{"meta":{"query_hash":"6fd67aaaa6e7","filters":{"topic":"Real-Time Systems Scheduling"},"cohort_total":429,"direct_labels_cover":0,"predictions_cover":429,"exported":429,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/6fd67aaaa6e7","api":"https://metacan.xera.ac/api/v1/cohort?topic=Real-Time+Systems+Scheduling"},"results":[{"id":"W101375639","doi":"10.1007/978-3-642-23641-9_46","title":"Reducing Total Energy for Reliability-Aware DVS Algorithms","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Dynamic voltage scaling; Computer science; Energy consumption; Reliability (semiconductor); Scheduling (production processes); Energy (signal processing); Reliability engineering; Real-time computing; Embedded system; Algorithm; Power (physics); Mathematical optimization; Engineering","score_opus":0.020043384253223776,"score_gpt":0.2419421689192747,"score_spread":0.22189878466605092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W101375639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07710417,0.0020418898,0.89871705,0.00075414707,0.00027774984,0.00011764168,0.0002554231,0.0017435404,0.018988464],"genre_scores_gemma":[0.650646,0.0007681243,0.33632344,0.000231052,0.00016227513,0.000110952824,0.0003812649,0.00046021485,0.010916685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945706,0.00014246607,0.000020507588,0.000066967514,0.00020832675,0.000104635554],"domain_scores_gemma":[0.99870956,0.0007726932,0.00006325876,0.00022538395,0.00017436729,0.00005476919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006779191,0.00087276706,0.00071816903,0.00070592476,0.00047425422,0.0008317085,0.0015367959,0.0005738091,0.006952814],"category_scores_gemma":[0.0032524494,0.00033245687,0.0005386141,0.001074009,0.00041239872,0.0010732214,0.0008279024,0.0009980063,0.0006392987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086357107,0.00026450044,0.0009259884,0.00031229857,0.00005800344,0.000057815003,0.00008518963,0.47490892,0.020369181,0.03405331,0.0111964205,0.45690483],"study_design_scores_gemma":[0.000060296825,0.00017431699,0.00039934198,0.000021958229,0.000025157522,0.00010439393,0.000039471357,0.9694379,0.0056528393,0.020940518,0.0031348227,0.0000090703215],"about_ca_topic_score_codex":0.0012977213,"about_ca_topic_score_gemma":0.0037003537,"teacher_disagreement_score":0.006952814,"about_ca_system_score_codex":0.0010310379,"about_ca_system_score_gemma":0.0011910434,"threshold_uncertainty_score":0.02325952},"labels":[],"label_agreement":null},{"id":"W109615606","doi":"10.1007/978-3-642-33078-0_37","title":"Multi-core Fixed Priority DVS Scheduling","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Scheduling (production processes); Core (optical fiber); Parallel computing; Distributed computing; Real-time computing; Mathematical optimization; Telecommunications; Mathematics","score_opus":0.03815319964917214,"score_gpt":0.27535170551314786,"score_spread":0.23719850586397573,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W109615606","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07250278,0.0071746157,0.8640316,0.000404588,0.0012656036,0.00012554282,0.00033191274,0.0029689516,0.051194467],"genre_scores_gemma":[0.7869986,0.0014765963,0.18067306,0.00013929109,0.00029926395,0.000065093314,0.0004991271,0.00030601508,0.029543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997609,0.000036585512,0.000011824762,0.000048715527,0.000078681864,0.00006327013],"domain_scores_gemma":[0.9996948,0.00006730464,0.000020609414,0.000061363324,0.00010387678,0.000052007603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033965163,0.0005077101,0.0005346875,0.00048569718,0.0004719205,0.0007230737,0.0014858326,0.0002458566,0.006219288],"category_scores_gemma":[0.00069882284,0.0002184444,0.00027320284,0.00083425007,0.00018682904,0.0005014089,0.00050956407,0.00048004228,0.0007732946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009294817,0.00018174297,0.00064107456,0.00047237158,0.00007482683,0.00014058842,0.00007177117,0.16465567,0.043374497,0.037136536,0.02430353,0.72801787],"study_design_scores_gemma":[0.00011335496,0.00040325918,0.0011496817,0.000056330104,0.000057692116,0.0004210184,0.000057870715,0.88433135,0.025776181,0.032810617,0.054791015,0.000031628566],"about_ca_topic_score_codex":0.0011437328,"about_ca_topic_score_gemma":0.0026679223,"teacher_disagreement_score":0.006219288,"about_ca_system_score_codex":0.00090989645,"about_ca_system_score_gemma":0.0008294837,"threshold_uncertainty_score":0.020805597},"labels":[],"label_agreement":null},{"id":"W134397979","doi":"","title":"EDF Feasibility and Hardware Accelerators","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Correctness; Scheduling (production processes); Schedule; Real-time operating system; Software; Earliest deadline first scheduling; Embedded system; Real-time computing; Dynamic priority scheduling; Operating system; Rate-monotonic scheduling; Algorithm","score_opus":0.03608683896354001,"score_gpt":0.2838775723379882,"score_spread":0.2477907333744482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W134397979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026791118,0.00068097585,0.9521259,0.0005010201,0.00011725606,0.00011911985,0.00015108087,0.00021217736,0.019301396],"genre_scores_gemma":[0.5047996,0.0012804935,0.4765534,0.00018769909,0.00020587521,0.00033441107,0.00045623124,0.00018225049,0.01600009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983639,0.00047847617,0.00007230002,0.00016877596,0.0006305287,0.00028601542],"domain_scores_gemma":[0.991955,0.0060717883,0.000440853,0.0003178487,0.0010721514,0.00014241601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032158897,0.00072545017,0.000536337,0.0023710704,0.00079274195,0.0012991991,0.0011622432,0.00072883803,0.010072471],"category_scores_gemma":[0.012566345,0.0005239549,0.0011498787,0.0013348903,0.0013555294,0.0023177157,0.0013353034,0.0014978109,0.00069623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035294675,0.00010265342,0.0020466058,0.00035767758,0.00003985914,0.0004653016,0.000109374094,0.34231213,0.0045716693,0.5201301,0.004902946,0.124608785],"study_design_scores_gemma":[0.000052554395,0.00012485767,0.00063602853,0.00011541382,0.000019241268,0.00029601864,0.00008084978,0.75459105,0.005014785,0.22602895,0.013001198,0.000038997936],"about_ca_topic_score_codex":0.0023548903,"about_ca_topic_score_gemma":0.001467409,"teacher_disagreement_score":0.010072471,"about_ca_system_score_codex":0.0011796626,"about_ca_system_score_gemma":0.0014538912,"threshold_uncertainty_score":0.033695757},"labels":[],"label_agreement":null},{"id":"W140915861","doi":"","title":"Modeling and analysis of real-time software systems using UML","year":2007,"lang":"en","type":"dissertation","venue":"Spectrum Research Repository (Concordia University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Applications of UML; UML tool; Unified Modeling Language; Computer science; Systems Modeling Language; Object Constraint Language; Model-driven architecture; Software engineering; Modeling language; Embedded software; Software system; Software; Systems engineering; Programming language; Engineering","score_opus":0.03401393025394459,"score_gpt":0.30340781072916895,"score_spread":0.26939388047522433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140915861","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005819089,0.0008151794,0.98630095,0.00025679515,0.00006386976,0.0002781017,0.00030919036,0.0020618807,0.004094855],"genre_scores_gemma":[0.12389695,0.0031596445,0.86345047,0.0001524039,0.00011644464,0.0010347682,0.0017170694,0.0007925279,0.0056796498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960925,0.0011957526,0.0005686851,0.00041462108,0.001523785,0.0002046275],"domain_scores_gemma":[0.99573874,0.002047708,0.00074276736,0.0006147988,0.0007627326,0.00009323514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031609838,0.0012369079,0.0006083951,0.002602507,0.0006658019,0.003624715,0.0018879109,0.0011078581,0.0024210417],"category_scores_gemma":[0.0076871817,0.0009936052,0.0020587386,0.0011761071,0.0009410824,0.0031964537,0.0013017508,0.0017769329,0.0011882342],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012057333,0.0001945128,0.0043348316,0.0015964013,0.00017928344,0.0018372004,0.0036796555,0.39230746,0.035781655,0.39459124,0.005584931,0.15979229],"study_design_scores_gemma":[0.00005725195,0.00011925232,0.0016156973,0.00070684246,0.00015337614,0.0007587491,0.00036428496,0.71951675,0.02320982,0.098515496,0.1548676,0.00011484178],"about_ca_topic_score_codex":0.0057557533,"about_ca_topic_score_gemma":0.0031898818,"teacher_disagreement_score":0.0057557533,"about_ca_system_score_codex":0.0015688505,"about_ca_system_score_gemma":0.0022969097,"threshold_uncertainty_score":0.016717076},"labels":[],"label_agreement":null},{"id":"W142955027","doi":"","title":"Proactive and Reactive Resource Allocation","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Resource allocation; Resource (disambiguation); Resource management (computing); Computer science; Distributed computing; Computer network","score_opus":0.020941126905451603,"score_gpt":0.21115331317818062,"score_spread":0.190212186272729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W142955027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012087813,0.0061441706,0.83467066,0.0022464017,0.0012250524,0.0007076188,0.0002925259,0.003200144,0.13942555],"genre_scores_gemma":[0.4296006,0.00435097,0.44910765,0.0036208222,0.0010327257,0.0017372587,0.00072859024,0.00085521146,0.1089661],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995878,0.0008604573,0.00029167876,0.000820872,0.0016244364,0.00052461785],"domain_scores_gemma":[0.9957587,0.0010360162,0.0005424502,0.0015376357,0.0008144132,0.00031068333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027158235,0.0012756621,0.0006387585,0.0009852974,0.00093970116,0.0040826104,0.0034870314,0.0018642463,0.007835052],"category_scores_gemma":[0.006225297,0.00057906366,0.00071001303,0.0011674239,0.0021822439,0.0038128817,0.0028486305,0.0017325841,0.0038576312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005632592,0.00038220125,0.0017237859,0.00095711596,0.00011368001,0.00027600097,0.00091041595,0.03571442,0.016974282,0.47371042,0.026974175,0.44170028],"study_design_scores_gemma":[0.00018401518,0.0005387396,0.0019399256,0.00039753155,0.00015867095,0.0015855742,0.0006155489,0.18193957,0.019720506,0.318395,0.4742978,0.00022716873],"about_ca_topic_score_codex":0.0016158911,"about_ca_topic_score_gemma":0.0015148787,"teacher_disagreement_score":0.007835052,"about_ca_system_score_codex":0.001163827,"about_ca_system_score_gemma":0.002158727,"threshold_uncertainty_score":0.026210904},"labels":[],"label_agreement":null},{"id":"W1457497571","doi":"10.1007/978-3-642-29860-8_3","title":"Runtime Monitoring of Time-Sensitive Systems","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Focus (optics); Schedule; Real-time computing; System monitoring; Distributed computing; Operating system","score_opus":0.01675899281114851,"score_gpt":0.23733792132133572,"score_spread":0.2205789285101872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1457497571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12798022,0.007305643,0.8322558,0.00043365336,0.00035937998,0.000091679525,0.00024005712,0.010706755,0.020626822],"genre_scores_gemma":[0.8632237,0.0023158512,0.121664256,0.000108200846,0.00030127983,0.000068308094,0.00035475966,0.0007367048,0.0112269595],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991352,0.00017505306,0.000042906988,0.00015786728,0.00039801086,0.00009100864],"domain_scores_gemma":[0.99860317,0.00065442163,0.00014871352,0.0003765444,0.00013824645,0.00007899448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973356,0.0006286423,0.0005300779,0.0006936319,0.00030288994,0.001164469,0.0012841821,0.0003846364,0.0018580873],"category_scores_gemma":[0.0024292816,0.00036724418,0.00021370818,0.0006373798,0.0004665791,0.0012163185,0.00068499474,0.0010639537,0.0004175621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093237177,0.00021383673,0.0021451209,0.0004927275,0.00006476487,0.000379945,0.0008406361,0.08025731,0.12219463,0.08345645,0.012553766,0.6964684],"study_design_scores_gemma":[0.00006197768,0.00028037094,0.0032240045,0.00015443134,0.000093773786,0.00063251663,0.00009480346,0.77965146,0.11256973,0.063978024,0.039206594,0.00005223978],"about_ca_topic_score_codex":0.0005049796,"about_ca_topic_score_gemma":0.0005791103,"teacher_disagreement_score":0.0018580873,"about_ca_system_score_codex":0.00049071986,"about_ca_system_score_gemma":0.000389753,"threshold_uncertainty_score":0.00621593},"labels":[],"label_agreement":null},{"id":"W1480509802","doi":"10.5555/1357910.1357986","title":"Heuristic scheduling algorithms designed based on properties of optimal algorithm for soft real-time tasks","year":2007,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Scheduling (production processes); Heuristic; Algorithm; Schedule; Task (project management); Time complexity; Mathematical optimization; Set (abstract data type); Job shop scheduling; Mathematics; Artificial intelligence","score_opus":0.05259621661182488,"score_gpt":0.2911732718583015,"score_spread":0.23857705524647663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480509802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015492615,0.00042470443,0.9801021,0.00008512894,0.000085153704,0.00016726609,0.000033652148,0.0003442111,0.0032651422],"genre_scores_gemma":[0.22228001,0.0005673126,0.7751683,0.00012200573,0.0000791021,0.0004328326,0.00015314802,0.00011191158,0.0010853688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989073,0.00034022893,0.00008953744,0.00014152194,0.00036226853,0.00015914018],"domain_scores_gemma":[0.9970521,0.0016519518,0.00044324214,0.00034819852,0.00041809567,0.00008634568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018371153,0.00084448507,0.0011252273,0.0012819092,0.00069197104,0.0011205064,0.0012805363,0.00088070735,0.0017972643],"category_scores_gemma":[0.007825775,0.0007652241,0.0006826938,0.0012652182,0.0008812455,0.0011498968,0.000582302,0.0010476266,0.0003757519],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019333555,0.00015422082,0.00087990076,0.00027108265,0.00007307644,0.00006990447,0.00015304255,0.76726305,0.0052684653,0.07445278,0.0026427046,0.14857852],"study_design_scores_gemma":[0.00008217023,0.00008622065,0.00016660328,0.000026172944,0.000020373229,0.00008336986,0.00003513658,0.9714855,0.0026846323,0.021653844,0.0036607971,0.00001515891],"about_ca_topic_score_codex":0.001530536,"about_ca_topic_score_gemma":0.0014459732,"teacher_disagreement_score":0.0018371153,"about_ca_system_score_codex":0.0014197276,"about_ca_system_score_gemma":0.0022995227,"threshold_uncertainty_score":0.010300875},"labels":[],"label_agreement":null},{"id":"W1483294334","doi":"10.1109/syscon.2015.7116771","title":"Hard Real-Time scheduling on a multicore platform","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Multi-core processor; Computer science; Scheduling (production processes); Embedded system; Real-time operating system; Parallel computing; Engineering","score_opus":0.06103457533365367,"score_gpt":0.27480124444758003,"score_spread":0.21376666911392636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1483294334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34040466,0.0005191167,0.63923407,0.00037132888,0.00023655934,0.00019348256,0.0001524148,0.0031368353,0.015751489],"genre_scores_gemma":[0.7280887,0.00011849823,0.26684234,0.00008765471,0.000031811138,0.00006882874,0.0001311776,0.00014166809,0.0044893813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994153,0.000100542624,0.000049013695,0.000105097504,0.00022659058,0.00010347019],"domain_scores_gemma":[0.99906,0.00034013722,0.00011124164,0.00019120096,0.00019622727,0.000101185105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062728673,0.00031472498,0.00024341219,0.00027494025,0.00054682815,0.00057490397,0.0007422047,0.0002960988,0.0018075936],"category_scores_gemma":[0.001711572,0.00019017798,0.00027661986,0.0002874224,0.0004030748,0.00056461524,0.00042128886,0.0006440004,0.00023094141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006514626,0.00026603942,0.003905644,0.00027057412,0.00007851417,0.0004882686,0.00030161155,0.59690803,0.14562137,0.042602494,0.0059149424,0.20299098],"study_design_scores_gemma":[0.000034527162,0.00013811458,0.0008727296,0.000008747151,0.000010754891,0.000043650376,0.000027519318,0.96576905,0.023561047,0.004929373,0.0045906208,0.000013938984],"about_ca_topic_score_codex":0.00583183,"about_ca_topic_score_gemma":0.007158541,"teacher_disagreement_score":0.00583183,"about_ca_system_score_codex":0.0006824167,"about_ca_system_score_gemma":0.0012973772,"threshold_uncertainty_score":0.011595786},"labels":[],"label_agreement":null},{"id":"W1505071739","doi":"10.1109/newcas.2015.7181984","title":"A probabilistically analysable cache implementation on FPGA","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Probabilistic logic; Parallel computing; Field-programmable gate array; Worst-case execution time; Interval (graph theory); CPU cache; Static timing analysis; Execution time; Embedded system; Mathematics","score_opus":0.05982096017900186,"score_gpt":0.325652544364639,"score_spread":0.2658315841856371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1505071739","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.550974,0.00055131083,0.43721908,0.00022838509,0.00006456347,0.00007432642,0.00039776837,0.0050290143,0.00546144],"genre_scores_gemma":[0.9080589,0.000097634205,0.090941675,0.000031128016,0.0000058813334,0.00002605038,0.00011325141,0.00003934965,0.00068622094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970055,0.00006349079,0.00002379951,0.000057398436,0.00010472515,0.000050063038],"domain_scores_gemma":[0.9992931,0.00023821334,0.00013619653,0.00018175312,0.00013038034,0.00002042047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034467503,0.00028830944,0.00017748958,0.00037551805,0.00019851801,0.00038935305,0.0005455246,0.00023224621,0.001021802],"category_scores_gemma":[0.0015053821,0.00018461164,0.0002021967,0.00031442955,0.00019684838,0.00034240197,0.00010857206,0.00023282932,0.00020345976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058854255,0.00009065828,0.0068671475,0.00018593694,0.0000737552,0.00043902677,0.00008599026,0.6811999,0.13111565,0.013323391,0.00178782,0.16424225],"study_design_scores_gemma":[0.000052652387,0.00049446186,0.0023881,0.000028849834,0.00004614923,0.00033445892,0.000019228783,0.91326284,0.077107236,0.0028602371,0.003374435,0.000031349067],"about_ca_topic_score_codex":0.0024780014,"about_ca_topic_score_gemma":0.003346625,"teacher_disagreement_score":0.0024780014,"about_ca_system_score_codex":0.00044669377,"about_ca_system_score_gemma":0.0007654108,"threshold_uncertainty_score":0.0049271584},"labels":[],"label_agreement":null},{"id":"W1508239197","doi":"10.1109/ccece.1995.526579","title":"Analysis of a heuristic mapping method for parallel real-time simulation of electrical networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Heuristic; Scheduling (production processes); Execution time; Processor scheduling; Distributed computing; Parallel computing; Real-time computing; Resource (disambiguation); Mathematical optimization; Artificial intelligence; Computer network","score_opus":0.031728761957635174,"score_gpt":0.29538379672242576,"score_spread":0.2636550347647906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1508239197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019834897,0.00018768515,0.97551507,0.00006757645,0.000029562478,0.000058208894,0.000018295117,0.0002505087,0.0040382002],"genre_scores_gemma":[0.6267963,0.0002796505,0.3700679,0.000060189708,0.00004343836,0.0002596653,0.00007688329,0.00018851492,0.0022275262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927825,0.00032700447,0.000015142106,0.0000371249,0.0002799558,0.00006261928],"domain_scores_gemma":[0.99756074,0.0017937649,0.00015072514,0.00017034062,0.0002713601,0.000053076732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016677942,0.00058815064,0.0004812587,0.00079347653,0.00046249668,0.0005872712,0.00073718507,0.0005069937,0.0020862443],"category_scores_gemma":[0.005059893,0.0003858616,0.0004842053,0.00039792352,0.0006000678,0.0005682398,0.00040286238,0.0005306286,0.00020865498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006700055,0.00003431481,0.00033918218,0.000052853695,0.00003088797,0.000039250048,0.000037626003,0.9499153,0.0028869899,0.01987497,0.00030374562,0.026417876],"study_design_scores_gemma":[0.0000059054605,0.000018163317,0.000060569113,0.0000042160495,0.000004837695,0.000011729222,0.0000059052463,0.9956899,0.00083962345,0.0027011465,0.000654857,0.0000031793866],"about_ca_topic_score_codex":0.0024951238,"about_ca_topic_score_gemma":0.0015704728,"teacher_disagreement_score":0.0024951238,"about_ca_system_score_codex":0.0010242669,"about_ca_system_score_gemma":0.0009918663,"threshold_uncertainty_score":0.008820236},"labels":[],"label_agreement":null},{"id":"W1510763201","doi":"10.1007/11526841_12","title":"Timing Tolerances in Safety-Critical Software","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Static timing analysis; Reliability engineering; Software; Software engineering; Real-time computing; Embedded system; Operating system","score_opus":0.019941310020266657,"score_gpt":0.2680273754170427,"score_spread":0.24808606539677602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510763201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051574484,0.010993491,0.87330043,0.0010862376,0.0010550696,0.00008113548,0.000077108685,0.0017545898,0.06007738],"genre_scores_gemma":[0.8042936,0.0071372883,0.15055686,0.00038424888,0.0009253808,0.00016712681,0.00017390044,0.0006217069,0.03573995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991918,0.0001259404,0.0000539706,0.00010166606,0.00040647775,0.000120027355],"domain_scores_gemma":[0.9980446,0.001044402,0.00022857188,0.00032746748,0.00025175107,0.000103221326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010263313,0.00066947774,0.000588341,0.0009795718,0.00065353955,0.0012377287,0.0014734188,0.0006820035,0.004415122],"category_scores_gemma":[0.0044253496,0.0006377696,0.00047449095,0.0012888109,0.0013434573,0.0019096306,0.0009865327,0.001885515,0.000649276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002893201,0.000088464934,0.00043569948,0.00040341608,0.000028827959,0.00019837431,0.00046667145,0.10907225,0.010945035,0.59412843,0.0063281073,0.27761546],"study_design_scores_gemma":[0.00006636043,0.0002604457,0.00039015547,0.00015245406,0.000050414692,0.0002525954,0.00014708897,0.15994097,0.009973374,0.7873512,0.041373204,0.000041724197],"about_ca_topic_score_codex":0.000774517,"about_ca_topic_score_gemma":0.00080566085,"teacher_disagreement_score":0.004415122,"about_ca_system_score_codex":0.0009584182,"about_ca_system_score_gemma":0.0009221766,"threshold_uncertainty_score":0.014770091},"labels":[],"label_agreement":null},{"id":"W1515460798","doi":"10.1007/978-3-319-15657-6_9","title":"Modeling Error Control Protocols","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Control (management); Artificial intelligence","score_opus":0.10146677315131354,"score_gpt":0.3137954472548927,"score_spread":0.2123286741035792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1515460798","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016311114,0.0015801956,0.92753726,0.0005831035,0.00051371276,0.00007311793,0.00017512067,0.0010010219,0.066905335],"genre_scores_gemma":[0.28803027,0.013396737,0.37476647,0.0010572698,0.0010427119,0.00092791097,0.0021643087,0.0012491826,0.31736508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920374,0.0001423425,0.000043371212,0.00014060785,0.0004150848,0.000054899487],"domain_scores_gemma":[0.9992085,0.0002924826,0.000049615817,0.00026484125,0.0001639623,0.000020463736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008173987,0.0012972875,0.0004935109,0.00061787834,0.0004103084,0.0018734427,0.0015027148,0.00091386936,0.012319547],"category_scores_gemma":[0.0024995974,0.0004760868,0.0005354525,0.00083762413,0.0008966629,0.0026012473,0.0011734086,0.002343916,0.0046924576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003274421,0.000046744946,0.00008280838,0.00015258677,0.000019659394,0.000043712505,0.00010786455,0.05939761,0.0021544744,0.74423754,0.016927408,0.17679681],"study_design_scores_gemma":[0.00001939286,0.00003773798,0.00007911936,0.00014511879,0.000026513826,0.00008338034,0.000038357055,0.26068252,0.005483954,0.58310324,0.15027131,0.000029298575],"about_ca_topic_score_codex":0.0012284834,"about_ca_topic_score_gemma":0.00092854444,"teacher_disagreement_score":0.012319547,"about_ca_system_score_codex":0.0009290215,"about_ca_system_score_gemma":0.001066417,"threshold_uncertainty_score":0.041212976},"labels":[],"label_agreement":null},{"id":"W1519360556","doi":"10.1007/0-8176-4404-0_20","title":"Control Loops in RTLinux","year":2005,"lang":"en","type":"book-chapter","venue":"Birkhäuser Boston eBooks","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Tellabs (Canada)","funders":"","keywords":"Computer science; Schematic; Controller (irrigation); Embedded system; Software; Reuse; Scheduling (production processes); Operating system; Engineering; Electrical engineering","score_opus":0.015736306386249507,"score_gpt":0.22006245992271314,"score_spread":0.20432615353646363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519360556","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006348617,0.0015420985,0.749762,0.000541588,0.00074708555,0.0003820962,0.0026748374,0.14107428,0.096927375],"genre_scores_gemma":[0.19244607,0.0025681201,0.5217257,0.0030383037,0.00058032625,0.002466296,0.011689098,0.05636329,0.20912269],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863154,0.00022575699,0.00012582344,0.0002424325,0.0005554975,0.00021890887],"domain_scores_gemma":[0.99918836,0.0002544853,0.00009901689,0.00017858192,0.0002273425,0.000052223637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010576572,0.0014919328,0.0006175546,0.0010355958,0.0005773335,0.0029410238,0.0019789257,0.00079013925,0.07578609],"category_scores_gemma":[0.0027179618,0.0008288113,0.000653838,0.00075090805,0.0008017802,0.002627437,0.0012065615,0.002345038,0.030476484],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019819695,0.00019203193,0.001648442,0.0018416308,0.00010511569,0.00064960716,0.0015818074,0.021206321,0.044130255,0.20540754,0.32120043,0.40005478],"study_design_scores_gemma":[0.00016648292,0.00016847314,0.00030992983,0.00019963893,0.000044796816,0.00043426783,0.000062825646,0.022044858,0.034839813,0.019643234,0.9220122,0.00007343059],"about_ca_topic_score_codex":0.0014746055,"about_ca_topic_score_gemma":0.0012202151,"teacher_disagreement_score":0.07578609,"about_ca_system_score_codex":0.0013016156,"about_ca_system_score_gemma":0.001110651,"threshold_uncertainty_score":0.25352973},"labels":[],"label_agreement":null},{"id":"W1520313186","doi":"10.1007/11951148_3","title":"Distributed Real-Time Behavioral Requirements Modeling Using Extended UML/SPT","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Unified Modeling Language; Applications of UML; Metamodeling; UML tool; Multicast; Object Constraint Language; Programming language; Distributed computing; Software engineering","score_opus":0.04286639057937804,"score_gpt":0.29493897738650726,"score_spread":0.25207258680712924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1520313186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037398199,0.000027231807,0.99244577,0.00006349658,0.00001375164,0.000113252456,0.0001387193,0.0014802273,0.001977646],"genre_scores_gemma":[0.17194965,0.00017403094,0.8202802,0.00009279906,0.000024812573,0.00059936295,0.0009352958,0.00077286846,0.0051709483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976743,0.00075426453,0.0002660992,0.000289464,0.00087370054,0.000142232],"domain_scores_gemma":[0.99600995,0.0018841581,0.00043726576,0.00086288917,0.0007084904,0.000097243064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025255182,0.0011648312,0.00068083784,0.0009860501,0.00046240122,0.0019913085,0.0023308971,0.0009620704,0.0045332536],"category_scores_gemma":[0.005260702,0.0011034643,0.002172144,0.0005947222,0.00072587957,0.0021338633,0.0014080441,0.0017012706,0.0015980783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022424804,0.00022597388,0.0015668246,0.0005710684,0.00015240397,0.0011787907,0.0012276863,0.7141377,0.03811615,0.103146575,0.00400188,0.13545074],"study_design_scores_gemma":[0.000048517933,0.000046596273,0.00017931643,0.00005370845,0.000054264437,0.00020044831,0.00006306857,0.95808893,0.010337693,0.018643511,0.012260583,0.000023410645],"about_ca_topic_score_codex":0.004186629,"about_ca_topic_score_gemma":0.00483012,"teacher_disagreement_score":0.0045332536,"about_ca_system_score_codex":0.0008963925,"about_ca_system_score_gemma":0.0018481534,"threshold_uncertainty_score":0.015165269},"labels":[],"label_agreement":null},{"id":"W1522363177","doi":"10.1109/rtas.2015.7108440","title":"Task placement and selection of data consistency mechanisms for real-time multicore applications","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Distributed computing; Leverage (statistics); Task (project management); Multi-core processor; Scheduling (production processes); Consistency (knowledge bases); Embedded system; Parallel computing","score_opus":0.06274366880695706,"score_gpt":0.3050908031354466,"score_spread":0.24234713432848956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522363177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10828114,0.000537923,0.8878347,0.00014027268,0.00007698325,0.00016656077,0.00003927677,0.0012094182,0.0017136291],"genre_scores_gemma":[0.6327913,0.00014351426,0.36484978,0.000060696002,0.000029992534,0.0002037346,0.00010913585,0.000120192875,0.0016917686],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99882,0.00041453124,0.00013012787,0.0001950675,0.00026923112,0.00017100337],"domain_scores_gemma":[0.997493,0.0007457277,0.00037704883,0.0006595418,0.00053727586,0.00018739128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019533928,0.0005385823,0.0004643137,0.00094571774,0.0008499653,0.001069757,0.0014965406,0.00050219236,0.00093200704],"category_scores_gemma":[0.004239,0.00040236954,0.00039527984,0.00071981346,0.00042568936,0.0009798313,0.00090359827,0.00056896865,0.00027553408],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015330476,0.0005297543,0.0057286955,0.000481144,0.00012567261,0.00030254608,0.0007842499,0.19969405,0.1717046,0.034302358,0.004603639,0.5802103],"study_design_scores_gemma":[0.00026603378,0.000452119,0.001993745,0.000036741607,0.00007554276,0.00028690702,0.00017373999,0.8617684,0.11351385,0.012914135,0.008449704,0.00006907354],"about_ca_topic_score_codex":0.0010177837,"about_ca_topic_score_gemma":0.0013601338,"teacher_disagreement_score":0.0019533928,"about_ca_system_score_codex":0.0006859792,"about_ca_system_score_gemma":0.0017758928,"threshold_uncertainty_score":0.010330677},"labels":[],"label_agreement":null},{"id":"W1522430317","doi":"10.1007/11551898_17","title":"Harmonic Block Windows Scheduling Through Harmonic Windows Scheduling","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scheduling (production processes); Block scheduling; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.02580073436647414,"score_gpt":0.2597937090382982,"score_spread":0.23399297467182403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522430317","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029634297,0.0005519057,0.9405445,0.00012619646,0.00028747326,0.00010415186,0.00009506007,0.0027360322,0.025920402],"genre_scores_gemma":[0.6170384,0.0008835093,0.34489566,0.00013221205,0.00030420272,0.00017677019,0.00034765832,0.0009371551,0.035284422],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973625,0.000041907155,0.000010716353,0.0000439567,0.00010507022,0.000062000596],"domain_scores_gemma":[0.9997464,0.000069170856,0.000019181254,0.00007424588,0.000051299936,0.000039755476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037158924,0.0005254984,0.00054421846,0.0005628893,0.0005394223,0.0009803575,0.0009994336,0.00021987307,0.011069906],"category_scores_gemma":[0.00086451886,0.0003718795,0.0002827551,0.00076619093,0.00033323874,0.0011219558,0.0010126579,0.0008425998,0.0016902197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012209798,0.0002191513,0.00057509466,0.00021629778,0.00007362405,0.000107895,0.0002189896,0.099060275,0.05862065,0.16495062,0.01782899,0.65690756],"study_design_scores_gemma":[0.00016167905,0.00035818914,0.0006432342,0.000034452623,0.00008889029,0.00016499813,0.000074785625,0.7793939,0.051390562,0.10651356,0.061122485,0.000053251406],"about_ca_topic_score_codex":0.0013382732,"about_ca_topic_score_gemma":0.001963182,"teacher_disagreement_score":0.011069906,"about_ca_system_score_codex":0.0005334894,"about_ca_system_score_gemma":0.0007248496,"threshold_uncertainty_score":0.037032485},"labels":[],"label_agreement":null},{"id":"W15232288","doi":"10.1007/978-1-4614-0314-2_9","title":"Higher-Level Protocols","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Protocol stack; Computer science; Standardization; Software portability; Computer network; Protocol (science); OSI model; Application layer; Multicast; Interchangeability; Distributed computing; Operating system; Software deployment; Interconnection; Wireless sensor network","score_opus":0.13405651154387538,"score_gpt":0.28593876843231475,"score_spread":0.15188225688843937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W15232288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003392968,0.0032122857,0.6205529,0.001657841,0.0015616808,0.00033963076,0.0006512399,0.0036025525,0.36502904],"genre_scores_gemma":[0.09869069,0.010287692,0.37579003,0.0016926859,0.0014995493,0.0010375575,0.0025709446,0.0029821175,0.50544876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99903905,0.0001751795,0.00008686375,0.00016686248,0.00041681915,0.00011529954],"domain_scores_gemma":[0.99886,0.00029336236,0.000040296316,0.00057792285,0.00017954854,0.000048916485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013018983,0.0013708514,0.00071563304,0.0012353413,0.0013637124,0.00506866,0.0018914831,0.00130334,0.05318243],"category_scores_gemma":[0.0023172097,0.0010435729,0.0009283397,0.0020246762,0.0015235447,0.0084527135,0.0025263424,0.004090371,0.026556952],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024214867,0.000036187837,0.000042063824,0.00018539104,0.0000098010605,0.000029715397,0.00016029163,0.0016895386,0.0021994745,0.88599837,0.025969055,0.08365585],"study_design_scores_gemma":[0.000013785954,0.000027153987,0.00006423479,0.00013456264,0.000019776833,0.00013826185,0.000057927013,0.009870036,0.0046329154,0.469456,0.5155597,0.000025637875],"about_ca_topic_score_codex":0.0007132153,"about_ca_topic_score_gemma":0.00090042903,"teacher_disagreement_score":0.05318243,"about_ca_system_score_codex":0.0016584938,"about_ca_system_score_gemma":0.001425123,"threshold_uncertainty_score":0.17791295},"labels":[],"label_agreement":null},{"id":"W1526272673","doi":"10.1109/cca.2005.1507239","title":"A feedback scheduling algorithm for real time control systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Actuator; Fixed-priority pre-emptive scheduling; Real-time computing; Response time; Dynamic priority scheduling; Processor scheduling; Context switch; Distributed computing; Rate-monotonic scheduling; Embedded system; Quality of service; Mathematical optimization; Computer network; Operating system; Mathematics","score_opus":0.011457885992964992,"score_gpt":0.24124277336155947,"score_spread":0.22978488736859448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1526272673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051628877,0.00025292806,0.99187416,0.00009789692,0.00018604839,0.000043997898,0.000024860235,0.0011027455,0.0012546242],"genre_scores_gemma":[0.48772147,0.00047916165,0.5049846,0.0002469992,0.00023736832,0.0003612226,0.00018048551,0.00026357925,0.0055249934],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995859,0.00008504126,0.000026010332,0.00008855839,0.00017751187,0.000036984642],"domain_scores_gemma":[0.9996106,0.00015905718,0.000038245907,0.000037900714,0.00013332823,0.000020875503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773956,0.0006707023,0.0005244953,0.00059800496,0.0006690791,0.0005945301,0.0007362675,0.00064406457,0.0032183987],"category_scores_gemma":[0.001753726,0.00023753969,0.00035714102,0.00039782247,0.00043513897,0.00096721767,0.00052634283,0.00079825893,0.00070702285],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005157236,0.00017627471,0.00035612396,0.0003838722,0.00004873392,0.00017709006,0.00026348422,0.315965,0.047180157,0.072354324,0.0074177,0.5551616],"study_design_scores_gemma":[0.00005947024,0.0001341954,0.000081163096,0.00001639811,0.000010806079,0.000055376087,0.000014242793,0.9743791,0.0066955187,0.011216841,0.0073245913,0.000012282975],"about_ca_topic_score_codex":0.0017315091,"about_ca_topic_score_gemma":0.0011396045,"teacher_disagreement_score":0.0032183987,"about_ca_system_score_codex":0.00066935905,"about_ca_system_score_gemma":0.0009112495,"threshold_uncertainty_score":0.010766685},"labels":[],"label_agreement":null},{"id":"W1527074547","doi":"10.1155/2015/261094","title":"Linux Low-Latency Tracing for Multicore Hard Real-Time Systems","year":2015,"lang":"en","type":"article","venue":"Advances in Computer Engineering","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec; Polytechnique Montréal","keywords":"Computer science; Tracing; Multi-core processor; Latency (audio); Scalability; Linux kernel; Testbed; Embedded system; Debugging; Static timing analysis; Real-time computing; Operating system","score_opus":0.015876357713187652,"score_gpt":0.24721930557810953,"score_spread":0.23134294786492188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527074547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40389678,0.0009130526,0.56569463,0.00020736862,0.00011954916,0.0001778351,0.00034579702,0.023770554,0.00487436],"genre_scores_gemma":[0.8889551,0.00015408208,0.108265705,0.000042734115,0.000009418817,0.00006930329,0.00021459158,0.0011012396,0.0011877978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99709976,0.0008756069,0.00018965887,0.00031725888,0.0012137247,0.00030394003],"domain_scores_gemma":[0.99160975,0.0038371477,0.0009994445,0.0024556268,0.0008627516,0.00023515681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022149866,0.00082830596,0.00040904206,0.0012117017,0.0006641061,0.0011724153,0.0013837065,0.00040609043,0.0024772095],"category_scores_gemma":[0.013565487,0.00045370936,0.00039602834,0.0010717007,0.0008001195,0.0016477008,0.001026019,0.0011125142,0.00031900493],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019394526,0.0005465018,0.041329276,0.0011161901,0.00016498509,0.00060513924,0.0018690714,0.3464145,0.25627694,0.041307352,0.0051915236,0.30323905],"study_design_scores_gemma":[0.000055611483,0.00038852965,0.0050326027,0.000058263104,0.000045585977,0.00013844277,0.000095508614,0.8347255,0.14749557,0.006322622,0.0055850684,0.0000567529],"about_ca_topic_score_codex":0.0059649693,"about_ca_topic_score_gemma":0.0049003013,"teacher_disagreement_score":0.0059649693,"about_ca_system_score_codex":0.001762946,"about_ca_system_score_gemma":0.0019321643,"threshold_uncertainty_score":0.012791097},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04770569517853304,"score_gpt":0.26935222082321075,"score_spread":0.2216465256446777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534030588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025759349,0.0002825867,0.9687609,0.0004721169,0.000091193964,0.00012194305,0.00014251286,0.0006274071,0.0037419577],"genre_scores_gemma":[0.8268048,0.0005574498,0.16452928,0.00042718786,0.00013695033,0.00050480233,0.0002634372,0.00020509875,0.0065710675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754936,0.00084762817,0.00016904582,0.00035703328,0.0007140747,0.0003627984],"domain_scores_gemma":[0.99696976,0.0010071101,0.00033600235,0.0011428605,0.0003328221,0.00021150114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021056521,0.0008965356,0.0009444238,0.0006528551,0.0006157045,0.002600546,0.0028576113,0.0016655546,0.0030641828],"category_scores_gemma":[0.005478438,0.0005693796,0.0011041132,0.00078008795,0.001813337,0.0039900225,0.0020109927,0.0026305402,0.0006206642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017210282,0.00006271598,0.0003500628,0.00015261372,0.000044178334,0.00025303822,0.00028842103,0.7845715,0.0052641393,0.19666779,0.0012258174,0.010947683],"study_design_scores_gemma":[0.00005112491,0.00008415811,0.00008859763,0.000023383353,0.000020586987,0.000053300537,0.00003455638,0.92947173,0.0013163269,0.06518869,0.003648539,0.000019077146],"about_ca_topic_score_codex":0.0033813305,"about_ca_topic_score_gemma":0.0027735112,"teacher_disagreement_score":0.0033813305,"about_ca_system_score_codex":0.0015312071,"about_ca_system_score_gemma":0.0022951204,"threshold_uncertainty_score":0.011135876},"labels":[],"label_agreement":null},{"id":"W1538589912","doi":"10.1007/978-1-4614-1406-3_10","title":"Transport Control Protocols Part 2: Transmission Control Protocol","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Protocol (science); Control (management); Transmission (telecommunications); Computer science; Computer network; Medicine; Telecommunications; Artificial intelligence","score_opus":0.032985171946142394,"score_gpt":0.264472951878959,"score_spread":0.23148777993281658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538589912","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021585266,0.04857729,0.51846033,0.0022510013,0.01076266,0.00073743844,0.0027185238,0.00654291,0.40779135],"genre_scores_gemma":[0.022628719,0.07019028,0.15335217,0.0018159179,0.0033207408,0.0011791323,0.006055061,0.0034480267,0.73801],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994229,0.00006418045,0.0000418467,0.000092394126,0.00032847593,0.000050197134],"domain_scores_gemma":[0.9994605,0.00016290159,0.00002977491,0.00012537405,0.00019659784,0.00002482516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052448036,0.0017041919,0.0010066384,0.0019276335,0.00081051246,0.002588968,0.0013623948,0.0015579031,0.038070586],"category_scores_gemma":[0.0014227397,0.00090015546,0.00060609647,0.0034120674,0.00079500384,0.0032439614,0.0009990961,0.0027687622,0.029178102],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005092329,0.00009705881,0.00007748467,0.00089477893,0.000029897743,0.00015114502,0.00026330887,0.0072561023,0.009375987,0.1408889,0.29644918,0.54446524],"study_design_scores_gemma":[0.000008045678,0.000025105717,0.00011389423,0.00026403257,0.000020617239,0.00026188642,0.000031702297,0.0058320574,0.0037646012,0.032772988,0.9568767,0.00002839906],"about_ca_topic_score_codex":0.0017011985,"about_ca_topic_score_gemma":0.0014088221,"teacher_disagreement_score":0.038070586,"about_ca_system_score_codex":0.0010626515,"about_ca_system_score_gemma":0.0013861696,"threshold_uncertainty_score":0.1273588},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.16711613159278715,"score_gpt":0.3867648919135359,"score_spread":0.21964876032074876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543670042","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034722153,0.0005486298,0.99283373,0.00008420992,0.000046853966,0.00014378378,0.00007882503,0.00096788176,0.0018237743],"genre_scores_gemma":[0.1901815,0.000933877,0.8039741,0.00010469091,0.00009215304,0.00055482035,0.0002803589,0.000299423,0.0035791567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991885,0.00016539947,0.00005982596,0.00012072712,0.0003450599,0.000120549485],"domain_scores_gemma":[0.9995222,0.00013965886,0.00006432201,0.00008918618,0.00012678983,0.000057809182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013582853,0.0013401819,0.00076123944,0.00084527925,0.00078910426,0.0014411241,0.0023062495,0.0007710918,0.0033024885],"category_scores_gemma":[0.0013388578,0.0006569762,0.0009879359,0.00076252996,0.0007967322,0.0011281826,0.0013236521,0.0015519483,0.00082603836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012256166,0.00012972724,0.0006031177,0.00036681164,0.00006680799,0.00025879528,0.000210133,0.8024893,0.014477683,0.090793535,0.0046856254,0.08579597],"study_design_scores_gemma":[0.000029695293,0.00011019007,0.0001112574,0.000033604854,0.000024573084,0.0000697418,0.00003130573,0.97434944,0.0024231912,0.010806901,0.011990647,0.000019323943],"about_ca_topic_score_codex":0.0071534966,"about_ca_topic_score_gemma":0.01112782,"teacher_disagreement_score":0.0071534966,"about_ca_system_score_codex":0.0015149378,"about_ca_system_score_gemma":0.002781565,"threshold_uncertainty_score":0.014223754},"labels":[],"label_agreement":null},{"id":"W1554654249","doi":"10.1109/rtas.2005.49","title":"Solution Space for Fixed-Priority with Preemption Threshold","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Preemption; Correctness; Computer science; Scheduling (production processes); Algorithm; Deadline-monotonic scheduling; Mathematical proof; Mathematical optimization; Mathematics; Dynamic priority scheduling; Rate-monotonic scheduling; Computer network; Quality of service","score_opus":0.01720642856049311,"score_gpt":0.2519211475280792,"score_spread":0.23471471896758608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554654249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04883476,0.00054614875,0.93705404,0.0011250722,0.00009761629,0.00016986455,0.00029380657,0.00085519796,0.0110236015],"genre_scores_gemma":[0.33825424,0.00055865035,0.652782,0.00023937756,0.00007792983,0.00029084706,0.0006942942,0.00023216408,0.006870468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868697,0.00032307312,0.00007192448,0.00033031663,0.00034924143,0.00023847765],"domain_scores_gemma":[0.9969796,0.0020937072,0.00021937217,0.00022215545,0.00035962576,0.00012558943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015351468,0.00071713905,0.0007513705,0.0008162786,0.0011148379,0.0025216723,0.0012906631,0.0009543015,0.009292226],"category_scores_gemma":[0.007816015,0.0004087517,0.00095926103,0.0011205444,0.0010237249,0.0026071302,0.0016877669,0.0015509807,0.0007429821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044379517,0.000203394,0.0006704047,0.00074935984,0.000062987376,0.00022606457,0.00042445117,0.5298104,0.0036052882,0.27406472,0.008386368,0.18135275],"study_design_scores_gemma":[0.00013646392,0.00013990085,0.00017887211,0.000069286994,0.000029437397,0.00010640345,0.00023144239,0.6716129,0.002860004,0.31731206,0.0072986255,0.000024573006],"about_ca_topic_score_codex":0.003324756,"about_ca_topic_score_gemma":0.0039006227,"teacher_disagreement_score":0.009292226,"about_ca_system_score_codex":0.001322564,"about_ca_system_score_gemma":0.002824138,"threshold_uncertainty_score":0.03108555},"labels":[],"label_agreement":null},{"id":"W1556020593","doi":"10.1109/ahs.2015.7231175","title":"Trading off power and fault-tolerance in real-time embedded systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Fault tolerance; Computer science; Leverage (statistics); Reliability engineering; Reliability (semiconductor); Multiprocessing; Failure rate; Electric power system; Transient (computer programming); Computation; Fault (geology); Embedded system; Real-time computing; Distributed computing; Power (physics); Parallel computing; Engineering; Algorithm; Machine learning","score_opus":0.02295654727931569,"score_gpt":0.25825899687672405,"score_spread":0.23530244959740837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556020593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124065965,0.0004497675,0.8744379,0.00013175403,0.000012581585,0.000022210941,0.000011890237,0.00027066984,0.00059732364],"genre_scores_gemma":[0.9574847,0.00010277435,0.04207555,0.000018137998,0.000011566801,0.000013147689,0.0000059840727,0.00003299351,0.00025506906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987299,0.00047919163,0.00007536334,0.00021547887,0.0003902555,0.00010975911],"domain_scores_gemma":[0.9952232,0.0027390698,0.0011013347,0.00050687516,0.00032277132,0.00010670812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019460365,0.0008787823,0.0006316873,0.0007960951,0.00036512187,0.0008735587,0.0010759014,0.00057930936,0.00047034307],"category_scores_gemma":[0.008251286,0.000328771,0.00031801776,0.00063792587,0.0010146415,0.0019567749,0.0006072564,0.00049203646,0.000114858645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067232126,0.000040002476,0.001202049,0.000035787132,0.000022346712,0.00004449501,0.00004011464,0.9449774,0.007156383,0.004584363,0.000057779456,0.04177203],"study_design_scores_gemma":[0.000004630579,0.000059659134,0.0006205211,0.0000033957544,0.000007755426,0.000039952956,0.000008643655,0.98845214,0.0049362,0.0057432125,0.00011654232,0.000007354084],"about_ca_topic_score_codex":0.001061719,"about_ca_topic_score_gemma":0.0013172934,"teacher_disagreement_score":0.0019460365,"about_ca_system_score_codex":0.000852388,"about_ca_system_score_gemma":0.00071499974,"threshold_uncertainty_score":0.010291696},"labels":[],"label_agreement":null},{"id":"W1563918058","doi":"10.1109/iecon.1992.254494","title":"The allocation of hard real-time tasks to heterogeneous processors in robotic and digital control systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Homogeneous; Distributed computing; Dynamic priority scheduling; Architecture; Operating system; Schedule; Mathematical optimization","score_opus":0.009594262233616983,"score_gpt":0.2197855264308135,"score_spread":0.21019126419719653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563918058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05321904,0.0006628825,0.93997484,0.00023108262,0.00008399579,0.000053623353,0.000029273306,0.0004416786,0.0053036776],"genre_scores_gemma":[0.66733396,0.0012015486,0.31741723,0.00018017327,0.00010259641,0.00016139941,0.00010828757,0.00016436893,0.013330347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947923,0.00019373336,0.000025940502,0.000073276264,0.0001634507,0.00006436484],"domain_scores_gemma":[0.99948716,0.00025771983,0.000062480896,0.000098934914,0.000057120604,0.0000366592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005500651,0.00041152452,0.00046269532,0.0004940293,0.0005613065,0.00092674064,0.0007873338,0.000538102,0.0015235789],"category_scores_gemma":[0.0017930928,0.00030126076,0.00034012974,0.00071493024,0.0006985921,0.0012993463,0.0006198957,0.00055472675,0.00027526467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019958352,0.00008439767,0.0005284915,0.00008354736,0.00002303575,0.00010236593,0.00012861243,0.847723,0.008220891,0.050810214,0.0022045558,0.089891344],"study_design_scores_gemma":[0.000025011457,0.00007135165,0.00014489645,0.000007857066,0.000010447338,0.000038767404,0.000034817156,0.96880966,0.005413347,0.020172771,0.0052618636,0.00000923723],"about_ca_topic_score_codex":0.0037844472,"about_ca_topic_score_gemma":0.0035676265,"teacher_disagreement_score":0.0037844472,"about_ca_system_score_codex":0.0008173142,"about_ca_system_score_gemma":0.0010709098,"threshold_uncertainty_score":0.007524848},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.3065236688287156,"score_gpt":0.35622517155047084,"score_spread":0.04970150272175522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1567247259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11438169,0.00032299818,0.88292193,0.000054112934,0.000021085238,0.000058014964,0.000059300986,0.00045073067,0.0017302355],"genre_scores_gemma":[0.908441,0.00013562462,0.09064079,0.00001918239,0.000015814136,0.00006226135,0.00012739419,0.0000862692,0.0004715705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874985,0.00035904426,0.00006478147,0.00027252486,0.00041603876,0.00013775333],"domain_scores_gemma":[0.99559385,0.003157303,0.0004768197,0.00039880295,0.0003186401,0.000054490283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015267339,0.0006518224,0.00066142285,0.0021755085,0.00027331617,0.00054497476,0.0009488839,0.00050692237,0.00079864083],"category_scores_gemma":[0.010003285,0.0003445783,0.0005329456,0.0011956703,0.00067271304,0.0011315645,0.00063786353,0.00069669826,0.00011536841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000929686,0.00004054945,0.0017063492,0.00006688752,0.000025980173,0.000066667235,0.00004797741,0.9533582,0.0045709168,0.0060004205,0.00015671502,0.033866502],"study_design_scores_gemma":[0.0000027949134,0.000019373016,0.0004463564,0.0000038407234,0.0000031015156,0.000013770291,0.0000041792887,0.9960908,0.0013162122,0.0020020548,0.000094518924,0.0000030952099],"about_ca_topic_score_codex":0.0039069047,"about_ca_topic_score_gemma":0.0020411285,"teacher_disagreement_score":0.0039069047,"about_ca_system_score_codex":0.00082274695,"about_ca_system_score_gemma":0.0010706271,"threshold_uncertainty_score":0.008074224},"labels":[],"label_agreement":null},{"id":"W1571653778","doi":"10.1007/978-3-642-16561-0_32","title":"Design Choices for High-Confidence Distributed Real-Time Software","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Control reconfiguration; Resource (disambiguation); Reservation; Predictability; Distributed computing; Dependency (UML); Architecture; Systems design; Software engineering; Embedded system; Computer network","score_opus":0.01856621854428506,"score_gpt":0.24723183415086622,"score_spread":0.22866561560658116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571653778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012161713,0.0006013578,0.977485,0.00027327446,0.00007089211,0.000038751798,0.00003083799,0.0007553752,0.008582766],"genre_scores_gemma":[0.5121217,0.0005987082,0.4753576,0.00024060329,0.000067661385,0.00014473176,0.00009714838,0.00050653866,0.010865455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99800295,0.00046985783,0.00013512946,0.0002441969,0.00097863,0.00016913122],"domain_scores_gemma":[0.9977709,0.0010076588,0.0001817156,0.00045465506,0.0004960147,0.00008905318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002297328,0.00089689065,0.00047989728,0.0005457896,0.00052536547,0.0019092808,0.0016000132,0.0012203808,0.0072941445],"category_scores_gemma":[0.007078348,0.0007863449,0.0005488273,0.00043641886,0.00073112984,0.0020465478,0.0010918493,0.001634356,0.0020060255],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006531983,0.00014131037,0.0012764509,0.0007771352,0.000116720505,0.00041578134,0.0006841826,0.12785372,0.06280434,0.43085238,0.005896803,0.36852792],"study_design_scores_gemma":[0.00021747823,0.00048078096,0.00043417793,0.00021153949,0.00016685849,0.0006889553,0.00019488097,0.5232601,0.059244707,0.36816874,0.046853427,0.00007831134],"about_ca_topic_score_codex":0.00021593933,"about_ca_topic_score_gemma":0.00058178965,"teacher_disagreement_score":0.0072941445,"about_ca_system_score_codex":0.0005818997,"about_ca_system_score_gemma":0.00040398305,"threshold_uncertainty_score":0.024401367},"labels":[],"label_agreement":null},{"id":"W1574558803","doi":"10.1007/978-3-540-74742-0_5","title":"Number of Processors with Partitioning Strategy and EDF-Schedulability Test: Upper and Lower Bounds with Comparison","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Upper and lower bounds; Parallel computing; Schedule; Scheduling (production processes); Heuristic; Processor scheduling; Branch and bound; Time complexity; Set (abstract data type); Job shop scheduling; Worst-case execution time; Execution time; Mathematical optimization; Algorithm; Mathematics","score_opus":0.018093016656547056,"score_gpt":0.27380501085789943,"score_spread":0.2557119942013524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574558803","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27104658,0.052715257,0.61558664,0.0019940333,0.0011116931,0.0005018967,0.001828858,0.0038999175,0.051315136],"genre_scores_gemma":[0.84139705,0.0040980703,0.14745165,0.00030310586,0.00046271973,0.00030841923,0.0014030505,0.000492317,0.004083663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441767,0.0015557599,0.0002728278,0.00073853106,0.0021502136,0.0008650301],"domain_scores_gemma":[0.96526515,0.029744465,0.00095138856,0.0018272174,0.0017986969,0.0004130555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072828177,0.0021440643,0.0028256893,0.005109374,0.0011014033,0.0031184664,0.005098851,0.0024605258,0.007020902],"category_scores_gemma":[0.027675051,0.0006918128,0.0014704654,0.004151165,0.0013878471,0.0057410747,0.0016799426,0.0012729955,0.0007472624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009212777,0.0007472119,0.0045551932,0.001774861,0.0004700721,0.00027295266,0.00016161133,0.5557484,0.011005349,0.03189901,0.006809385,0.3773432],"study_design_scores_gemma":[0.00019349188,0.00049193733,0.0017685686,0.0001200344,0.0002059508,0.0002875143,0.00009888198,0.9694809,0.008290688,0.01766225,0.0013477132,0.000052045605],"about_ca_topic_score_codex":0.0034531332,"about_ca_topic_score_gemma":0.0029532954,"teacher_disagreement_score":0.0072828177,"about_ca_system_score_codex":0.0044141747,"about_ca_system_score_gemma":0.0024687333,"threshold_uncertainty_score":0.038515687},"labels":[],"label_agreement":null},{"id":"W1575365799","doi":"10.1109/icess.2005.56","title":"Feedback Scheduling of Real-Time Control Tasks in Power-Aware Embedded Systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; St. Francis Xavier University; University of Texas at San Antonio","keywords":"Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Workload; Context switch; Embedded system; Schedule; Real-time computing; Operating system; Engineering","score_opus":0.0070228904367928835,"score_gpt":0.22340704089059682,"score_spread":0.21638415045380394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575365799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2026788,0.00064606447,0.7931553,0.0001953892,0.00014184279,0.00006415477,0.000027114369,0.00077908323,0.0023121634],"genre_scores_gemma":[0.9733267,0.00011451616,0.0258213,0.000027226468,0.000025235538,0.000027032684,0.000017459006,0.000017303753,0.0006232997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996586,0.00009157865,0.000021700474,0.000058882335,0.00012353343,0.000045748842],"domain_scores_gemma":[0.9993969,0.00030451766,0.00008593936,0.000058734804,0.00010555149,0.000048417347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006516103,0.00044609333,0.0003498541,0.00034537137,0.00037800928,0.00041558172,0.0005927492,0.00031810778,0.00065620616],"category_scores_gemma":[0.0016291173,0.00020733202,0.00016880751,0.00025562008,0.00046377542,0.00050134177,0.00031213605,0.00033627165,0.00008935488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010774683,0.00033776602,0.0010558486,0.00024826432,0.000029407993,0.0002799379,0.00032245275,0.6911919,0.10048879,0.013491331,0.0014915569,0.18998533],"study_design_scores_gemma":[0.000043042437,0.00021896746,0.00028280233,0.0000064087158,0.000007093233,0.000033558073,0.000017301454,0.9833214,0.011748955,0.003540392,0.00077251246,0.000007554136],"about_ca_topic_score_codex":0.0024008958,"about_ca_topic_score_gemma":0.0031510482,"teacher_disagreement_score":0.0024008958,"about_ca_system_score_codex":0.0004933597,"about_ca_system_score_gemma":0.00069570966,"threshold_uncertainty_score":0.0047737956},"labels":[],"label_agreement":null},{"id":"W1579154801","doi":"10.1109/cdc.2003.1271957","title":"UML extensions for real-time control systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Distributed computing; Unified Modeling Language; Scheduling (production processes); Jitter; Software; Real-time computing; Object-oriented programming; Embedded system; Programming language","score_opus":0.013786660936033293,"score_gpt":0.24468921079692602,"score_spread":0.23090254986089273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1579154801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003303602,0.0023210184,0.9571752,0.0012665878,0.0006591784,0.00032012752,0.0006324791,0.008022285,0.0262995],"genre_scores_gemma":[0.08543012,0.0036202865,0.8804297,0.0010812158,0.00061610516,0.0013975342,0.0023164318,0.0016855092,0.023423044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99678385,0.0015464334,0.00051062944,0.00025134865,0.0007830022,0.00012478774],"domain_scores_gemma":[0.9953584,0.0023186028,0.0007340414,0.00080978137,0.00062627596,0.00015288095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034576368,0.00155629,0.000602099,0.0018092436,0.00063940923,0.002414664,0.0011838693,0.0017190465,0.008605893],"category_scores_gemma":[0.0074857194,0.00069513003,0.0012588006,0.0009676795,0.0010963331,0.0032512178,0.001492062,0.002636022,0.0037230013],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012247403,0.00008563195,0.0005943916,0.00059556967,0.000039856906,0.0009798479,0.001848355,0.015103973,0.008497861,0.8401431,0.022227965,0.10976098],"study_design_scores_gemma":[0.000058199323,0.00006627494,0.00027935143,0.00039367148,0.000041100844,0.0007165743,0.00014350038,0.037784085,0.003937832,0.16611126,0.7904134,0.00005478542],"about_ca_topic_score_codex":0.0013375685,"about_ca_topic_score_gemma":0.0017594309,"teacher_disagreement_score":0.008605893,"about_ca_system_score_codex":0.0011069487,"about_ca_system_score_gemma":0.0010619108,"threshold_uncertainty_score":0.02878958},"labels":[],"label_agreement":null},{"id":"W158230821","doi":"","title":"Software modeling for embedded and mobile sensor system","year":2011,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Ontario Tech University","funders":"","keywords":"Computer science; Embedded system; Software; Operating system","score_opus":0.18825161993525197,"score_gpt":0.3904814229381189,"score_spread":0.20222980300286691,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W158230821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074810227,0.000982976,0.9689265,0.00086430815,0.00017251972,0.0002633016,0.00074005954,0.003870591,0.016698757],"genre_scores_gemma":[0.4212803,0.0044833613,0.5163471,0.0006960495,0.00022957577,0.0016913704,0.004311615,0.0014203938,0.049540203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908364,0.00021137812,0.000097498516,0.00014961648,0.0003777675,0.00008004712],"domain_scores_gemma":[0.99904245,0.00035322798,0.000090017835,0.00015397422,0.0003237641,0.00003642516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082956464,0.0009973287,0.00053121767,0.0007281149,0.00046531067,0.001800692,0.0016700983,0.0013796648,0.0073047457],"category_scores_gemma":[0.0028195705,0.00043188955,0.0012891215,0.0005699511,0.0006143369,0.001856094,0.0010562993,0.0012878162,0.0025758825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011108443,0.00009918099,0.0022403365,0.0007361426,0.00008279488,0.00082732487,0.0005281912,0.6159969,0.009254274,0.25750256,0.014215278,0.098405935],"study_design_scores_gemma":[0.000020869384,0.00004854485,0.00024939168,0.00008065013,0.00003520193,0.00020662801,0.000055152505,0.8960166,0.0026339532,0.042193085,0.05844061,0.00001931303],"about_ca_topic_score_codex":0.007081587,"about_ca_topic_score_gemma":0.0036373755,"teacher_disagreement_score":0.0073047457,"about_ca_system_score_codex":0.0008492327,"about_ca_system_score_gemma":0.0014714333,"threshold_uncertainty_score":0.024436831},"labels":[],"label_agreement":null},{"id":"W1597017957","doi":"10.1007/978-3-540-45232-4_11","title":"Heuristic Optimization of Scheduling and Allocation for Distributed Systems with Soft Deadlines","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Distributed computing; Queueing theory; Heuristic; Mathematical optimization; Computer network","score_opus":0.014440682492985886,"score_gpt":0.2322584779265558,"score_spread":0.2178177954335699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597017957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06857564,0.0016527107,0.9185428,0.00042279117,0.0002392749,0.00016885324,0.00014913628,0.00057588005,0.009672874],"genre_scores_gemma":[0.73075294,0.00081113225,0.2606234,0.00015962357,0.00017102048,0.00036871055,0.00021613593,0.00023207623,0.0066650244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.00032489686,0.000024903686,0.00007916081,0.00016253341,0.00017156245],"domain_scores_gemma":[0.9982376,0.0013203201,0.00013478062,0.00007577015,0.00012496296,0.00010649373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020520273,0.0013713517,0.0020126894,0.0012203744,0.0007769557,0.0016029037,0.0018737814,0.0015336213,0.0033402452],"category_scores_gemma":[0.0039678765,0.0011840955,0.00079035794,0.0017172276,0.0013345884,0.0012575357,0.0011072072,0.0012341082,0.0003515366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007542955,0.00003030003,0.00005689232,0.000032434855,0.000015803853,0.000013685093,0.000012498026,0.9860488,0.00026213855,0.003891841,0.00056909176,0.008991073],"study_design_scores_gemma":[0.000029800009,0.000019797977,0.000027210488,0.0000037698644,0.000005760946,0.000004081213,0.0000072493544,0.9964706,0.00011204942,0.0031180354,0.00019852439,0.0000031092145],"about_ca_topic_score_codex":0.007903529,"about_ca_topic_score_gemma":0.008281374,"teacher_disagreement_score":0.007903529,"about_ca_system_score_codex":0.0023261607,"about_ca_system_score_gemma":0.002353411,"threshold_uncertainty_score":0.016877532},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02324868176041726,"score_gpt":0.2669086847118722,"score_spread":0.24366000295145493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604530876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38840756,0.0012535058,0.6016998,0.000113861766,0.000075142634,0.00010217079,0.00010073683,0.002121006,0.006126215],"genre_scores_gemma":[0.9289798,0.00013982324,0.06865689,0.000028556915,0.000025301737,0.00007056677,0.00013563123,0.00015734175,0.0018061207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996511,0.00007494755,0.000018339293,0.00008684554,0.00006575306,0.000102945116],"domain_scores_gemma":[0.9992472,0.00023389072,0.00012261889,0.00020423807,0.00012393396,0.000068282265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005082001,0.0007697982,0.00075741275,0.0006474535,0.000587543,0.000598749,0.00089442,0.000366312,0.0012599454],"category_scores_gemma":[0.0010981456,0.00024153083,0.0004083797,0.00066249503,0.00047553194,0.0007673473,0.0008823381,0.00044802358,0.00026859727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014386348,0.00027928027,0.0040870775,0.00027222274,0.0001015659,0.0002928178,0.00038792368,0.6908547,0.08169417,0.0067642513,0.002957716,0.21086958],"study_design_scores_gemma":[0.0000685254,0.00034298105,0.001475547,0.000011438906,0.000044542976,0.00011200731,0.00008264716,0.9597687,0.030609496,0.005170386,0.0022972305,0.000016524671],"about_ca_topic_score_codex":0.001324302,"about_ca_topic_score_gemma":0.0032104999,"teacher_disagreement_score":0.001324302,"about_ca_system_score_codex":0.00041020362,"about_ca_system_score_gemma":0.000974852,"threshold_uncertainty_score":0.0042149425},"labels":[],"label_agreement":null},{"id":"W1606060343","doi":"","title":"MEQA 3 - a multi-end QoS application adaptation architecture","year":2001,"lang":"en","type":"book","venue":"Nova Science Publishers, Inc. eBooks","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Quality of service; Computer science; Adaptation (eye); Architecture; Distributed computing; Resource allocation; Resource (disambiguation); Service (business); Computer network; Event (particle physics); Mobile QoS; Real-time computing; Service provider","score_opus":0.03787090270176549,"score_gpt":0.26506277186335336,"score_spread":0.22719186916158787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606060343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019375926,0.0013337993,0.9183529,0.0005529641,0.00025008642,0.00025127747,0.00030876545,0.032442156,0.027132105],"genre_scores_gemma":[0.2780856,0.0016715263,0.6178029,0.0012060002,0.00019694118,0.0004116349,0.001880651,0.0025605028,0.09618428],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997069,0.000039720293,0.000019603112,0.000051254538,0.00013672258,0.000045789206],"domain_scores_gemma":[0.9996692,0.00005627414,0.000017090892,0.00008770499,0.00012145631,0.000048332724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005020368,0.00057412504,0.00033128873,0.00036092795,0.00039602758,0.0014021512,0.001587253,0.0011347266,0.0075782062],"category_scores_gemma":[0.0008268775,0.0005137593,0.0005059791,0.00034932568,0.0002572082,0.0011345709,0.0007285453,0.0020288648,0.003934314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011359467,0.0003318906,0.0017440347,0.00033496547,0.00012897282,0.00065204414,0.00057952397,0.060817596,0.27845436,0.042737376,0.071124285,0.5419589],"study_design_scores_gemma":[0.0001384983,0.00049907365,0.003822531,0.000110359,0.000080374215,0.0014957289,0.00006773282,0.54592925,0.08773494,0.017359124,0.3425851,0.00017736938],"about_ca_topic_score_codex":0.0042639202,"about_ca_topic_score_gemma":0.0026351204,"teacher_disagreement_score":0.0075782062,"about_ca_system_score_codex":0.00071690296,"about_ca_system_score_gemma":0.000630427,"threshold_uncertainty_score":0.025351584},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016647059064031695,"score_gpt":0.2538805904351192,"score_spread":0.2372335313710875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1673553675","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1321988,0.00039594676,0.86262435,0.00021859667,0.00007880528,0.000234099,0.00016801614,0.00073628075,0.0033449868],"genre_scores_gemma":[0.78541815,0.00037714664,0.2116479,0.00008421774,0.000046544417,0.00018464921,0.00043084542,0.0001538651,0.0016567706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996101,0.00012590566,0.00002047649,0.000075303695,0.00009743535,0.00007067842],"domain_scores_gemma":[0.99927574,0.0004237852,0.00009556939,0.000060604732,0.00007425094,0.00007013551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062287104,0.0007176388,0.00052405434,0.0006379183,0.00082025403,0.00052684906,0.0007323383,0.00041480476,0.0015597303],"category_scores_gemma":[0.0014486947,0.00027039612,0.00046590224,0.00068244373,0.000417502,0.00057014724,0.00048386957,0.00046717795,0.00017713656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018970891,0.00011858329,0.00072075357,0.0001974599,0.00003858326,0.00029772145,0.0001727377,0.9035902,0.012742948,0.021136925,0.002271457,0.058522895],"study_design_scores_gemma":[0.000033955515,0.000066592074,0.00023863466,0.000005942066,0.000010851343,0.00004460836,0.00004339693,0.97963136,0.002030877,0.016348511,0.0015362954,0.000008921545],"about_ca_topic_score_codex":0.004690788,"about_ca_topic_score_gemma":0.0058301133,"teacher_disagreement_score":0.004690788,"about_ca_system_score_codex":0.0008321044,"about_ca_system_score_gemma":0.0015971299,"threshold_uncertainty_score":0.009326994},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0151988964282292,"score_gpt":0.21967222642673678,"score_spread":0.2044733299985076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678112703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021071092,0.000064091364,0.9964797,0.00010115889,0.000021310261,0.000024873576,0.000006410784,0.00008553845,0.0011097731],"genre_scores_gemma":[0.13451715,0.00046742236,0.8614363,0.00012712153,0.00008719131,0.00017769172,0.00004800411,0.00011794059,0.0030212533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989021,0.00024239578,0.00006823407,0.00016855256,0.0005090924,0.00010965812],"domain_scores_gemma":[0.9983796,0.0005806623,0.00015397776,0.0003959818,0.00038703805,0.00010266212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001154379,0.0012055138,0.0004932616,0.0008702501,0.0006864445,0.0011805271,0.0013625413,0.0007811744,0.0022040221],"category_scores_gemma":[0.0030477322,0.0005506623,0.00067737984,0.0006469233,0.0012840104,0.0020530254,0.0013714391,0.0022213673,0.0006704074],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008862567,0.0001707275,0.00043862785,0.00021673144,0.0000364638,0.00029602155,0.0002707206,0.5637476,0.05219388,0.22134158,0.0014237547,0.15977527],"study_design_scores_gemma":[0.000040179315,0.00017802762,0.00016358779,0.000033721048,0.000028993334,0.0002080941,0.00008593899,0.85034806,0.02301847,0.108299874,0.017563973,0.000031055155],"about_ca_topic_score_codex":0.0010128582,"about_ca_topic_score_gemma":0.001130885,"teacher_disagreement_score":0.0022040221,"about_ca_system_score_codex":0.00093855587,"about_ca_system_score_gemma":0.0016994657,"threshold_uncertainty_score":0.007373214},"labels":[],"label_agreement":null},{"id":"W172774100","doi":"10.1007/1-4020-5263-4_66","title":"Activation-Adjusted Scheduling Algorithms for Real-Times Systems","year":2007,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Computer science; Algorithm; Scheduling (production processes); Parallel computing; Mathematical optimization; Mathematics","score_opus":0.07509648322608205,"score_gpt":0.2971673640249849,"score_spread":0.22207088079890286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172774100","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033479605,0.0011452056,0.9865622,0.00015845752,0.00031049456,0.000035941706,0.0000323132,0.0009645225,0.007442857],"genre_scores_gemma":[0.16936907,0.0021177402,0.8048995,0.00025202916,0.00038771905,0.00021946893,0.0002719366,0.00089131156,0.02159121],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940336,0.00015416181,0.000032061198,0.00009721705,0.00024385117,0.0000693264],"domain_scores_gemma":[0.9991455,0.0003933907,0.00005369125,0.00016059802,0.00020546559,0.000041300602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095320476,0.0011123768,0.00088195945,0.0006203981,0.0005271984,0.001202524,0.0022121284,0.00076642865,0.0070781074],"category_scores_gemma":[0.0030769373,0.0005151093,0.0005435577,0.0013127808,0.00066362653,0.0016047972,0.0008922784,0.00285323,0.0021418312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028310975,0.00011703699,0.00019360488,0.00020896697,0.000048176713,0.000037771915,0.00014559046,0.3326173,0.008587122,0.15500696,0.016298776,0.48645562],"study_design_scores_gemma":[0.00003931522,0.00004212681,0.00010193274,0.000022284092,0.000015268177,0.00004640273,0.00001998625,0.8998366,0.0031338532,0.08328882,0.013433198,0.00002023276],"about_ca_topic_score_codex":0.0017029576,"about_ca_topic_score_gemma":0.0017340719,"teacher_disagreement_score":0.0070781074,"about_ca_system_score_codex":0.001006286,"about_ca_system_score_gemma":0.0011046792,"threshold_uncertainty_score":0.02367866},"labels":[],"label_agreement":null},{"id":"W1799546","doi":"10.1007/978-3-319-12436-0_19","title":"Fixed-Priority Scheduling Policies and Their Non-utilization Bounds","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Dynamic priority scheduling; Earliest deadline first scheduling; Rate-monotonic scheduling; Scheduling (production processes); Fair-share scheduling; Mathematical optimization; Deadline-monotonic scheduling; Distributed computing; Two-level scheduling; Monotonic function; Mathematics; Computer network; Quality of service","score_opus":0.021163516601045665,"score_gpt":0.2575855369553231,"score_spread":0.23642202035427745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1799546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035042368,0.030463275,0.8490873,0.0021348626,0.0009765214,0.00012289656,0.0003981951,0.0009871371,0.08078742],"genre_scores_gemma":[0.6976079,0.022106119,0.24949516,0.00091667374,0.0014698474,0.0005378537,0.000561213,0.0009755754,0.026329603],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9950931,0.0012465483,0.0002461925,0.00063558493,0.0018077283,0.00097095204],"domain_scores_gemma":[0.97090673,0.022972282,0.0013019546,0.002227969,0.0018397362,0.0007513095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064503304,0.0023992816,0.0022060752,0.002765383,0.0018431373,0.005966063,0.00510935,0.0020211933,0.007683981],"category_scores_gemma":[0.0348411,0.0015966304,0.0011816769,0.0045704897,0.0025108748,0.0068607135,0.0029076585,0.0067081894,0.0015448027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003231774,0.00015204288,0.00030411722,0.00030972436,0.000063267544,0.000109942666,0.0002366616,0.090806924,0.001578178,0.81720394,0.0063237627,0.08258824],"study_design_scores_gemma":[0.0000309039,0.00008006166,0.00033858352,0.00021012334,0.000050480056,0.000213158,0.00006476503,0.377102,0.0014782614,0.6135481,0.006844061,0.000039511313],"about_ca_topic_score_codex":0.0026147098,"about_ca_topic_score_gemma":0.0014510916,"teacher_disagreement_score":0.007683981,"about_ca_system_score_codex":0.0046543544,"about_ca_system_score_gemma":0.002737671,"threshold_uncertainty_score":0.03411299},"labels":[],"label_agreement":null},{"id":"W1832526807","doi":"10.1007/11557654_29","title":"Convergence of the Discrete FGDLS Algorithm","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Monotonic function; Computer science; Convergence (economics); Workload; Algorithm; Mathematical optimization; Variable (mathematics); Scheduling (production processes); Mathematics","score_opus":0.01228171881359969,"score_gpt":0.23777501658346362,"score_spread":0.22549329776986393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1832526807","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01917751,0.00030822307,0.9608879,0.00044303152,0.00018050251,0.00006446986,0.00012134311,0.0006448822,0.018172167],"genre_scores_gemma":[0.5447741,0.00036083182,0.42991385,0.00029938834,0.00016619923,0.00027020668,0.00041318507,0.00040183926,0.023400355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990332,0.00035706122,0.000032609583,0.00013367391,0.00031854075,0.00012482292],"domain_scores_gemma":[0.99751914,0.0015532526,0.00010352386,0.0002667608,0.00043331322,0.00012403294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019504664,0.0006901241,0.000876238,0.0009578888,0.0005007691,0.0014521056,0.0015157849,0.0009513298,0.008766362],"category_scores_gemma":[0.007585191,0.00033786392,0.0005602009,0.00063013326,0.0014797907,0.0010295381,0.0017315296,0.0013766978,0.0016568904],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007037907,0.00012622327,0.00075244927,0.0002625263,0.000038115635,0.00006178983,0.00014818937,0.5904807,0.003448458,0.20718734,0.007927949,0.18886262],"study_design_scores_gemma":[0.000051697527,0.000025341345,0.00006325668,0.00001592743,0.0000038556805,0.000017424978,0.000012682104,0.9682073,0.0008126518,0.029262863,0.0015213788,0.000005665019],"about_ca_topic_score_codex":0.004153653,"about_ca_topic_score_gemma":0.0027477515,"teacher_disagreement_score":0.008766362,"about_ca_system_score_codex":0.0015700266,"about_ca_system_score_gemma":0.0016682532,"threshold_uncertainty_score":0.02932638},"labels":[],"label_agreement":null},{"id":"W1835982031","doi":"10.1109/isorc.2015.21","title":"Flexible Framework for Statistical Schedulability Analysis of Probabilistic Sporadic Tasks","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Probabilistic logic; Stopwatch; Automaton; Model checking; Parameterized complexity; Computation; Flexibility (engineering); Statistical model; Probabilistic analysis of algorithms; Task (project management); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics","score_opus":0.06549792459634848,"score_gpt":0.33904961699414216,"score_spread":0.27355169239779364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835982031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018749071,0.000061108425,0.99724305,0.00002261083,0.000009234495,0.00003397685,0.00003931623,0.00030150995,0.00041427623],"genre_scores_gemma":[0.2965311,0.0003039276,0.7004296,0.00010794016,0.00011334255,0.0008122711,0.00029122425,0.0003440243,0.0010665206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685967,0.0008249196,0.00019553649,0.00040405162,0.0013988423,0.00031707966],"domain_scores_gemma":[0.99490607,0.0028321587,0.00048249037,0.0011158586,0.0005412071,0.0001222591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004351673,0.0017950371,0.0013824701,0.0022719123,0.0008251867,0.0015448866,0.0026480008,0.0009967615,0.0020675028],"category_scores_gemma":[0.008313219,0.0010077985,0.0027293207,0.0015677954,0.0016592433,0.0017584136,0.0019428659,0.002847703,0.0006325847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106499596,0.000109417226,0.0007168442,0.00015488834,0.000113509086,0.00028699386,0.00015766182,0.774375,0.016685393,0.1688556,0.00083483034,0.03760333],"study_design_scores_gemma":[0.000013942459,0.00003073034,0.000114942064,0.000012197323,0.000017126964,0.000047587466,0.000009754965,0.95318514,0.0018889306,0.04311602,0.0015471482,0.000016602364],"about_ca_topic_score_codex":0.0028286912,"about_ca_topic_score_gemma":0.0020990716,"teacher_disagreement_score":0.004351673,"about_ca_system_score_codex":0.0013179177,"about_ca_system_score_gemma":0.002645291,"threshold_uncertainty_score":0.023014128},"labels":[],"label_agreement":null},{"id":"W1865229029","doi":"10.1109/pacrim.1997.620405","title":"Performance of several buffering schemes using RCP","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Jitter; Token ring; Computer network; Network packet; Security token; Queueing theory; Protocol (science); Token passing; Real-time computing; Telecommunications","score_opus":0.03926507792267438,"score_gpt":0.23091688255733436,"score_spread":0.19165180463465997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1865229029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9757176,0.0027573036,0.016453013,0.00026881008,0.0001380135,0.00013309768,0.0002037254,0.0016127606,0.002715669],"genre_scores_gemma":[0.99124277,0.00029744298,0.007635297,0.00005901608,0.000027958638,0.00003634662,0.00012371723,0.000051353432,0.00052603695],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801767,0.00056634843,0.0001694033,0.00030790042,0.000532718,0.0004059107],"domain_scores_gemma":[0.9846586,0.00964577,0.0017676039,0.0013403243,0.0018883584,0.00069929624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027111215,0.0013449398,0.00069856946,0.0015464629,0.0010985824,0.0010788697,0.0019295986,0.0010537234,0.0020458584],"category_scores_gemma":[0.013680055,0.0004122896,0.00025588294,0.0014782696,0.00082551595,0.0015103904,0.0005514433,0.0006231929,0.00024362741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021001205,0.0017718505,0.017412174,0.0014844261,0.00064752565,0.0006739047,0.0011273426,0.30612308,0.35103095,0.009636306,0.005521372,0.2835699],"study_design_scores_gemma":[0.0009812583,0.0059536486,0.0050291074,0.00011986274,0.00061023637,0.00055165734,0.00030044737,0.54119825,0.43948674,0.0016243255,0.0039550974,0.00018931078],"about_ca_topic_score_codex":0.0039955825,"about_ca_topic_score_gemma":0.0021779474,"teacher_disagreement_score":0.0039955825,"about_ca_system_score_codex":0.0022738327,"about_ca_system_score_gemma":0.00093416165,"threshold_uncertainty_score":0.01649785},"labels":[],"label_agreement":null},{"id":"W1880476883","doi":"10.1109/wordsf.1999.842329","title":"Batching earliest deadline first scheduling","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Earliest deadline first scheduling; Distributed computing; Fixed-priority pre-emptive scheduling; Deadline-monotonic scheduling; Prioritization; Fair-share scheduling; Rate-monotonic scheduling; Processor scheduling; Real-time computing; Mathematical optimization; Quality of service; Computer network; Resource (disambiguation)","score_opus":0.014069380977910944,"score_gpt":0.2271196325326044,"score_spread":0.21305025155469345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1880476883","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022927493,0.0021018754,0.96854836,0.00023314124,0.00031730678,0.00039175132,0.00019488673,0.002175945,0.0031093014],"genre_scores_gemma":[0.28749698,0.001483074,0.7036129,0.00023474233,0.00028759753,0.00024699623,0.0003416828,0.00021947476,0.006076435],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986896,0.0002644693,0.00010335937,0.0003070268,0.00048658546,0.00014895778],"domain_scores_gemma":[0.9963825,0.0019799059,0.00049696065,0.0004381754,0.00052217947,0.00018031383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031146337,0.0011295737,0.001773119,0.0011873449,0.0009766346,0.0012493196,0.0025798758,0.0006797486,0.002052703],"category_scores_gemma":[0.00576795,0.0006348106,0.00054666115,0.0017011882,0.0006499943,0.00135535,0.00056091975,0.0010907281,0.0007438521],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015356089,0.00046439128,0.003151463,0.0011625825,0.00016955013,0.00025987683,0.00039365687,0.30460283,0.04506403,0.050941393,0.011338794,0.5809159],"study_design_scores_gemma":[0.00023216124,0.0006441782,0.0010919721,0.00005570552,0.000092878014,0.00035378058,0.000055819808,0.9118451,0.035654802,0.025042145,0.024846552,0.00008496339],"about_ca_topic_score_codex":0.0051804376,"about_ca_topic_score_gemma":0.005051215,"teacher_disagreement_score":0.0051804376,"about_ca_system_score_codex":0.001916824,"about_ca_system_score_gemma":0.002503419,"threshold_uncertainty_score":0.016471982},"labels":[],"label_agreement":null},{"id":"W1883412616","doi":"10.1109/pacrim.1993.407172","title":"A fault-tolerant dynamic scheduler for distributed hard-real-time systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Scheduling (production processes); Fault tolerance; Execution time; Parallel computing; Dynamic priority scheduling; Real-time computing; Distributed computing; Running time; Fixed-priority pre-emptive scheduling; Algorithm; Rate-monotonic scheduling; Mathematical optimization; Mathematics; Operating system; Schedule","score_opus":0.020811310278061896,"score_gpt":0.23976381282326306,"score_spread":0.21895250254520116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1883412616","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020977812,0.00082174863,0.97207457,0.00019388985,0.00024163972,0.00009579442,0.00007920746,0.003780988,0.0017342045],"genre_scores_gemma":[0.61671865,0.0007133094,0.37578884,0.00018755878,0.00024605397,0.0002333352,0.00046396014,0.00027940207,0.0053688698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995813,0.000075160046,0.000036306705,0.000062417865,0.00019156143,0.000053250722],"domain_scores_gemma":[0.99946386,0.00012615333,0.000058779984,0.00012511932,0.00014513389,0.000081071754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006219133,0.00042238325,0.00053807255,0.0004769046,0.0006055586,0.0008359187,0.001640543,0.000393037,0.0016087926],"category_scores_gemma":[0.0014853787,0.0002938081,0.00028232462,0.00039406627,0.000326052,0.0008542113,0.0006026892,0.00068553054,0.00049632654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091827137,0.00026673722,0.0023296585,0.00041315868,0.000118229895,0.0005675744,0.00026344717,0.39467323,0.070485376,0.053218227,0.016912693,0.45983338],"study_design_scores_gemma":[0.00014436146,0.0001731071,0.00034868112,0.000011507157,0.00003813197,0.00021182297,0.000019051437,0.9576674,0.014750697,0.006913957,0.019696837,0.000024448207],"about_ca_topic_score_codex":0.0015117258,"about_ca_topic_score_gemma":0.0019310742,"teacher_disagreement_score":0.001640543,"about_ca_system_score_codex":0.0007234422,"about_ca_system_score_gemma":0.0013369514,"threshold_uncertainty_score":0.005381942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.035812008618553666,"score_gpt":0.266551280083951,"score_spread":0.23073927146539736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1905713602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010764457,0.00006745562,0.9866071,0.000056062796,0.000025714606,0.00009517432,0.00005659661,0.00077637064,0.001551082],"genre_scores_gemma":[0.15179801,0.00022502175,0.8451469,0.00006131644,0.00001761258,0.00040312696,0.00029820006,0.0002665935,0.0017832102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987343,0.00035045377,0.00013373565,0.0001457324,0.0005075208,0.00012822886],"domain_scores_gemma":[0.99789655,0.0011016764,0.00021591573,0.00043870145,0.00030577095,0.000041384596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018281528,0.00075844955,0.00046199164,0.0006188496,0.0004190455,0.0012029284,0.0011139855,0.00083678495,0.0019031379],"category_scores_gemma":[0.0038391175,0.0006718814,0.0012407955,0.0005178689,0.00070068537,0.0009851828,0.00055087643,0.0010445411,0.0004930489],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018989104,0.00015449048,0.00098614,0.0005570363,0.00007988336,0.00055017316,0.0003898638,0.67618054,0.06067208,0.14202286,0.0016560418,0.11656095],"study_design_scores_gemma":[0.00008380366,0.00010154866,0.00015301575,0.000052098236,0.000055462413,0.00010829507,0.00004337886,0.9070745,0.042528138,0.039385073,0.010392604,0.000022047623],"about_ca_topic_score_codex":0.0011488884,"about_ca_topic_score_gemma":0.0022549478,"teacher_disagreement_score":0.0019031379,"about_ca_system_score_codex":0.000720676,"about_ca_system_score_gemma":0.0015262614,"threshold_uncertainty_score":0.009668291},"labels":[],"label_agreement":null},{"id":"W1907490098","doi":"10.1109/iecon.1993.339424","title":"Generating multiprocessor implementations of robotics algorithms from task precedence graphs","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Multiprocessing; Node (physics); Implementation; Parallel computing; Algorithm; Programmer; Robotics; Graph; Distributed computing; Artificial intelligence; Embedded system; Programming language; Theoretical computer science; Robot","score_opus":0.03821086894031581,"score_gpt":0.2760310555349805,"score_spread":0.23782018659466467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1907490098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025962573,0.000074649935,0.96764934,0.000081094826,0.00003432808,0.00013241795,0.0001414269,0.0024186107,0.0035056628],"genre_scores_gemma":[0.17077334,0.00016701312,0.8247496,0.000048385624,0.000011266963,0.0002892663,0.00061957166,0.0007879296,0.0025536332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960536,0.00012939602,0.000025507014,0.00005964977,0.00013224316,0.000047907542],"domain_scores_gemma":[0.99890924,0.00067033205,0.00008534513,0.00016421328,0.00014464791,0.000026206233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070341956,0.00063204503,0.00032783172,0.000701273,0.00043272492,0.00079657737,0.001145438,0.0005887667,0.004697612],"category_scores_gemma":[0.0038626497,0.0004824184,0.00066760514,0.00069569773,0.00056590966,0.0008877749,0.00087197905,0.00088297774,0.0007465584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013592995,0.00010814009,0.0011225783,0.00023559722,0.000032297125,0.00027612224,0.00030874895,0.7277459,0.011388691,0.097652726,0.004159036,0.15683432],"study_design_scores_gemma":[0.00006545458,0.00004221699,0.0001458081,0.000021002521,0.000012548548,0.000049535898,0.00005666497,0.93659914,0.010025598,0.045273934,0.007695867,0.000012142096],"about_ca_topic_score_codex":0.0022324857,"about_ca_topic_score_gemma":0.003942816,"teacher_disagreement_score":0.004697612,"about_ca_system_score_codex":0.0007532617,"about_ca_system_score_gemma":0.00088305306,"threshold_uncertainty_score":0.015715122},"labels":[],"label_agreement":null},{"id":"W1918415121","doi":"10.1109/etfa.2015.7301494","title":"Generation of communication schedules using component interfaces","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Component (thermodynamics); Schedule; Distributed computing; Task (project management); Integer programming; Computation; Mode (computer interface); Linear programming; Bounded function; Scheduling (production processes); Resource (disambiguation); Real-time computing; Computer network; Mathematical optimization; Algorithm; Human–computer interaction; Engineering; Operating system","score_opus":0.21514434887420777,"score_gpt":0.3312659992561717,"score_spread":0.1161216503819639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1918415121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06881284,0.00007067625,0.92405254,0.000060438302,0.000035486228,0.00019827884,0.00012599042,0.001183631,0.0054600965],"genre_scores_gemma":[0.53654647,0.00011345998,0.45975405,0.000032588745,0.0000135824175,0.00037124602,0.00047076677,0.000342921,0.002354899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996117,0.00012417417,0.000025510093,0.000060771094,0.00011939436,0.000058504556],"domain_scores_gemma":[0.99910885,0.0004064797,0.000101137564,0.00011029833,0.00022580868,0.00004739888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062942825,0.0006160532,0.00029998276,0.0007203614,0.00032367432,0.0004695475,0.0005881775,0.00032579686,0.0019914175],"category_scores_gemma":[0.002201949,0.00030004312,0.00040336503,0.0005070147,0.00028253978,0.00038156135,0.00042273832,0.0004603833,0.0003419981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027559043,0.00015092126,0.0017021102,0.000221776,0.00003269091,0.00029138883,0.0003040618,0.76671165,0.033637997,0.029685367,0.003081411,0.16390507],"study_design_scores_gemma":[0.00003874474,0.00012225135,0.0003055842,0.000010979538,0.000019127248,0.00004053469,0.000047898884,0.9718716,0.014595809,0.008275941,0.0046610096,0.0000104459905],"about_ca_topic_score_codex":0.0015649892,"about_ca_topic_score_gemma":0.0016373744,"teacher_disagreement_score":0.0019914175,"about_ca_system_score_codex":0.00050818094,"about_ca_system_score_gemma":0.0011246873,"threshold_uncertainty_score":0.0066619515},"labels":[],"label_agreement":null},{"id":"W1922853344","doi":"10.1109/cca.2003.1223178","title":"Design and implementation of an Internet-based embedded control system","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"The Internet; Computer science; Embedded system; Unified Modeling Language; Modularity (biology); Microcontroller; Control system; Real-time Control System Software; Model-based design; Software engineering; Robotics; Software; Operating system; Software system; Robot; Engineering; Component-based software engineering; Artificial intelligence; Simulation","score_opus":0.01356560664758431,"score_gpt":0.269078771552548,"score_spread":0.2555131649049637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922853344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033123977,0.00024119078,0.9396402,0.00021171117,0.00018279802,0.00053110323,0.00007447754,0.008058432,0.017936083],"genre_scores_gemma":[0.5810578,0.00031721662,0.40165457,0.0002889114,0.00008644269,0.0007888518,0.0002578985,0.00026864454,0.0152796935],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995123,0.000061178005,0.000037552545,0.00008947495,0.00025740504,0.00004207772],"domain_scores_gemma":[0.9996619,0.000049118593,0.000030245104,0.000045815843,0.000183708,0.000029171659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042329944,0.0003252305,0.00039676955,0.0004934601,0.00029879794,0.0008778145,0.00094293756,0.00057439215,0.0027850857],"category_scores_gemma":[0.0006168249,0.00022853151,0.00020775449,0.00022546534,0.0002581041,0.0004631986,0.00029616768,0.00046716523,0.0011694857],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000504343,0.00066193024,0.0038483224,0.0007620089,0.00017883028,0.0014917816,0.000653326,0.08330105,0.30119625,0.03641521,0.008232161,0.5627548],"study_design_scores_gemma":[0.00036603602,0.0010792668,0.0043577095,0.0001316977,0.00024532346,0.0015714199,0.00010261686,0.559591,0.31163916,0.0054261833,0.11538452,0.000105041836],"about_ca_topic_score_codex":0.00063857064,"about_ca_topic_score_gemma":0.0003695778,"teacher_disagreement_score":0.0027850857,"about_ca_system_score_codex":0.00027385898,"about_ca_system_score_gemma":0.00062587345,"threshold_uncertainty_score":0.00931704},"labels":[],"label_agreement":null},{"id":"W1932733311","doi":"10.1109/real.1989.63556","title":"Nearly Poisson transfer traffic in real-time networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Poisson distribution; Computer science; Node (physics); Independence (probability theory); Task (project management); Function (biology); Exponential distribution; Transfer (computing); Theoretical computer science; Mathematics; Statistics; Engineering","score_opus":0.01147803569934772,"score_gpt":0.2229688726664689,"score_spread":0.21149083696712118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1932733311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31506953,0.0009651622,0.67234707,0.0007909278,0.00017909889,0.00009647316,0.00024018751,0.00052113616,0.009790388],"genre_scores_gemma":[0.9784541,0.00070855115,0.01646602,0.00012060719,0.00011032677,0.00006608199,0.0001633282,0.0000656318,0.0038453457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982718,0.00070980284,0.000057847756,0.00019204862,0.0005740297,0.00019440771],"domain_scores_gemma":[0.9958133,0.002602826,0.00049909175,0.0003744222,0.0005571728,0.00015317972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019224507,0.00049926416,0.00052879105,0.0010700893,0.00056946184,0.0015186145,0.0013515025,0.0009752064,0.0015491099],"category_scores_gemma":[0.009143052,0.00043169037,0.00036153232,0.0015004613,0.0010076861,0.002614205,0.00065660995,0.00060356327,0.00027458213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012944077,0.000042837924,0.0018655193,0.000047930786,0.000017624008,0.00029145568,0.00013226114,0.8839968,0.0023477252,0.09955391,0.0012177597,0.010356684],"study_design_scores_gemma":[0.00000827419,0.0000264169,0.00043868105,0.000004518123,0.0000043908994,0.00011335635,0.00005635648,0.971033,0.0006374411,0.026660126,0.0010078553,0.000009662711],"about_ca_topic_score_codex":0.0032478184,"about_ca_topic_score_gemma":0.0012765804,"teacher_disagreement_score":0.0032478184,"about_ca_system_score_codex":0.0017258478,"about_ca_system_score_gemma":0.0006955615,"threshold_uncertainty_score":0.012521982},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01414553549661212,"score_gpt":0.2282402965364972,"score_spread":0.21409476103988506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1953227509","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058060918,0.3930469,0.22089747,0.036385693,0.0048308573,0.00013285232,0.00044996972,0.0025911012,0.28360423],"genre_scores_gemma":[0.55455667,0.18958001,0.18210842,0.0059434893,0.0029652324,0.00011561556,0.0009093799,0.00069617596,0.063125044],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994035,0.00007603335,0.000034730227,0.00008514649,0.0002901159,0.00011040158],"domain_scores_gemma":[0.999057,0.00015517643,0.00011803377,0.00011352994,0.00031693323,0.00023938053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001793849,0.00045757776,0.00023518337,0.0007328078,0.00043766305,0.0022580514,0.00064618513,0.0006988675,0.005820241],"category_scores_gemma":[0.0014623683,0.0002342995,0.00021688353,0.0014121333,0.0009807317,0.004595355,0.0012933963,0.0013074571,0.0020974912],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008792875,0.000059569997,0.0015131942,0.00037638732,0.000013602036,0.00006192704,0.00027692583,0.0020916201,0.0045168097,0.16122058,0.020204801,0.80957663],"study_design_scores_gemma":[0.0000151721,0.00028931702,0.0034518223,0.0005255768,0.00001908165,0.0004920228,0.00032754536,0.0060090404,0.0033897678,0.054016918,0.93143415,0.000029546856],"about_ca_topic_score_codex":0.0010412784,"about_ca_topic_score_gemma":0.0015861645,"teacher_disagreement_score":0.005820241,"about_ca_system_score_codex":0.0017657846,"about_ca_system_score_gemma":0.0012775571,"threshold_uncertainty_score":0.019470632},"labels":[],"label_agreement":null},{"id":"W1960366695","doi":"10.1109/etfa.2015.7301505","title":"Static slack-based instrumentation of programs","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instrumentation (computer programming); Computer science; Benchmark (surveying); Suite; Code (set theory); Software; TRACE (psycholinguistics); Embedded system; Real-time computing; Operating system; Programming language","score_opus":0.05390055306524036,"score_gpt":0.27784212975050426,"score_spread":0.2239415766852639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1960366695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22095057,0.0007225385,0.7556677,0.00014670976,0.0000760568,0.00013048548,0.00021037961,0.018661883,0.0034337372],"genre_scores_gemma":[0.88017297,0.00023587982,0.11679963,0.00011786688,0.000036584875,0.00010209015,0.00031771534,0.00058756664,0.0016297265],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981704,0.00032283211,0.00011950179,0.00030031978,0.00077298045,0.00031402215],"domain_scores_gemma":[0.99446577,0.0019042875,0.0011648138,0.0016816661,0.0005803239,0.00020312806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009806897,0.00073850947,0.00043920608,0.0011803708,0.0004122794,0.000590606,0.0011496679,0.00039404375,0.001474103],"category_scores_gemma":[0.0051860237,0.00037051304,0.00041346133,0.00087610824,0.00088582386,0.0010462153,0.0011592419,0.00068476266,0.000414295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010391861,0.00050242513,0.017625289,0.000592555,0.00009007736,0.00054541056,0.0006520586,0.18395898,0.2607204,0.016420508,0.0040019094,0.5138513],"study_design_scores_gemma":[0.000063050335,0.0006728865,0.006613958,0.000100724654,0.000112380934,0.00054662523,0.00010391019,0.691579,0.28111956,0.007928107,0.01108911,0.00007087175],"about_ca_topic_score_codex":0.0015071192,"about_ca_topic_score_gemma":0.0022164658,"teacher_disagreement_score":0.0015071192,"about_ca_system_score_codex":0.0006292684,"about_ca_system_score_gemma":0.0018255248,"threshold_uncertainty_score":0.0051864386},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01094205829376414,"score_gpt":0.2411258155490805,"score_spread":0.23018375725531637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964142318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28787997,0.00096844224,0.7033766,0.00016546562,0.000061334256,0.0001483936,0.000110220615,0.0010342223,0.006255336],"genre_scores_gemma":[0.94764656,0.00016243773,0.050495084,0.00004579137,0.000030716612,0.00008992008,0.000086188615,0.000048966343,0.0013942597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99745387,0.0005036542,0.00019720769,0.00030461102,0.0008562146,0.00068435236],"domain_scores_gemma":[0.9963671,0.0014071093,0.0005733028,0.000800706,0.000537565,0.00031410088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002564258,0.00053867546,0.00064513896,0.0006767481,0.0011275047,0.0017528748,0.0023798484,0.0004886853,0.0017611998],"category_scores_gemma":[0.0052389936,0.00055955094,0.0005168671,0.0006851393,0.0015437595,0.0023883951,0.0016684334,0.0008365142,0.00032988217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010771437,0.00031809125,0.0060909227,0.0004875973,0.00020173143,0.0009080326,0.0014992601,0.61689484,0.053431217,0.19740376,0.0031954977,0.11849197],"study_design_scores_gemma":[0.00009594751,0.0003159034,0.002106773,0.00003246127,0.00007579686,0.00019758797,0.00024878822,0.8986109,0.012499567,0.081837915,0.003905971,0.00007245082],"about_ca_topic_score_codex":0.006021886,"about_ca_topic_score_gemma":0.0049792896,"teacher_disagreement_score":0.006021886,"about_ca_system_score_codex":0.001593353,"about_ca_system_score_gemma":0.001882401,"threshold_uncertainty_score":0.013561249},"labels":[],"label_agreement":null},{"id":"W1965894586","doi":"10.1145/2527269.2527270","title":"Real-time programming on accelerator many-core processors","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Concurrency; Correctness; Software; Programming paradigm; Software development; Programming language; Distributed computing; Multi-core processor; Concurrent computing; Parallel computing","score_opus":0.022669499112560585,"score_gpt":0.2568487514664956,"score_spread":0.23417925235393502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965894586","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12750246,0.00040484645,0.8506426,0.00057389983,0.00015157227,0.00008181765,0.00008146301,0.0012889646,0.019272387],"genre_scores_gemma":[0.6936237,0.00044514023,0.2870967,0.000120008786,0.00006307882,0.0000973953,0.00013172634,0.0001873339,0.018234946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997694,0.000064196036,0.00001506512,0.000030847365,0.00008678329,0.0000337412],"domain_scores_gemma":[0.9995664,0.00019665036,0.000044292283,0.00008378285,0.000074077565,0.00003470178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051085727,0.00020421794,0.00024564617,0.00014370549,0.00029842442,0.0007463145,0.0005638411,0.0002733094,0.0022000198],"category_scores_gemma":[0.0011336684,0.00014509476,0.00023656104,0.00018282956,0.00044201914,0.0006624584,0.00038190253,0.00064080994,0.0003827076],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033712634,0.00015760928,0.0024523905,0.00027112695,0.000029768196,0.00040240682,0.00042463414,0.41709378,0.0437506,0.44959363,0.0055110734,0.07997581],"study_design_scores_gemma":[0.000038927166,0.00008127088,0.00046088075,0.000016043681,0.0000091352085,0.00007618626,0.000045366516,0.9271113,0.0057601198,0.052324343,0.014067148,0.000009266545],"about_ca_topic_score_codex":0.0016377984,"about_ca_topic_score_gemma":0.003977261,"teacher_disagreement_score":0.0022000198,"about_ca_system_score_codex":0.00041583614,"about_ca_system_score_gemma":0.0008148976,"threshold_uncertainty_score":0.007359743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01807556073586558,"score_gpt":0.24904648343422384,"score_spread":0.23097092269835826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966746281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009429969,0.00018840592,0.98407525,0.00010750681,0.0000815672,0.00011651238,0.000055750024,0.003322258,0.0026227126],"genre_scores_gemma":[0.30324927,0.00014216204,0.6940979,0.00014678153,0.00008579567,0.00019107823,0.00016518222,0.0005022157,0.0014197049],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985096,0.00035194992,0.000097183205,0.00020052641,0.00067194813,0.00016887274],"domain_scores_gemma":[0.9971322,0.0012030529,0.00027385342,0.00046507304,0.00073149486,0.00019427875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021886453,0.00086002506,0.00053180155,0.0010430466,0.0005601133,0.001290257,0.0016515251,0.0006830553,0.0020112789],"category_scores_gemma":[0.007040186,0.00041490304,0.00045433344,0.00065378036,0.0005561549,0.0014175605,0.0010556314,0.0014807238,0.0006380301],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070635765,0.00026397803,0.003181025,0.00031921765,0.000086981425,0.00026279822,0.00024668686,0.39979842,0.054924097,0.089740105,0.008562878,0.4419075],"study_design_scores_gemma":[0.00003117349,0.00009831985,0.00020282104,0.000024818808,0.000016528207,0.000075395146,0.0000120146005,0.96352094,0.013593305,0.0154114235,0.006993524,0.000019789204],"about_ca_topic_score_codex":0.003001876,"about_ca_topic_score_gemma":0.0023130807,"teacher_disagreement_score":0.003001876,"about_ca_system_score_codex":0.0010494796,"about_ca_system_score_gemma":0.002721728,"threshold_uncertainty_score":0.011574745},"labels":[],"label_agreement":null},{"id":"W1968264568","doi":"10.1007/s11227-012-0771-0","title":"Energy-efficient tasks scheduling algorithm for real-time multiprocessor embedded systems","year":2012,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Scheduling (production processes); Distributed computing; Embedded system; Mathematical optimization","score_opus":0.01879960574576279,"score_gpt":0.25800864333167434,"score_spread":0.23920903758591155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968264568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10048182,0.00055908365,0.89350754,0.0002591045,0.00014384868,0.00008786445,0.0000790145,0.000662696,0.004219028],"genre_scores_gemma":[0.6241982,0.00027173932,0.37068036,0.00008989104,0.000042361455,0.00013280487,0.00018511034,0.00011328667,0.004286362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99980754,0.000039345785,0.000013197803,0.000032744407,0.00006115396,0.00004600296],"domain_scores_gemma":[0.999765,0.00007221447,0.000025008352,0.000027732774,0.000086695465,0.000023448898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043127598,0.0004919825,0.00055402634,0.0005382359,0.00061699894,0.0004910661,0.0010174792,0.0003962668,0.0020673336],"category_scores_gemma":[0.0008284671,0.00024285953,0.00036409113,0.0005707485,0.00020656818,0.00054460607,0.00046036314,0.0004425603,0.00031473968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045662976,0.00017252668,0.00070437253,0.00012234558,0.000048263508,0.000081990074,0.00007522828,0.81366163,0.015968515,0.008048384,0.0029491358,0.15771104],"study_design_scores_gemma":[0.00003516998,0.000034100205,0.00011796022,0.0000026818382,0.0000074581594,0.000015671149,0.00000987697,0.9959001,0.0015616397,0.0017122297,0.0005993143,0.00000367476],"about_ca_topic_score_codex":0.003229657,"about_ca_topic_score_gemma":0.0052144807,"teacher_disagreement_score":0.003229657,"about_ca_system_score_codex":0.00048647998,"about_ca_system_score_gemma":0.0013804317,"threshold_uncertainty_score":0.006915927},"labels":[],"label_agreement":null},{"id":"W1972633898","doi":"10.4271/2015-01-0186","title":"Improved ECU End of Line Testing using Multicore Microcontroller","year":2015,"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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Multi-core processor; Microcontroller; Computer science; Embedded system; Line (geometry); Operating system","score_opus":0.038207070737189826,"score_gpt":0.2752265990562875,"score_spread":0.23701952831909767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972633898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29125705,0.0014414743,0.6577926,0.00056730653,0.00046100278,0.0006766661,0.0007105623,0.022600263,0.024492987],"genre_scores_gemma":[0.8097308,0.000287783,0.17235884,0.0002404421,0.000056594767,0.00021509497,0.00078440935,0.0005172976,0.015808715],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987612,0.00016008677,0.000083843675,0.00020192657,0.00064582186,0.00014723191],"domain_scores_gemma":[0.9988136,0.00020073597,0.00014473326,0.00021933854,0.0005358772,0.00008562113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004800093,0.00062957377,0.00047447556,0.00080738746,0.00021124631,0.0006396884,0.0017781579,0.0005016881,0.006409913],"category_scores_gemma":[0.0012579305,0.00019852235,0.00033185518,0.00036007032,0.00019750622,0.0011659241,0.0005304317,0.0004338548,0.0011318086],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091286673,0.00038978018,0.007873423,0.0006970319,0.00007244292,0.0016831278,0.0003155528,0.015158619,0.5898624,0.0037940925,0.009533928,0.3697067],"study_design_scores_gemma":[0.00012355151,0.0028783805,0.015377702,0.00010989706,0.000101876794,0.0025184215,0.0001735619,0.1595105,0.7715924,0.0011019789,0.046396233,0.00011548139],"about_ca_topic_score_codex":0.0012538095,"about_ca_topic_score_gemma":0.0017520582,"teacher_disagreement_score":0.006409913,"about_ca_system_score_codex":0.0005292993,"about_ca_system_score_gemma":0.0005998185,"threshold_uncertainty_score":0.021443307},"labels":[],"label_agreement":null},{"id":"W1972806349","doi":"10.1016/s0140-3664(00)00160-2","title":"A real-time residential gateway operating system","year":2000,"lang":"en","type":"article","venue":"Computer Communications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Gateway (web page); Real-time computing; Telecommunications; Computer network; Operating system; Embedded system; World Wide Web","score_opus":0.019829572885594407,"score_gpt":0.26044668360783085,"score_spread":0.24061711072223646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972806349","genre_codex":"empirical","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41787142,0.00078527385,0.2754335,0.00085755496,0.00087244785,0.0007749277,0.0014966354,0.24548087,0.056427352],"genre_scores_gemma":[0.86487836,0.00027685156,0.10230222,0.00038447115,0.00019952244,0.00017082081,0.0026223091,0.0034935693,0.025671823],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994337,0.00014002847,0.00003834332,0.00009890293,0.00019613058,0.00009293064],"domain_scores_gemma":[0.9984034,0.00022470843,0.0000737285,0.0005863572,0.00035853928,0.00035343645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010246724,0.0004876365,0.0005828536,0.0006473005,0.0005607546,0.0010255025,0.0021261626,0.0003780462,0.014626017],"category_scores_gemma":[0.0020643922,0.00028758662,0.00022861958,0.00063685887,0.00041549554,0.0008879141,0.0008225913,0.0008989893,0.0040472145],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0083076805,0.0027328448,0.012878771,0.00040576805,0.00020035435,0.0010629349,0.0012077631,0.044966355,0.13663372,0.02759353,0.2027923,0.56121796],"study_design_scores_gemma":[0.001548271,0.0019655686,0.0099972235,0.00004831359,0.00023358638,0.0009088662,0.000366539,0.73791724,0.08912273,0.009567839,0.14815024,0.00017364693],"about_ca_topic_score_codex":0.0023423522,"about_ca_topic_score_gemma":0.001935742,"teacher_disagreement_score":0.014626017,"about_ca_system_score_codex":0.00064018974,"about_ca_system_score_gemma":0.001113655,"threshold_uncertainty_score":0.048928916},"labels":[],"label_agreement":null},{"id":"W1973686476","doi":"10.2316/journal.201.2007.4.201-1760","title":"MULTIPROCESSOR SCHEDULING IN SUPERVISORY CONTROL OF DISCRETE-EVENT SYSTEMS FRAMEWORK","year":2007,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiprocessing; Supervisory control; Computer science; Scheduling (production processes); Parallel computing; Distributed computing; Control (management); Embedded system; Engineering; Operations management; Artificial intelligence","score_opus":0.019559316781652212,"score_gpt":0.2640471038696487,"score_spread":0.24448778708799648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973686476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004072314,0.00048730217,0.9930548,0.00010497674,0.00006192782,0.000043770036,0.000017192702,0.00018885164,0.001968941],"genre_scores_gemma":[0.45750615,0.0011311256,0.5375645,0.00015030972,0.00026459797,0.00039225578,0.00008113181,0.00005635916,0.0028535882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918455,0.0002908498,0.000053529788,0.0001316754,0.00026546477,0.00007398066],"domain_scores_gemma":[0.99926144,0.00038726928,0.00008270243,0.000106841326,0.00010349157,0.000058213616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013839114,0.0005259986,0.00053067895,0.0004760546,0.00035151065,0.0011671464,0.0010966073,0.0005230403,0.001574173],"category_scores_gemma":[0.0016446311,0.00023680454,0.0006679218,0.0003886796,0.0017309347,0.0012292454,0.0007932051,0.0011832797,0.00022914857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062845,0.00007945625,0.0002608945,0.00020710853,0.0000394015,0.00031256996,0.00026346432,0.23206538,0.0082055945,0.72359693,0.00085668184,0.03404953],"study_design_scores_gemma":[0.000063959946,0.000112374444,0.00012053235,0.00003796041,0.00002677704,0.00007754291,0.000040986,0.81879085,0.0034977975,0.16832177,0.008891115,0.000018324097],"about_ca_topic_score_codex":0.001132055,"about_ca_topic_score_gemma":0.0011552612,"teacher_disagreement_score":0.001574173,"about_ca_system_score_codex":0.0006265461,"about_ca_system_score_gemma":0.001234247,"threshold_uncertainty_score":0.007318914},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023422941526555253,"score_gpt":0.307505476957824,"score_spread":0.2840825354312687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978574312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837619,0.0006366347,0.18582,0.0003343886,0.00038113823,0.00042521558,0.00034734057,0.015817434,0.012475941],"genre_scores_gemma":[0.9002195,0.00016561277,0.09560745,0.00009366587,0.000021446986,0.0000911752,0.0003683409,0.0006631411,0.002769682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872154,0.00032497273,0.00009849381,0.0001968465,0.00036452568,0.0002935993],"domain_scores_gemma":[0.99601537,0.0012047171,0.00020158588,0.00097577897,0.0012205418,0.00038190524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019314361,0.00101222,0.00059493195,0.00053878536,0.0004810124,0.0011580548,0.0023145778,0.0005274028,0.0046078567],"category_scores_gemma":[0.0052916245,0.0005464179,0.00038065034,0.0005199215,0.0008444215,0.0012907616,0.00076332793,0.00092804345,0.00066807744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012796399,0.003360653,0.021182064,0.0012318899,0.00044148567,0.0009087051,0.001627238,0.3693329,0.17430562,0.011519356,0.01144869,0.391845],"study_design_scores_gemma":[0.0013494408,0.0036725146,0.0056071007,0.00004519933,0.00025744803,0.0002050361,0.00051712524,0.8380983,0.13808142,0.0020257272,0.010063136,0.000077564786],"about_ca_topic_score_codex":0.0062170667,"about_ca_topic_score_gemma":0.0056480137,"teacher_disagreement_score":0.0062170667,"about_ca_system_score_codex":0.0008711275,"about_ca_system_score_gemma":0.0020976719,"threshold_uncertainty_score":0.015414834},"labels":[],"label_agreement":null},{"id":"W1979861261","doi":"10.1109/ispdc.2006.21","title":"Distributed, Real-Time Programming on Commodity POSIX Systems: A Preliminary Report","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bishop's University","funders":"","keywords":"POSIX; Computer science; Programming language; Programmer; Semantics (computer science); First-generation programming language; Operating system; Programming paradigm; Code (set theory)","score_opus":0.0112274397355305,"score_gpt":0.23800272273905212,"score_spread":0.22677528300352162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979861261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090136476,0.0017425569,0.8775722,0.0012316037,0.0004003285,0.00045439022,0.0003846597,0.00616944,0.021908337],"genre_scores_gemma":[0.33028632,0.0053123813,0.5774681,0.00028536498,0.000377139,0.00062214345,0.0019070545,0.0020547789,0.08168665],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985946,0.0003465487,0.000110655405,0.00018634257,0.00058635266,0.0001753574],"domain_scores_gemma":[0.9980166,0.00050502375,0.00011420532,0.0004433643,0.00063867716,0.000282189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003015887,0.0006489482,0.00045265316,0.0005002238,0.00067270536,0.001965405,0.0014142401,0.00045884468,0.009956958],"category_scores_gemma":[0.004067332,0.0005637358,0.00070596545,0.00062250753,0.0007460329,0.0033868076,0.00109695,0.001571054,0.0023782097],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021554108,0.0020850312,0.01047104,0.0016053942,0.00014721413,0.0021468415,0.005217462,0.061347988,0.09650047,0.13200857,0.045335285,0.64097935],"study_design_scores_gemma":[0.0005925512,0.005460012,0.007915159,0.00038078058,0.00031702523,0.0027173432,0.002103537,0.20358615,0.22964235,0.0341428,0.5128576,0.00028464288],"about_ca_topic_score_codex":0.0029521359,"about_ca_topic_score_gemma":0.0019047083,"teacher_disagreement_score":0.009956958,"about_ca_system_score_codex":0.000726696,"about_ca_system_score_gemma":0.0018115307,"threshold_uncertainty_score":0.03330934},"labels":[],"label_agreement":null},{"id":"W1981053051","doi":"10.1109/rtcsa.2013.6732226","title":"INSTEP: A static instrumentation framework for preserving extra-functional properties","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Instrumentation (computer programming); Correctness; Computer science; Tracing; Debugging; Software; Scalability; Leverage (statistics); Functional requirement; Embedded system; Programming language; Software engineering; Operating system; Artificial intelligence","score_opus":0.051599431987017635,"score_gpt":0.25491588949073263,"score_spread":0.203316457503715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981053051","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024497581,0.00010653327,0.9789386,0.00009117029,0.000022274522,0.00011635762,0.00023446005,0.016631663,0.0014092727],"genre_scores_gemma":[0.11905754,0.00032267265,0.8688943,0.00022780022,0.000069128815,0.00050071214,0.0012386146,0.0066266716,0.003062493],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99461514,0.0011683512,0.00043713735,0.00074763095,0.0023926417,0.0006390026],"domain_scores_gemma":[0.99170494,0.003898253,0.00075964845,0.0023379414,0.0010799831,0.0002192876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005120616,0.0018600948,0.0011800735,0.0021943895,0.0011292831,0.002184697,0.004066706,0.0016571545,0.005797715],"category_scores_gemma":[0.014443372,0.0018646005,0.0031236382,0.001255182,0.0031870764,0.0047120852,0.004739229,0.0037309597,0.0016485174],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057447463,0.0004873606,0.007451037,0.0020163206,0.00030269276,0.0012501776,0.0014243802,0.17564109,0.036507823,0.34406877,0.022139873,0.40813604],"study_design_scores_gemma":[0.00017874528,0.00039275782,0.0018110451,0.00041124882,0.00025821768,0.0011735918,0.00023035715,0.659074,0.07476647,0.15581177,0.105657026,0.00023472062],"about_ca_topic_score_codex":0.00455556,"about_ca_topic_score_gemma":0.0064374283,"teacher_disagreement_score":0.005797715,"about_ca_system_score_codex":0.0017071302,"about_ca_system_score_gemma":0.004681309,"threshold_uncertainty_score":0.027080774},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03067242606097093,"score_gpt":0.2704592703814393,"score_spread":0.23978684432046837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981191435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2508092,0.0023915519,0.7336325,0.00032706631,0.00008151653,0.00013993829,0.0004856254,0.0019897446,0.010142831],"genre_scores_gemma":[0.95723474,0.00056714437,0.039101996,0.000089567984,0.000071814946,0.0001013673,0.00021320094,0.0002756921,0.002344572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970234,0.00061735755,0.00017601199,0.00040733843,0.0010470968,0.0007287553],"domain_scores_gemma":[0.99416083,0.0038658718,0.00067924394,0.0006338025,0.0004851586,0.00017502459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022333646,0.0016794341,0.0009581037,0.0012466884,0.00066790276,0.0016479188,0.0015166424,0.0006948956,0.0026531606],"category_scores_gemma":[0.007128482,0.00057270675,0.000763097,0.0010622102,0.0007252075,0.0025089898,0.00078212516,0.0011892471,0.00041326016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022139016,0.000056129084,0.0011657017,0.000103859114,0.000046969802,0.00017934621,0.000068836016,0.96469593,0.01135966,0.011413913,0.0005909833,0.010097249],"study_design_scores_gemma":[0.0000040143946,0.000033559296,0.00016439038,0.0000036760946,0.000009569426,0.000034163702,0.000013777187,0.9949098,0.0026250065,0.0019908461,0.00020446329,0.0000065884897],"about_ca_topic_score_codex":0.0036456282,"about_ca_topic_score_gemma":0.003039963,"teacher_disagreement_score":0.0036456282,"about_ca_system_score_codex":0.0019317513,"about_ca_system_score_gemma":0.0013513248,"threshold_uncertainty_score":0.014015913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Computer science; Running time; Artificial intelligence; Machine learning; Algorithm","score_opus":0.017389914438871987,"score_gpt":0.23145081851960556,"score_spread":0.21406090408073358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983910579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29339358,0.0030128574,0.6770877,0.0016481687,0.0011923688,0.000249573,0.00468981,0.0076373448,0.011088473],"genre_scores_gemma":[0.96027887,0.0006071805,0.03142623,0.00008932549,0.0003041555,0.00009589855,0.0018768354,0.00013226783,0.0051892227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996037,0.00007404551,0.00001842237,0.00012852188,0.00009616559,0.000079136706],"domain_scores_gemma":[0.9960277,0.0025007196,0.00038938713,0.00038419364,0.00043209878,0.00026592822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000897551,0.0013526756,0.0016059919,0.0007454221,0.0003236592,0.0006847375,0.0010611482,0.0008984871,0.008013669],"category_scores_gemma":[0.00483389,0.00032919223,0.00029188162,0.00079590967,0.00031347864,0.0008742927,0.0005118657,0.0011121989,0.0027516913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004003402,0.00085702975,0.007944643,0.00033461303,0.00011274052,0.00019970161,0.000039573115,0.5830991,0.010966558,0.0019945009,0.020558003,0.3698901],"study_design_scores_gemma":[0.00004820997,0.00010931819,0.0013681609,0.000011164405,0.000023452725,0.000024059314,0.0000047083377,0.9941849,0.0019678187,0.0017078167,0.00054189947,0.000008521609],"about_ca_topic_score_codex":0.006916214,"about_ca_topic_score_gemma":0.00756264,"teacher_disagreement_score":0.008013669,"about_ca_system_score_codex":0.00042504646,"about_ca_system_score_gemma":0.00081407686,"threshold_uncertainty_score":0.026808381},"labels":[],"label_agreement":null},{"id":"W1986783865","doi":"10.1145/1806546.1806552","title":"Named memory pool for Ada","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Simple (philosophy); Memory management; Programming language; Distributed computing; Operating system; Semiconductor memory","score_opus":0.01178120214542567,"score_gpt":0.23821282196695429,"score_spread":0.22643161982152862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986783865","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004456075,0.0034490803,0.92577946,0.002155631,0.0025894118,0.0001484605,0.00026229222,0.008294123,0.052865524],"genre_scores_gemma":[0.1528805,0.0035335205,0.7759943,0.0034310657,0.0021062219,0.00089163834,0.00084447244,0.0029991886,0.05731906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872464,0.00037334577,0.00012212052,0.00021002282,0.00038011256,0.00018961138],"domain_scores_gemma":[0.9987191,0.00024257312,0.0000948336,0.00054932316,0.00025882496,0.0001353317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014106197,0.00070058357,0.0007337147,0.00070300436,0.0018574958,0.0032801682,0.0027477946,0.00149453,0.011276723],"category_scores_gemma":[0.0021974277,0.00067753415,0.0010247373,0.00075754017,0.0015862165,0.0071263397,0.0034477157,0.0031882809,0.005609326],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018606623,0.00003523192,0.00020415022,0.00024709836,0.00002102037,0.00014699552,0.00033391314,0.0022993595,0.0038663875,0.86453295,0.037830863,0.09029596],"study_design_scores_gemma":[0.00006425298,0.00011651611,0.000091110676,0.00010873677,0.00005025749,0.0004557133,0.000065608416,0.017464317,0.005857136,0.18171091,0.79396045,0.00005498238],"about_ca_topic_score_codex":0.0010417055,"about_ca_topic_score_gemma":0.0014438845,"teacher_disagreement_score":0.011276723,"about_ca_system_score_codex":0.0010021834,"about_ca_system_score_gemma":0.0014783688,"threshold_uncertainty_score":0.037724376},"labels":[],"label_agreement":null},{"id":"W1990373073","doi":"10.1109/etfa.2011.6059022","title":"Resolving state inconsistency in distributed fault-tolerant real-time dynamic TDMA architectures","year":2011,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Time division multiple access; Computer science; Schedule; Synchronizing; Distributed computing; State (computer science); Real-time computing; Computer network; Fault tolerance; Real-time communication; Transient (computer programming); Algorithm; Telecommunications","score_opus":0.013542320365732,"score_gpt":0.2283335933924079,"score_spread":0.21479127302667592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990373073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26354465,0.0003235908,0.7332847,0.00024954285,0.00006452664,0.00007107156,0.000025933123,0.0010986484,0.0013372233],"genre_scores_gemma":[0.9230441,0.00007979188,0.07610695,0.00004495289,0.000015423258,0.000045838453,0.00004574369,0.000055312405,0.0005619789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985293,0.000452575,0.00012537208,0.00023379804,0.0005085141,0.00015043974],"domain_scores_gemma":[0.99677175,0.0012488285,0.00045721803,0.0007358868,0.0006453274,0.00014091226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023461273,0.0003982347,0.0005549603,0.00045624046,0.0007184398,0.00080004695,0.0014116007,0.00051331,0.00061010366],"category_scores_gemma":[0.007048984,0.00031479943,0.00024286185,0.00047988395,0.00075768563,0.0011541767,0.00083360163,0.0007937007,0.000100815276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070199923,0.00026054741,0.004376035,0.00017112335,0.00008686877,0.00041676432,0.0010762803,0.72682995,0.05206413,0.030483909,0.0012398156,0.18229258],"study_design_scores_gemma":[0.000084199615,0.00020134509,0.0005668583,0.000008750653,0.000033822616,0.0001167562,0.00013163632,0.96174407,0.018728567,0.016385423,0.0019773226,0.00002112284],"about_ca_topic_score_codex":0.0025451826,"about_ca_topic_score_gemma":0.0018491325,"teacher_disagreement_score":0.0025451826,"about_ca_system_score_codex":0.0007414317,"about_ca_system_score_gemma":0.0011065919,"threshold_uncertainty_score":0.0124076605},"labels":[],"label_agreement":null},{"id":"W1992760270","doi":"10.1109/etfa.2013.6647940","title":"Practical issues with the timing analysis of the Controller Area Network","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Polling; Computer science; Preemption; Queueing theory; Controller (irrigation); Heuristic; Queue; Distributed computing; Upper and lower bounds; Ideal (ethics); CAN bus; Software; Real-time computing; Computer network","score_opus":0.02803514702259303,"score_gpt":0.2743473052231298,"score_spread":0.24631215820053676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992760270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019095913,0.0013637994,0.9655467,0.002214746,0.0002685296,0.000053699056,0.00006303842,0.00064035,0.010753186],"genre_scores_gemma":[0.6279062,0.0019435732,0.36252955,0.00059325964,0.0006908878,0.0001508403,0.00015569976,0.00048447188,0.0055455077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935899,0.0030563488,0.0002481293,0.000646852,0.0020884639,0.0003704114],"domain_scores_gemma":[0.9575509,0.031825393,0.0020220617,0.004230292,0.0040872367,0.000284212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008538544,0.0008236513,0.000621996,0.0014306484,0.0011511995,0.0027698881,0.00210832,0.0010653295,0.005542842],"category_scores_gemma":[0.04160793,0.00069452915,0.0007560635,0.0014521352,0.0020508713,0.0033844844,0.0009191521,0.0023903023,0.0007437025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017376935,0.000092801856,0.0027152018,0.0003638836,0.000052777556,0.00025898544,0.00033611985,0.59348696,0.007864254,0.29856145,0.003721583,0.09237221],"study_design_scores_gemma":[0.000030574447,0.000089269655,0.0007754913,0.00007606116,0.000023959763,0.00025921498,0.00018866782,0.80602986,0.0048510334,0.17682302,0.010817082,0.000035811587],"about_ca_topic_score_codex":0.0045517343,"about_ca_topic_score_gemma":0.003875853,"teacher_disagreement_score":0.008538544,"about_ca_system_score_codex":0.0024106118,"about_ca_system_score_gemma":0.0032225854,"threshold_uncertainty_score":0.045156658},"labels":[],"label_agreement":null},{"id":"W1993465263","doi":"10.1016/j.eswa.2013.09.018","title":"Pre-run-time scheduling in real-time systems: Current researches and Artificial Intelligence perspectives","year":2013,"lang":"en","type":"article","venue":"Expert Systems with Applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scheduling (production processes); Artificial intelligence; Machine learning; Mathematical optimization; Mathematics","score_opus":0.03399876742595253,"score_gpt":0.3106230237101262,"score_spread":0.27662425628417364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993465263","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041949064,0.3568023,0.5606531,0.007380005,0.0016953254,0.000058125923,0.00008283488,0.00063389324,0.030745342],"genre_scores_gemma":[0.6655679,0.21759811,0.10541996,0.0007240939,0.004511149,0.00006307403,0.00020270958,0.000109917375,0.005803071],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993519,0.00015255858,0.0000471137,0.00017372896,0.00019906445,0.000075690055],"domain_scores_gemma":[0.9971765,0.0018507494,0.00028037053,0.00021116625,0.0003744534,0.00010665034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017863145,0.0006380861,0.0009259974,0.00076959614,0.0004194705,0.0024813265,0.0014691799,0.0010803975,0.0020217386],"category_scores_gemma":[0.0032674912,0.00030273115,0.00040716556,0.0020944662,0.0014915095,0.0028500056,0.00042712383,0.0013419841,0.0005832231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048852223,0.0004539917,0.0026443817,0.0028620027,0.000120540426,0.00022322824,0.0003039012,0.13899651,0.008106475,0.25471377,0.0060178754,0.5850687],"study_design_scores_gemma":[0.000080435675,0.00054906326,0.003142133,0.0005213895,0.0001605257,0.0004763668,0.0006058222,0.5587352,0.0090394495,0.36179376,0.06479448,0.00010140994],"about_ca_topic_score_codex":0.0014811243,"about_ca_topic_score_gemma":0.0009041335,"teacher_disagreement_score":0.0024813265,"about_ca_system_score_codex":0.0010871295,"about_ca_system_score_gemma":0.0017739041,"threshold_uncertainty_score":0.009447098},"labels":[],"label_agreement":null},{"id":"W1996060760","doi":"10.1007/11557432_16","title":"A Modelling and Simulation Based Approach to Dependable System Design","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Dependability; DEVS; Computer science; Formalism (music); Fault tolerance; Reliability engineering; Modularity (biology); Distributed computing; Software fault tolerance; Modeling and simulation; Software engineering; Simulation; Engineering","score_opus":0.03826800514568109,"score_gpt":0.24333912242165512,"score_spread":0.20507111727597402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996060760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082721683,0.00018967026,0.9949824,0.00010893561,0.000040151524,0.000042710883,0.000024960316,0.00035589503,0.0034281365],"genre_scores_gemma":[0.13123421,0.0015339482,0.85269076,0.0002203034,0.000105802756,0.0005346015,0.00024965833,0.00039437923,0.013036403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908173,0.00024846807,0.00006315892,0.000083724815,0.0004775715,0.000045365377],"domain_scores_gemma":[0.99900585,0.00054663006,0.000061063554,0.00019618914,0.00015589588,0.000034307755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010239835,0.0014702849,0.0012299101,0.000810168,0.0005594179,0.0017052322,0.0028243635,0.0014880805,0.005938659],"category_scores_gemma":[0.002263007,0.0013408784,0.0019084903,0.0008195114,0.0013577194,0.0017390555,0.001363095,0.0025257599,0.0012995605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044063814,0.000079079444,0.00012945839,0.00023618534,0.00008691691,0.00012938853,0.00014473592,0.7561952,0.005634819,0.18112597,0.0019572661,0.054236937],"study_design_scores_gemma":[0.000015600057,0.000036041438,0.000045849716,0.00003101415,0.000036686106,0.000056711844,0.0000108961,0.90406376,0.0024017396,0.08107729,0.01221164,0.000012747948],"about_ca_topic_score_codex":0.0031560264,"about_ca_topic_score_gemma":0.0035687315,"teacher_disagreement_score":0.005938659,"about_ca_system_score_codex":0.001136569,"about_ca_system_score_gemma":0.0011117058,"threshold_uncertainty_score":0.019866765},"labels":[],"label_agreement":null},{"id":"W1996090276","doi":"10.1142/s0218194005002051","title":"A NEW APPROACH IN DESIGNING INTERPROCESS COMMUNICATION FOR REAL-TIME SYSTEMS","year":2005,"lang":"en","type":"article","venue":"International Journal of Software Engineering and Knowledge Engineering","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University; Dalhousie University","funders":"","keywords":"Inter-process communication; Computer science; Process (computing); Distributed computing; Message passing; Software; Event (particle physics); Set (abstract data type); Embedded system; Operating system; Real-time computing","score_opus":0.01019748547541436,"score_gpt":0.244190021954812,"score_spread":0.23399253647939763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996090276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015096434,0.00034846066,0.99383014,0.00031777425,0.000108858854,0.00005903947,0.000009964478,0.0006402027,0.003175867],"genre_scores_gemma":[0.048036963,0.0013060578,0.94025856,0.00064044853,0.0002739385,0.0004385257,0.00007327266,0.00044823735,0.0085239755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793965,0.00046615978,0.00017051391,0.0003580619,0.0009414064,0.00012425147],"domain_scores_gemma":[0.99774915,0.0005573274,0.00020001973,0.0005965714,0.000751601,0.00014528351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024169094,0.0011524053,0.0007519338,0.0012589397,0.0014465539,0.002877493,0.0025109977,0.0013090875,0.0031677252],"category_scores_gemma":[0.004389616,0.0008869117,0.0014038286,0.0012741279,0.0020053086,0.0055428525,0.0016561358,0.0036244704,0.0020829698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018724157,0.0002624277,0.0010300624,0.0010892627,0.00017021554,0.0004969041,0.0019390762,0.06794599,0.038079783,0.48643005,0.009122399,0.39324656],"study_design_scores_gemma":[0.00016097873,0.000899533,0.00060118525,0.0004449354,0.00033965605,0.0015476523,0.0003187379,0.36728156,0.055233996,0.21037066,0.36257443,0.00022669468],"about_ca_topic_score_codex":0.0014334113,"about_ca_topic_score_gemma":0.0017174148,"teacher_disagreement_score":0.0031677252,"about_ca_system_score_codex":0.0012786996,"about_ca_system_score_gemma":0.0026577143,"threshold_uncertainty_score":0.012781978},"labels":[],"label_agreement":null},{"id":"W2000411644","doi":"10.1109/rtas.2013.6531097","title":"ORTAP: An Offset-based response time analysis for a pipelined communication resource model","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multiprocessing; Correctness; Response time; Offset (computer science); Parallel computing; Distributed computing; Resource (disambiguation); Processor scheduling; Models of communication; Computer network; Algorithm","score_opus":0.02143411602301251,"score_gpt":0.262815827448325,"score_spread":0.24138171142531248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000411644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009195775,0.0004112483,0.9863529,0.00016685444,0.00006300869,0.00006140855,0.00013492905,0.0006275337,0.002986221],"genre_scores_gemma":[0.55620587,0.001223078,0.43162498,0.00040654384,0.00029151436,0.00042850676,0.0006303133,0.0010029024,0.008186302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985073,0.00032176185,0.0000633913,0.00020664524,0.00061510643,0.00028558928],"domain_scores_gemma":[0.9970682,0.0017902259,0.00027393774,0.00032043643,0.00045920012,0.000087973414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022234684,0.0012651369,0.000821571,0.001499732,0.0005793778,0.0011515592,0.0020867784,0.0007381471,0.0055950456],"category_scores_gemma":[0.006915313,0.00054455415,0.0013545718,0.0012417797,0.00062893354,0.0023906685,0.0011663685,0.0019930368,0.000971889],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002350622,0.00009582272,0.0007496088,0.0002499579,0.0000538394,0.00013477853,0.00007011302,0.885006,0.009749442,0.0476788,0.003115041,0.052861553],"study_design_scores_gemma":[0.000005389729,0.000024942803,0.000051923136,0.000009169244,0.000010134658,0.000020621083,0.000006990097,0.9923348,0.0009018608,0.0057153758,0.0009126174,0.000006055815],"about_ca_topic_score_codex":0.0055337213,"about_ca_topic_score_gemma":0.0034171217,"teacher_disagreement_score":0.0055950456,"about_ca_system_score_codex":0.0018335283,"about_ca_system_score_gemma":0.0030373514,"threshold_uncertainty_score":0.018717349},"labels":[],"label_agreement":null},{"id":"W2001010400","doi":"10.1145/1806546.1806564","title":"Conclusions of the 14th international real-time Ada workshop","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Software; Library science; World Wide Web; Operating system","score_opus":0.008741895914681243,"score_gpt":0.23653758495853236,"score_spread":0.2277956890438511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001010400","genre_codex":"review","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033994368,0.5521316,0.010224547,0.04987862,0.23412974,0.00067854906,0.0016419126,0.0008340607,0.14708167],"genre_scores_gemma":[0.017002134,0.47880778,0.008462439,0.02213673,0.053251594,0.00048431245,0.005778653,0.00083049,0.4132458],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99722016,0.0003323179,0.0002772799,0.00027983438,0.001582926,0.00030752883],"domain_scores_gemma":[0.98895395,0.0007022905,0.00039069066,0.00031771167,0.008558726,0.001076565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004706143,0.0012150997,0.00086686225,0.0029816097,0.00065794174,0.0031882506,0.0019104914,0.0022321832,0.060964912],"category_scores_gemma":[0.0069017396,0.00042966162,0.0013233608,0.0024216233,0.00047561442,0.002773494,0.0015151283,0.0023672925,0.04093434],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021653494,0.00010832713,0.00035341876,0.0015802969,0.000040836618,0.00012113115,0.00007168807,0.00033448776,0.0012043709,0.001030428,0.6991139,0.29582462],"study_design_scores_gemma":[0.0000144395135,0.000051738494,0.00042774156,0.0008102978,0.00003624524,0.000082311024,0.000053690197,0.00006476144,0.0004960746,0.0003727732,0.9975788,0.0000111138015],"about_ca_topic_score_codex":0.004723141,"about_ca_topic_score_gemma":0.009081038,"teacher_disagreement_score":0.060964912,"about_ca_system_score_codex":0.0023593924,"about_ca_system_score_gemma":0.0044691334,"threshold_uncertainty_score":0.20394796},"labels":[],"label_agreement":null},{"id":"W2002399871","doi":"10.1145/2501626.2501629","title":"A comparison of compositional schedulability analysis techniques for hierarchical real-time systems","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Automaton; Task (project management); Distributed computing; Theoretical computer science; Factor (programming language); Programming language","score_opus":0.02435992128159157,"score_gpt":0.3193271748579634,"score_spread":0.2949672535763718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002399871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030463861,0.0014788862,0.95933163,0.00020976538,0.00009065529,0.00019317545,0.00008511332,0.0016929397,0.006453962],"genre_scores_gemma":[0.40433714,0.0013009248,0.5912052,0.000117761556,0.000094159666,0.0002557756,0.00037562047,0.00041901195,0.0018944931],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958483,0.0011468456,0.00029653087,0.00034535793,0.0019508109,0.000412104],"domain_scores_gemma":[0.99102247,0.004542587,0.0007351148,0.0013487963,0.0021068454,0.00024418012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054107094,0.0013134687,0.0007871313,0.0025759658,0.00091209,0.0012518807,0.0016716111,0.00073388685,0.0032211365],"category_scores_gemma":[0.013150139,0.0006609777,0.0020794144,0.0012243149,0.0009220817,0.0025274626,0.001405138,0.0013218826,0.0007705263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014132742,0.00041689182,0.0032021247,0.0017345672,0.000336338,0.0002800596,0.0012731961,0.33861005,0.03226341,0.09160486,0.003742003,0.5251232],"study_design_scores_gemma":[0.0001427399,0.00047476895,0.0020395757,0.00024979727,0.00025501457,0.0002715286,0.0005005861,0.92585844,0.02062655,0.036678325,0.012808552,0.00009416499],"about_ca_topic_score_codex":0.0042554396,"about_ca_topic_score_gemma":0.006060968,"teacher_disagreement_score":0.0054107094,"about_ca_system_score_codex":0.0015337681,"about_ca_system_score_gemma":0.004492364,"threshold_uncertainty_score":0.028614938},"labels":[],"label_agreement":null},{"id":"W2002737237","doi":"10.1109/rtcsa.2012.16","title":"Time-Triggered Program Self-Monitoring","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Correctness; Overhead (engineering); Concurrency; Synchronization (alternating current); Timer; Distributed computing; Process (computing); State (computer science); Real-time computing; Instrumentation (computer programming); Set (abstract data type); Embedded system; Algorithm; Operating system; Microcontroller","score_opus":0.01584770647337189,"score_gpt":0.2726198022229708,"score_spread":0.25677209574959886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002737237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087747544,0.00030404463,0.902359,0.00014789365,0.000035449008,0.00014279112,0.000108196655,0.007259701,0.0018954123],"genre_scores_gemma":[0.7073959,0.00020376893,0.28940728,0.00012422477,0.0000327464,0.00019588813,0.00031837076,0.00038027647,0.0019414984],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855334,0.0003297273,0.00007811831,0.00037945376,0.00052790926,0.00013146529],"domain_scores_gemma":[0.9960129,0.001619459,0.00074703735,0.0010516822,0.00044100307,0.00012783836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095158454,0.00060787686,0.00050711306,0.00044735576,0.0003056501,0.00064022327,0.0014786152,0.0005138906,0.0012303155],"category_scores_gemma":[0.0033132823,0.00027596156,0.000491589,0.00049582816,0.00058312365,0.0011343014,0.00066609925,0.000819684,0.00021852774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010927434,0.000599072,0.007370663,0.0006077631,0.00012914135,0.00042692164,0.00048053727,0.18736148,0.25147128,0.023602422,0.004656019,0.52220196],"study_design_scores_gemma":[0.000064088475,0.00037075352,0.0017254387,0.00002492184,0.00006185498,0.00029526732,0.000036087607,0.89847726,0.08760243,0.006214563,0.005101735,0.000025654454],"about_ca_topic_score_codex":0.00066555483,"about_ca_topic_score_gemma":0.0009489178,"teacher_disagreement_score":0.0014786152,"about_ca_system_score_codex":0.00050139125,"about_ca_system_score_gemma":0.0010051396,"threshold_uncertainty_score":0.0050325394},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019573260620422316,"score_gpt":0.2626189037684474,"score_spread":0.24304564314802507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003309571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18078811,0.00068142323,0.81361294,0.00020187949,0.000054062944,0.00007637996,0.00010819028,0.00076810503,0.003708995],"genre_scores_gemma":[0.9522398,0.00029174233,0.045915835,0.000038444872,0.000042052805,0.0000830959,0.000079244106,0.00011775479,0.0011921165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983215,0.00023679002,0.000058840433,0.00024973258,0.0008887602,0.0002443769],"domain_scores_gemma":[0.99137324,0.005329056,0.0013393725,0.0007273762,0.0010224925,0.00020839975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002085848,0.000910819,0.0006203123,0.0013395222,0.00040959127,0.000992572,0.0013062615,0.00048584052,0.0014373091],"category_scores_gemma":[0.012816006,0.0005242327,0.00075469044,0.00066150894,0.00096463447,0.0016136634,0.0008775268,0.001165103,0.00014480825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012140821,0.000030034478,0.0033129128,0.00010057062,0.00005450229,0.00008467184,0.0000563436,0.932786,0.011123664,0.034598816,0.00021091275,0.017520078],"study_design_scores_gemma":[0.000006431837,0.000051943618,0.00058459205,0.000008194146,0.000024123889,0.00005004519,0.000010870636,0.9814105,0.0055711614,0.011816547,0.00045356672,0.000012019371],"about_ca_topic_score_codex":0.002521381,"about_ca_topic_score_gemma":0.001994706,"teacher_disagreement_score":0.002521381,"about_ca_system_score_codex":0.0013996463,"about_ca_system_score_gemma":0.0024636644,"threshold_uncertainty_score":0.011031151},"labels":[],"label_agreement":null},{"id":"W2006200348","doi":"10.1109/icon.2013.6781974","title":"Scheduling soft aperiodic messages on FlexRay in-vehicle networks","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Aperiodic graph; FlexRay; Computer science; Scheduling (production processes); Distributed computing; Computer network; Real-time computing; Embedded system; Engineering; Automotive industry; Mathematics","score_opus":0.01057936330086535,"score_gpt":0.22401650601451728,"score_spread":0.21343714271365194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006200348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11047383,0.00037385584,0.8832833,0.00013259676,0.00008242328,0.000118083684,0.00005151899,0.00095912715,0.004525274],"genre_scores_gemma":[0.78558964,0.00030030578,0.21017483,0.00006600737,0.00005216248,0.00010006226,0.0001382112,0.00009309713,0.0034857015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996233,0.00010853796,0.000029249255,0.000058589434,0.00011890283,0.000061402374],"domain_scores_gemma":[0.999529,0.00017771263,0.00007982082,0.00007374394,0.00007985218,0.000059832993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055766717,0.0005332614,0.00051555503,0.0004835291,0.0005563304,0.0006311538,0.00086216815,0.00034876016,0.0014395596],"category_scores_gemma":[0.0009394542,0.00019048633,0.00018723548,0.0005206026,0.0003639896,0.00065267907,0.0006612395,0.00047959198,0.00030924895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007981015,0.00013100877,0.0011173647,0.00013998603,0.00003823084,0.00022455544,0.00028673594,0.7122186,0.05169056,0.0209261,0.0026036531,0.20982508],"study_design_scores_gemma":[0.000021410777,0.000101225596,0.00025950672,0.0000058988167,0.000009201892,0.00004518066,0.00005361305,0.97993875,0.012369641,0.0040718475,0.0031130891,0.000010577725],"about_ca_topic_score_codex":0.0018223944,"about_ca_topic_score_gemma":0.0023807995,"teacher_disagreement_score":0.0018223944,"about_ca_system_score_codex":0.0006636176,"about_ca_system_score_gemma":0.0008824752,"threshold_uncertainty_score":0.004815817},"labels":[],"label_agreement":null},{"id":"W2010177982","doi":"10.1109/ccece.2012.6335029","title":"Microkernel based real-time embedded operating systems efficiency improvement","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Microkernel; Inter-process communication; Computer science; Dependability; Operating system; Embedded system; Architecture; Real-time operating system; Software engineering","score_opus":0.012190680672600953,"score_gpt":0.2410990167713781,"score_spread":0.22890833609877714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010177982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48095772,0.0011949464,0.4912547,0.00048580059,0.00013912238,0.000056835426,0.000065142194,0.010425723,0.015419996],"genre_scores_gemma":[0.91095716,0.00014439154,0.082865685,0.00006051465,0.000032312848,0.00002052375,0.000054726028,0.00018737778,0.005677318],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999549,0.0000995014,0.000032817527,0.00009060925,0.00015537548,0.00007276763],"domain_scores_gemma":[0.99907804,0.00021779016,0.00011177218,0.0003023215,0.00023360639,0.000056609733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035611322,0.00022487067,0.00025658263,0.00024622204,0.0002379257,0.00066458917,0.00074824825,0.00017674598,0.0022469522],"category_scores_gemma":[0.0011898964,0.0001246265,0.000106286876,0.00022286533,0.00020260004,0.0010971737,0.00046210774,0.00046923853,0.00044746682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009418333,0.00047150266,0.004872347,0.00018632853,0.00005225959,0.00016489603,0.00023405605,0.0973551,0.3030572,0.02634403,0.006800807,0.5595195],"study_design_scores_gemma":[0.000051329465,0.00036212133,0.0037345246,0.00001068957,0.00003146721,0.0002859634,0.000043344815,0.8101703,0.16719489,0.005766443,0.012314368,0.000034509776],"about_ca_topic_score_codex":0.00048696066,"about_ca_topic_score_gemma":0.0010071305,"teacher_disagreement_score":0.0022469522,"about_ca_system_score_codex":0.00037565414,"about_ca_system_score_gemma":0.0005403655,"threshold_uncertainty_score":0.0075168014},"labels":[],"label_agreement":null},{"id":"W2011685880","doi":"10.1109/tpds.2012.205","title":"SyRaFa: Synchronous Rate and Frequency Adjustment for Utilization Control in Distributed Real-Time Embedded Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; University of Nebraska-Lincoln","keywords":"Computer science; Workload; Setpoint; Asynchronous communication; Frequency scaling; Task (project management); Synchronization (alternating current); Distributed computing; Multi-core processor; Quality of service; Real-time computing; Parallel computing; Computer network; Operating system; Energy consumption","score_opus":0.02285363525884347,"score_gpt":0.2558623161601467,"score_spread":0.23300868090130322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011685880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03057626,0.00042503915,0.96657234,0.00007893688,0.00008594199,0.000058321035,0.00002321092,0.0011783021,0.0010016504],"genre_scores_gemma":[0.91526514,0.00016263139,0.08343352,0.0000649111,0.00008037075,0.00007623818,0.000036171252,0.00005171957,0.0008292991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00018434772,0.0000584815,0.00019612785,0.00024651704,0.0000938346],"domain_scores_gemma":[0.9989887,0.00032577995,0.00022873768,0.0002042466,0.00019294793,0.000059603193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003315,0.0008247422,0.000771255,0.0004384947,0.0005329245,0.000595991,0.001119832,0.0004730742,0.0009811602],"category_scores_gemma":[0.002699883,0.0002353038,0.00036008318,0.00030556967,0.00049445336,0.0007485353,0.00062983215,0.0006415549,0.00031362125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006548192,0.00024445736,0.0014927235,0.00018448739,0.00007472007,0.00021143146,0.0003457325,0.56132627,0.06524066,0.0133155435,0.0025657828,0.35434344],"study_design_scores_gemma":[0.000041149222,0.00011988927,0.00021623392,0.000008211272,0.000009452134,0.000048546382,0.000008853744,0.9902519,0.0065228753,0.0016056887,0.0011519829,0.000015144624],"about_ca_topic_score_codex":0.0018816387,"about_ca_topic_score_gemma":0.0021894886,"teacher_disagreement_score":0.0018816387,"about_ca_system_score_codex":0.00041239653,"about_ca_system_score_gemma":0.0009554792,"threshold_uncertainty_score":0.0058192015},"labels":[],"label_agreement":null},{"id":"W2013705016","doi":"10.1145/1952522.1952524","title":"Nonutilization bounds and feasible regions for arbitrary fixed-priority policies","year":2011,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Office of Naval Research; Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Earliest deadline first scheduling; Dynamic priority scheduling; Bounding overwatch; Scheduling (production processes); Rate-monotonic scheduling; Deadline-monotonic scheduling; Bounded function; Mathematical optimization; Job shop scheduling; Distributed computing; Mathematics; Schedule; Computer network; Quality of service","score_opus":0.06013182717330944,"score_gpt":0.28434316270455295,"score_spread":0.2242113355312435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013705016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046340086,0.0013549229,0.9391219,0.00049774384,0.000052328247,0.00008944001,0.00022465775,0.00029349193,0.012025413],"genre_scores_gemma":[0.7704884,0.001432058,0.22485055,0.00012875789,0.00012146385,0.00039753754,0.0004290575,0.00021977528,0.0019325356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9940122,0.0021886583,0.0004142175,0.00088979484,0.0017485821,0.00074650504],"domain_scores_gemma":[0.96305335,0.027041597,0.0044841776,0.0022975218,0.0024499737,0.00067343767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055071614,0.0014669829,0.00095805124,0.002071771,0.0007799459,0.0035533702,0.0018658503,0.000848751,0.0025906614],"category_scores_gemma":[0.042638987,0.00060286326,0.0012187294,0.0017533298,0.002308054,0.0040678713,0.0018784881,0.0026192327,0.00040176895],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019283722,0.0001004773,0.0019840684,0.00029628596,0.00006141181,0.00023687803,0.00051106064,0.27370098,0.005634758,0.6738578,0.0012939202,0.04212947],"study_design_scores_gemma":[0.000027316766,0.00014237432,0.0013907072,0.00014313427,0.000026720387,0.00019400391,0.00016609058,0.59818006,0.0065549333,0.38795424,0.005172335,0.000048050715],"about_ca_topic_score_codex":0.0024698244,"about_ca_topic_score_gemma":0.0012123672,"teacher_disagreement_score":0.0055071614,"about_ca_system_score_codex":0.0030275239,"about_ca_system_score_gemma":0.0023733398,"threshold_uncertainty_score":0.029124975},"labels":[],"label_agreement":null},{"id":"W2014487321","doi":"10.1109/aero.2005.1559585","title":"Design for Flexible and Scalable Avionics Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scalability; Flexibility (engineering); Avionics; Task (project management); Set (abstract data type); Distributed computing; Scale (ratio); Work (physics); Product (mathematics); Risk analysis (engineering); Systems engineering; Software engineering; Engineering; Database","score_opus":0.03833504565826907,"score_gpt":0.2645889794960185,"score_spread":0.22625393383774944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014487321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016914979,0.0011106933,0.96515435,0.00085832726,0.00012656573,0.00042136043,0.00008418465,0.000842426,0.014487091],"genre_scores_gemma":[0.32457766,0.0018757466,0.661839,0.00029600027,0.00011711795,0.0011108917,0.00033502321,0.00039163156,0.00945703],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982351,0.00043249427,0.00011077033,0.0001952046,0.0008151401,0.00021126789],"domain_scores_gemma":[0.9990422,0.0003182048,0.00012957657,0.00018672858,0.00023411185,0.0000890927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019113299,0.00073696626,0.0004468807,0.0004564823,0.0006914249,0.0018546581,0.0016172996,0.0010502172,0.0037342794],"category_scores_gemma":[0.0033787505,0.0006823189,0.00061615475,0.00041500275,0.0010540843,0.0016491242,0.0021665287,0.0012395272,0.0009850623],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103730155,0.00012112501,0.0013036778,0.0011678394,0.0001407215,0.0007531478,0.0008780771,0.5802682,0.0515467,0.21258484,0.00728255,0.14384937],"study_design_scores_gemma":[0.00019332871,0.0003274499,0.0007025892,0.00026210435,0.000109002925,0.0003943924,0.00039952577,0.70579505,0.01305157,0.15119146,0.1275229,0.00005058883],"about_ca_topic_score_codex":0.00096329587,"about_ca_topic_score_gemma":0.0019753352,"teacher_disagreement_score":0.0037342794,"about_ca_system_score_codex":0.0008365712,"about_ca_system_score_gemma":0.0012327677,"threshold_uncertainty_score":0.012492418},"labels":[],"label_agreement":null},{"id":"W2015747341","doi":"10.4271/2014-01-0190","title":"Timing Analysis and Tracing Concepts for ECU Development","year":2014,"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":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Computer science; Tracing; Development (topology); Programming language","score_opus":0.017777876091725965,"score_gpt":0.273469384337371,"score_spread":0.255691508245645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015747341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018445444,0.0004328756,0.99113023,0.00010701025,0.00005090265,0.00005811059,0.000051848634,0.0008964461,0.0054281326],"genre_scores_gemma":[0.1290009,0.0025151053,0.84753495,0.00024911977,0.00019257829,0.0005837272,0.0003106389,0.0010016913,0.018611232],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99766785,0.0005220156,0.00019158295,0.0004875684,0.0009801871,0.00015067664],"domain_scores_gemma":[0.9962172,0.0020083846,0.00056546694,0.0005768866,0.0005436707,0.00008843215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018808695,0.0016003965,0.00049802935,0.0030151443,0.0006084426,0.0027437755,0.0018277601,0.00097361935,0.009396073],"category_scores_gemma":[0.0074702897,0.0008196325,0.001252044,0.0018346937,0.0027862035,0.004004979,0.0014378648,0.0026616063,0.001963866],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005411905,0.00004894857,0.00058350724,0.00034404904,0.000030628777,0.0002938595,0.0006702716,0.03315945,0.00978571,0.78770864,0.002551532,0.16476938],"study_design_scores_gemma":[0.00003967497,0.00019438216,0.00080541667,0.0004710731,0.00010525706,0.0005785601,0.00023408736,0.31666344,0.02766403,0.5539343,0.09922159,0.00008813818],"about_ca_topic_score_codex":0.0023728635,"about_ca_topic_score_gemma":0.0010836043,"teacher_disagreement_score":0.009396073,"about_ca_system_score_codex":0.0018324082,"about_ca_system_score_gemma":0.0016118492,"threshold_uncertainty_score":0.031432986},"labels":[],"label_agreement":null},{"id":"W2016833942","doi":"10.1007/s10270-007-0050-3","title":"A modelling and simulation based process for dependable systems design","year":2007,"lang":"en","type":"article","venue":"Software & Systems Modeling","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Process (computing); Systems engineering; Software engineering; Programming language","score_opus":0.07356362033255823,"score_gpt":0.298298027996331,"score_spread":0.22473440766377276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016833942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078718475,0.000017574006,0.9978532,0.000039577586,0.000009991209,0.00007010222,0.000016236396,0.00036466285,0.00084150786],"genre_scores_gemma":[0.09537988,0.00021747232,0.9006619,0.00006325583,0.000026265749,0.00043668048,0.00021928565,0.00025878387,0.0027365168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770063,0.0007406764,0.00014573577,0.00024136191,0.0010615579,0.000110018045],"domain_scores_gemma":[0.99756384,0.0011204636,0.00017382808,0.0005818784,0.00046759975,0.000092362636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002927784,0.0012289445,0.0012242198,0.0010317891,0.00087071996,0.002085622,0.0022134536,0.0017707986,0.00494951],"category_scores_gemma":[0.0061985096,0.0010558637,0.002355919,0.0008045044,0.0014271404,0.0018995319,0.0022003895,0.0024327103,0.0016251605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010617557,0.0001576024,0.0004412256,0.00020059467,0.000076108474,0.00021725187,0.00036878878,0.69010884,0.011414579,0.21980599,0.0012568743,0.075845964],"study_design_scores_gemma":[0.000020424033,0.00004924702,0.000054345794,0.0000267944,0.00002521084,0.00004205814,0.000012568875,0.9571628,0.0040934565,0.032355893,0.006142305,0.000015015912],"about_ca_topic_score_codex":0.0046093054,"about_ca_topic_score_gemma":0.002782802,"teacher_disagreement_score":0.00494951,"about_ca_system_score_codex":0.0011161397,"about_ca_system_score_gemma":0.0025107348,"threshold_uncertainty_score":0.016557753},"labels":[],"label_agreement":null},{"id":"W2017937196","doi":"10.1145/967900.968077","title":"A hardware/software kernel for system on chip designs","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Coprocessor; Uniprocessor system; Computer science; Kernel (algebra); Embedded system; Software; Partition (number theory); Scheduling (production processes); System on a chip; Parallel computing; Operating system; Engineering","score_opus":0.040649953804992485,"score_gpt":0.26077318279993716,"score_spread":0.2201232289949447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017937196","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010338046,0.0012729664,0.97046006,0.00026659502,0.0002359168,0.0002544479,0.00017088068,0.0074337916,0.0095673185],"genre_scores_gemma":[0.1729908,0.0011036192,0.8164059,0.00020389083,0.00016884552,0.00041968477,0.0005518762,0.000953162,0.007202207],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998616,0.00028411043,0.00014686865,0.00013574919,0.0007427211,0.00007458246],"domain_scores_gemma":[0.9983576,0.0002806092,0.00017207382,0.0007819225,0.0003144281,0.00009337113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012458403,0.0007557033,0.00042790608,0.0009989423,0.00045271614,0.0016047247,0.0008344456,0.0005088118,0.004508765],"category_scores_gemma":[0.003754775,0.00045631613,0.0005274349,0.0007675619,0.0007903467,0.001564668,0.0010750766,0.001380859,0.0025724554],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035803075,0.00018073051,0.0015193822,0.0007920706,0.00008157077,0.0004075296,0.00029227414,0.040169477,0.063000835,0.3327426,0.019938158,0.54051733],"study_design_scores_gemma":[0.00009981022,0.0007675604,0.0025657061,0.00032840096,0.00012634546,0.0012975807,0.00010296018,0.43218434,0.06523576,0.13919507,0.35799956,0.000096970674],"about_ca_topic_score_codex":0.00057865377,"about_ca_topic_score_gemma":0.0007188664,"teacher_disagreement_score":0.004508765,"about_ca_system_score_codex":0.0007347374,"about_ca_system_score_gemma":0.0010413195,"threshold_uncertainty_score":0.015083313},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027475656276314625,"score_gpt":0.28189741361284104,"score_spread":0.2544217573365264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024105885","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6597521,0.0006605465,0.33488992,0.0002321586,0.000073384916,0.00016576707,0.0001434924,0.00086539553,0.0032173067],"genre_scores_gemma":[0.9152007,0.0001522231,0.08387935,0.00004021592,0.000010130921,0.000115912066,0.0001078415,0.000049771403,0.00044383577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995264,0.00020921607,0.000035394754,0.000040732702,0.00012559316,0.000062749736],"domain_scores_gemma":[0.9988889,0.0005481532,0.00016659733,0.00017336155,0.00016663116,0.000056423054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012210946,0.00038571007,0.00033042228,0.0003954751,0.00042071418,0.00044266362,0.0008804271,0.00028267154,0.00093682087],"category_scores_gemma":[0.0030298925,0.00024358305,0.00041314357,0.00042704708,0.00028725638,0.00049361255,0.0003081453,0.0004331927,0.00009556169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019211342,0.00008509856,0.0017875349,0.00011023205,0.000037601305,0.00006819959,0.00008302838,0.9544797,0.013203517,0.003694959,0.0006332178,0.025624884],"study_design_scores_gemma":[0.00002823411,0.00009283512,0.00043729946,0.0000049898176,0.000009749708,0.000017255445,0.00001733303,0.9929598,0.0041532437,0.0016676382,0.00060599647,0.0000056567446],"about_ca_topic_score_codex":0.002454411,"about_ca_topic_score_gemma":0.004105712,"teacher_disagreement_score":0.002454411,"about_ca_system_score_codex":0.00066520256,"about_ca_system_score_gemma":0.0015311707,"threshold_uncertainty_score":0.0064578056},"labels":[],"label_agreement":null},{"id":"W2026226211","doi":"10.5539/mas.v4n9p30","title":"Implementation of the No Packet Loss Network Communication in VxWorks","year":2010,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Network packet; Scheduling (production processes); Reliability (semiconductor); Task (project management); Packet loss; Embedded system; Computer network; Software; Real-time computing; Distributed computing; Operating system","score_opus":0.00767635708781919,"score_gpt":0.25900136619395137,"score_spread":0.2513250091061322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026226211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08631768,0.00025668924,0.8373673,0.00046292454,0.00044431447,0.00071902934,0.00037894666,0.034331985,0.039721247],"genre_scores_gemma":[0.79684913,0.00028941018,0.17481326,0.00019183532,0.000095739495,0.00071933,0.0011154639,0.0015336174,0.024392173],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990901,0.00013287416,0.00009674798,0.00015431205,0.00036226228,0.00016370071],"domain_scores_gemma":[0.9991529,0.00013131698,0.00007068181,0.00027735747,0.00029199116,0.00007581822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000931849,0.0006097427,0.000369503,0.00066290086,0.0005883648,0.0014090126,0.0019827972,0.00048884144,0.00843853],"category_scores_gemma":[0.0019923882,0.0003135154,0.00028536282,0.00037165586,0.00045600306,0.0015410401,0.0008186966,0.0010046681,0.0013910996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041224794,0.0011817409,0.011483637,0.00075995235,0.00029999553,0.0020848755,0.002809906,0.058629565,0.21123365,0.12933223,0.061424438,0.51663756],"study_design_scores_gemma":[0.0012309722,0.0010362219,0.002821289,0.00010004981,0.00014380226,0.00085040345,0.00024214906,0.37241554,0.42587975,0.008653418,0.18648322,0.00014322442],"about_ca_topic_score_codex":0.0019997386,"about_ca_topic_score_gemma":0.0011519267,"teacher_disagreement_score":0.00843853,"about_ca_system_score_codex":0.00064935314,"about_ca_system_score_gemma":0.0013177351,"threshold_uncertainty_score":0.028229713},"labels":[],"label_agreement":null},{"id":"W2033488850","doi":"10.1109/syscon.2013.6549902","title":"Implementation of a subsumption based architecture using model-driven development","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Architecture; Robotics; Artificial intelligence; Robot; Development (topology); Inertial measurement unit; Ranging; De facto; Software engineering; Embedded system; Computer architecture; Control engineering; Distributed computing; Engineering","score_opus":0.030479105463706926,"score_gpt":0.2836284699888558,"score_spread":0.2531493645251489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033488850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017382186,0.00007719309,0.97675085,0.00009936813,0.000030439882,0.00013706004,0.000052659747,0.0036375616,0.0018327188],"genre_scores_gemma":[0.24983887,0.00021446245,0.7460329,0.0001230845,0.000013520835,0.00030281307,0.00033062344,0.00051143224,0.0026323262],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987961,0.00031474535,0.000115444105,0.00021560765,0.0004570369,0.000100929996],"domain_scores_gemma":[0.99846256,0.0004941899,0.00008336039,0.00048622853,0.00041040228,0.00006337957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00171913,0.0005897029,0.0003914202,0.00052675366,0.00044851672,0.0013241513,0.0014351495,0.0006106502,0.0015387564],"category_scores_gemma":[0.0027033363,0.0004295875,0.0007453525,0.00026933584,0.0007900888,0.0012244042,0.0010612599,0.00094823405,0.0005131363],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034104436,0.00048692996,0.0055914684,0.0009967404,0.00028331223,0.001233183,0.0015609035,0.32424167,0.15701579,0.13562448,0.0039115995,0.3687128],"study_design_scores_gemma":[0.00006388362,0.0003211515,0.00084893795,0.000082915845,0.00015669611,0.00040618068,0.00009443116,0.82385075,0.10465859,0.031464964,0.037989303,0.000062222745],"about_ca_topic_score_codex":0.003257784,"about_ca_topic_score_gemma":0.002838354,"teacher_disagreement_score":0.003257784,"about_ca_system_score_codex":0.0007995219,"about_ca_system_score_gemma":0.001770442,"threshold_uncertainty_score":0.009091735},"labels":[],"label_agreement":null},{"id":"W2035119168","doi":"10.1109/robot.2004.1307447","title":"A real-time task-oriented scheduling algorithm for distributed multi-robot systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Robot; Scheduling (production processes); Distributed computing; Task (project management); Interdependence; Task analysis; Real-time computing; Processor scheduling; Dynamic priority scheduling; Artificial intelligence; Mathematical optimization; Schedule; Engineering; Operating system","score_opus":0.018201271132450104,"score_gpt":0.26282553060876607,"score_spread":0.24462425947631597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035119168","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027735592,0.00011489912,0.9956161,0.000049860213,0.000041921292,0.000038675724,0.000015032583,0.00046523628,0.00088464504],"genre_scores_gemma":[0.09003929,0.00022498351,0.90701795,0.000070905015,0.000048421032,0.00019993602,0.00011551267,0.00012870622,0.0021543799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962234,0.000088493056,0.000029082452,0.000075847485,0.00013995368,0.000044345277],"domain_scores_gemma":[0.9996762,0.00010440986,0.000046414254,0.000039284234,0.00010082971,0.00003293942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075297244,0.000920643,0.00070003304,0.00065212627,0.0007527195,0.0006965253,0.0014565879,0.00075338903,0.0020367177],"category_scores_gemma":[0.0012024329,0.00038533393,0.0005002407,0.0007736178,0.0004517897,0.00086051476,0.00076852797,0.0008109192,0.00069056154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001894655,0.00012784239,0.00033889158,0.00018615845,0.000043971144,0.00012288339,0.00013501894,0.683601,0.014251064,0.025994414,0.00505137,0.26995796],"study_design_scores_gemma":[0.000059326627,0.0000563013,0.00004701374,0.000008179242,0.0000082559345,0.000055267443,0.0000124956305,0.9880972,0.0020707087,0.0048642773,0.004712277,0.000008808131],"about_ca_topic_score_codex":0.0024671496,"about_ca_topic_score_gemma":0.0023270727,"teacher_disagreement_score":0.0024671496,"about_ca_system_score_codex":0.0006905602,"about_ca_system_score_gemma":0.0013416851,"threshold_uncertainty_score":0.006813526},"labels":[],"label_agreement":null},{"id":"W2035974757","doi":"10.4271/2014-01-0206","title":"Efficient Virtualization for Functional Integration on Modern Microcontrollers in Safety-Relevant Domains","year":2014,"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":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Virtualization; Microcontroller; Computer science; Embedded system; Functional safety; Operating system; Computer network; Cloud computing","score_opus":0.0108172393922835,"score_gpt":0.23586056712687795,"score_spread":0.22504332773459446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035974757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1430789,0.0022891895,0.8066068,0.0005683048,0.00032214427,0.00023371456,0.00019235344,0.011470033,0.035238586],"genre_scores_gemma":[0.8501317,0.0005857489,0.14135066,0.00017122857,0.00006829194,0.00016511866,0.0004380572,0.0006511018,0.0064381734],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.00021949719,0.000047881113,0.00007460136,0.00018431061,0.00020645629],"domain_scores_gemma":[0.9994355,0.000115457544,0.000054125474,0.000250506,0.00008701905,0.000057521396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239491,0.00069914357,0.00037299294,0.00046743808,0.00039232065,0.001191735,0.0011160079,0.00030157084,0.0041244994],"category_scores_gemma":[0.0014143869,0.00027869578,0.0003684305,0.00032366783,0.0004671096,0.0018910986,0.001926806,0.00087958825,0.0016976302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008345876,0.00042144093,0.005550363,0.0008202236,0.00009341898,0.0010622563,0.0011508273,0.046493236,0.21451151,0.12538949,0.02785704,0.57581556],"study_design_scores_gemma":[0.0001671965,0.001013181,0.00770813,0.00031552737,0.00015697554,0.0013420634,0.0007359067,0.5167986,0.20699325,0.06489896,0.19974858,0.00012159166],"about_ca_topic_score_codex":0.00068595994,"about_ca_topic_score_gemma":0.0008864994,"teacher_disagreement_score":0.0041244994,"about_ca_system_score_codex":0.00057491683,"about_ca_system_score_gemma":0.0009405329,"threshold_uncertainty_score":0.01379782},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016915997486578512,"score_gpt":0.22800096663539482,"score_spread":0.2110849691488163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036838567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1278615,0.00018306791,0.8685197,0.0002227194,0.00002759848,0.000096141666,0.00003607961,0.0012376657,0.0018155138],"genre_scores_gemma":[0.63396126,0.00013101037,0.3647358,0.00008789398,0.000012571724,0.00019521308,0.00008450062,0.00008240961,0.0007094475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985468,0.0008358807,0.00006753721,0.0001348899,0.0003171305,0.00009783349],"domain_scores_gemma":[0.9940785,0.0046586916,0.00043002664,0.00030223062,0.0004524316,0.000078059886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018541137,0.00093996944,0.00051819626,0.0010815792,0.00035798262,0.0007439939,0.0009214846,0.00097050756,0.0007944018],"category_scores_gemma":[0.008616171,0.0004225453,0.0006782735,0.00060433947,0.0011813781,0.0007742661,0.00051283976,0.0007962488,0.00011626274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000800716,0.00010860335,0.0019875632,0.000047302347,0.000058571695,0.000081574835,0.000093169816,0.9479676,0.0038301346,0.0046694824,0.00018312498,0.040892806],"study_design_scores_gemma":[0.000029382494,0.000054989086,0.0002891862,0.000010512871,0.000013510617,0.000020840136,0.000016239295,0.9912169,0.0030265278,0.005050136,0.00026199847,0.0000098170985],"about_ca_topic_score_codex":0.0058933534,"about_ca_topic_score_gemma":0.0036786995,"teacher_disagreement_score":0.0058933534,"about_ca_system_score_codex":0.00090983324,"about_ca_system_score_gemma":0.0010841804,"threshold_uncertainty_score":0.011718094},"labels":[],"label_agreement":null},{"id":"W2037435078","doi":"10.1109/etfa.2012.6489580","title":"Program transformation for time-aware instrumentation","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Instrumentation (computer programming); Metric (unit); Computer science; Transformation (genetics); Program transformation; Domain (mathematical analysis); Factor (programming language); Systems engineering; Reliability engineering; Engineering; Programming language; Mathematics","score_opus":0.019161681092242713,"score_gpt":0.2889370894065536,"score_spread":0.2697754083143109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037435078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07872952,0.00026095094,0.9122214,0.00018635471,0.0000307667,0.00013974438,0.00015387546,0.0049447296,0.0033327593],"genre_scores_gemma":[0.7092314,0.0001764523,0.28886253,0.00007668128,0.000031370662,0.00017928216,0.00030489915,0.000460247,0.00067710015],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614656,0.0010561086,0.00024354334,0.00038536778,0.0019215229,0.0002468768],"domain_scores_gemma":[0.9939376,0.0028894695,0.00096291397,0.0014319614,0.0006901261,0.00008775349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001544602,0.00048753378,0.00040672623,0.0008938969,0.00034686716,0.0007897516,0.0006608155,0.00046537918,0.0013367847],"category_scores_gemma":[0.0085698,0.00018122514,0.00050941913,0.001224206,0.00088834565,0.0012354725,0.00086028816,0.000969673,0.0002252202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068009994,0.0003529431,0.0073002465,0.0005044191,0.00007897646,0.00016748297,0.000375102,0.17509009,0.1557,0.076425895,0.0030255273,0.5802992],"study_design_scores_gemma":[0.00007949974,0.0008318811,0.0044262726,0.0000633031,0.00009796108,0.00040169634,0.00013990667,0.78524566,0.16182287,0.033305086,0.013543172,0.00004277318],"about_ca_topic_score_codex":0.0010245689,"about_ca_topic_score_gemma":0.0010047058,"teacher_disagreement_score":0.001544602,"about_ca_system_score_codex":0.0007002361,"about_ca_system_score_gemma":0.0013056986,"threshold_uncertainty_score":0.008168697},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016060542788861366,"score_gpt":0.26850324228180994,"score_spread":0.25244269949294856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043233377","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45029074,0.0010856567,0.5398159,0.0004989322,0.00025115392,0.0002586331,0.00007773095,0.001587384,0.006133861],"genre_scores_gemma":[0.9177397,0.00021509048,0.079869576,0.00008188062,0.000039114333,0.00006911861,0.00007107381,0.00012095876,0.0017934535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983217,0.00044030455,0.00012829428,0.00029844794,0.0005166065,0.00029465402],"domain_scores_gemma":[0.99328715,0.003050695,0.0012602354,0.0010427865,0.00087774167,0.00048133236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026017297,0.0009871057,0.00069461623,0.000762723,0.0007607652,0.0010947854,0.0013977349,0.0007014554,0.0011243182],"category_scores_gemma":[0.011867774,0.00042681774,0.00039304918,0.0006657115,0.0005741147,0.0018525303,0.0010274486,0.0013389208,0.00026311638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021578467,0.0007113902,0.013161295,0.0005364749,0.00012928016,0.00052917807,0.00082046853,0.27773908,0.16960326,0.017845707,0.0023243015,0.51444167],"study_design_scores_gemma":[0.00021095878,0.0021452075,0.018159678,0.00009072298,0.00017174479,0.0013547464,0.00069937046,0.82652223,0.10556985,0.034063507,0.010903279,0.000108662825],"about_ca_topic_score_codex":0.0014460634,"about_ca_topic_score_gemma":0.002244654,"teacher_disagreement_score":0.0026017297,"about_ca_system_score_codex":0.0006561183,"about_ca_system_score_gemma":0.0015231676,"threshold_uncertainty_score":0.013759434},"labels":[],"label_agreement":null},{"id":"W2043365683","doi":"10.4271/2011-01-0866","title":"Communication Requirements for Plug-In Electric Vehicles","year":2011,"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":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Chrysler (Canada)","funders":"","keywords":"Plug-in; Computer science; Plug and play; Spark plug; Automotive engineering; Engineering; Aerospace engineering; Operating system","score_opus":0.03567621091872548,"score_gpt":0.27441905234411934,"score_spread":0.23874284142539387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043365683","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023996571,0.002159225,0.16702564,0.006477449,0.001869986,0.0006905732,0.0042376244,0.006252568,0.7872903],"genre_scores_gemma":[0.5132617,0.003661988,0.04241013,0.0022585695,0.001386423,0.0020915165,0.018054005,0.0029847585,0.413891],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99606043,0.000582073,0.00022463052,0.00026126797,0.002413126,0.00045843332],"domain_scores_gemma":[0.9942908,0.0016984777,0.00021777261,0.00043228088,0.003139867,0.00022089701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016389107,0.0008301431,0.00052966445,0.0012358881,0.0014154123,0.0024083506,0.001290887,0.0020521367,0.089502245],"category_scores_gemma":[0.008134444,0.00045845687,0.00037568994,0.00083658437,0.0003074844,0.0026613278,0.0014454866,0.0011329834,0.04138557],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039136893,0.00020947843,0.0022210137,0.0011472101,0.000023921199,0.0010328884,0.0010744766,0.026965799,0.034642812,0.2308412,0.3528743,0.34857556],"study_design_scores_gemma":[0.000050705603,0.00016745979,0.0016838616,0.00025821893,0.00002275383,0.0011641493,0.0005220864,0.02304191,0.009778144,0.013182347,0.950075,0.00005328735],"about_ca_topic_score_codex":0.0047119935,"about_ca_topic_score_gemma":0.0025974978,"teacher_disagreement_score":0.089502245,"about_ca_system_score_codex":0.0010670887,"about_ca_system_score_gemma":0.0015676678,"threshold_uncertainty_score":0.2994148},"labels":[],"label_agreement":null},{"id":"W2045496600","doi":"10.1117/12.434274","title":"<title>Admission control and quality adaptation in the distributed multimedia server system (DMSS)</title>","year":2001,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Quality of service; Computer network; Server; Bandwidth (computing); Fault tolerance; Bandwidth allocation; Admission control; Resource allocation; Multimedia; Distributed computing; Adaptation (eye)","score_opus":0.016486951171103815,"score_gpt":0.23978958526196625,"score_spread":0.22330263409086243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045496600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04180107,0.003181222,0.92179185,0.0025340475,0.00086486776,0.00015260532,0.00009843482,0.0016741222,0.027901731],"genre_scores_gemma":[0.8088528,0.002921569,0.1286832,0.00030994017,0.00076839974,0.00014595102,0.00020772213,0.00022412124,0.05788639],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957937,0.00014550866,0.00002124386,0.000060799623,0.0001346644,0.000058450412],"domain_scores_gemma":[0.99959296,0.00016957558,0.000024225907,0.00006023434,0.000106641986,0.000046370616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007833395,0.0002602569,0.00049906055,0.00029214306,0.0004750406,0.0013055458,0.0007434598,0.00042584987,0.003751149],"category_scores_gemma":[0.0014023541,0.00017574457,0.00024005714,0.0006074121,0.0008153334,0.00095591036,0.00042970077,0.0006521126,0.0011224578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007988322,0.00020579492,0.002061724,0.00018403216,0.000038575196,0.00040293,0.00025467502,0.30103564,0.018074062,0.28375518,0.037988253,0.35520035],"study_design_scores_gemma":[0.000036537862,0.000069672475,0.00036190377,0.000013667596,0.000008810245,0.00007071359,0.00003114514,0.95358783,0.0043357587,0.025550567,0.015918907,0.000014521247],"about_ca_topic_score_codex":0.005977655,"about_ca_topic_score_gemma":0.004292227,"teacher_disagreement_score":0.005977655,"about_ca_system_score_codex":0.0017149949,"about_ca_system_score_gemma":0.0009794015,"threshold_uncertainty_score":0.012548864},"labels":[],"label_agreement":null},{"id":"W2045551312","doi":"10.1109/radecs.2005.4365596","title":"Sensitivity of Real-Time Operating Systems to Transient Faults: A case study for MicroC kernel","year":2005,"lang":"en","type":"article","venue":"ESA SP","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Real-time operating system; Computer science; Life-critical system; Transient (computer programming); Kernel (algebra); Scheduling (production processes); Embedded system; Reliability engineering; Real-time computing; Engineering; Operating system; Software","score_opus":0.018833235867416736,"score_gpt":0.27876102591072305,"score_spread":0.2599277900433063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045551312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9948309,0.00011927976,0.0039349734,0.000063255975,0.000006361869,0.000029506024,0.00007306991,0.000112921036,0.0008297086],"genre_scores_gemma":[0.99880636,0.000034557903,0.000974034,0.000010388155,0.0000025091933,0.0000048845677,0.000027384336,0.000009782827,0.00012998444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9987747,0.00040925585,0.00007094235,0.00017807118,0.00036842423,0.00019857699],"domain_scores_gemma":[0.9833112,0.011894195,0.0016824009,0.0016054576,0.0011135001,0.00039330169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014177293,0.0005337658,0.00042758763,0.0011049175,0.00054573396,0.00049002876,0.0006685214,0.0009624651,0.0009829192],"category_scores_gemma":[0.009886873,0.00020282349,0.00047202175,0.0008652861,0.0009245172,0.00066128455,0.0004432248,0.00058960763,0.000114813534],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003181806,0.0014716971,0.20635396,0.00064129813,0.00034438458,0.026426494,0.0025128413,0.6098841,0.07243584,0.00740139,0.0026762302,0.066669926],"study_design_scores_gemma":[0.00015416257,0.0039346414,0.11192709,0.00005112452,0.00034363286,0.013815836,0.001999756,0.76281095,0.09680876,0.005581019,0.0024441904,0.00012884142],"about_ca_topic_score_codex":0.00403516,"about_ca_topic_score_gemma":0.0034668306,"teacher_disagreement_score":0.00403516,"about_ca_system_score_codex":0.0009384807,"about_ca_system_score_gemma":0.00037598284,"threshold_uncertainty_score":0.008023381},"labels":[],"label_agreement":null},{"id":"W2048240025","doi":"10.4271/2014-01-0257","title":"Mode-Dynamic Task Allocation and Scheduling for an Engine Management Real-Time System Using a Multicore Microcontroller","year":2014,"lang":"en","type":"article","venue":"SAE International journal of passenger cars. Electronic and electrical systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Multi-core processor; Computer science; Scheduling (production processes); Microcontroller; Embedded system; Mode (computer interface); Task (project management); Real-time computing; Parallel computing; Operating system; Engineering; Operations management; Systems engineering","score_opus":0.006906990401978035,"score_gpt":0.2580356027250055,"score_spread":0.25112861232302747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048240025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5435252,0.0008142251,0.43659982,0.00017909161,0.00010050624,0.00029019162,0.00017649775,0.00540611,0.012908336],"genre_scores_gemma":[0.9051766,0.00013124061,0.088199735,0.000033133398,0.00001742466,0.00012087512,0.00016917859,0.00010834866,0.0060434276],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998425,0.000031198204,0.000016449147,0.00003713471,0.000042762218,0.000029844014],"domain_scores_gemma":[0.9998336,0.0000436939,0.000022369675,0.00003638652,0.000047131507,0.000016856458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002088126,0.0003604098,0.00014630554,0.00026997548,0.00016808459,0.0003048277,0.0005802366,0.00015355229,0.002497622],"category_scores_gemma":[0.00044946859,0.000098998826,0.00014496491,0.00020935983,0.000096208314,0.00033320446,0.00019526057,0.00016529161,0.00034540053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00093012385,0.00033337917,0.0045412113,0.00037150548,0.00006533597,0.0002817059,0.00030971752,0.18599918,0.3005027,0.005481538,0.004026532,0.49715707],"study_design_scores_gemma":[0.00008715263,0.0009293688,0.005467394,0.000022568287,0.000045237175,0.00020465923,0.00007315264,0.8763513,0.10384542,0.0019333368,0.0110064605,0.00003409436],"about_ca_topic_score_codex":0.001317902,"about_ca_topic_score_gemma":0.0020808368,"teacher_disagreement_score":0.002497622,"about_ca_system_score_codex":0.00035392618,"about_ca_system_score_gemma":0.0005035731,"threshold_uncertainty_score":0.0083553195},"labels":[],"label_agreement":null},{"id":"W2048713255","doi":"10.1007/s00165-014-0325-8","title":"Synthesizing bounded-time 2-phase fault recovery","year":2014,"lang":"en","type":"article","venue":"Formal Aspects of Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Liveness; Computer science; Bounded function; Theory of computation; Fault tolerance; Algorithm; Simple (philosophy); Sequence (biology); Ideal (ethics); Time complexity; Class (philosophy); Distributed computing; Theoretical computer science; Mathematics","score_opus":0.008436181392611425,"score_gpt":0.24146598286907556,"score_spread":0.23302980147646413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048713255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078852646,0.00006824868,0.9166348,0.00013624266,0.000028726083,0.00010215319,0.00005483256,0.0012109835,0.002911284],"genre_scores_gemma":[0.7407492,0.000087768196,0.25693217,0.000106478205,0.000011709112,0.00013567951,0.00010912932,0.00013825268,0.00172965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993063,0.00019520434,0.00005195587,0.00009917498,0.00023898903,0.00010843228],"domain_scores_gemma":[0.9981572,0.001009909,0.0002632461,0.00032609573,0.00020034901,0.00004321445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090567564,0.00041649572,0.00028990646,0.00031928456,0.00021181062,0.00043258633,0.00065132783,0.0004166303,0.0019441139],"category_scores_gemma":[0.0030875702,0.00021184656,0.00049747777,0.00024815532,0.0007417667,0.0006248891,0.00072007906,0.000682714,0.0002486567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036925098,0.0001962282,0.0010335487,0.0003410467,0.00004039828,0.0002650098,0.0003584382,0.7080303,0.10787338,0.0982095,0.000857287,0.082425624],"study_design_scores_gemma":[0.000059376198,0.00016939582,0.00020160117,0.000021124046,0.000021532831,0.00005962537,0.000034853012,0.9153634,0.057552494,0.023219474,0.0032810252,0.000016045702],"about_ca_topic_score_codex":0.0010127226,"about_ca_topic_score_gemma":0.0013734691,"teacher_disagreement_score":0.0019441139,"about_ca_system_score_codex":0.00048548638,"about_ca_system_score_gemma":0.0010045264,"threshold_uncertainty_score":0.006503761},"labels":[],"label_agreement":null},{"id":"W2049562458","doi":"10.1109/civemsa.2013.6617391","title":"A software-in-the-loop simulation of an intelligent microsatellite within a virtual environment","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Alphanumeric; Architecture; Software architecture; Software; Reference architecture; Real-time computing; Distributed computing; Systems engineering; Operating system; Engineering","score_opus":0.01798857624416597,"score_gpt":0.24552917063078883,"score_spread":0.22754059438662286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049562458","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7492076,0.000051723688,0.23858072,0.000121747275,0.000046457153,0.0000924331,0.00017056883,0.0010275607,0.010701232],"genre_scores_gemma":[0.9826037,0.000023824814,0.016127532,0.0000099513045,0.0000023860089,0.00004064279,0.000081538885,0.000021964865,0.0010884664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998604,0.000044691362,0.000006330753,0.000023258346,0.000038148974,0.000027211683],"domain_scores_gemma":[0.9997218,0.00013414778,0.00002837676,0.00003458361,0.000042409345,0.00003866467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025497872,0.000305739,0.00025610067,0.00026230485,0.00033831663,0.000650588,0.00054534053,0.0005514333,0.0019853183],"category_scores_gemma":[0.00069287774,0.00014138843,0.00037040675,0.00016496853,0.00055030023,0.00039874966,0.00049268577,0.00030759466,0.0001261163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008777672,0.00005642457,0.0012527988,0.000014737545,0.000013311977,0.000069980706,0.000097863856,0.9885405,0.0047341567,0.001551815,0.000090376525,0.0034902287],"study_design_scores_gemma":[0.00001577779,0.000049092887,0.00024687775,0.0000015903668,0.0000056675813,0.0000072865128,0.000016864564,0.99765056,0.0013682835,0.000308348,0.00032570682,0.0000038233234],"about_ca_topic_score_codex":0.008327181,"about_ca_topic_score_gemma":0.00519023,"teacher_disagreement_score":0.008327181,"about_ca_system_score_codex":0.00040923533,"about_ca_system_score_gemma":0.00085158215,"threshold_uncertainty_score":0.016557455},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.02595016831673748,"score_gpt":0.27122356463086195,"score_spread":0.24527339631412448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052671997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16855328,0.00028939653,0.82859206,0.00023784685,0.000043829063,0.00003703763,0.000018825673,0.00063288544,0.001594776],"genre_scores_gemma":[0.87542796,0.00010940928,0.12337997,0.00007563159,0.000018247734,0.000062391686,0.000037429498,0.000056885474,0.0008320237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940634,0.0002849268,0.000019506375,0.0000653306,0.00014477345,0.000079116704],"domain_scores_gemma":[0.9961642,0.0030199012,0.00025396366,0.00016267957,0.0003339579,0.00006524877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015256199,0.0006110773,0.0005484931,0.0010001665,0.0004870588,0.00071236794,0.0009794496,0.0010105617,0.0008381938],"category_scores_gemma":[0.00565641,0.0003564026,0.0004813062,0.00045019004,0.0009373847,0.0008816906,0.00047902841,0.00082640874,0.00009669413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013317449,0.00007597141,0.0012457147,0.00003052431,0.00003673611,0.00007903891,0.00008930302,0.9351367,0.004066472,0.008738167,0.00021389977,0.0501543],"study_design_scores_gemma":[0.000012134433,0.000021528775,0.00015134743,0.000004547675,0.0000063961234,0.000009597672,0.000008474747,0.9915581,0.0016451555,0.006483046,0.00009485163,0.000004966373],"about_ca_topic_score_codex":0.004837309,"about_ca_topic_score_gemma":0.0036978615,"teacher_disagreement_score":0.004837309,"about_ca_system_score_codex":0.0009055021,"about_ca_system_score_gemma":0.00089732185,"threshold_uncertainty_score":0.009618282},"labels":[],"label_agreement":null},{"id":"W2052838808","doi":"10.1115/detc2011-47928","title":"A Method for Simultaneously Satisfying Important Constraints and Dependencies for Many Different Types of Processes in Embedded Real-Time Systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Asynchronous communication; Process (computing); Distributed computing; Computation; Constraint (computer-aided design); Theoretical computer science; Algorithm; Programming language; Mathematics","score_opus":0.032475802008258836,"score_gpt":0.2812530162560793,"score_spread":0.24877721424782046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052838808","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019373572,0.00011165553,0.99637306,0.00009047203,0.000038729497,0.00008534385,0.000018569048,0.00052622036,0.0008185574],"genre_scores_gemma":[0.031799387,0.000121997706,0.9656578,0.00008612359,0.000053705797,0.00019067596,0.0000531274,0.00017155739,0.0018655735],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954756,0.0010169684,0.0004200175,0.00080654735,0.0020329624,0.00024800774],"domain_scores_gemma":[0.9912504,0.0048681726,0.00070032524,0.0017666336,0.0011141361,0.0003002869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004750389,0.0016008248,0.0011861355,0.001485421,0.0016662206,0.0016111233,0.002006562,0.0016341405,0.002911795],"category_scores_gemma":[0.00908287,0.0011298507,0.0013841828,0.0012368838,0.0014415488,0.003645327,0.0024482987,0.0030131452,0.0011737675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065510883,0.00040225417,0.0021327394,0.00089182047,0.00026179137,0.0011181423,0.001965211,0.07965439,0.08478563,0.13562304,0.010698127,0.68181187],"study_design_scores_gemma":[0.0005133106,0.00048458413,0.00068849715,0.0001944513,0.00029312813,0.002127463,0.000279018,0.69619334,0.08565637,0.114103705,0.09917829,0.00028789364],"about_ca_topic_score_codex":0.0016594975,"about_ca_topic_score_gemma":0.0031397466,"teacher_disagreement_score":0.004750389,"about_ca_system_score_codex":0.0007518177,"about_ca_system_score_gemma":0.0029307837,"threshold_uncertainty_score":0.025122762},"labels":[],"label_agreement":null},{"id":"W2054589346","doi":"10.1115/imece2005-81619","title":"Performance Evaluation of a Distributed Reconfigurable Controller Architecture for Robotic Applications","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; University of Saskatchewan","funders":"","keywords":"Reconfigurability; Embedded system; Control reconfiguration; Computer science; Ethernet; Synchronization (alternating current); Modular design; Modularity (biology); Controller (irrigation); Reference architecture; Computer architecture; Software; Software architecture; Distributed computing; Computer network; Operating system","score_opus":0.026431453628821083,"score_gpt":0.27486264393116355,"score_spread":0.24843119030234248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054589346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9488807,0.0003565697,0.04134562,0.00012448817,0.000051665957,0.0001392636,0.000104681894,0.0013922125,0.0076047964],"genre_scores_gemma":[0.9923943,0.000035443027,0.006773545,0.000009119787,0.000004972852,0.000025429734,0.00007940902,0.000024657216,0.0006531344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992199,0.00017530046,0.000044317992,0.000133548,0.00031198902,0.00011502243],"domain_scores_gemma":[0.99724627,0.0011647036,0.00019928427,0.00032081106,0.0009092173,0.00015984867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011107154,0.00070037664,0.00039919693,0.00069041055,0.00048392796,0.0005772147,0.00090959057,0.0005290885,0.0020579335],"category_scores_gemma":[0.0034321214,0.00016988876,0.00025838873,0.0004937158,0.000404071,0.0006042309,0.00033736666,0.0004123191,0.00031781165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029901923,0.0005489412,0.00446286,0.00028085193,0.00011781518,0.00022698232,0.00015589617,0.8181479,0.059629496,0.0024866816,0.0013226769,0.10962962],"study_design_scores_gemma":[0.00014072168,0.001515745,0.0028677767,0.000007773535,0.000035620003,0.00006471946,0.000045407953,0.96671706,0.027646182,0.00038128434,0.00055943435,0.000018284654],"about_ca_topic_score_codex":0.006082239,"about_ca_topic_score_gemma":0.0031946995,"teacher_disagreement_score":0.006082239,"about_ca_system_score_codex":0.0013426444,"about_ca_system_score_gemma":0.0006510532,"threshold_uncertainty_score":0.012093663},"labels":[],"label_agreement":null},{"id":"W2055496043","doi":"10.1145/2769458.2769465","title":"Towards a DEVS-based Operating System","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scalability; DEVS; Kernel (algebra); Reliability (semiconductor); Formal verification; Distributed computing; Formal methods; Embedded system; Software engineering; Modeling and simulation; Operating system; Programming language; Simulation","score_opus":0.0431152206773496,"score_gpt":0.26786099958362136,"score_spread":0.22474577890627176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055496043","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021601615,0.00060714263,0.95298266,0.0015930902,0.00036762006,0.00015558161,0.0001718029,0.012124638,0.010395895],"genre_scores_gemma":[0.2329721,0.0006720026,0.7479076,0.00092026085,0.00017041843,0.0002506506,0.00071983365,0.0018590639,0.014528039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983608,0.0003376048,0.00017065015,0.00027547067,0.00068541855,0.00017008052],"domain_scores_gemma":[0.99722314,0.00043419693,0.00017538482,0.0010433225,0.0008143215,0.00030964098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027306683,0.0004317241,0.0004567783,0.0005751265,0.0004805514,0.0024868536,0.002420344,0.0009220066,0.0030135352],"category_scores_gemma":[0.0045658774,0.00057961117,0.00081162463,0.00029735995,0.0015996562,0.0029041476,0.0034420437,0.0029485996,0.0017462524],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005529208,0.00045777496,0.008248209,0.0007722787,0.00014021939,0.0006270489,0.0012880719,0.122933775,0.048154872,0.52514285,0.023806028,0.26787606],"study_design_scores_gemma":[0.000104863946,0.00029665878,0.0012388959,0.0002606423,0.00009308681,0.00039793306,0.00016826356,0.61366665,0.028582133,0.11841416,0.23670104,0.0000756509],"about_ca_topic_score_codex":0.001833072,"about_ca_topic_score_gemma":0.0021929157,"teacher_disagreement_score":0.0030135352,"about_ca_system_score_codex":0.0010303794,"about_ca_system_score_gemma":0.0020904078,"threshold_uncertainty_score":0.014441311},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0513958623455601,"score_gpt":0.2936989394645004,"score_spread":0.24230307711894028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056047125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30637538,0.0003793685,0.6875457,0.00016929442,0.000039859537,0.000077887424,0.000060785147,0.0029600793,0.0023915644],"genre_scores_gemma":[0.95957834,0.00008123394,0.039664507,0.00002519459,0.00001454318,0.000062332234,0.000041998657,0.00007715664,0.00045467296],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982405,0.0004159644,0.00010766102,0.00039647505,0.0006377643,0.00020165739],"domain_scores_gemma":[0.99603695,0.0018924553,0.00076318,0.00077610975,0.00038984144,0.00014152136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015802386,0.0006444894,0.0005334739,0.00051617925,0.00040612862,0.0013646919,0.0011812449,0.00048037944,0.0007330854],"category_scores_gemma":[0.005955093,0.00034096447,0.00042963686,0.00029456313,0.0011570107,0.0014258864,0.001091608,0.0007366475,0.000098151424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064172427,0.00023126895,0.01044054,0.0003696397,0.00011841512,0.00086278736,0.0008260403,0.6855042,0.13729343,0.038285356,0.0007695721,0.1246571],"study_design_scores_gemma":[0.000031918782,0.00015687665,0.0020754486,0.00001986799,0.00004852291,0.00013557795,0.00007206425,0.95625466,0.031635128,0.008436193,0.0011142073,0.000019593383],"about_ca_topic_score_codex":0.0014945399,"about_ca_topic_score_gemma":0.0013190599,"teacher_disagreement_score":0.0015802386,"about_ca_system_score_codex":0.0007611053,"about_ca_system_score_gemma":0.0011261839,"threshold_uncertainty_score":0.008357227},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012497548206931663,"score_gpt":0.24228981722200948,"score_spread":0.22979226901507782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058980727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064673476,0.0018844233,0.91391647,0.0025059034,0.00038916207,0.00028440767,0.00018266014,0.0014751683,0.014688304],"genre_scores_gemma":[0.8459616,0.0011009404,0.14678207,0.0008118012,0.00027393756,0.00027922838,0.00014525632,0.00043856647,0.004206562],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98925495,0.004372646,0.0008427684,0.0010189348,0.0031580345,0.0013527314],"domain_scores_gemma":[0.97005886,0.013981226,0.0042472775,0.006805255,0.0035043901,0.0014031284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012506749,0.0012081636,0.0009855325,0.0008325514,0.0013916927,0.0042407312,0.0025290644,0.000992426,0.00330195],"category_scores_gemma":[0.031390335,0.00088051567,0.00078986335,0.0009785546,0.0021456094,0.006724085,0.0033293637,0.0041396767,0.00080752705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079024694,0.00021196957,0.003607289,0.00063097983,0.00019090583,0.00054292264,0.0010594522,0.39984486,0.028588038,0.44926164,0.010163466,0.105108276],"study_design_scores_gemma":[0.00016080974,0.0003927257,0.0010372836,0.00026075277,0.00015344513,0.0006237299,0.00036866948,0.7477265,0.035709642,0.16557105,0.047876175,0.00011927343],"about_ca_topic_score_codex":0.0018858551,"about_ca_topic_score_gemma":0.002594247,"teacher_disagreement_score":0.012506749,"about_ca_system_score_codex":0.0022938463,"about_ca_system_score_gemma":0.0060601467,"threshold_uncertainty_score":0.0661428},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02522899895287399,"score_gpt":0.2600384088994585,"score_spread":0.2348094099465845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061663604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34818512,0.00521723,0.62515306,0.0009452576,0.00069960556,0.00019480505,0.00022511827,0.001974127,0.017405616],"genre_scores_gemma":[0.9265469,0.00037273657,0.06964372,0.00012400254,0.00009472391,0.000058948724,0.000117212956,0.0001079032,0.0029338377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994741,0.00012769223,0.00003605704,0.00007909294,0.00013769766,0.00014532651],"domain_scores_gemma":[0.99902976,0.00025613402,0.00012543838,0.0002339081,0.00022949876,0.00012536961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146821,0.0004926933,0.00046745926,0.00047073982,0.00096540817,0.0010650718,0.0014142428,0.0003432455,0.0021812143],"category_scores_gemma":[0.0019601171,0.00033359,0.0002553497,0.00080297375,0.00034464334,0.00087123865,0.0008630884,0.00071490667,0.00026139859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018642318,0.00039260817,0.002667347,0.0004629089,0.00014191467,0.00024549165,0.00034540723,0.65764374,0.04157452,0.03309243,0.013248348,0.24832103],"study_design_scores_gemma":[0.000081764185,0.00023752851,0.0007435671,0.000018019318,0.000050198945,0.00007488756,0.00007501494,0.97047687,0.012010904,0.010887196,0.0053266003,0.00001750581],"about_ca_topic_score_codex":0.0027472982,"about_ca_topic_score_gemma":0.0090529965,"teacher_disagreement_score":0.0027472982,"about_ca_system_score_codex":0.0009160378,"about_ca_system_score_gemma":0.0021284483,"threshold_uncertainty_score":0.00729686},"labels":[],"label_agreement":null},{"id":"W2065796454","doi":"10.1109/aspdac.2015.7059079","title":"Enhanced partitioned scheduling of Mixed-Criticality Systems on multicore platforms","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Mixed criticality; Criticality; Computer science; Schedule; Distributed computing; Scheduling (production processes); Multi-core processor; Processor scheduling; Parallel computing; Mathematical optimization; Operating system; Mathematics","score_opus":0.0594319153625985,"score_gpt":0.28819052923786537,"score_spread":0.22875861387526686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065796454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39380008,0.00060050597,0.600614,0.00013107334,0.00008795921,0.00011112789,0.00005530144,0.00081084034,0.0037891534],"genre_scores_gemma":[0.7915632,0.00013569642,0.20647424,0.000046064368,0.000026111893,0.000067148336,0.00010532149,0.00009312441,0.0014889635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997197,0.00008685639,0.000016457605,0.000042249318,0.000074578216,0.000060132283],"domain_scores_gemma":[0.9994062,0.00023642102,0.000076571596,0.00007939658,0.00013031902,0.00007101707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041549554,0.0005927111,0.00027866417,0.00037121764,0.00032872966,0.00038686214,0.0005780187,0.00021550574,0.00088398496],"category_scores_gemma":[0.0011700445,0.00021419532,0.00021182356,0.0002717732,0.00022529774,0.0005542313,0.0005813052,0.00043342405,0.00013652832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005930693,0.00018546481,0.0019638098,0.0001963959,0.000062639134,0.00026252994,0.00023630375,0.6668221,0.15941541,0.010458278,0.0016946512,0.15810934],"study_design_scores_gemma":[0.000038220158,0.00016199579,0.0005442748,0.0000063408793,0.000012613712,0.000049518945,0.00002593265,0.97518325,0.019163715,0.002741161,0.0020652944,0.000007680078],"about_ca_topic_score_codex":0.0014872468,"about_ca_topic_score_gemma":0.0033236458,"teacher_disagreement_score":0.0014872468,"about_ca_system_score_codex":0.00040919986,"about_ca_system_score_gemma":0.0006600705,"threshold_uncertainty_score":0.002968967},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01003870821449935,"score_gpt":0.25061897766589064,"score_spread":0.2405802694513913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066719875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13500416,0.0005819923,0.85950625,0.00019169002,0.000047881073,0.00009756176,0.00013346435,0.00048144403,0.003955508],"genre_scores_gemma":[0.958675,0.00017889218,0.040043056,0.00004737112,0.00005124775,0.00011000437,0.00012585329,0.00008936275,0.00067932886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986958,0.0004397212,0.00004615647,0.0001823923,0.00039230683,0.00024360532],"domain_scores_gemma":[0.99726737,0.0018441458,0.00034376755,0.00023145333,0.00023921164,0.00007408912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020604655,0.0011362929,0.00073591294,0.001024462,0.00043058582,0.00066594564,0.0006621488,0.00037899343,0.0011743949],"category_scores_gemma":[0.0044403076,0.00029016638,0.0007783169,0.00057205104,0.0008081737,0.0007236642,0.0006630759,0.0007090965,0.00014275097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002291563,0.000054737764,0.0018300301,0.00012568147,0.00007319785,0.00020602235,0.00011912328,0.9334584,0.012502606,0.023775255,0.00071860815,0.026907168],"study_design_scores_gemma":[0.000012492018,0.00007383092,0.00036337643,0.000007174794,0.000013298889,0.000025037763,0.000016938475,0.9878671,0.0024604276,0.008882002,0.00027188877,0.0000064509163],"about_ca_topic_score_codex":0.0018994224,"about_ca_topic_score_gemma":0.0012094025,"teacher_disagreement_score":0.0020604655,"about_ca_system_score_codex":0.00095068244,"about_ca_system_score_gemma":0.0015048211,"threshold_uncertainty_score":0.010896862},"labels":[],"label_agreement":null},{"id":"W2069919236","doi":"10.1145/2185395.2185398","title":"Sharp utilization thresholds for some realtime scheduling problems","year":2012,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Aperiodic graph; Workload; Scheduling (production processes); Power consumption; Schedule; Real-time computing; Context switch; Distributed computing; Embedded system; Power (physics); Mathematical optimization; Operating system; Mathematics","score_opus":0.2117957622850598,"score_gpt":0.38399782703129776,"score_spread":0.17220206474623795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069919236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25922066,0.008332075,0.70721173,0.0038419568,0.00020055947,0.00022784807,0.00042765218,0.0014406994,0.019096844],"genre_scores_gemma":[0.92760515,0.0014780067,0.06783254,0.0003978487,0.0002685981,0.00022377986,0.00025271633,0.00012401011,0.0018174029],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978498,0.000586974,0.0002170249,0.00037371126,0.0006332326,0.00033935168],"domain_scores_gemma":[0.979002,0.0171145,0.001953001,0.00060345023,0.0007166165,0.0006104866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030766344,0.00080741703,0.0009861571,0.0018346241,0.0006808174,0.0025513675,0.000859147,0.0012520953,0.0017497604],"category_scores_gemma":[0.025944997,0.00056316087,0.0007912242,0.0015256752,0.0017196522,0.0027462125,0.0012762934,0.0024898117,0.00024476057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005354233,0.00028132755,0.008791676,0.0008311539,0.00014859464,0.0012309187,0.0010686103,0.26735204,0.012438504,0.61231565,0.0061643217,0.08884186],"study_design_scores_gemma":[0.000056712797,0.00015381376,0.0020873921,0.000093993716,0.000025517522,0.00044009686,0.00019381354,0.53475124,0.0027203355,0.45663467,0.0027967526,0.000045661018],"about_ca_topic_score_codex":0.00127994,"about_ca_topic_score_gemma":0.0004667486,"teacher_disagreement_score":0.0030766344,"about_ca_system_score_codex":0.0016207773,"about_ca_system_score_gemma":0.000813274,"threshold_uncertainty_score":0.016270936},"labels":[],"label_agreement":null},{"id":"W2072081880","doi":"10.1142/s0129626405002404","title":"Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Shortest path problem; Dynamic priority scheduling; Computer science; Scheduling (production processes); Loop (graph theory); Mathematical optimization; Fair-share scheduling; Dynamic programming; Feedback loop; Algorithm; Parallel computing; Mathematics; Theoretical computer science; Schedule; Graph","score_opus":0.02596882797196698,"score_gpt":0.30003898314699856,"score_spread":0.2740701551750316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072081880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068778647,0.000111250716,0.9905364,0.000058553545,0.000053494154,0.00005354341,0.000020812446,0.00054187584,0.0017463089],"genre_scores_gemma":[0.37840736,0.00034368254,0.61734325,0.00010388235,0.00009244731,0.00032181572,0.0001409543,0.00026697735,0.0029796618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996686,0.00009685506,0.000011989987,0.000050259678,0.00013394952,0.000038342758],"domain_scores_gemma":[0.9995365,0.00024761702,0.00003363687,0.00005124023,0.00010498092,0.000026131618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512515,0.00063338433,0.000508991,0.00062349613,0.0005628333,0.0003647399,0.00085667946,0.0005278473,0.0030421505],"category_scores_gemma":[0.0015582703,0.00019869524,0.0003913426,0.00064915913,0.0005660378,0.0006397485,0.0006877381,0.0008400713,0.0004236131],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024106172,0.00015270356,0.0002941254,0.00021939313,0.000043788626,0.00010276446,0.00016345263,0.5168062,0.033459514,0.044752914,0.00421751,0.39954656],"study_design_scores_gemma":[0.000042483298,0.000110558125,0.00007449725,0.0000075358253,0.000008148536,0.00003813575,0.000013172678,0.9782568,0.006239009,0.011151338,0.0040469365,0.000011320914],"about_ca_topic_score_codex":0.0028719094,"about_ca_topic_score_gemma":0.0023112535,"teacher_disagreement_score":0.0030421505,"about_ca_system_score_codex":0.0005480914,"about_ca_system_score_gemma":0.0010669525,"threshold_uncertainty_score":0.010177016},"labels":[],"label_agreement":null},{"id":"W2075573329","doi":"10.1145/1806546.1806553","title":"Realtime paradigms needed post Ada 2005","year":2010,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Concurrency; Multiprocessing; Scheduling (production processes); Blocking (statistics); Programming language; Concurrency control; Distributed computing; Parallel computing; Computer architecture; Computer network","score_opus":0.007968287309009604,"score_gpt":0.220578211781564,"score_spread":0.2126099244725544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075573329","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014326574,0.016728967,0.24318838,0.10416773,0.057844326,0.00025893157,0.00048775497,0.0057592588,0.55723804],"genre_scores_gemma":[0.20727995,0.013362946,0.25266486,0.030644098,0.018519636,0.00046516725,0.0009215215,0.0026140234,0.47352773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969764,0.00058209285,0.0002208183,0.0003384594,0.0014407142,0.00044154798],"domain_scores_gemma":[0.9960252,0.0006358173,0.00027690353,0.0006470293,0.0015632366,0.00085174345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063211326,0.00065651676,0.0003313402,0.0007147221,0.0017155085,0.0057286685,0.0012221582,0.0021429881,0.030883867],"category_scores_gemma":[0.0068731327,0.00057019695,0.0005645625,0.00042460082,0.001676968,0.004909178,0.0019213477,0.006294774,0.010611171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016442861,0.00010216024,0.00026114788,0.00023965075,0.000010166305,0.00030523332,0.0012118744,0.00077652803,0.0072355843,0.6443093,0.182717,0.16266699],"study_design_scores_gemma":[0.000028792225,0.00006713477,0.000115315284,0.00007904014,0.000004345098,0.00017750534,0.00012061541,0.000832298,0.0012323239,0.02674169,0.9705866,0.000014411353],"about_ca_topic_score_codex":0.0023693577,"about_ca_topic_score_gemma":0.0029336615,"teacher_disagreement_score":0.030883867,"about_ca_system_score_codex":0.0030081647,"about_ca_system_score_gemma":0.0030654082,"threshold_uncertainty_score":0.10331684},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026221074564777215,"score_gpt":0.28290320673529623,"score_spread":0.256682132170519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077288229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01784292,0.0006751096,0.97841716,0.000237522,0.00009167426,0.00009863203,0.000012791124,0.00029225933,0.0023318909],"genre_scores_gemma":[0.5384644,0.0008130099,0.45464587,0.00021058018,0.0001508344,0.00051658595,0.00007949567,0.00024255367,0.004876578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760866,0.0009740831,0.00012738658,0.00039447754,0.00068591017,0.00020941833],"domain_scores_gemma":[0.99593276,0.0023073822,0.00053743983,0.00055834925,0.00048444947,0.00017966407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002921085,0.0012670845,0.0012056401,0.0008679,0.00090587063,0.0015680732,0.0012320487,0.0010391987,0.0035436044],"category_scores_gemma":[0.0055855876,0.000776317,0.0011795346,0.0011365467,0.0010309936,0.0017043808,0.0020238457,0.001923941,0.0005028129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026941547,0.00025721267,0.0010527843,0.00031287185,0.000101997255,0.00014061466,0.00019503637,0.79814106,0.014352576,0.0478712,0.0015105043,0.13579477],"study_design_scores_gemma":[0.000030392885,0.00013137862,0.00016880162,0.000016261747,0.000033767727,0.000068037596,0.000023261244,0.9804734,0.0044342712,0.011638718,0.0029692757,0.000012534398],"about_ca_topic_score_codex":0.0008625536,"about_ca_topic_score_gemma":0.001759054,"teacher_disagreement_score":0.0035436044,"about_ca_system_score_codex":0.001189561,"about_ca_system_score_gemma":0.002553905,"threshold_uncertainty_score":0.015448391},"labels":[],"label_agreement":null},{"id":"W2077767213","doi":"10.2316/journal.201.2006.2.201-1590","title":"INTEGRATING SCHEDULABILITY ANALYSIS WITH UML-RT","year":2006,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Trojan Technologies (Canada); Western University","funders":"","keywords":"Computer science; Unified Modeling Language; Programming language; Embedded system; Software","score_opus":0.006569264102072286,"score_gpt":0.20934826600190576,"score_spread":0.20277900189983347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077767213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026078613,0.00009043872,0.99212974,0.00010177438,0.000030565177,0.000050371546,0.000031102845,0.0031924178,0.0017657912],"genre_scores_gemma":[0.09271571,0.00025736788,0.9039523,0.000083619605,0.00007072961,0.00017237797,0.00024082388,0.0006481579,0.00185888],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961597,0.0015643053,0.00038374084,0.00033130063,0.0012845247,0.00027651706],"domain_scores_gemma":[0.9924414,0.0043740356,0.0009288471,0.0010298495,0.0011423118,0.0000835579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054365955,0.00098493,0.00052392774,0.002683616,0.00054246956,0.001767511,0.0013181022,0.00080624764,0.003467287],"category_scores_gemma":[0.011080706,0.0006433443,0.0013038435,0.00065154297,0.00072179834,0.0024369797,0.0008888939,0.0010658335,0.0014413752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023223272,0.0002796193,0.0032233328,0.0006310509,0.00018124843,0.0008288188,0.0010718442,0.22344917,0.038796876,0.21166721,0.005653051,0.5139856],"study_design_scores_gemma":[0.000056319674,0.000084013765,0.00057161564,0.00015653549,0.000092532624,0.0003288538,0.00014085084,0.871116,0.028111022,0.06926449,0.030007932,0.00006979615],"about_ca_topic_score_codex":0.0037973695,"about_ca_topic_score_gemma":0.0023329651,"teacher_disagreement_score":0.0054365955,"about_ca_system_score_codex":0.0013022027,"about_ca_system_score_gemma":0.0021172059,"threshold_uncertainty_score":0.02875185},"labels":[],"label_agreement":null},{"id":"W2077895634","doi":"10.1115/detc2013-13450","title":"Handling Overruns and Underruns of Real-Time Processes With Precedence and Exclusion Relations Using a Pre-Run-Time Schedule","year":2013,"lang":"en","type":"article","venue":"Volume 4: 18th Design for Manufacturing and the Life Cycle Conference; 2013 ASME/IEEE International Conference on Mechatronic and Embedded Systems and Applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Computation; Scheduling (production processes); Schedule; Robustness (evolution); Real-time computing; Execution time; Process (computing); Processor scheduling; Real-time operating system; Set (abstract data type); Distributed computing; Algorithm; Mathematical optimization; Embedded system; Operating system","score_opus":0.03514028571180008,"score_gpt":0.26795708051567024,"score_spread":0.23281679480387016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077895634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15691894,0.000518376,0.8365005,0.000108485365,0.00015506089,0.00037772226,0.000047274847,0.0029833864,0.0023902294],"genre_scores_gemma":[0.6547513,0.00030697507,0.34188077,0.00007764796,0.000078922945,0.0002297228,0.0001567844,0.00037742092,0.002140616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980393,0.00035401346,0.00018450154,0.00029709432,0.0009141188,0.00021100699],"domain_scores_gemma":[0.99605197,0.0011747886,0.00089397846,0.000904174,0.0007855439,0.0001895568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020472,0.0011595257,0.00072179735,0.0009609775,0.000745798,0.0006446958,0.0012007973,0.00033730458,0.0011937107],"category_scores_gemma":[0.0054139122,0.0005340712,0.000579097,0.00047097765,0.0005537157,0.0010779996,0.00087082613,0.0011769992,0.00028536364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017438098,0.00050722447,0.013182095,0.0005724549,0.00022363673,0.0027325694,0.0016433274,0.29669097,0.22407085,0.015019753,0.0025486092,0.44106466],"study_design_scores_gemma":[0.00016035931,0.0015618731,0.0050470536,0.0000814185,0.0002492031,0.0012407199,0.00034076333,0.81133974,0.15559322,0.009129025,0.015135122,0.00012154423],"about_ca_topic_score_codex":0.002836395,"about_ca_topic_score_gemma":0.0047846925,"teacher_disagreement_score":0.002836395,"about_ca_system_score_codex":0.0004771122,"about_ca_system_score_gemma":0.003041993,"threshold_uncertainty_score":0.010685444},"labels":[],"label_agreement":null},{"id":"W2079084512","doi":"10.1109/ecrts.2012.30","title":"Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Finite-state machine; Automotive industry; Software; Model checking; Distributed computing; Task (project management); State (computer science); Embedded system; Algorithm; Programming language; Systems engineering; Engineering","score_opus":0.015777348359783457,"score_gpt":0.27914020879303925,"score_spread":0.2633628604332558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079084512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26254147,0.00014959944,0.73435396,0.000074498115,0.00001716954,0.00005847536,0.00004244961,0.00039487646,0.0023674641],"genre_scores_gemma":[0.95953894,0.00007420839,0.039589755,0.000016733495,0.000020051777,0.00007983644,0.00006735141,0.000048601833,0.0005645407],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881256,0.0003319505,0.00007364836,0.00015902086,0.00044662945,0.00017619722],"domain_scores_gemma":[0.99588287,0.002830478,0.0004779102,0.00035345208,0.00035907188,0.000096157295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019839667,0.0005495512,0.00049725233,0.00069121964,0.00032888795,0.00065696647,0.0009008084,0.00040581106,0.0007601673],"category_scores_gemma":[0.006682588,0.00033475185,0.0006242626,0.00034294903,0.00075307506,0.0007720786,0.00042783635,0.00046536274,0.000114709575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030740717,0.00011098915,0.002234025,0.00011290246,0.000049057955,0.00018649723,0.00015812379,0.8874901,0.03992418,0.047204573,0.00029924235,0.021922978],"study_design_scores_gemma":[0.000010023162,0.000035270226,0.00018256147,0.0000031073382,0.0000069655102,0.000009408736,0.000008375943,0.99010694,0.0038106837,0.005689974,0.00013292946,0.0000037105624],"about_ca_topic_score_codex":0.0022515003,"about_ca_topic_score_gemma":0.0018588691,"teacher_disagreement_score":0.0022515003,"about_ca_system_score_codex":0.0009542702,"about_ca_system_score_gemma":0.001377303,"threshold_uncertainty_score":0.010492384},"labels":[],"label_agreement":null},{"id":"W2080598508","doi":"10.1145/2380356.2380402","title":"Runtime verification of real-time embedded systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Runtime verification; Overhead (engineering); Embedded system; State (computer science); Set (abstract data type); Distributed computing; Formal verification; Real-time computing; Operating system; Programming language","score_opus":0.015646658073536854,"score_gpt":0.24537498319912207,"score_spread":0.22972832512558522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080598508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068284236,0.00075757777,0.9222862,0.00022446043,0.00012547098,0.000059406248,0.00017597177,0.0055307276,0.002555883],"genre_scores_gemma":[0.85884464,0.00038167607,0.13843107,0.000087690525,0.00008900708,0.00009983047,0.00029063268,0.00043910227,0.001336361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942259,0.0018810936,0.000431291,0.00079475384,0.0021981644,0.0004687347],"domain_scores_gemma":[0.9901872,0.0046516606,0.0012322889,0.0025981688,0.0011353692,0.00019519158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035022134,0.0007853684,0.00072168285,0.0008215236,0.0003889557,0.001668227,0.001606001,0.0008618704,0.0015682412],"category_scores_gemma":[0.01060486,0.00052771025,0.00096796395,0.0005113707,0.0013959289,0.0021141497,0.0011675017,0.001291941,0.00047703512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013581993,0.0002043755,0.003709817,0.0009686833,0.00019452134,0.0010373453,0.0005260596,0.54178715,0.14168611,0.14083508,0.0025836877,0.16510898],"study_design_scores_gemma":[0.000106861175,0.00018633241,0.0007155144,0.000083623185,0.00005294943,0.0002214667,0.0000382371,0.87021077,0.068345875,0.055549264,0.0044484427,0.00004060982],"about_ca_topic_score_codex":0.0010060914,"about_ca_topic_score_gemma":0.000896428,"teacher_disagreement_score":0.0035022134,"about_ca_system_score_codex":0.000790474,"about_ca_system_score_gemma":0.0014522038,"threshold_uncertainty_score":0.018521726},"labels":[],"label_agreement":null},{"id":"W2086572751","doi":"10.1109/mesa.2008.4735659","title":"A Method for Satisfying Asynchronous and Periodic Timing Requirements in Real-Time Embedded Systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Asynchronous communication; Computer science; Scheduling (production processes); Exploit; Processor scheduling; Static timing analysis; Distributed computing; Real-time computing; Set (abstract data type); Real-time operating system; Execution time; Embedded system; Parallel computing; Schedule; Operating system; Computer network; Mathematical optimization","score_opus":0.0547061975615155,"score_gpt":0.31811253176463666,"score_spread":0.26340633420312115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086572751","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007153123,0.00008992636,0.99769324,0.00003114011,0.00005652949,0.000045704557,0.000015587579,0.00073166494,0.00062092696],"genre_scores_gemma":[0.025155412,0.0001519206,0.9712327,0.000071663795,0.00009090464,0.00025547214,0.000091226495,0.0003009451,0.0026496672],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971787,0.00057236606,0.00024534532,0.00048322714,0.001339851,0.00018060805],"domain_scores_gemma":[0.9962121,0.0017566854,0.00030779451,0.0007458341,0.0008408389,0.00013674956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018312564,0.0011467143,0.0010339362,0.001239348,0.0008923078,0.0015869372,0.0017753857,0.0011279167,0.0044559794],"category_scores_gemma":[0.0058232383,0.0007523993,0.0011631503,0.00089827477,0.0010275691,0.0020766153,0.0013313466,0.002159336,0.0024449364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005010322,0.00017996284,0.00060210045,0.00084090116,0.00011366979,0.00088645547,0.0006613297,0.04702616,0.092315294,0.15175459,0.012099389,0.69301915],"study_design_scores_gemma":[0.00040687152,0.0005703025,0.0005151718,0.00024910783,0.00015717397,0.0022388352,0.00018654425,0.6024058,0.104343906,0.12162337,0.16708596,0.00021694062],"about_ca_topic_score_codex":0.00089355465,"about_ca_topic_score_gemma":0.001091478,"teacher_disagreement_score":0.0044559794,"about_ca_system_score_codex":0.00060429797,"about_ca_system_score_gemma":0.0015775424,"threshold_uncertainty_score":0.014906764},"labels":[],"label_agreement":null},{"id":"W2086768946","doi":"10.1287/opre.49.1.145.11186","title":"Reducing Delay in Preemptive Repeat Priority Queues","year":2001,"lang":"en","type":"article","venue":"Operations Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Computer science; Computer network","score_opus":0.0850953309610087,"score_gpt":0.39908738632059065,"score_spread":0.31399205535958197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086768946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20406216,0.0010156385,0.78936076,0.00039396092,0.0001244264,0.000055355707,0.000051997904,0.0010731951,0.003862449],"genre_scores_gemma":[0.9362708,0.00044344336,0.059683837,0.00011661036,0.00009813491,0.000041845542,0.000045281304,0.00007306614,0.0032270576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988397,0.0002941868,0.000040133313,0.00013151528,0.0004668686,0.00022764232],"domain_scores_gemma":[0.9972218,0.0016155638,0.0003201064,0.00028753374,0.00038875313,0.00016617421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015715873,0.0007095017,0.00069191033,0.0006202065,0.00063722156,0.00096338254,0.0018319356,0.0007268753,0.001317198],"category_scores_gemma":[0.0076000625,0.0003983676,0.0003568017,0.00062724785,0.0007410559,0.0017493757,0.0009071978,0.0007921246,0.00034754223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094734656,0.00031817952,0.0018302732,0.00013928406,0.000052328847,0.00023115295,0.00040701372,0.78705347,0.026717806,0.07638511,0.002141182,0.10377679],"study_design_scores_gemma":[0.00005978248,0.00021066886,0.00014495113,0.0000060519287,0.000023190543,0.00006398359,0.000028688844,0.97115535,0.005073712,0.021896865,0.0013224932,0.0000143237185],"about_ca_topic_score_codex":0.00375968,"about_ca_topic_score_gemma":0.0024858862,"teacher_disagreement_score":0.00375968,"about_ca_system_score_codex":0.0015944579,"about_ca_system_score_gemma":0.0017387286,"threshold_uncertainty_score":0.011568606},"labels":[],"label_agreement":null},{"id":"W2091258198","doi":"10.3166/jesa.39.15-30","title":"Langages et formalismes synchrones. Fondements","year":2005,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy; Medicine","score_opus":0.03547026241416085,"score_gpt":0.2911041812323508,"score_spread":0.25563391881819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091258198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005501462,0.04347618,0.8231044,0.005850119,0.0035037803,0.00021654391,0.001040208,0.001680294,0.1156271],"genre_scores_gemma":[0.28761804,0.060405865,0.52217954,0.004554161,0.007828533,0.0018076769,0.0034385351,0.00096133206,0.11120635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958508,0.0018256967,0.0003828686,0.00071810593,0.0010128008,0.00020979469],"domain_scores_gemma":[0.9977131,0.0013158531,0.00026775608,0.00032044284,0.00028090156,0.00010196075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004458102,0.0020798538,0.0008971821,0.0027880883,0.0019213622,0.0060702306,0.0012399466,0.003113886,0.008235459],"category_scores_gemma":[0.0049992595,0.001135952,0.0017947109,0.0028151646,0.0081440415,0.007316375,0.002135341,0.006190851,0.00428833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000080330365,0.0000051020006,0.000041808864,0.00006300572,0.0000055344367,0.000059231705,0.00022370531,0.000506742,0.00022442544,0.98982596,0.0017385766,0.0072979433],"study_design_scores_gemma":[0.000028344251,0.00002137191,0.00010460807,0.0001097612,0.000011955946,0.00032244026,0.00010248973,0.00306443,0.0006915791,0.7962758,0.19924167,0.000025597179],"about_ca_topic_score_codex":0.004485786,"about_ca_topic_score_gemma":0.0023787175,"teacher_disagreement_score":0.008235459,"about_ca_system_score_codex":0.0023575241,"about_ca_system_score_gemma":0.0016946847,"threshold_uncertainty_score":0.02755034},"labels":[],"label_agreement":null},{"id":"W2091327576","doi":"10.4271/2013-01-2211","title":"Model-Based Design Flow Driven by Integrated Modular Avionic Simulations","year":2013,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Avionics; Modular design; Integrated modular avionics; Computer science; Design flow; Flow (mathematics); Systems engineering; Computer architecture; Embedded system; Software engineering; Engineering; Aerospace engineering; Operating system","score_opus":0.01897410517486175,"score_gpt":0.24434386799700902,"score_spread":0.22536976282214727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091327576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008997412,0.000052663232,0.9826749,0.000070208036,0.000021627502,0.0002644194,0.00015829262,0.0025034153,0.005257033],"genre_scores_gemma":[0.16395462,0.0002434679,0.82670623,0.00006572552,0.000019161376,0.0010296601,0.0010420186,0.00088967633,0.0060494905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990277,0.0003006918,0.000048658818,0.00013572669,0.00040528583,0.00008192392],"domain_scores_gemma":[0.99885345,0.0006066032,0.00008017787,0.00017913892,0.00023795372,0.000042812495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016114194,0.0013638741,0.0006583601,0.0007942705,0.00048287577,0.0015095213,0.0016387664,0.000959933,0.008784289],"category_scores_gemma":[0.0032327306,0.0008627643,0.0013855571,0.00044084867,0.0006821748,0.00084254803,0.0014694786,0.0010855999,0.0018755712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012096407,0.00015484322,0.000925786,0.00032733608,0.000057658468,0.0002282532,0.00039492684,0.8769636,0.014675426,0.02936555,0.0019898813,0.0747958],"study_design_scores_gemma":[0.000035206725,0.00006656672,0.00014069158,0.00003703731,0.000022990016,0.000040398903,0.000035823985,0.97814196,0.0051270425,0.007244676,0.009093066,0.000014595209],"about_ca_topic_score_codex":0.0031152319,"about_ca_topic_score_gemma":0.003119267,"teacher_disagreement_score":0.008784289,"about_ca_system_score_codex":0.0009798948,"about_ca_system_score_gemma":0.0020092719,"threshold_uncertainty_score":0.029386401},"labels":[],"label_agreement":null},{"id":"W2092404446","doi":"10.1109/coginf.2007.4341935","title":"An Improved Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"","keywords":"Computer science; Scheduling (production processes); Algorithm; Processor scheduling; Task (project management); Variable (mathematics); Mathematical optimization; Mathematics; Engineering; Computer network","score_opus":0.010195615017997511,"score_gpt":0.25211947661488243,"score_spread":0.24192386159688492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092404446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027172549,0.0005034728,0.9692993,0.00008503411,0.00012525934,0.0000860313,0.000070253875,0.0014507968,0.0012073459],"genre_scores_gemma":[0.22827245,0.00023604707,0.76905704,0.000072259434,0.00005536679,0.00013033382,0.00029263832,0.0001492365,0.0017346584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997441,0.000047539783,0.000022145128,0.0000486063,0.000085273765,0.000052238935],"domain_scores_gemma":[0.9995491,0.000109411056,0.000045307934,0.000060592756,0.00018937992,0.000046261248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054298167,0.00056339224,0.00076145603,0.00092436885,0.00066131604,0.00046636173,0.0009066469,0.00031396915,0.0015588276],"category_scores_gemma":[0.0012051219,0.0002578982,0.00037995572,0.0008718254,0.00029153872,0.00068462593,0.00042702773,0.00057555584,0.0003044478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010570158,0.00017350637,0.002379185,0.00028736927,0.00006528642,0.00025495698,0.00039674516,0.20942457,0.075052515,0.024975907,0.009541805,0.6763912],"study_design_scores_gemma":[0.00017595885,0.00030954776,0.00078764657,0.000021729085,0.000039181607,0.00026730786,0.00005040368,0.9612537,0.019827068,0.0068890844,0.010322663,0.000055683187],"about_ca_topic_score_codex":0.005367128,"about_ca_topic_score_gemma":0.005011718,"teacher_disagreement_score":0.005367128,"about_ca_system_score_codex":0.00063528086,"about_ca_system_score_gemma":0.0018829483,"threshold_uncertainty_score":0.010671794},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020706576151137784,"score_gpt":0.2578143589089094,"score_spread":0.23710778275777164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092758480","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022110352,0.000052040705,0.9910671,0.00017931567,0.00007137407,0.000091036694,0.00033305574,0.0031473779,0.0028476452],"genre_scores_gemma":[0.1369382,0.0002840211,0.8530279,0.00029618002,0.00012455162,0.00038850366,0.0016589542,0.001776742,0.0055049146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976173,0.00061320193,0.00031377125,0.00032981718,0.00090856646,0.00021737159],"domain_scores_gemma":[0.9967443,0.0014062915,0.0003157759,0.00057481596,0.0008549839,0.00010372518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029640165,0.0011847578,0.0005998988,0.0014286871,0.00076405355,0.0031393436,0.0014845611,0.0013193011,0.0068312623],"category_scores_gemma":[0.005806762,0.0009113607,0.0019624159,0.0007856405,0.0013967062,0.0034998597,0.0018963018,0.0023302508,0.002477944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012505693,0.00015066385,0.00040063006,0.0003924584,0.00003847022,0.00042687682,0.000856785,0.025336929,0.012192896,0.8833369,0.004816661,0.07192567],"study_design_scores_gemma":[0.00016764889,0.00013375048,0.00031295585,0.00035389248,0.00013609535,0.00058018445,0.00028323176,0.24493393,0.031371072,0.5730417,0.14857936,0.00010626636],"about_ca_topic_score_codex":0.0034480726,"about_ca_topic_score_gemma":0.0037521415,"teacher_disagreement_score":0.0068312623,"about_ca_system_score_codex":0.0011287353,"about_ca_system_score_gemma":0.0024528552,"threshold_uncertainty_score":0.022852838},"labels":[],"label_agreement":null},{"id":"W2093171649","doi":"10.4271/2015-01-0176","title":"Non-Intrusive Tracing at First Instruction","year":2015,"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":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"Division of Electrical, Communications and Cyber Systems; Bundesministerium für Bildung und Forschung","keywords":"Computer science; Tracing; Programming language","score_opus":0.016572299357048573,"score_gpt":0.24463591183015562,"score_spread":0.22806361247310705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093171649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035507154,0.001071945,0.5239853,0.0010558177,0.0017190877,0.0008214498,0.0047131493,0.190587,0.24053903],"genre_scores_gemma":[0.4467948,0.00079314323,0.20379987,0.0014779984,0.00037200504,0.00058595533,0.005737461,0.018137313,0.32230148],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9982962,0.0001483555,0.0000847036,0.00035840305,0.00088103977,0.00023131084],"domain_scores_gemma":[0.9957196,0.0006936041,0.00019498177,0.0022843545,0.0009780575,0.00012934074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006899662,0.0015226542,0.00077519706,0.0020670039,0.0009515832,0.0021207782,0.0019335019,0.001286882,0.09367456],"category_scores_gemma":[0.004749868,0.0005773121,0.0004790839,0.001312122,0.00062402524,0.0027571216,0.00260893,0.0020074206,0.06578526],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000877759,0.00026363073,0.0041573024,0.0003155168,0.000043122312,0.0008969168,0.0008316472,0.0027334392,0.05166693,0.023250038,0.15346488,0.76149875],"study_design_scores_gemma":[0.00009229583,0.00035235228,0.0033992685,0.0002522389,0.00006446366,0.00165136,0.00041453962,0.06282527,0.19569594,0.020637175,0.7144678,0.00014726119],"about_ca_topic_score_codex":0.0028071401,"about_ca_topic_score_gemma":0.0029960575,"teacher_disagreement_score":0.09367456,"about_ca_system_score_codex":0.00083208864,"about_ca_system_score_gemma":0.0014034556,"threshold_uncertainty_score":0.31337267},"labels":[],"label_agreement":null},{"id":"W2098255117","doi":"10.1109/etfa.2008.4638584","title":"Hardware acceleration for verifiable, adaptive real-time communication","year":2008,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Ethernet; Embedded system; Real-time communication; Ethernet flow control; Verifiable secret sharing; Synchronous Ethernet; Network processor; Network interface controller; Computer hardware; Computer network; Network packet","score_opus":0.043795975690802846,"score_gpt":0.2580022255036337,"score_spread":0.21420624981283087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098255117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06458166,0.0013197219,0.9155692,0.000448323,0.00026840277,0.00011807611,0.000050574145,0.0051646936,0.012479324],"genre_scores_gemma":[0.72623956,0.000702912,0.2627931,0.00016014253,0.000099360725,0.00009410326,0.00012419284,0.00037187626,0.009414792],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991229,0.00015348141,0.000042824286,0.00009957363,0.00045610682,0.00012508786],"domain_scores_gemma":[0.99725336,0.0010728773,0.00031541302,0.00073984393,0.00048754015,0.0001309585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077839417,0.00057201716,0.00034304644,0.00046855022,0.00038270466,0.0009659856,0.0012432999,0.00041902388,0.005811132],"category_scores_gemma":[0.003804236,0.0003218729,0.0002732638,0.00048456795,0.00069486187,0.0014957857,0.0007009763,0.0014765272,0.0013484765],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011076855,0.00022524447,0.0028821505,0.00081931846,0.00006552688,0.00036669316,0.0004930839,0.11081051,0.23066102,0.18066974,0.013374534,0.45852458],"study_design_scores_gemma":[0.00017044571,0.0008376656,0.0019128158,0.00011965279,0.000085270454,0.00039895374,0.000103531005,0.70173424,0.18511668,0.03530973,0.07413147,0.0000795178],"about_ca_topic_score_codex":0.0012827604,"about_ca_topic_score_gemma":0.0018844203,"teacher_disagreement_score":0.005811132,"about_ca_system_score_codex":0.00093485566,"about_ca_system_score_gemma":0.0011064907,"threshold_uncertainty_score":0.019440174},"labels":[],"label_agreement":null},{"id":"W2101252418","doi":"10.1109/ccece.2005.1557033","title":"Fault-tolerant scheduling of real-time tasks having software faults","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Fixed-priority pre-emptive scheduling; Scheduling (production processes); Fair-share scheduling; Earliest deadline first scheduling; Dynamic priority scheduling; Two-level scheduling; Ethernet; Distributed computing; Embedded system; Rate-monotonic scheduling; Round-robin scheduling; Real-time computing; Parallel computing; Operating system; Schedule; Engineering","score_opus":0.00979710778240044,"score_gpt":0.23305001638844494,"score_spread":0.2232529086060445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101252418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38156864,0.00047923138,0.6155523,0.00014480502,0.0001313436,0.00006853751,0.000035833484,0.00036872458,0.001650663],"genre_scores_gemma":[0.9227935,0.0001875413,0.07603018,0.000027511986,0.000054023123,0.00004288262,0.000053760596,0.000035125537,0.00077558286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967027,0.0000916401,0.000028416134,0.000060991228,0.00008597222,0.00006278571],"domain_scores_gemma":[0.99912757,0.00030368517,0.00016545533,0.00015933305,0.00015757953,0.00008642077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005420127,0.00034313378,0.00046252154,0.0003308052,0.00043409222,0.00042034735,0.00086759275,0.0003327765,0.00059028267],"category_scores_gemma":[0.0017418291,0.00018878143,0.0002629619,0.00040140736,0.00032423055,0.00062376424,0.00031396016,0.00032337112,0.00012921458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013823642,0.00022114364,0.002093932,0.00033259642,0.000071867755,0.0005646005,0.00037578342,0.65830684,0.10549633,0.02607935,0.00190131,0.20317385],"study_design_scores_gemma":[0.00006351054,0.00037165277,0.0008127132,0.000009353504,0.000022470202,0.00016118145,0.000064543485,0.9641288,0.022148972,0.0097108735,0.0024944986,0.0000112963135],"about_ca_topic_score_codex":0.0007290429,"about_ca_topic_score_gemma":0.00058971136,"teacher_disagreement_score":0.00086759275,"about_ca_system_score_codex":0.00039525138,"about_ca_system_score_gemma":0.0005743007,"threshold_uncertainty_score":0.0028677583},"labels":[],"label_agreement":null},{"id":"W2101256398","doi":"10.1109/date.2006.244063","title":"Soft-error classification and impact analysis on real-time operating systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Real-time computing; Reliability (semiconductor); Real-time operating system; Embedded operating system; Synchronization (alternating current); Kernel (algebra); Reliability engineering; Operating system; Engineering","score_opus":0.020779820711367913,"score_gpt":0.28049328799348616,"score_spread":0.25971346728211825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101256398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8775629,0.0012160379,0.1172199,0.00027056417,0.0000869361,0.00005456565,0.0002054155,0.0008681112,0.0025156806],"genre_scores_gemma":[0.9954276,0.000101338126,0.00394791,0.000026955151,0.000027084558,0.000010853415,0.00008938463,0.00004820693,0.00032065075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942701,0.0015142902,0.00028043802,0.0005644586,0.0027505187,0.000620189],"domain_scores_gemma":[0.9320984,0.04869217,0.008465338,0.004749283,0.005350255,0.00064440176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037926193,0.0009477545,0.00090665906,0.0029730205,0.00046965582,0.0010828117,0.001005378,0.0006281871,0.002166497],"category_scores_gemma":[0.04090016,0.00028425522,0.0007775298,0.0016198263,0.0012873325,0.0018381707,0.0011901486,0.0009488359,0.00024241282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094422005,0.00016480176,0.031748943,0.00023279394,0.00016324535,0.0004665479,0.0001567816,0.8958803,0.016945342,0.0046922793,0.000474661,0.04813009],"study_design_scores_gemma":[0.000012311119,0.00017198602,0.015629144,0.000017041024,0.00006117549,0.0002358702,0.000052481446,0.9612507,0.017084906,0.005138008,0.00031286248,0.000033566157],"about_ca_topic_score_codex":0.002265458,"about_ca_topic_score_gemma":0.0010261339,"teacher_disagreement_score":0.0037926193,"about_ca_system_score_codex":0.0012175216,"about_ca_system_score_gemma":0.00065796426,"threshold_uncertainty_score":0.0200575},"labels":[],"label_agreement":null},{"id":"W2101352763","doi":"10.1109/ccece.1997.614840","title":"Prototyping from SDL specifications using a real-time concurrent logic language","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Programming language; Concurrency; Pascal (unit); Code generation; Logic programming; Operating system","score_opus":0.09950316168118911,"score_gpt":0.2848790944894809,"score_spread":0.1853759328082918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101352763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009044327,0.00003721201,0.98197067,0.00012844372,0.0000439001,0.00019042239,0.00008557664,0.0030231061,0.005476414],"genre_scores_gemma":[0.13121754,0.0002117197,0.86220986,0.00010396664,0.000021627104,0.00040119863,0.00049874844,0.00095869804,0.0043766582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699295,0.0009535503,0.00023645279,0.00018241291,0.0014312778,0.00020335548],"domain_scores_gemma":[0.99193454,0.0050800233,0.000353276,0.00092346355,0.0014801776,0.00022845635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038389843,0.0007089279,0.0004127822,0.00071147847,0.0005931002,0.0025744839,0.0015203253,0.00069131155,0.006435571],"category_scores_gemma":[0.012844507,0.00089273124,0.0010320654,0.00038487813,0.0012925221,0.0019922443,0.0017253344,0.0012507014,0.0016544611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055894145,0.00032054467,0.0015840149,0.0010804618,0.0000847051,0.002621638,0.002959724,0.33312204,0.08203116,0.34025735,0.008740023,0.22663939],"study_design_scores_gemma":[0.00031209152,0.00023211625,0.00016948351,0.00021405196,0.000044706238,0.00053268264,0.0002579597,0.7978321,0.089366816,0.045287363,0.06566756,0.00008313136],"about_ca_topic_score_codex":0.0015254798,"about_ca_topic_score_gemma":0.0022875573,"teacher_disagreement_score":0.006435571,"about_ca_system_score_codex":0.00090929726,"about_ca_system_score_gemma":0.0017151134,"threshold_uncertainty_score":0.021529138},"labels":[],"label_agreement":null},{"id":"W2102938079","doi":"10.1109/pacrim.2009.5291233","title":"Architectural support for greater predictability in real-time systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Predictability; Correctness; Scheduling (production processes); Processor scheduling; Worst-case execution time; Execution time; Architecture; Branch predictor; Distributed computing; Real-time operating system; Real-time computing; Parallel computing; Embedded system; Operating system; Programming language","score_opus":0.017620984503908164,"score_gpt":0.2587495972730983,"score_spread":0.24112861276919015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102938079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25359538,0.0051831715,0.71012306,0.0041260268,0.0005981001,0.000036904443,0.00009863405,0.0044260724,0.021812683],"genre_scores_gemma":[0.87513185,0.0019312858,0.11830816,0.00036102784,0.00046508244,0.00004413526,0.00010708429,0.00027723418,0.0033740008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942964,0.0001270504,0.00006749192,0.00006033378,0.00024278715,0.000072662144],"domain_scores_gemma":[0.99461406,0.0022499505,0.0006185934,0.0016242525,0.0007006239,0.00019247839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008972552,0.0003127136,0.0002591491,0.00047847783,0.00042558648,0.0015721103,0.00075266074,0.00052701,0.0034495906],"category_scores_gemma":[0.0057351114,0.00042281955,0.000287876,0.0006174033,0.0005373022,0.0023718218,0.0009981756,0.0015877329,0.00063622696],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030260294,0.00015697666,0.0078420825,0.0007533446,0.00009463668,0.0009845182,0.0012208455,0.1306538,0.211595,0.33404326,0.007103567,0.3052494],"study_design_scores_gemma":[0.00017402356,0.00047096406,0.008272423,0.00019937841,0.00021521834,0.0015424412,0.00052786287,0.53649807,0.11738023,0.23638387,0.09819267,0.00014276028],"about_ca_topic_score_codex":0.00029578788,"about_ca_topic_score_gemma":0.0009015498,"teacher_disagreement_score":0.0034495906,"about_ca_system_score_codex":0.00030650507,"about_ca_system_score_gemma":0.00048069158,"threshold_uncertainty_score":0.011539996},"labels":[],"label_agreement":null},{"id":"W2104956368","doi":"10.1109/ccece.2003.1226150","title":"A framework of a Web-based distributed control system","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Common Object Request Broker Architecture; Intranet; Distributed computing; Distributed object; Scheduling (production processes); Distributed design patterns; Distributed control system; The Internet; Operating system; Embedded system; Control (management); Distributed algorithm","score_opus":0.008766104420229582,"score_gpt":0.22999856498928242,"score_spread":0.22123246056905285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104956368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003174289,0.0004977967,0.9668921,0.0006691697,0.00016650342,0.0002921493,0.00013723197,0.0050405925,0.023130208],"genre_scores_gemma":[0.18893705,0.0010405275,0.7806876,0.00045695074,0.00027037945,0.0012738741,0.0006815777,0.0006485834,0.02600339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985933,0.0002791983,0.000108606815,0.00025762443,0.000634338,0.00012700536],"domain_scores_gemma":[0.99927014,0.00015256471,0.00004515141,0.00014365533,0.00020313339,0.0001854459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017510144,0.00085884496,0.0008508608,0.001223211,0.0014315451,0.004516106,0.0026334394,0.0020799332,0.008218997],"category_scores_gemma":[0.0013518687,0.0005701654,0.00086928875,0.0008314181,0.0023323137,0.0024486713,0.002120955,0.0018324074,0.002784626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010757267,0.00016577545,0.00049583387,0.0003154281,0.00007097396,0.00108801,0.00073478516,0.0857486,0.015169137,0.8169889,0.009957309,0.06915781],"study_design_scores_gemma":[0.00019365488,0.00023020347,0.00041397914,0.00029103665,0.00007287069,0.0006690144,0.00019528768,0.42742166,0.00805057,0.22229335,0.34005895,0.00010948724],"about_ca_topic_score_codex":0.0066596796,"about_ca_topic_score_gemma":0.0028097082,"teacher_disagreement_score":0.008218997,"about_ca_system_score_codex":0.0014601718,"about_ca_system_score_gemma":0.0029266959,"threshold_uncertainty_score":0.027495325},"labels":[],"label_agreement":null},{"id":"W2105364249","doi":"","title":"Time-Dependent Queueing Approach to Helicopter Allocation for Forest Fire Initial-Attack","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Queueing theory; Computer science; Operations research; Environmental science; Computer network; Engineering","score_opus":0.017771491835056316,"score_gpt":0.26692271264062745,"score_spread":0.24915122080557112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105364249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03846937,0.0010323888,0.9461794,0.0011521865,0.00023904628,0.00012534874,0.00030614718,0.00027831984,0.012217834],"genre_scores_gemma":[0.87166566,0.002142779,0.07987148,0.0002591361,0.00037384345,0.00027072337,0.00032416152,0.00018356288,0.044908606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993425,0.0001925616,0.000023581184,0.00013667053,0.0001271084,0.000177608],"domain_scores_gemma":[0.99835926,0.001088099,0.00013240092,0.000037203914,0.00028617613,0.00009688635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013900005,0.0010066787,0.0010123396,0.0009865288,0.0009691636,0.0018650903,0.0021476112,0.0014795511,0.00692319],"category_scores_gemma":[0.0038924594,0.0008234631,0.0010969202,0.0008994837,0.0010701403,0.0014244126,0.00090480654,0.0016355584,0.0005656403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020161646,0.00002738529,0.00043951767,0.000027398219,0.000013750884,0.00006471477,0.00006693831,0.9748166,0.00039244248,0.019849142,0.00071418734,0.0035676726],"study_design_scores_gemma":[0.0000024442465,0.0000043605455,0.000052499323,0.0000019171978,0.0000031761242,0.000002891494,0.000013708281,0.9979996,0.00003159537,0.0016623476,0.00022249113,0.000002968375],"about_ca_topic_score_codex":0.16933247,"about_ca_topic_score_gemma":0.095938586,"teacher_disagreement_score":0.16933247,"about_ca_system_score_codex":0.00730931,"about_ca_system_score_gemma":0.004603212,"threshold_uncertainty_score":0.3366937},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06099595997479199,"score_gpt":0.24463653615029624,"score_spread":0.18364057617550425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105700497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033427186,0.0009433284,0.98687553,0.00034556547,0.000058847356,0.000054349908,0.000033740256,0.00030900928,0.008036856],"genre_scores_gemma":[0.20939898,0.0031710637,0.7778297,0.00019373963,0.000110610505,0.00049938593,0.0002144623,0.00017106874,0.008410977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991078,0.00044404462,0.000042913583,0.00009166805,0.00025453005,0.00005910023],"domain_scores_gemma":[0.9993724,0.00031394156,0.00004303271,0.00015292982,0.000097753815,0.00001991083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012890022,0.00055442256,0.0004463707,0.0005686621,0.0005227575,0.0014705537,0.0010724774,0.00080380356,0.0029074992],"category_scores_gemma":[0.0019383555,0.00044960916,0.0006246542,0.000860753,0.00085873774,0.0023918902,0.000785258,0.0014798739,0.00071904354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004245519,0.000055779314,0.00031849623,0.00027047493,0.00003264466,0.00014920898,0.00021444539,0.3256562,0.003941267,0.57227755,0.0035038395,0.09353762],"study_design_scores_gemma":[0.000023114259,0.000042014202,0.0001265092,0.00006302455,0.00001626831,0.00007575651,0.00004662267,0.70115733,0.0022512444,0.25763452,0.038545806,0.000017686387],"about_ca_topic_score_codex":0.003042276,"about_ca_topic_score_gemma":0.0035407601,"teacher_disagreement_score":0.003042276,"about_ca_system_score_codex":0.0011264859,"about_ca_system_score_gemma":0.0017495506,"threshold_uncertainty_score":0.009726524},"labels":[],"label_agreement":null},{"id":"W2105856914","doi":"10.24908/pceea.v0i0.4004","title":"THE DESIGN OF AN EMBEDDED FRAMEWORK FOR PROGRAMMABLE AUTOMATION SYSTEMS","year":2011,"lang":"en","type":"article","venue":"Proceedings of the Canadian Engineering Education Association (CEEA)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Control reconfiguration; Automation; Computer science; Embedded system; Variety (cybernetics); Plug and play; Systems engineering; Simple (philosophy); Plug-in; Software engineering; Engineering; Programming language; Operating system; Artificial intelligence","score_opus":0.018586859495493546,"score_gpt":0.2262365182326218,"score_spread":0.20764965873712826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105856914","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071480605,0.0005829199,0.9834759,0.00012315014,0.00011563072,0.00019153909,0.00002857948,0.0012911793,0.007042987],"genre_scores_gemma":[0.13895236,0.000676385,0.8479993,0.00012943766,0.000059977956,0.0003265618,0.00012540254,0.00026005603,0.011470534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911314,0.00014509335,0.00006269001,0.00014580812,0.00038275958,0.00015047073],"domain_scores_gemma":[0.99969053,0.00007635125,0.00002497994,0.00005741625,0.00009220907,0.00005843695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011492135,0.0006304267,0.00038128736,0.00041743496,0.0005935924,0.0016141022,0.0017588424,0.0009671052,0.0027082828],"category_scores_gemma":[0.0011755795,0.00052166113,0.0007816796,0.0002585521,0.0009046696,0.0015435287,0.0012407646,0.0012889894,0.0007625624],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016130584,0.00012220361,0.0006650695,0.0005673928,0.00009721796,0.00096723536,0.0007860044,0.093672834,0.06630091,0.6076023,0.006980871,0.22207665],"study_design_scores_gemma":[0.00019737452,0.00054396177,0.00072918175,0.00029615642,0.00012724209,0.0011851075,0.00017218842,0.3936972,0.051422227,0.08404105,0.46743515,0.00015322324],"about_ca_topic_score_codex":0.001830914,"about_ca_topic_score_gemma":0.0021823603,"teacher_disagreement_score":0.0027082828,"about_ca_system_score_codex":0.0007415988,"about_ca_system_score_gemma":0.0014074683,"threshold_uncertainty_score":0.009060144},"labels":[],"label_agreement":null},{"id":"W2107033871","doi":"10.1109/ccece.2005.1557382","title":"Design of a real-time virtual machine (RTVM)","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Real-time operating system; Computer science; Embedded system; Operating system; Software; Virtual machine; Java; Embedded operating system; Architecture; Real-time communication","score_opus":0.012462642498357832,"score_gpt":0.222138398209625,"score_spread":0.20967575571126718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107033871","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013967825,0.00058812316,0.9751663,0.00020549726,0.00025241688,0.0003751118,0.000059507332,0.004505527,0.0048797177],"genre_scores_gemma":[0.32176733,0.0005911484,0.66917163,0.00030055322,0.000119109354,0.0006252402,0.00024003831,0.0006673192,0.0065177097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990188,0.00018941126,0.00010051798,0.00022722979,0.00030628213,0.000157758],"domain_scores_gemma":[0.99916124,0.00011904593,0.00012089527,0.00017474686,0.00030581644,0.00011819275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011681352,0.0004432267,0.0004770565,0.00043383535,0.00043774027,0.0014385388,0.0021061872,0.00094527635,0.0016631869],"category_scores_gemma":[0.002000879,0.0006066021,0.0005183736,0.00029059825,0.000706378,0.00128756,0.00085790147,0.0009010869,0.00082111236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083300506,0.0002686965,0.0050041424,0.0015479942,0.0002715847,0.0011265593,0.00097621843,0.17442808,0.19192319,0.15721297,0.024357138,0.44205043],"study_design_scores_gemma":[0.00033259927,0.0011190797,0.0019847697,0.00019461049,0.00025259372,0.001447463,0.00013415163,0.5818739,0.16344677,0.022550657,0.22651882,0.00014467466],"about_ca_topic_score_codex":0.00083135907,"about_ca_topic_score_gemma":0.0007256409,"teacher_disagreement_score":0.0021061872,"about_ca_system_score_codex":0.0006923962,"about_ca_system_score_gemma":0.0013527812,"threshold_uncertainty_score":0.0061777234},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017540417479876745,"score_gpt":0.26053523740452855,"score_spread":0.2429948199246518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107330110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48942378,0.0017548312,0.49731913,0.00035566592,0.00018205371,0.00035493978,0.0004038129,0.002611526,0.0075943805],"genre_scores_gemma":[0.9347498,0.00045008893,0.06359716,0.00003636985,0.000032139193,0.00009702077,0.00026728524,0.00012407108,0.00064613123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979284,0.0008662295,0.00008637675,0.00013367427,0.0007853334,0.00019996715],"domain_scores_gemma":[0.9850557,0.011542586,0.0008314954,0.0008875931,0.0013207723,0.0003617641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005533947,0.0008637094,0.0010186582,0.00140474,0.000530574,0.00084857066,0.0013669104,0.00068617635,0.0024096395],"category_scores_gemma":[0.012710399,0.00039216978,0.00066021713,0.0017576254,0.0007341663,0.001957834,0.0006342947,0.0006609761,0.0002120693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009185657,0.00026162498,0.0010610084,0.000138432,0.00005580691,0.000021463711,0.000057867637,0.941886,0.0018142102,0.0064656297,0.0008078546,0.046511635],"study_design_scores_gemma":[0.000034005952,0.00019182834,0.00022332648,0.000003846137,0.000021322736,0.0000073876367,0.000010612904,0.997006,0.00061392295,0.0017578674,0.00012535714,0.0000045304655],"about_ca_topic_score_codex":0.007935148,"about_ca_topic_score_gemma":0.005814188,"teacher_disagreement_score":0.007935148,"about_ca_system_score_codex":0.0021632933,"about_ca_system_score_gemma":0.0025549338,"threshold_uncertainty_score":0.029266655},"labels":[],"label_agreement":null},{"id":"W2108329019","doi":"10.1109/rtss.2007.8","title":"GD-Aggregate: A WAN Virtual Topology Building Tool for Hard Real-Time and Embedded Applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Throughput; Scalability; Network topology; Aggregate (composite); Flexibility (engineering); Distributed computing; Computer network; Topology (electrical circuits); Operating system; Engineering","score_opus":0.012919173009738943,"score_gpt":0.2782929154532574,"score_spread":0.26537374244351847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108329019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057306727,0.000114326496,0.97796863,0.000067899055,0.000037590482,0.000059745424,0.00025581813,0.013197345,0.0025680102],"genre_scores_gemma":[0.25513932,0.0005375306,0.7341318,0.0001201697,0.00005396262,0.00026549416,0.0014446593,0.0022670825,0.006039923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964476,0.00010152772,0.000030402247,0.00004663072,0.00014718619,0.00002956353],"domain_scores_gemma":[0.99923015,0.00027784513,0.000087051296,0.00019445355,0.0001440003,0.00006652683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012059634,0.00075955334,0.00042267746,0.0009117081,0.00036400833,0.0010658492,0.0013313942,0.0003936921,0.00510059],"category_scores_gemma":[0.0025173812,0.00036624723,0.0003805774,0.00067434506,0.00034101403,0.0015822742,0.00083564984,0.0008587157,0.0011678521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006514403,0.00015069768,0.0022027625,0.0004172108,0.00010297232,0.00030143646,0.00024588383,0.4177318,0.036298,0.08117685,0.03623208,0.4244888],"study_design_scores_gemma":[0.000058737536,0.000071869064,0.0002746099,0.000017120747,0.000028102917,0.00013290935,0.000026858479,0.9291596,0.015599808,0.01553679,0.039066803,0.000026775642],"about_ca_topic_score_codex":0.0012039175,"about_ca_topic_score_gemma":0.0020620644,"teacher_disagreement_score":0.00510059,"about_ca_system_score_codex":0.0005309701,"about_ca_system_score_gemma":0.00070959295,"threshold_uncertainty_score":0.01706314},"labels":[],"label_agreement":null},{"id":"W2108408615","doi":"10.1109/icma.2005.1626876","title":"A real-time scheduler design for fuzzy logic controller","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Interrupt; Scheduling (production processes); Real-time computing; Fuzzy logic; Fixed-priority pre-emptive scheduling; Real-time operating system; Embedded system; Kernel (algebra); Distributed computing; Dynamic priority scheduling; Rate-monotonic scheduling; Operating system; Artificial intelligence; Microcontroller; Engineering","score_opus":0.024108522253800155,"score_gpt":0.2516013792832937,"score_spread":0.2274928570294935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108408615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016268967,0.00034322691,0.9776195,0.00011017539,0.00017876513,0.00020151674,0.00005282977,0.0011405916,0.004084372],"genre_scores_gemma":[0.6686201,0.00027322953,0.32540444,0.000169094,0.0000908128,0.00030897176,0.00011818587,0.00008420128,0.0049310327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.00003403936,0.000024736617,0.00007442357,0.000115809176,0.000033576183],"domain_scores_gemma":[0.9997179,0.00004636084,0.000028280201,0.000023426604,0.00016270998,0.00002132325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051118364,0.0004055889,0.00034338117,0.00038982488,0.00054531195,0.0007642213,0.0009562046,0.0004951268,0.0026124178],"category_scores_gemma":[0.00069634017,0.00020359112,0.00037438583,0.00019812035,0.00023352428,0.00042729385,0.00018849115,0.00051458296,0.00047457035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008667482,0.000336497,0.0016771102,0.00069405494,0.00017716104,0.00052432396,0.0004442235,0.36277932,0.22010079,0.05307109,0.005542649,0.35378602],"study_design_scores_gemma":[0.00016083669,0.0002522,0.00043506865,0.000021996299,0.00005999371,0.00014981437,0.000023608645,0.947949,0.038365025,0.002869541,0.009681996,0.00003087755],"about_ca_topic_score_codex":0.0050070765,"about_ca_topic_score_gemma":0.004012086,"teacher_disagreement_score":0.0050070765,"about_ca_system_score_codex":0.00083493197,"about_ca_system_score_gemma":0.0014044457,"threshold_uncertainty_score":0.009955883},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06042743518341133,"score_gpt":0.2581025017501475,"score_spread":0.19767506656673617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109819183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026265515,0.0011195935,0.95437676,0.0004522243,0.00026630494,0.000094207644,0.0003425267,0.0011494157,0.015933346],"genre_scores_gemma":[0.67872953,0.0012792067,0.30836433,0.0003798887,0.00021507572,0.00021453755,0.0005000322,0.0004284303,0.009888899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984723,0.00029691975,0.000108141205,0.00029666105,0.0005849003,0.00024104645],"domain_scores_gemma":[0.99560624,0.0019926503,0.00035517866,0.0013004912,0.00049352087,0.0002519252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013064208,0.0007727082,0.00055030966,0.0006151449,0.0008026804,0.0015411269,0.00178761,0.00046380277,0.0037544006],"category_scores_gemma":[0.0055656373,0.00038960238,0.00048069062,0.0006868918,0.0014459334,0.0021317585,0.0015574612,0.0015147806,0.0006861443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028486588,0.00006506851,0.00082000264,0.00022201167,0.000029120123,0.00016003869,0.00022053074,0.15831892,0.014061241,0.7669447,0.0038544612,0.05501906],"study_design_scores_gemma":[0.000062184714,0.00011373952,0.00016473969,0.00004256796,0.0000411733,0.00015826705,0.00003642715,0.463875,0.012806431,0.48357794,0.039089307,0.00003225399],"about_ca_topic_score_codex":0.002059698,"about_ca_topic_score_gemma":0.0022026028,"teacher_disagreement_score":0.0037544006,"about_ca_system_score_codex":0.0019075068,"about_ca_system_score_gemma":0.0019667542,"threshold_uncertainty_score":0.01384002},"labels":[],"label_agreement":null},{"id":"W2110275702","doi":"10.1177/0037549714531054","title":"Real-time distributed simulations in an HLA framework: Application to aircraft simulation","year":2014,"lang":"en","type":"article","venue":"SIMULATION","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"High-level architecture; Computer science; Architecture; Context (archaeology); Set (abstract data type); Software; Embedded system; Distributed computing; Software engineering; Simulation; Systems engineering; Operating system; Programming language; Engineering","score_opus":0.015207405372919999,"score_gpt":0.3081285547456132,"score_spread":0.2929211493726932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110275702","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05999695,0.00033892944,0.93420804,0.0002828005,0.00006451252,0.00008295817,0.00005012706,0.0013453568,0.0036303129],"genre_scores_gemma":[0.71627873,0.000578417,0.28092575,0.000052915602,0.000048356414,0.00016450221,0.000114224145,0.0001964533,0.0016406714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936336,0.0003679868,0.000038924278,0.000060036316,0.00011908455,0.000050590133],"domain_scores_gemma":[0.998574,0.0008836262,0.00008198986,0.0001859418,0.000137013,0.00013738629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014260284,0.0003522685,0.0005509789,0.00040294937,0.0005009252,0.0010950033,0.0008684989,0.0007697806,0.0016714798],"category_scores_gemma":[0.0026335658,0.00028007664,0.00042424758,0.00040145885,0.0009311563,0.0008212794,0.0008871898,0.00089630793,0.00022829391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000098504635,0.00006711145,0.00093149964,0.000052590844,0.000025918072,0.00013388085,0.00022600034,0.9363075,0.0037110725,0.040125687,0.0003805155,0.017939653],"study_design_scores_gemma":[0.00002952422,0.000026653915,0.00010962958,0.000009624847,0.0000057580005,0.000024039538,0.000031371022,0.9886516,0.0009828563,0.0069028833,0.0032199505,0.0000061467217],"about_ca_topic_score_codex":0.0053384607,"about_ca_topic_score_gemma":0.0026651223,"teacher_disagreement_score":0.0053384607,"about_ca_system_score_codex":0.0008186357,"about_ca_system_score_gemma":0.0009274119,"threshold_uncertainty_score":0.010614753},"labels":[],"label_agreement":null},{"id":"W2111607873","doi":"10.1109/ccece.2009.5090187","title":"Scheduling active camera resources for multiple moving targets","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Control reconfiguration; Scheduling (production processes); Real-time computing; Dynamic priority scheduling; Predictability; Distributed computing; Fair-share scheduling; Embedded system; Schedule; Operating system; Engineering; Operations management","score_opus":0.015573189070185066,"score_gpt":0.25495106809069074,"score_spread":0.23937787902050567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111607873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59836954,0.00045574602,0.3955032,0.00014025715,0.00006016935,0.00016931542,0.000054402874,0.0012218534,0.0040255175],"genre_scores_gemma":[0.96326417,0.00007487398,0.03581003,0.000021758566,0.00001494897,0.000041810188,0.000044854973,0.000042060223,0.0006854844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99960357,0.00008841058,0.00001852833,0.000089471425,0.000104109764,0.00009591654],"domain_scores_gemma":[0.9982886,0.0007855719,0.00023259471,0.00019806887,0.0002603283,0.00023483922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007700367,0.00039879963,0.0005712495,0.00032877384,0.0006394208,0.0007619696,0.0010194043,0.0003069844,0.0012101036],"category_scores_gemma":[0.0021888637,0.00024548717,0.00018994276,0.00037361748,0.00044983698,0.00079003425,0.00044146014,0.000476629,0.00018322973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009798964,0.00042589483,0.005190565,0.0001497678,0.00006902099,0.00027594078,0.00044052105,0.7242002,0.06476491,0.0067525883,0.002356277,0.1943944],"study_design_scores_gemma":[0.000058109934,0.00025275577,0.0016008941,0.000006171007,0.00001920939,0.0000893406,0.000101518395,0.9730935,0.021649921,0.0015121363,0.0015946019,0.000021767963],"about_ca_topic_score_codex":0.004785208,"about_ca_topic_score_gemma":0.005206554,"teacher_disagreement_score":0.004785208,"about_ca_system_score_codex":0.0010573147,"about_ca_system_score_gemma":0.0017712614,"threshold_uncertainty_score":0.009514689},"labels":[],"label_agreement":null},{"id":"W2113945968","doi":"10.1016/j.rcim.2010.10.009","title":"Evaluating a new communication protocol for real-time distributed control","year":2010,"lang":"en","type":"article","venue":"Robotics and Computer-Integrated Manufacturing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Communications protocol; Ethernet; Event (particle physics); Protocol (science); Real-time communication; Automation; CAN bus; Distributed computing; Embedded system; Control (management); Telecommunications network; Computer network; Real-time computing; Engineering","score_opus":0.02888747733286171,"score_gpt":0.3100759640082913,"score_spread":0.28118848667542956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113945968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41678077,0.0009303123,0.5645034,0.00080630655,0.0007173279,0.000887466,0.00012977044,0.0014642917,0.013780322],"genre_scores_gemma":[0.89158154,0.00018100822,0.10525443,0.00009159509,0.000076834636,0.0003002255,0.00009462456,0.00010804897,0.0023117098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9925569,0.0033265962,0.00035250944,0.00057103805,0.0025878937,0.0006049464],"domain_scores_gemma":[0.97490853,0.016654097,0.0009639993,0.0025936104,0.0043070926,0.0005726648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008887205,0.0009318082,0.00093744684,0.0010241825,0.00074995874,0.0019287375,0.002291676,0.0017992989,0.0037416166],"category_scores_gemma":[0.030603148,0.00032467814,0.0005055226,0.0008077841,0.0012880922,0.0033756339,0.0012383302,0.0013816272,0.0003697965],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0055281054,0.0016148359,0.0035863654,0.000527768,0.000218815,0.00014095538,0.00015300827,0.75947124,0.0190591,0.027678637,0.0018477233,0.18017346],"study_design_scores_gemma":[0.00037621878,0.0014285429,0.00040391608,0.000013224361,0.0000969505,0.000041593117,0.00005653271,0.9825137,0.009990457,0.0041475436,0.00090641016,0.000024831481],"about_ca_topic_score_codex":0.0033538614,"about_ca_topic_score_gemma":0.002409251,"teacher_disagreement_score":0.008887205,"about_ca_system_score_codex":0.0024361624,"about_ca_system_score_gemma":0.0031085175,"threshold_uncertainty_score":0.047000587},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02484475998112554,"score_gpt":0.29169593632514457,"score_spread":0.266851176344019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114620069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.332886,0.0015793742,0.6626489,0.00019995838,0.00006063504,0.000052651103,0.000022286313,0.00077576516,0.0017743508],"genre_scores_gemma":[0.9610344,0.00012584291,0.038260657,0.000030978616,0.000017550707,0.00003076428,0.000013101969,0.000033175605,0.0004535995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995771,0.00013058852,0.00002347774,0.000056391327,0.00014341332,0.00006902887],"domain_scores_gemma":[0.99880004,0.0005862166,0.00021618378,0.000120229415,0.00021650997,0.000060774702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008874523,0.0004576997,0.00031588864,0.0005520951,0.00047100306,0.00073815766,0.0006867504,0.0002815494,0.00064337713],"category_scores_gemma":[0.0028887405,0.00029041906,0.00023295077,0.00029037255,0.00056497945,0.0007921446,0.00040759856,0.00058546016,0.00007949323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053636415,0.00011579754,0.0042582457,0.00023788976,0.000072760144,0.00027738203,0.0003196443,0.8110344,0.07966515,0.027483754,0.00069548265,0.075303115],"study_design_scores_gemma":[0.000018887858,0.000086282365,0.0002911222,0.000006050582,0.000014224668,0.00003426516,0.000013784496,0.98750466,0.007933497,0.0036329543,0.00045774796,0.000006559013],"about_ca_topic_score_codex":0.0022329702,"about_ca_topic_score_gemma":0.0027729427,"teacher_disagreement_score":0.0022329702,"about_ca_system_score_codex":0.00078608753,"about_ca_system_score_gemma":0.0011345115,"threshold_uncertainty_score":0.0057034492},"labels":[],"label_agreement":null},{"id":"W2114738707","doi":"10.1109/ccece.1993.332270","title":"A multiprocessor based robot controller-a Chimera II application","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multiprocessing; Robot; Computer science; Chimera (genetics); Embedded system; Controller (irrigation); Control engineering; Artificial intelligence; Operating system; Engineering; Chemistry","score_opus":0.014596075519757973,"score_gpt":0.2116414244992962,"score_spread":0.19704534897953824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114738707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08628422,0.0013907958,0.8370569,0.00042753268,0.0002350079,0.0004270078,0.0005125624,0.031773046,0.04189288],"genre_scores_gemma":[0.44563383,0.0009771752,0.50631195,0.00030323977,0.000060063892,0.00031177385,0.0008489133,0.0013451616,0.044207808],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99982005,0.000017978959,0.00000964246,0.000055255066,0.00007297621,0.000024105171],"domain_scores_gemma":[0.9998636,0.000025371151,0.000013794858,0.000027623271,0.000031385796,0.000038160375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020440768,0.0003513346,0.0003121033,0.0001653941,0.00026096802,0.0005058875,0.0008922334,0.0005434681,0.006463217],"category_scores_gemma":[0.0003434136,0.00026379107,0.0002938815,0.00014321548,0.0001938354,0.0004246374,0.0004166339,0.0008258208,0.0015347638],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007778607,0.00023841464,0.0009843983,0.00041744026,0.000063064996,0.0008375397,0.00027589654,0.05684492,0.6310321,0.01991404,0.015440185,0.27317423],"study_design_scores_gemma":[0.00024844968,0.0011535035,0.0020617268,0.000071901755,0.0000735085,0.0014463534,0.0000643441,0.45556808,0.3088652,0.0027249737,0.22763754,0.000084502215],"about_ca_topic_score_codex":0.0014790905,"about_ca_topic_score_gemma":0.0012589506,"teacher_disagreement_score":0.006463217,"about_ca_system_score_codex":0.00038717964,"about_ca_system_score_gemma":0.00060369185,"threshold_uncertainty_score":0.021621644},"labels":[],"label_agreement":null},{"id":"W2114812851","doi":"10.1109/ecrts.2013.30","title":"Outstanding Paper Award: Using Max-Plus Algebra to Improve the Analysis of Non-cyclic Task Models","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Leverage (statistics); Computer science; Task (project management); Graph; Vertex (graph theory); Scheduling (production processes); Task analysis; Theoretical computer science; Algorithm; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.020134505016192003,"score_gpt":0.25960534699695603,"score_spread":0.23947084198076402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114812851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022686357,0.0014516268,0.9346386,0.0039860453,0.0066587874,0.0001472642,0.000466734,0.0016726298,0.028291931],"genre_scores_gemma":[0.47059596,0.0024523987,0.40715694,0.0011544777,0.00526766,0.0002904777,0.0021579645,0.0014050382,0.109519094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986688,0.00037838242,0.00008281993,0.00021568422,0.00054136256,0.00011301514],"domain_scores_gemma":[0.99671715,0.0011512161,0.00014026408,0.00049599813,0.0011964054,0.00029904235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004178151,0.0009892767,0.00094466,0.00084608514,0.0006584602,0.0017274265,0.0018796658,0.0010258514,0.021655],"category_scores_gemma":[0.009229624,0.00030121105,0.001522386,0.0011539013,0.000582224,0.0027818244,0.0018581616,0.0016454135,0.004814105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005341234,0.00027727522,0.0017572984,0.0004282294,0.00018917474,0.0005215042,0.0002482402,0.23470478,0.009985087,0.34154084,0.10707932,0.3027341],"study_design_scores_gemma":[0.00004032269,0.00014154968,0.00032206616,0.000031247462,0.000037489728,0.00011031882,0.000021742171,0.841703,0.004482214,0.111819774,0.041242924,0.00004738567],"about_ca_topic_score_codex":0.0018074956,"about_ca_topic_score_gemma":0.0011798588,"teacher_disagreement_score":0.021655,"about_ca_system_score_codex":0.0011622697,"about_ca_system_score_gemma":0.0012205633,"threshold_uncertainty_score":0.07244319},"labels":[],"label_agreement":null},{"id":"W2117693732","doi":"10.1109/ecrts.2013.34","title":"An Efficient Periodic Resource Supply Model for Workloads with Transient Overloads","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Provisioning; Computer science; Workload; Upper and lower bounds; Robustness (evolution); Resource (disambiguation); Supply and demand; Distributed computing; Function (biology); Transient (computer programming); Computer network; Mathematics; Operating system","score_opus":0.011297277201196105,"score_gpt":0.22406489171479932,"score_spread":0.2127676145136032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117693732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03297414,0.00020429511,0.96178323,0.00019259239,0.00003683048,0.00008069643,0.0001190717,0.00024686725,0.0043621585],"genre_scores_gemma":[0.87628406,0.00049841113,0.113760754,0.00009186985,0.000073007985,0.00029402165,0.00023210411,0.0001309656,0.008634739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938583,0.00015084172,0.000033910805,0.000096699485,0.0002354505,0.0000972606],"domain_scores_gemma":[0.9991373,0.00040692175,0.0001085297,0.00011664509,0.00018208944,0.000048468464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010158428,0.0006704077,0.0006768016,0.0004542943,0.0004024482,0.0010661844,0.0011720664,0.0007412296,0.0021258248],"category_scores_gemma":[0.0024721762,0.00039135697,0.0005460849,0.00049807725,0.00050805334,0.001310971,0.0005497618,0.0008004759,0.00040199497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113008704,0.00004200375,0.00023708672,0.000054960197,0.00001179557,0.00013067201,0.00007608581,0.95210826,0.0065015033,0.031295463,0.0007913178,0.008637845],"study_design_scores_gemma":[0.000004738138,0.000015714586,0.000036739115,0.0000024911126,0.0000029102125,0.000013619269,0.0000053986655,0.99640685,0.00031937571,0.0028360886,0.0003533217,0.0000027578706],"about_ca_topic_score_codex":0.0032235489,"about_ca_topic_score_gemma":0.002534129,"teacher_disagreement_score":0.0032235489,"about_ca_system_score_codex":0.0009841997,"about_ca_system_score_gemma":0.0014962173,"threshold_uncertainty_score":0.0071409345},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.037425724205016365,"score_gpt":0.29774896123835715,"score_spread":0.26032323703334076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118021850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044433475,0.000089509114,0.9534561,0.00008404082,0.000017279244,0.000067642584,0.000038146183,0.0007617997,0.0010519675],"genre_scores_gemma":[0.48460338,0.00016252672,0.5125977,0.000083142986,0.000060338592,0.00047529844,0.0002735349,0.00037752895,0.0013666565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949949,0.0019668355,0.0003873523,0.00038328374,0.0018160925,0.00045153077],"domain_scores_gemma":[0.9883817,0.007604424,0.0013266336,0.0015517226,0.0010211321,0.00011441494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048431936,0.0008257177,0.00074666337,0.0014372139,0.00066694507,0.0013264171,0.0015210812,0.0008065911,0.0015420788],"category_scores_gemma":[0.017535293,0.0007087823,0.0014150167,0.00075421267,0.0010529567,0.0018815419,0.0007220615,0.0011564576,0.000301365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048410977,0.00028348027,0.004495086,0.00032597122,0.00014330025,0.00053031644,0.000761132,0.71165377,0.03480746,0.14529923,0.0014592273,0.09975695],"study_design_scores_gemma":[0.00005762542,0.0000826783,0.0004330548,0.000023461178,0.00003603614,0.000051522697,0.000051461117,0.9507,0.011541143,0.035358578,0.0016421115,0.000022268314],"about_ca_topic_score_codex":0.0027440705,"about_ca_topic_score_gemma":0.003028899,"teacher_disagreement_score":0.0048431936,"about_ca_system_score_codex":0.0015249723,"about_ca_system_score_gemma":0.0020393643,"threshold_uncertainty_score":0.025613546},"labels":[],"label_agreement":null},{"id":"W2118893560","doi":"10.1109/cgo.2007.5","title":"Compilation Techniques for Real-Time Java Programs","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Java; Operating system; Compiler; Real time Java; Garbage collection; Just-in-time compilation; Suite; Programming language; Java annotation; Java concurrency; Benchmark (surveying); Garbage","score_opus":0.020918134583604506,"score_gpt":0.28474887558581674,"score_spread":0.2638307410022122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118893560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00548489,0.00047049168,0.98075783,0.00008359412,0.00010662961,0.00007192476,0.000059072925,0.009300755,0.0036648358],"genre_scores_gemma":[0.120824814,0.0014037839,0.8616599,0.0002688813,0.00014643633,0.00024213642,0.00042536063,0.008377686,0.00665094],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982582,0.00034304208,0.00017803715,0.0002985966,0.0007357685,0.00018642783],"domain_scores_gemma":[0.9967434,0.0011452893,0.00039742215,0.0011379999,0.00050681055,0.00006911564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001451142,0.0007218248,0.000425583,0.0011385385,0.0006278848,0.0014062966,0.0017934839,0.00040970882,0.0035635247],"category_scores_gemma":[0.0052833483,0.0007922699,0.0009514875,0.0009963242,0.0008839703,0.0022332103,0.0015360337,0.0015593605,0.0016792406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037603267,0.00027323738,0.0026825408,0.0020077196,0.00025961513,0.00078124186,0.0024397366,0.048480574,0.071390554,0.17421784,0.016482567,0.68060833],"study_design_scores_gemma":[0.00030413104,0.00039596998,0.002406493,0.00070524216,0.00046151906,0.0027749662,0.0005220965,0.29350284,0.17822501,0.17406796,0.34638008,0.00025357236],"about_ca_topic_score_codex":0.00091641105,"about_ca_topic_score_gemma":0.001601902,"teacher_disagreement_score":0.0035635247,"about_ca_system_score_codex":0.00046333153,"about_ca_system_score_gemma":0.00093992724,"threshold_uncertainty_score":0.011921167},"labels":[],"label_agreement":null},{"id":"W2122144534","doi":"10.1109/sies.2008.4577712","title":"TEODACS : A new vision for testing dependable automotive communication systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"AVL List; Canadian Institute of Steel Construction","keywords":"Automotive industry; Computer science; System testing; Embedded system; Systems engineering; Software engineering; Engineering; Aerospace engineering","score_opus":0.060458469801028175,"score_gpt":0.28014911702245127,"score_spread":0.2196906472214231,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122144534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025801895,0.0015112143,0.95182717,0.0022076562,0.0009080881,0.00057060894,0.00051584945,0.0069245407,0.009733063],"genre_scores_gemma":[0.35501733,0.0018531259,0.6308538,0.0014920889,0.00053600164,0.0011811627,0.002375402,0.0016606363,0.005030489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98587555,0.006128402,0.0007109128,0.0013907289,0.005259526,0.0006348706],"domain_scores_gemma":[0.98582447,0.004659312,0.000976399,0.0042436062,0.0028888776,0.0014073761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010776366,0.0021274842,0.0017668061,0.0026246319,0.00071085634,0.0048135933,0.005684446,0.0027662024,0.0035732072],"category_scores_gemma":[0.017949946,0.0006340593,0.001312852,0.0011785951,0.0036509184,0.007440709,0.0032104603,0.005044794,0.0008925089],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012205112,0.002049892,0.013089816,0.0016241402,0.00053142704,0.00060440885,0.0009068477,0.11682968,0.10168364,0.34482905,0.025669439,0.39096123],"study_design_scores_gemma":[0.00039265834,0.0035055547,0.00436648,0.0008789742,0.00020690971,0.0013141732,0.00089577684,0.54798967,0.08245007,0.22051024,0.13720405,0.00028544702],"about_ca_topic_score_codex":0.001756968,"about_ca_topic_score_gemma":0.00088257354,"teacher_disagreement_score":0.010776366,"about_ca_system_score_codex":0.0020495981,"about_ca_system_score_gemma":0.0033297816,"threshold_uncertainty_score":0.056991577},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.08050642459028037,"score_gpt":0.25457888770684284,"score_spread":0.17407246311656246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122969894","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0875075,0.00028334654,0.9016402,0.00049172033,0.00009930779,0.00019633076,0.00017287787,0.0019644024,0.0076442976],"genre_scores_gemma":[0.746431,0.0002851147,0.24761407,0.00018605212,0.000053236556,0.00030599357,0.00023198989,0.00030332623,0.0045892624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990175,0.00027098984,0.000088210734,0.0001678015,0.00032781923,0.00012755369],"domain_scores_gemma":[0.9988662,0.0003194546,0.00015240739,0.00038519027,0.00019723621,0.000079614365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008605853,0.00054033595,0.00033359794,0.0003044118,0.00034046764,0.00077483704,0.00098067,0.00047624318,0.0012930434],"category_scores_gemma":[0.0016504193,0.00036934254,0.00037412666,0.00024491487,0.00080551347,0.001093018,0.0006503657,0.0011339762,0.00028935308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022919518,0.00017694285,0.0028926686,0.00020643929,0.00003088177,0.00057388673,0.000381602,0.7115022,0.042434093,0.20674564,0.0034088695,0.031417653],"study_design_scores_gemma":[0.000026810369,0.00012699146,0.00028181006,0.000012097456,0.000010133089,0.00007881523,0.00002192832,0.9726502,0.005490886,0.0167451,0.0045446204,0.000010654008],"about_ca_topic_score_codex":0.0027662565,"about_ca_topic_score_gemma":0.0042767706,"teacher_disagreement_score":0.0027662565,"about_ca_system_score_codex":0.0006706828,"about_ca_system_score_gemma":0.0012557165,"threshold_uncertainty_score":0.0055003166},"labels":[],"label_agreement":null},{"id":"W2123820681","doi":"10.1109/infcom.1995.515986","title":"Resource and connection admission control in real-time transport protocols with deterministic QoS guarantees","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Quality of service; Computer science; Admission control; Scheduling (production processes); Computer network; Real-time communication; Distributed computing; Implementation; Flow control (data); Real-time computing; Mathematical optimization; Mathematics","score_opus":0.0169554334531084,"score_gpt":0.2428268218274918,"score_spread":0.2258713883743834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123820681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03588301,0.002262254,0.95506877,0.0010825566,0.00016251423,0.00009607526,0.000048323032,0.00053685304,0.0048596696],"genre_scores_gemma":[0.8406934,0.0015916756,0.15420868,0.00020958835,0.00025611237,0.00032173726,0.00009236987,0.00010416561,0.0025222397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946466,0.0019250003,0.00033525104,0.0005428959,0.0019042179,0.0006460611],"domain_scores_gemma":[0.98884904,0.0076290863,0.0010809412,0.0010700162,0.0011421099,0.00022881835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057203285,0.00077132706,0.00081835414,0.001259633,0.0014842319,0.0032022884,0.0017528405,0.0015221367,0.0012628008],"category_scores_gemma":[0.022539005,0.00083449174,0.0009166477,0.0012703605,0.0035541872,0.0037955751,0.0013800393,0.0022359896,0.00028883354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001838424,0.00006315402,0.00077499443,0.00013723984,0.00004427451,0.00013206675,0.00028247578,0.6129078,0.0033186115,0.3388832,0.0012582631,0.0420141],"study_design_scores_gemma":[0.000023830607,0.000019229059,0.000110316,0.000016823082,0.000015937378,0.000043356627,0.000024643507,0.9379961,0.0013564236,0.05929341,0.0010788644,0.000020917505],"about_ca_topic_score_codex":0.0076060886,"about_ca_topic_score_gemma":0.00495931,"teacher_disagreement_score":0.0076060886,"about_ca_system_score_codex":0.0033523282,"about_ca_system_score_gemma":0.0055641388,"threshold_uncertainty_score":0.030252397},"labels":[],"label_agreement":null},{"id":"W2124049919","doi":"10.1109/ccece.2005.1557034","title":"An RTPA supporting environment for java code generation","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Java; Real time Java; Java annotation; Java concurrency; strictfp; Operating system; Java Modeling Language; Programming language; Generics in Java; Formal specification; Garbage collection; Embedded Java; Software engineering; Garbage","score_opus":0.022436031177310883,"score_gpt":0.26539475340750535,"score_spread":0.24295872223019446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124049919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001921552,0.00007204222,0.8512695,0.00009899242,0.00007491877,0.00025488748,0.00075827923,0.13893043,0.006619442],"genre_scores_gemma":[0.046437006,0.00040333407,0.89838743,0.0002855608,0.00013110983,0.0016159447,0.004940949,0.034884997,0.012913622],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.00035824493,0.00025843456,0.0002968986,0.00079009664,0.00021879909],"domain_scores_gemma":[0.99498427,0.0021339948,0.0004952959,0.001157492,0.0009592795,0.00026959943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002628863,0.0013655468,0.00084317283,0.0014734743,0.00084286154,0.0024325058,0.0029445314,0.001655394,0.023866484],"category_scores_gemma":[0.009593966,0.0019234756,0.0012219744,0.0009589046,0.00073903747,0.0026714378,0.002086408,0.0038314096,0.022063104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016153207,0.0010280017,0.0026764534,0.0017130102,0.00017515011,0.002792816,0.002278492,0.013322076,0.124195695,0.088932924,0.15349393,0.60777617],"study_design_scores_gemma":[0.0012781299,0.00042919503,0.0013649367,0.0003866889,0.00014224865,0.0036160946,0.0001011177,0.15581955,0.11654693,0.033670224,0.68627745,0.00036741045],"about_ca_topic_score_codex":0.00086587993,"about_ca_topic_score_gemma":0.0009980695,"teacher_disagreement_score":0.023866484,"about_ca_system_score_codex":0.0003718965,"about_ca_system_score_gemma":0.0016030975,"threshold_uncertainty_score":0.079841316},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012511981838960304,"score_gpt":0.24988186026447115,"score_spread":0.23736987842551086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124192052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120589964,0.0027917393,0.7887673,0.00028918317,0.0005332906,0.0004313971,0.00096887647,0.05946774,0.026160516],"genre_scores_gemma":[0.8096497,0.00033185817,0.17704166,0.00035990874,0.00013725071,0.00018496953,0.00073996594,0.0013334011,0.0102212],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994754,0.00006776241,0.000048099162,0.00009231812,0.00022960793,0.00008680031],"domain_scores_gemma":[0.99925274,0.00018243832,0.00009790938,0.0001929936,0.00020885303,0.00006503451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042540499,0.0006801128,0.00034293186,0.00049309805,0.00036380903,0.00094197853,0.001831735,0.00028922016,0.006628623],"category_scores_gemma":[0.001152638,0.0002731497,0.00024641393,0.00026788836,0.00033312468,0.0006860632,0.00045796545,0.00082047837,0.0011336975],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001489078,0.0005182171,0.002956433,0.00092064636,0.00015869478,0.00065802253,0.0004329267,0.15286303,0.34371993,0.035045847,0.042727806,0.41850942],"study_design_scores_gemma":[0.0001876411,0.0008428334,0.0010050235,0.00005292377,0.00010496862,0.0003564652,0.000050103445,0.68817794,0.23364782,0.0047537237,0.07071397,0.00010659479],"about_ca_topic_score_codex":0.0019545718,"about_ca_topic_score_gemma":0.003685007,"teacher_disagreement_score":0.006628623,"about_ca_system_score_codex":0.0006868718,"about_ca_system_score_gemma":0.0010361114,"threshold_uncertainty_score":0.022175014},"labels":[],"label_agreement":null},{"id":"W2124210807","doi":"10.1145/353171.353174","title":"Object-oriented real-time concurrency","year":2000,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency; Object (grammar); Concurrency control; Object-oriented programming; Programming language; Artificial intelligence; Database transaction","score_opus":0.008043640237003142,"score_gpt":0.23420422247574912,"score_spread":0.226160582238746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124210807","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008569569,0.0014708523,0.9584123,0.00075648894,0.00031235514,0.00019167521,0.00008676817,0.005182306,0.025017787],"genre_scores_gemma":[0.2886739,0.0028909014,0.6625389,0.0010135451,0.00052617694,0.0006023671,0.0004296907,0.0019735512,0.04135101],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965752,0.0007190897,0.00028045248,0.00046058092,0.0015897674,0.00037487625],"domain_scores_gemma":[0.993619,0.0023207497,0.0004990137,0.002062503,0.0011563973,0.0003422476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005265568,0.000851336,0.0006986005,0.00078634184,0.0012758578,0.005939084,0.0023551255,0.0010847016,0.0062263003],"category_scores_gemma":[0.010345978,0.0009857073,0.0009590554,0.0011420045,0.0031540226,0.006315292,0.0030295528,0.002747924,0.0017754947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021665814,0.00009620585,0.0011872143,0.0003087181,0.000046028592,0.00031873758,0.0011975141,0.01312249,0.00687776,0.8468515,0.007931573,0.12184561],"study_design_scores_gemma":[0.00033173914,0.00015147628,0.00069808256,0.00014731992,0.00015884104,0.0009159913,0.0002352716,0.088874765,0.01550638,0.5989956,0.2938697,0.00011477566],"about_ca_topic_score_codex":0.0027136959,"about_ca_topic_score_gemma":0.002699317,"teacher_disagreement_score":0.0062263003,"about_ca_system_score_codex":0.0013723713,"about_ca_system_score_gemma":0.002235196,"threshold_uncertainty_score":0.02784729},"labels":[],"label_agreement":null},{"id":"W2124852788","doi":"10.1109/pacrim.1989.48355","title":"Events and actions: an object-oriented approach to real-time control systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"International Submarine Engineering (Canada)","funders":"","keywords":"Interrupt; Computer science; Object-oriented programming; Scheduling (production processes); Programming language; Architecture; Object (grammar); Distributed computing; Real-time computing; Embedded system; Artificial intelligence","score_opus":0.01874246071500552,"score_gpt":0.25224176403053805,"score_spread":0.23349930331553254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124852788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012259696,0.0030076015,0.97791183,0.0010115672,0.00045875713,0.000097195734,0.000077126104,0.0014738176,0.014736096],"genre_scores_gemma":[0.06512972,0.008711364,0.8899988,0.0011349063,0.0012738609,0.00050926936,0.00041477804,0.00056906807,0.032258242],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872476,0.00041154213,0.00012860043,0.0001525536,0.00048247585,0.00010013033],"domain_scores_gemma":[0.9990841,0.0004323936,0.000088618246,0.00012366395,0.00014289109,0.00012830964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018211666,0.0011881278,0.0007104297,0.0015253229,0.0009101307,0.0051332777,0.0020319219,0.0018226312,0.0044488613],"category_scores_gemma":[0.0018114522,0.0006962479,0.0011253742,0.0013554895,0.0033373383,0.005149852,0.0013371928,0.0032987657,0.001719189],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006838173,0.000051317875,0.00021347872,0.00027174925,0.000039018658,0.0004165975,0.0008042838,0.016172547,0.002863727,0.8869414,0.009449205,0.08270839],"study_design_scores_gemma":[0.0000707142,0.00010053371,0.00021818452,0.00025874347,0.000072547264,0.00041837987,0.00021222387,0.061176587,0.003458034,0.5330037,0.4009463,0.00006415096],"about_ca_topic_score_codex":0.0028718219,"about_ca_topic_score_gemma":0.0023717317,"teacher_disagreement_score":0.0051332777,"about_ca_system_score_codex":0.0011509105,"about_ca_system_score_gemma":0.0014790412,"threshold_uncertainty_score":0.014882922},"labels":[],"label_agreement":null},{"id":"W2124872750","doi":"10.1109/ccece.2009.5090130","title":"Dynamic leakage aware power management with procrastination method","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Procrastination; Dynamic demand; Computer science; Leakage power; Leakage (economics); Power management; Power consumption; Dynamic voltage scaling; Frequency scaling; Energy consumption; Voltage; Power (physics); Reliability engineering; Scaling; Real-time computing; Engineering; Electrical engineering; Mathematics","score_opus":0.004823038950777036,"score_gpt":0.2569518554827392,"score_spread":0.2521288165319622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124872750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030399464,0.00081857096,0.95988995,0.00017483767,0.0001061382,0.000116022675,0.000042130014,0.0054058335,0.0030470374],"genre_scores_gemma":[0.6533427,0.00048787298,0.33843398,0.00024357362,0.0001029844,0.0002163921,0.000151078,0.00032538906,0.0066960496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949753,0.000070210976,0.000048623147,0.00012881032,0.00017725867,0.00007757333],"domain_scores_gemma":[0.99922454,0.0002020902,0.00013719262,0.00018013934,0.00021424843,0.000041697505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003758092,0.00082062,0.00066309003,0.00082595064,0.0004961324,0.0006462141,0.0013759546,0.0003913922,0.002097095],"category_scores_gemma":[0.0012711006,0.00023250254,0.00037409132,0.0006452912,0.00035097823,0.0008335964,0.00052030024,0.0006742043,0.00044597196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004476309,0.0002462906,0.0011687151,0.00025117508,0.00007426308,0.00026345876,0.00017202647,0.07671553,0.07714966,0.0053340257,0.0063208765,0.8318563],"study_design_scores_gemma":[0.00013091807,0.0005008098,0.00093845255,0.000024060544,0.00008748462,0.0008225496,0.0000446498,0.87006885,0.10832417,0.0042189355,0.014786133,0.000052959174],"about_ca_topic_score_codex":0.0010650768,"about_ca_topic_score_gemma":0.00138172,"teacher_disagreement_score":0.002097095,"about_ca_system_score_codex":0.00044409707,"about_ca_system_score_gemma":0.00072392524,"threshold_uncertainty_score":0.0070155263},"labels":[],"label_agreement":null},{"id":"W2125188709","doi":"10.1145/974043.974083","title":"Performance of parallel architectures for CORBA-based systems","year":2004,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Distributed computing; Object request broker; Architecture; Computer architecture; Distributed object","score_opus":0.014914448379805498,"score_gpt":0.22312841591115098,"score_spread":0.2082139675313455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125188709","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9133778,0.0012437862,0.058906924,0.00082533323,0.00017362044,0.00012017921,0.00014305266,0.003533972,0.021675352],"genre_scores_gemma":[0.9870184,0.00024527096,0.01061507,0.00002911497,0.00002865858,0.0000377409,0.00014743884,0.00013845379,0.0017398827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770206,0.0006312854,0.00009909824,0.00019481796,0.0010873822,0.00028536087],"domain_scores_gemma":[0.996354,0.0014672978,0.00025400502,0.0007397945,0.00097205763,0.00021279865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023077752,0.00064994284,0.00040644832,0.0006205586,0.000828867,0.0015347587,0.0008139776,0.00056502764,0.0035369918],"category_scores_gemma":[0.008572451,0.00035328686,0.00019341407,0.001012342,0.0005576246,0.0014972449,0.0007399349,0.000795235,0.0008472682],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00513593,0.0011976156,0.013496078,0.0005749013,0.00020037446,0.0004164571,0.0010816182,0.54506123,0.23436205,0.03918492,0.007175313,0.15211354],"study_design_scores_gemma":[0.0002295133,0.0012837454,0.0073437113,0.000035225377,0.000084984254,0.00019410133,0.00033391773,0.8810963,0.08024628,0.019386385,0.009712247,0.000053493597],"about_ca_topic_score_codex":0.0030490537,"about_ca_topic_score_gemma":0.0015234229,"teacher_disagreement_score":0.0035369918,"about_ca_system_score_codex":0.0010506926,"about_ca_system_score_gemma":0.0009741845,"threshold_uncertainty_score":0.012204826},"labels":[],"label_agreement":null},{"id":"W2125275327","doi":"10.1109/dis.2006.4","title":"A New Evaluation Method of Communication for Distributed Control","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Event (particle physics); Communications protocol; Unified Modeling Language; CAN bus; Distributed computing; Protocol (science); Telecommunications network; Measure (data warehouse); Control (management); Controller (irrigation); Communications system; Embedded system; Real-time computing; Computer network; Software; Operating system; Database","score_opus":0.02598147756008605,"score_gpt":0.32570625694736277,"score_spread":0.2997247793872767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125275327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007477046,0.0006379399,0.991102,0.00031207866,0.00050725375,0.00006770307,0.00003308558,0.00029333326,0.0062988596],"genre_scores_gemma":[0.09315963,0.0012058667,0.88823223,0.0005724336,0.0013112436,0.00093428825,0.00010933737,0.0004939894,0.013981052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99108255,0.0031471732,0.0004992811,0.0011918087,0.0038427904,0.00023632123],"domain_scores_gemma":[0.99381506,0.0028514033,0.00038336197,0.0010615026,0.0017221445,0.00016653539],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004848549,0.0011964331,0.0009852622,0.0021692046,0.001185228,0.0034844028,0.0016301746,0.0012268726,0.00571044],"category_scores_gemma":[0.014677385,0.00034120085,0.0007560347,0.0022029968,0.0032864395,0.005818128,0.001777722,0.0029712203,0.0014037697],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076265016,0.000040959847,0.00032233275,0.00023970532,0.00004020517,0.00007602988,0.00036313222,0.007875748,0.0049049365,0.7537465,0.007189058,0.22512506],"study_design_scores_gemma":[0.0001005574,0.00034775265,0.0005940865,0.00023659009,0.00008394525,0.0006419925,0.00022321573,0.23823768,0.011275309,0.48391798,0.26418516,0.00015563676],"about_ca_topic_score_codex":0.0013234231,"about_ca_topic_score_gemma":0.00095294864,"teacher_disagreement_score":0.00571044,"about_ca_system_score_codex":0.0020010578,"about_ca_system_score_gemma":0.0016003813,"threshold_uncertainty_score":0.025641918},"labels":[],"label_agreement":null},{"id":"W2125715261","doi":"10.1109/rtcsa.2009.24","title":"Towards Real Multi-criticality Scheduling","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Microkernel; Scheduling (production processes); Distributed computing; Mixed criticality; Criticality; Task (project management); Isolation (microbiology); Processor scheduling; Embedded system; Computer network; Resource (disambiguation); Systems engineering","score_opus":0.035377008862790625,"score_gpt":0.3101489235944341,"score_spread":0.2747719147316435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125715261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020717023,0.0011146648,0.9711537,0.0010795102,0.0002368307,0.00005999999,0.000018271532,0.0013158164,0.004304159],"genre_scores_gemma":[0.2915375,0.001032871,0.7006895,0.00031620005,0.00024778774,0.00012837406,0.000079286816,0.00047516482,0.005493284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998201,0.000623819,0.00010798271,0.00025111286,0.0006039363,0.00021218909],"domain_scores_gemma":[0.9965911,0.00086433924,0.00027891583,0.0010121658,0.00095887796,0.00029465617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043404773,0.00064279424,0.00052116363,0.0008117584,0.0005822487,0.0024076356,0.0018360208,0.0010013822,0.0022152173],"category_scores_gemma":[0.008423868,0.00067778403,0.00040736358,0.0005352535,0.0010790835,0.003178621,0.0018203051,0.0029128112,0.0010677039],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005388013,0.00025499286,0.0015323281,0.0005225945,0.00006540532,0.00040586406,0.0014251124,0.1973528,0.05592934,0.37904423,0.010633023,0.35229558],"study_design_scores_gemma":[0.00009236443,0.0002652348,0.00044970782,0.00011313166,0.00003954982,0.00033430525,0.00030311712,0.6769835,0.020901086,0.21328364,0.08717713,0.000057248737],"about_ca_topic_score_codex":0.001043133,"about_ca_topic_score_gemma":0.0011021543,"teacher_disagreement_score":0.0043404773,"about_ca_system_score_codex":0.0010805009,"about_ca_system_score_gemma":0.0016172773,"threshold_uncertainty_score":0.02295494},"labels":[],"label_agreement":null},{"id":"W2126401691","doi":"10.1109/infcom.1990.91319","title":"TORMLAN-a multichannel local area network protocol","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Token ring; Protocol (science); Computer science; Channel (broadcasting); Local area network; Computer network; Transmission (telecommunications); Control channel; Security token; Data transmission; Ring (chemistry); Telecommunications","score_opus":0.034418225616777695,"score_gpt":0.2464506055251427,"score_spread":0.212032379908365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126401691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015119969,0.0039169714,0.8259933,0.002841898,0.0018707623,0.0021485186,0.0027790484,0.030307027,0.115022495],"genre_scores_gemma":[0.3063344,0.003696844,0.54647493,0.00269025,0.00061568775,0.003142981,0.006751476,0.0013241376,0.1289693],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873644,0.00039564274,0.0000913126,0.00015381086,0.00045609454,0.00016668678],"domain_scores_gemma":[0.9990984,0.00016722365,0.000098485136,0.00023876641,0.00029353175,0.000103469356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011810496,0.00058951013,0.00056613435,0.0010618748,0.0017225033,0.0025763237,0.0020759373,0.0010972556,0.012743449],"category_scores_gemma":[0.0022564072,0.0002907335,0.0003543612,0.00094074523,0.0007809946,0.0028540022,0.0020551935,0.0014046911,0.0044406657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087718555,0.00031682735,0.0005280174,0.0013225833,0.000074527285,0.0010074088,0.0005858342,0.016082926,0.030307982,0.34066346,0.2186407,0.38959253],"study_design_scores_gemma":[0.00016219943,0.00026353038,0.00042181814,0.00014235446,0.000075226446,0.0010372724,0.00016887319,0.10640007,0.026358,0.053346552,0.81144726,0.00017682507],"about_ca_topic_score_codex":0.0025259831,"about_ca_topic_score_gemma":0.0060159606,"teacher_disagreement_score":0.012743449,"about_ca_system_score_codex":0.0014393986,"about_ca_system_score_gemma":0.002554923,"threshold_uncertainty_score":0.04263109},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.054868940205333123,"score_gpt":0.3357297370310439,"score_spread":0.2808607968257108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126720785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008732129,0.0000386335,0.9955729,0.00018817524,0.00002130462,0.00022079091,0.000037347512,0.0018305588,0.0012169748],"genre_scores_gemma":[0.010959962,0.00015466397,0.98631775,0.000093280134,0.000011752504,0.000550999,0.00021418561,0.00057134463,0.0011260519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99296373,0.0026990506,0.0009996035,0.00032684574,0.0026578268,0.00035296733],"domain_scores_gemma":[0.98769903,0.0046420656,0.0009994115,0.0029505962,0.0033754052,0.00033340036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008322529,0.0014749587,0.00071575306,0.0017548316,0.0010399662,0.0038352697,0.0038629598,0.002680477,0.005878368],"category_scores_gemma":[0.026361927,0.0020597833,0.0013458688,0.0010557052,0.0016273229,0.0033921557,0.0022753854,0.004086453,0.0042586713],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013522961,0.0006396338,0.0015422563,0.0009257647,0.00009511016,0.0018123423,0.004297113,0.15051761,0.026294736,0.4817845,0.021581983,0.31037378],"study_design_scores_gemma":[0.00025858637,0.00018113707,0.0004833785,0.0009817363,0.00008837607,0.0007635605,0.00092450983,0.49700603,0.03239747,0.2498238,0.21692201,0.00016940734],"about_ca_topic_score_codex":0.0033782108,"about_ca_topic_score_gemma":0.0056304284,"teacher_disagreement_score":0.008322529,"about_ca_system_score_codex":0.0010519205,"about_ca_system_score_gemma":0.0030868687,"threshold_uncertainty_score":0.044014215},"labels":[],"label_agreement":null},{"id":"W2128112038","doi":"10.1109/ares.2006.117","title":"Schedulability driven security optimization in real-time systems","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Security service; Computer security model; Scheduling (production processes); Quality of service; Security testing; Security information and event management; Distributed computing; Computer security; Computer network; Information security; Cloud computing security; Cloud computing; Engineering; Operating system","score_opus":0.00812579994576106,"score_gpt":0.2263810646256876,"score_spread":0.21825526467992654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128112038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038137533,0.00071128784,0.9579037,0.00022369502,0.00006249697,0.00007740681,0.000041791947,0.00023572885,0.0026063598],"genre_scores_gemma":[0.78216857,0.00062751764,0.21421455,0.00010943189,0.000078932535,0.00015970043,0.00012769333,0.000102509606,0.002411024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841464,0.00060292764,0.000068192974,0.00018852508,0.0004379717,0.00028768834],"domain_scores_gemma":[0.99825925,0.0011852852,0.00019219682,0.00010445555,0.00018031869,0.00007858728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017882107,0.0009423395,0.00086156087,0.00065534085,0.00043557037,0.00083465787,0.0008275968,0.00060021307,0.0013320905],"category_scores_gemma":[0.0033039309,0.00041865322,0.00058246264,0.00066673633,0.0009159314,0.0009889732,0.0005695606,0.000834006,0.00016602453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016436112,0.00008756617,0.00035722193,0.00012923781,0.000039243143,0.000105019295,0.00006514407,0.9418415,0.005298502,0.020192446,0.0005766738,0.031143209],"study_design_scores_gemma":[0.000027513324,0.00006848037,0.00011022714,0.000008610051,0.000009239756,0.000024673396,0.000019511264,0.9872062,0.002548947,0.008957688,0.0010105688,0.000008360888],"about_ca_topic_score_codex":0.002809413,"about_ca_topic_score_gemma":0.0018381797,"teacher_disagreement_score":0.002809413,"about_ca_system_score_codex":0.0015130665,"about_ca_system_score_gemma":0.0015728822,"threshold_uncertainty_score":0.010978103},"labels":[],"label_agreement":null},{"id":"W2129299706","doi":"10.1109/ccece.2006.277330","title":"Profiling of the Lab VIEW Development Environment and Real-Time Module","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Carleton University","funders":"","keywords":"Computer science; Real-time operating system; Profiling (computer programming); Embedded system; Software; Overhead (engineering); Real-time Control System; Real-time computing; Control (management); Operating system","score_opus":0.008472343171144321,"score_gpt":0.19422868598273327,"score_spread":0.18575634281158895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129299706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0813632,0.00032972134,0.8866481,0.00036165316,0.000101764,0.0005144804,0.00077672966,0.019645058,0.010259213],"genre_scores_gemma":[0.5015959,0.000657272,0.4777461,0.0004070846,0.00003130315,0.0009685835,0.0023049645,0.0038000843,0.012488679],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99852484,0.00031092812,0.00008496193,0.00028261717,0.0006236272,0.00017302291],"domain_scores_gemma":[0.9975592,0.00077810057,0.00019471315,0.0006120407,0.0007080593,0.0001478907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015059176,0.0008107913,0.00044642642,0.0005900425,0.00030268903,0.0014198018,0.0012744137,0.00048134953,0.0023769948],"category_scores_gemma":[0.0047417376,0.0008205969,0.00047562874,0.00024361046,0.00033310312,0.0014364148,0.00052525103,0.0013312534,0.0012737232],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015711238,0.00070644193,0.020159476,0.00080947945,0.00013103567,0.000646161,0.0017166326,0.33352876,0.20981415,0.039708342,0.020992365,0.37021607],"study_design_scores_gemma":[0.00006175729,0.00040522183,0.0037527755,0.00010061789,0.00007129823,0.0003692396,0.00009338074,0.701281,0.21225366,0.003306315,0.07818512,0.000119572534],"about_ca_topic_score_codex":0.0026405023,"about_ca_topic_score_gemma":0.0027136714,"teacher_disagreement_score":0.0026405023,"about_ca_system_score_codex":0.0012190825,"about_ca_system_score_gemma":0.0022165943,"threshold_uncertainty_score":0.008845091},"labels":[],"label_agreement":null},{"id":"W2129882019","doi":"10.3844/ajassp.2004.338.347","title":"Extending UML-RT for Control System Modeling","year":2004,"lang":"en","type":"article","venue":"American Journal of Applied Sciences","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Unified Modeling Language; Distributed computing; Scheduling (production processes); Source code; Visualization; Code generation; Real-time computing; Jitter; Software engineering; Embedded system; Software; Key (lock); Operating system; Engineering","score_opus":0.01596980799793009,"score_gpt":0.2585106562289259,"score_spread":0.2425408482309958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129882019","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015661645,0.00016666717,0.9902441,0.00013954652,0.00006121976,0.0000924294,0.0001775351,0.0033810027,0.004171369],"genre_scores_gemma":[0.061600562,0.00079064403,0.9290832,0.00012724445,0.00010390858,0.00045183458,0.00086719525,0.0010807415,0.0058945804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977677,0.00080892,0.00029373012,0.00028148625,0.0007086735,0.00013963142],"domain_scores_gemma":[0.997024,0.0014731074,0.0003685941,0.00057368254,0.00050128077,0.00005926672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032479682,0.001447548,0.000526655,0.001442644,0.0004507373,0.0018960669,0.0017640205,0.0011420267,0.005385814],"category_scores_gemma":[0.005621785,0.0008431933,0.0023996388,0.0006709808,0.0007052701,0.002465323,0.0011812206,0.0017726303,0.0025248528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001375236,0.0001498823,0.001766555,0.0006910325,0.00011536193,0.0014285198,0.0021645108,0.35594302,0.022773352,0.44683254,0.008715224,0.1592825],"study_design_scores_gemma":[0.00004394631,0.000066036,0.00023510106,0.0001841258,0.000084485335,0.00034752645,0.000078866986,0.7756258,0.008371634,0.064365976,0.15054819,0.00004824519],"about_ca_topic_score_codex":0.006486579,"about_ca_topic_score_gemma":0.0044724145,"teacher_disagreement_score":0.006486579,"about_ca_system_score_codex":0.0011533332,"about_ca_system_score_gemma":0.0016045383,"threshold_uncertainty_score":0.018017352},"labels":[],"label_agreement":null},{"id":"W2131819355","doi":"10.1109/emrts.2000.853994","title":"Worst-case execution times analysis of MPEG-2 decoding","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"L'Alliance Boviteq","funders":"","keywords":"Computer science; Decoding methods; Variety (cybernetics); Quality of service; Reduction (mathematics); Service provider; Service (business); Worst-case execution time; Real-time computing; Execution time; Computer network; Distributed computing; Telecommunications","score_opus":0.028610751381909997,"score_gpt":0.2446735304529018,"score_spread":0.2160627790709918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131819355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.350699,0.0035950064,0.61869025,0.00041369136,0.000275348,0.0002174454,0.002288047,0.005865601,0.01795565],"genre_scores_gemma":[0.9081933,0.0009845963,0.082432486,0.00009684608,0.00007734774,0.00012278257,0.0020537802,0.00070814654,0.0053307908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99861777,0.00019856701,0.00008198188,0.00020131732,0.0006793877,0.00022093477],"domain_scores_gemma":[0.99688584,0.0018561771,0.00027189928,0.00031751074,0.00060598995,0.000062548104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006924876,0.0019102622,0.0006145554,0.0019057301,0.00032352316,0.0007369488,0.0006007969,0.0004795431,0.002837466],"category_scores_gemma":[0.0043009026,0.00037283066,0.0005711472,0.0012823298,0.0003405462,0.00055687863,0.00020908174,0.00082412513,0.0007657399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073569105,0.0001338207,0.004836479,0.00044064282,0.00013179325,0.00034844008,0.00012859228,0.76429886,0.069228545,0.0066717984,0.004389327,0.148656],"study_design_scores_gemma":[0.0000064374217,0.00015165977,0.001619677,0.000016532595,0.00002602724,0.00014968775,0.000019836805,0.9476763,0.04664108,0.0013917309,0.0022789214,0.000022048791],"about_ca_topic_score_codex":0.005371073,"about_ca_topic_score_gemma":0.0046610194,"teacher_disagreement_score":0.005371073,"about_ca_system_score_codex":0.0009560543,"about_ca_system_score_gemma":0.00073779305,"threshold_uncertainty_score":0.010679603},"labels":[],"label_agreement":null},{"id":"W2135599636","doi":"10.1145/2347583.2347588","title":"Unifying and refactoring DMF to support concurrent Jini and JMS DMS in GIPSY","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Code refactoring; Artifact (error); Context (archaeology); Programming language; Operating system; Distributed computing; Software engineering; Software","score_opus":0.06435738530560782,"score_gpt":0.3173738856109942,"score_spread":0.2530165003053864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135599636","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073426664,0.00022295247,0.9019116,0.00060546765,0.0002635627,0.0002826712,0.00023676177,0.014766654,0.008283615],"genre_scores_gemma":[0.24325505,0.00019009734,0.7449825,0.0004067774,0.00008447006,0.0002200804,0.0007470011,0.003613622,0.006500412],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.998572,0.0002842513,0.00014802319,0.00028506736,0.00047826197,0.00023241437],"domain_scores_gemma":[0.9969452,0.00042868502,0.00016004719,0.0019062156,0.00040981377,0.00015007364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045040613,0.0005755364,0.00047898712,0.0006164035,0.0005790267,0.0014492915,0.0027860366,0.0006884728,0.001314555],"category_scores_gemma":[0.0058741365,0.0006188042,0.00095472625,0.00040878248,0.0013754796,0.0020627582,0.0028639024,0.0027114502,0.00066456984],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005756582,0.00057402893,0.011708949,0.0008860478,0.00020238073,0.0024184387,0.006307689,0.11740772,0.17521808,0.3134492,0.019424567,0.3518273],"study_design_scores_gemma":[0.00028240564,0.00029319004,0.003037579,0.00026669353,0.00021514962,0.001212651,0.00073647365,0.40558746,0.17691861,0.08618091,0.3251108,0.00015800171],"about_ca_topic_score_codex":0.0030924866,"about_ca_topic_score_gemma":0.0045490777,"teacher_disagreement_score":0.0045040613,"about_ca_system_score_codex":0.0009399892,"about_ca_system_score_gemma":0.0032362875,"threshold_uncertainty_score":0.023819983},"labels":[],"label_agreement":null},{"id":"W2136209759","doi":"10.1109/simsym.1993.639133","title":"A C++ Environment For Modeling Communication Systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Correctness; Computer science; Protocol (science); Communications protocol; Channel (broadcasting); Process (computing); Distributed computing; Computer network; Embedded system; Programming language","score_opus":0.03093948496852263,"score_gpt":0.2455999227981812,"score_spread":0.21466043782965857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136209759","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016437516,0.00035071612,0.93912035,0.00027476577,0.00018971546,0.0009096958,0.0056819106,0.036913585,0.014915552],"genre_scores_gemma":[0.024486562,0.0011743491,0.9397003,0.00038844656,0.00013257659,0.004417223,0.008252499,0.007857677,0.013590313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985514,0.0003346433,0.00018317818,0.00018986002,0.0005891292,0.00015173656],"domain_scores_gemma":[0.9973738,0.0013558577,0.00019484693,0.0003223546,0.0005965739,0.00015653105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019645856,0.002877534,0.0015041806,0.0014063276,0.0011205919,0.0035263363,0.006450803,0.0024539055,0.040088706],"category_scores_gemma":[0.0058976905,0.0015266037,0.0021698764,0.0017281594,0.0009761085,0.002132144,0.0017078967,0.0047643348,0.014991544],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035915585,0.00033673606,0.0012949608,0.0028463502,0.00030961906,0.0010782174,0.0006174104,0.45758414,0.012076488,0.21628733,0.15227447,0.15493508],"study_design_scores_gemma":[0.00028869443,0.00009656578,0.00047378015,0.00038679416,0.00011355086,0.00042593537,0.00005398475,0.51862794,0.006275643,0.050914858,0.42220563,0.0001366087],"about_ca_topic_score_codex":0.0126078,"about_ca_topic_score_gemma":0.008920282,"teacher_disagreement_score":0.040088706,"about_ca_system_score_codex":0.0013746998,"about_ca_system_score_gemma":0.0031099927,"threshold_uncertainty_score":0.1341101},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03078824080446908,"score_gpt":0.21233113400902867,"score_spread":0.1815428932045596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136605427","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019256494,0.000070071306,0.9963959,0.000044585333,0.00002038322,0.000037152,0.0000070808255,0.00025508655,0.001244009],"genre_scores_gemma":[0.40238574,0.0003476865,0.5922354,0.00010941849,0.00010044214,0.0004893092,0.000085147134,0.0002496997,0.003997207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99768066,0.0008127811,0.00011534972,0.00032095137,0.0009386675,0.00013153919],"domain_scores_gemma":[0.9980445,0.000873921,0.00026625686,0.00026391185,0.00046972325,0.000081650105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026921136,0.0012082752,0.0007550936,0.0004794364,0.00044151675,0.0012823164,0.0018149664,0.0007631217,0.0028016437],"category_scores_gemma":[0.0056322278,0.0006154569,0.0006523417,0.0003453452,0.0009953555,0.0010263934,0.00087030936,0.001152178,0.0008117344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006777633,0.000036608995,0.00021042945,0.00013983189,0.000034698664,0.000052016985,0.00007383487,0.9198676,0.005275681,0.024145527,0.00061145436,0.0494846],"study_design_scores_gemma":[0.000032477783,0.00006046611,0.00003809667,0.000012550902,0.000013547666,0.00002524615,0.000007364109,0.98695475,0.0024791965,0.007296826,0.0030725328,0.000007021777],"about_ca_topic_score_codex":0.0010540632,"about_ca_topic_score_gemma":0.001098448,"teacher_disagreement_score":0.0028016437,"about_ca_system_score_codex":0.0011084937,"about_ca_system_score_gemma":0.0011586121,"threshold_uncertainty_score":0.0142374635},"labels":[],"label_agreement":null},{"id":"W2136844655","doi":"10.1109/icppw.2000.869151","title":"Managing soft QoS requirements in distributed systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Quality of service; Scheduling (production processes); Database transaction; Mobile QoS; Architecture; Service-oriented architecture; Distributed computing; Transaction processing; Multimedia; Service (business); Computer network; Service provider; Database; Web service; World Wide Web; Engineering","score_opus":0.03791758156194478,"score_gpt":0.24919908501494858,"score_spread":0.2112815034530038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136844655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069210656,0.0008319691,0.9171534,0.0014518698,0.00017953257,0.00012581966,0.00003544685,0.0018201058,0.009191217],"genre_scores_gemma":[0.76756275,0.0005865913,0.22434838,0.00031941998,0.00026804456,0.00015607422,0.00012606315,0.00024722534,0.006385567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986482,0.0003975233,0.0001070968,0.0001839112,0.00051317853,0.00014998876],"domain_scores_gemma":[0.99651045,0.0013342401,0.00032913248,0.0007687428,0.0006767809,0.00038059326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002046792,0.0005302901,0.0006158342,0.0006281,0.0014412833,0.0019229137,0.0013854404,0.0010909,0.001447138],"category_scores_gemma":[0.004831574,0.0003423347,0.000306056,0.0007148726,0.0010528875,0.0023669547,0.0015008294,0.0011206245,0.00061377045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056921085,0.0003877237,0.0047044726,0.00053515396,0.00009702318,0.0008124279,0.0023167182,0.15858227,0.069113135,0.21209829,0.011884653,0.53889906],"study_design_scores_gemma":[0.00015056721,0.00026212173,0.00094942626,0.000040421633,0.000058572892,0.00043361972,0.00033135578,0.81491375,0.015549046,0.115938984,0.051316872,0.00005532464],"about_ca_topic_score_codex":0.0019772085,"about_ca_topic_score_gemma":0.002049966,"teacher_disagreement_score":0.002046792,"about_ca_system_score_codex":0.0012925054,"about_ca_system_score_gemma":0.0011590812,"threshold_uncertainty_score":0.010824621},"labels":[],"label_agreement":null},{"id":"W2138510156","doi":"10.1145/2632160","title":"Minimizing Stack and Communication Memory Usage in Real-Time Embedded Applications","year":2014,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Preemption; Scheduling (production processes); Embedded system; Distributed computing; Design space exploration; Computation; Automotive industry; Algorithm; Operating system","score_opus":0.015777293139547174,"score_gpt":0.2609785489100433,"score_spread":0.24520125577049612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138510156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38289034,0.0022493543,0.6077464,0.0004694045,0.0000439224,0.00006297776,0.000039400293,0.0007559973,0.0057422025],"genre_scores_gemma":[0.92555207,0.00033660603,0.07310839,0.00004821445,0.0000072530643,0.000042533644,0.000018821615,0.00007334193,0.0008127348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.00013258534,0.000016595253,0.000052145406,0.00006846016,0.00008335117],"domain_scores_gemma":[0.99923563,0.0004387323,0.00013304189,0.00008125849,0.000073686875,0.000037590304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007142009,0.00062134874,0.000570407,0.0004433038,0.00045218933,0.00071448926,0.0009373579,0.00064890337,0.0009342644],"category_scores_gemma":[0.0022541818,0.00043665478,0.0002837521,0.00045152684,0.00051700504,0.0008995051,0.0005053506,0.00048678665,0.00018014992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003674924,0.00011802653,0.0012342861,0.00019986057,0.000049259466,0.00006012451,0.00012477432,0.8582595,0.040128045,0.012451259,0.0005492503,0.08645799],"study_design_scores_gemma":[0.0000273197,0.00019443598,0.000691058,0.000016808784,0.000038782644,0.00004407341,0.00006012716,0.9716893,0.019714704,0.006407946,0.001102754,0.0000126865825],"about_ca_topic_score_codex":0.0015744834,"about_ca_topic_score_gemma":0.0025920726,"teacher_disagreement_score":0.0015744834,"about_ca_system_score_codex":0.0006644967,"about_ca_system_score_gemma":0.0012871112,"threshold_uncertainty_score":0.0048213005},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Memory model; Programming language; Real time Java; Operating system; Shared memory","score_opus":0.011582332532636267,"score_gpt":0.2500236681188539,"score_spread":0.23844133558621763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138536237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007885411,0.0007047957,0.97405565,0.000372777,0.0003126525,0.000110544126,0.00021938352,0.011400989,0.0049378974],"genre_scores_gemma":[0.20537218,0.0011661648,0.76985097,0.0009715185,0.00049208326,0.00042831802,0.00096847647,0.011581147,0.009169132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586487,0.00083960925,0.0008679457,0.00050545495,0.0015070874,0.00041508157],"domain_scores_gemma":[0.9909719,0.0031265463,0.00074292195,0.0038286191,0.000910392,0.00041966885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005197397,0.0012534509,0.0012030831,0.0016083453,0.0010492022,0.0042129406,0.004325791,0.0021320395,0.007925758],"category_scores_gemma":[0.013150064,0.0026499638,0.002155178,0.002032918,0.002719719,0.011961887,0.004718199,0.0049934015,0.0020865707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001107696,0.00017121236,0.0034838517,0.0010525861,0.00013930874,0.0006761046,0.0022255692,0.0089485515,0.021325137,0.67958134,0.022012115,0.2592766],"study_design_scores_gemma":[0.0002699412,0.00021309912,0.0013004536,0.00058407785,0.00039500787,0.0014280672,0.00037070824,0.1054436,0.036315866,0.65627545,0.19713856,0.00026514518],"about_ca_topic_score_codex":0.0013341175,"about_ca_topic_score_gemma":0.0021182208,"teacher_disagreement_score":0.007925758,"about_ca_system_score_codex":0.0011443006,"about_ca_system_score_gemma":0.0015453927,"threshold_uncertainty_score":0.027486742},"labels":[],"label_agreement":null},{"id":"W2138618691","doi":"10.1109/cca.2005.1507246","title":"Universal scheduler design on uniprocessors in supervisory control of discrete-event systems framework","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Supervisory control; Scheduling (production processes); Supervisory control theory; Event (particle physics); Task (project management); Processor scheduling; Control (management); Distributed computing; Real-time computing; Mathematical optimization; Operating system; Artificial intelligence; Mathematics; Engineering","score_opus":0.026196126733821556,"score_gpt":0.251788460452958,"score_spread":0.22559233371913645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138618691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008764782,0.00034885894,0.989091,0.00006589884,0.000043917058,0.000054413147,0.000020724778,0.00042158202,0.0011888077],"genre_scores_gemma":[0.5459439,0.0006997824,0.4508796,0.00015147559,0.000104686886,0.0002830784,0.00009024488,0.00010830459,0.0017388728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904746,0.00020903267,0.00010032865,0.0002308372,0.00028343842,0.00012898719],"domain_scores_gemma":[0.99907315,0.00032776213,0.000116383606,0.00020776548,0.00018851185,0.000086353284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017518513,0.00048709576,0.0007710485,0.00044949903,0.0005246149,0.00090877403,0.0013450967,0.0004067394,0.0010701362],"category_scores_gemma":[0.001987969,0.00036858593,0.00059049734,0.00039803528,0.0011424659,0.0014208001,0.0012479905,0.0010641919,0.00023127369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029003032,0.000118885044,0.0010474407,0.00053871574,0.00009243301,0.00042482262,0.0006159607,0.29132438,0.029501854,0.52630705,0.0024739695,0.14726447],"study_design_scores_gemma":[0.000082588835,0.00022606057,0.00022431138,0.000058083515,0.000075422715,0.0001369395,0.000054782562,0.8566728,0.016598808,0.11292837,0.012907202,0.000034616034],"about_ca_topic_score_codex":0.0011184558,"about_ca_topic_score_gemma":0.0016434345,"teacher_disagreement_score":0.0017518513,"about_ca_system_score_codex":0.0006572423,"about_ca_system_score_gemma":0.0015010057,"threshold_uncertainty_score":0.009264827},"labels":[],"label_agreement":null},{"id":"W2138833561","doi":"10.1109/robot.1994.351384","title":"Analyzing the temporal behavior of real-time closed-loop robotic tasks","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Computer Research Institute of Montréal","funders":"","keywords":"Computer science; Controller (irrigation); Bridge (graph theory); Graphical user interface; Robot; Interface (matter); Human–computer interaction; Control (management); Loop (graph theory); Robotics; Artificial intelligence; Programming language; Operating system","score_opus":0.027559270399748377,"score_gpt":0.25441258856794546,"score_spread":0.2268533181681971,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138833561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08338668,0.00020178879,0.9129671,0.00007855674,0.000025818446,0.000073428244,0.00017491348,0.0011046869,0.001987082],"genre_scores_gemma":[0.71215457,0.00031107792,0.28376108,0.00007549648,0.000022061537,0.0001502309,0.00064537546,0.00025307527,0.0026271103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986904,0.00020339772,0.00007732581,0.00024747255,0.0006309382,0.00015029493],"domain_scores_gemma":[0.9954247,0.0027049659,0.0006669749,0.0005992127,0.0004884405,0.000115700765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017096944,0.0005775041,0.00035335403,0.00069665414,0.00036181317,0.0006651759,0.0010002723,0.00040431265,0.0019564023],"category_scores_gemma":[0.009046736,0.0003770528,0.0005805832,0.000508375,0.0008965612,0.0012507198,0.00058594526,0.00076926843,0.00022737136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006069326,0.00017706615,0.007293437,0.0004548881,0.00010486259,0.00047449165,0.0006105916,0.6925803,0.074930064,0.09765633,0.0013999554,0.1237111],"study_design_scores_gemma":[0.000024091272,0.000048619364,0.0012306286,0.000013693948,0.000019354651,0.00006135055,0.0000334222,0.9616883,0.017454967,0.017548408,0.0018617448,0.000015402702],"about_ca_topic_score_codex":0.00721509,"about_ca_topic_score_gemma":0.008163426,"teacher_disagreement_score":0.00721509,"about_ca_system_score_codex":0.0008629202,"about_ca_system_score_gemma":0.0015054926,"threshold_uncertainty_score":0.014346182},"labels":[],"label_agreement":null},{"id":"W2138878451","doi":"","title":"Generation of Communication Schedules for Multi-Mode Distributed Real-Time Applications","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Mode (computer interface); Real-time computing; Scheduling (production processes); Workflow; Key (lock); Mathematical optimization","score_opus":0.0665618810650459,"score_gpt":0.32225581467542236,"score_spread":0.25569393361037646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138878451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06258336,0.0000746828,0.9340518,0.000103455684,0.00002748698,0.00013379147,0.00008158201,0.0005780214,0.0023657144],"genre_scores_gemma":[0.5868758,0.00006292331,0.41120157,0.0000307406,0.00001070508,0.0001749349,0.00021026269,0.00014767694,0.0012854713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994148,0.0002444519,0.00003289797,0.00008909295,0.00015712954,0.000061650644],"domain_scores_gemma":[0.9987239,0.0006550018,0.00014903706,0.00016339183,0.00025645274,0.00005214901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011609332,0.00042322563,0.00025569226,0.00045996337,0.00039875478,0.00042178773,0.0005909376,0.00032450733,0.0019624971],"category_scores_gemma":[0.0031085857,0.00024545068,0.00034676085,0.00032653913,0.0003092581,0.00034063435,0.0004374574,0.0004726548,0.00023034195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013801361,0.0001105741,0.0009081169,0.00009603171,0.000018551784,0.00010627178,0.00009238654,0.9034787,0.014423274,0.009890003,0.0011038624,0.069634214],"study_design_scores_gemma":[0.000023154496,0.000043870175,0.00012819564,0.0000057257043,0.0000042270503,0.000019907991,0.000019731266,0.99101907,0.005421247,0.0022980114,0.001012928,0.000003837668],"about_ca_topic_score_codex":0.002474515,"about_ca_topic_score_gemma":0.003115688,"teacher_disagreement_score":0.002474515,"about_ca_system_score_codex":0.0007444488,"about_ca_system_score_gemma":0.0013877281,"threshold_uncertainty_score":0.0065651536},"labels":[],"label_agreement":null},{"id":"W2139599608","doi":"10.22215/etd/2004-05823","title":"Performance stress testing of real-time systems using genetic algorithms","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Stress testing (software); Task (project management); Unit testing; Integration testing; Real-time computing; White-box testing; Test strategy; Execution time; Reliability engineering; Distributed computing; Engineering; Operating system; Software system; Software; Systems engineering","score_opus":0.025117388965108057,"score_gpt":0.2636065452689292,"score_spread":0.23848915630382111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139599608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16381992,0.00027233118,0.8322999,0.00022685913,0.00002009618,0.00009079408,0.00003608764,0.00072412315,0.0025098796],"genre_scores_gemma":[0.70464754,0.00023035567,0.2939698,0.00006639567,0.000012342562,0.00015245617,0.000113495866,0.000073176765,0.00073430454],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851614,0.0008013326,0.000062831874,0.00013823956,0.0003821646,0.00009919896],"domain_scores_gemma":[0.9930428,0.0055675805,0.00056351867,0.00028639706,0.00045912003,0.00008060547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017255545,0.00082891126,0.00042879645,0.0010237211,0.0002942653,0.00076759554,0.0008292351,0.00073022814,0.0006120822],"category_scores_gemma":[0.009171802,0.0003113345,0.00062677515,0.00060192286,0.0010322728,0.000683432,0.00043302285,0.00061030284,0.00007880631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009181256,0.0001440079,0.003106117,0.00008294526,0.00005916005,0.000135641,0.0001435075,0.90716976,0.010762986,0.009832233,0.00023037034,0.06824144],"study_design_scores_gemma":[0.000018085928,0.00007366933,0.00043760292,0.000014866045,0.0000131945235,0.000031609274,0.000019133506,0.9868216,0.0059303693,0.0063238926,0.0003077238,0.000008264848],"about_ca_topic_score_codex":0.0031412677,"about_ca_topic_score_gemma":0.0019086393,"teacher_disagreement_score":0.0031412677,"about_ca_system_score_codex":0.0008016561,"about_ca_system_score_gemma":0.0010150702,"threshold_uncertainty_score":0.0091257095},"labels":[],"label_agreement":null},{"id":"W2141817129","doi":"10.1109/pacrim.1995.520438","title":"Porting and enhancements of a real-time object-oriented operating system","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Hort Innovation","keywords":"Porting; Computer science; Hierarchy; Scheduling (production processes); Object-oriented programming; Distributed computing; Object (grammar); Class hierarchy; Method; Operating system; Real-time operating system; Memory hierarchy; Software; Cache; Engineering; Artificial intelligence","score_opus":0.012855102902794539,"score_gpt":0.22826249012485433,"score_spread":0.2154073872220598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141817129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4676474,0.00052139536,0.49382603,0.0008593816,0.00063419057,0.00075081794,0.00008986572,0.014137689,0.021533167],"genre_scores_gemma":[0.5399345,0.00059635675,0.444012,0.00037763407,0.00031375414,0.00015116573,0.000557612,0.0020841814,0.011972748],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984629,0.00027673595,0.00018103617,0.0001960582,0.0006795435,0.0002037264],"domain_scores_gemma":[0.9966529,0.0007548498,0.0002240517,0.0012320399,0.0008366007,0.0002996351],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031513986,0.0006526535,0.0003020738,0.0004987662,0.00039116712,0.0013158977,0.0018995409,0.00047054666,0.002179074],"category_scores_gemma":[0.0065022362,0.00040547908,0.0006213309,0.0003415587,0.00039373452,0.0030451587,0.0008388638,0.0019359124,0.00062475126],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015145551,0.0013870003,0.009532445,0.00029083504,0.00008773613,0.0021008244,0.0020984104,0.021505577,0.1901827,0.015088356,0.0043877023,0.7518239],"study_design_scores_gemma":[0.000715437,0.007022362,0.019658849,0.00020169148,0.0005338539,0.0065937974,0.0013264612,0.29294536,0.41927364,0.015051804,0.23632532,0.00035146446],"about_ca_topic_score_codex":0.0011131311,"about_ca_topic_score_gemma":0.00070626556,"teacher_disagreement_score":0.0031513986,"about_ca_system_score_codex":0.00033064221,"about_ca_system_score_gemma":0.00052731275,"threshold_uncertainty_score":0.016666412},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0407747948231475,"score_gpt":0.29524860940031716,"score_spread":0.25447381457716967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143082536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8918936,0.004293158,0.096676745,0.0005272626,0.00010470379,0.000058274876,0.00003925347,0.00047237487,0.0059345243],"genre_scores_gemma":[0.98931015,0.00032981936,0.009995112,0.000040444877,0.000014373653,0.00001003414,0.000020640797,0.000027001464,0.00025237966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987978,0.00062326645,0.00005226509,0.00008722408,0.00027726128,0.00016219585],"domain_scores_gemma":[0.99433607,0.004252016,0.00046633751,0.00035319454,0.00044840053,0.00014393791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010773097,0.0006429128,0.00044199135,0.00043013453,0.0007007999,0.00066238554,0.0006180683,0.00056928815,0.0006617138],"category_scores_gemma":[0.007118523,0.0002602269,0.00028971882,0.0007305713,0.0004202434,0.0010750198,0.0004735633,0.00040146362,0.00012066115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006944375,0.00017403034,0.0044332035,0.0001894046,0.00007644788,0.00043606636,0.00014040683,0.8885636,0.022550613,0.0032265144,0.000689105,0.07882628],"study_design_scores_gemma":[0.000051127394,0.00049945625,0.003183041,0.000034006163,0.00011751852,0.00050745223,0.00017545644,0.9695395,0.021275498,0.003169738,0.0014289063,0.00001839858],"about_ca_topic_score_codex":0.002929147,"about_ca_topic_score_gemma":0.003290963,"teacher_disagreement_score":0.002929147,"about_ca_system_score_codex":0.00054646994,"about_ca_system_score_gemma":0.00063164876,"threshold_uncertainty_score":0.0058242083},"labels":[],"label_agreement":null},{"id":"W2143445561","doi":"10.1145/1879021.1879048","title":"Semantics-preserving implementation of synchronous specifications over dynamic TDMA distributed architectures","year":2010,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Toolchain; Computer science; Scheduling (production processes); Code generation; Distributed computing; Semantics (computer science); Programming language; Processor scheduling; Code (set theory); Embedded system; Parallel computing; Computer architecture; Operating system; Software","score_opus":0.012425152533636855,"score_gpt":0.28426223510491216,"score_spread":0.2718370825712753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143445561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025147283,0.000034111406,0.96945,0.00007379181,0.00003151343,0.000039225193,0.000054154214,0.0023404218,0.0028294846],"genre_scores_gemma":[0.6534458,0.0001224734,0.34119737,0.00010214627,0.00003136337,0.00020292989,0.00027646485,0.0005510969,0.0040703896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990004,0.00027367007,0.00008625169,0.0001243034,0.0003978733,0.000117547315],"domain_scores_gemma":[0.99813336,0.00070083194,0.00015205872,0.00066519657,0.00029447823,0.000054025015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014043743,0.00039348047,0.00027257868,0.00037690907,0.00048425628,0.0012252984,0.0011241913,0.00038062822,0.0017119527],"category_scores_gemma":[0.0035750854,0.0003783339,0.00043781305,0.000370277,0.0008878007,0.0018050659,0.0010363666,0.0011502397,0.00041035868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004459619,0.00025692512,0.0014295995,0.00026985072,0.00007368937,0.00045588563,0.0009482436,0.19572267,0.07675988,0.5110632,0.0031022034,0.20947194],"study_design_scores_gemma":[0.00014745335,0.00018029804,0.00015274518,0.000035495174,0.00007093414,0.00012190109,0.0001353787,0.6913163,0.13597177,0.15018718,0.021649256,0.000031284584],"about_ca_topic_score_codex":0.0015062045,"about_ca_topic_score_gemma":0.002867618,"teacher_disagreement_score":0.0017119527,"about_ca_system_score_codex":0.0005913002,"about_ca_system_score_gemma":0.0014629052,"threshold_uncertainty_score":0.007427156},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011288938097357279,"score_gpt":0.23940086277625677,"score_spread":0.22811192467889949,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144856846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26931384,0.005237147,0.70249414,0.00040457092,0.00032067622,0.00024273897,0.00017500714,0.013132937,0.0086789755],"genre_scores_gemma":[0.88588023,0.00040750482,0.109424986,0.00017472675,0.00010421219,0.00011815062,0.00014101119,0.00017460498,0.003574645],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999736,0.00004815017,0.00003059484,0.00006250736,0.00007353046,0.00004915738],"domain_scores_gemma":[0.99944836,0.000114679344,0.00009890541,0.00018371115,0.000102302634,0.000052054318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028028258,0.00046728284,0.00031177825,0.0005470362,0.0003831926,0.00060848147,0.0015459498,0.00033170148,0.0029958312],"category_scores_gemma":[0.0008274293,0.00022766506,0.0002281679,0.00038301566,0.0002783203,0.0008940371,0.0005839357,0.00046374174,0.0006267244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012776325,0.00031910368,0.0035482857,0.0007354466,0.000117876996,0.0008242226,0.00034923168,0.030780345,0.44136977,0.029667303,0.009746391,0.4812644],"study_design_scores_gemma":[0.00023490889,0.003158364,0.0033807012,0.00011186592,0.00025735286,0.0017925136,0.00011770061,0.43373296,0.46026522,0.0060825357,0.09072462,0.00014131996],"about_ca_topic_score_codex":0.0005299763,"about_ca_topic_score_gemma":0.00094920665,"teacher_disagreement_score":0.0029958312,"about_ca_system_score_codex":0.00042146278,"about_ca_system_score_gemma":0.0006429716,"threshold_uncertainty_score":0.010021985},"labels":[],"label_agreement":null},{"id":"W2145623489","doi":"10.3233/hsn-2000-187","title":"A hierarchical Quality of Service control architecture for configurable multimedia applications","year":2000,"lang":"en","type":"article","venue":"Journal of High Speed Networks","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Architecture; Multimedia; Quality of service; Control (management); Quality (philosophy); Service (business); Computer network; Service quality; Computer architecture; Distributed computing; Artificial intelligence","score_opus":0.014719516351592906,"score_gpt":0.269745154777049,"score_spread":0.2550256384254561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145623489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042364087,0.00026846823,0.94699633,0.00024305697,0.000054325537,0.0001674762,0.000064712694,0.005954533,0.0038870336],"genre_scores_gemma":[0.7146088,0.00016352907,0.28178117,0.00016457887,0.000034897996,0.00020684414,0.00015868702,0.0001533763,0.002728159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934894,0.00011337504,0.00004795751,0.00017868608,0.00022668943,0.000084334446],"domain_scores_gemma":[0.9993131,0.00013366227,0.000112506634,0.00018072041,0.00019081417,0.00006921602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009981327,0.0004974628,0.00032708063,0.0005771561,0.0006316322,0.0012250791,0.0017852752,0.0006132331,0.0015390811],"category_scores_gemma":[0.0017608629,0.00024152322,0.0003500109,0.0005141792,0.00093916594,0.00096743106,0.0006936616,0.0010520322,0.00040444024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058425736,0.00037735928,0.0041572195,0.00023420696,0.00008161013,0.0003566332,0.0005203609,0.51025736,0.11309072,0.118756235,0.0077255433,0.24385849],"study_design_scores_gemma":[0.000015873253,0.00005088328,0.0004451957,0.0000073583224,0.000012159413,0.00003648838,0.000013139073,0.98677284,0.0050828937,0.005390343,0.0021551668,0.000017689326],"about_ca_topic_score_codex":0.008727515,"about_ca_topic_score_gemma":0.008759831,"teacher_disagreement_score":0.008727515,"about_ca_system_score_codex":0.0018576583,"about_ca_system_score_gemma":0.0012450656,"threshold_uncertainty_score":0.017353415},"labels":[],"label_agreement":null},{"id":"W2145901923","doi":"10.1109/rtas.2009.26","title":"On Time-Aware Instrumentation of Programs","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Instrumentation (computer programming); Firmware; Debugging; Laptop; Software; Embedded system; TRACE (psycholinguistics); Copying; Compiler; Real-time computing; Gas meter prover; Distributed computing; Operating system; Mathematical proof","score_opus":0.011070936644039547,"score_gpt":0.24276218409147596,"score_spread":0.2316912474474364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145901923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014506531,0.0004001764,0.9811311,0.00023822469,0.000037042024,0.0000744264,0.0000459653,0.0015251026,0.00204146],"genre_scores_gemma":[0.46479252,0.0012011853,0.5278842,0.00031249935,0.00020469635,0.00038607034,0.00024648107,0.0010248864,0.0039474657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99276805,0.0020703236,0.000411483,0.001137585,0.0027309868,0.0008815561],"domain_scores_gemma":[0.9723183,0.015421112,0.0027006688,0.006930495,0.002130227,0.00049924885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041203783,0.0015672819,0.000995817,0.0020394623,0.0014087865,0.0022717922,0.002897004,0.0012903842,0.0023315428],"category_scores_gemma":[0.026866501,0.0011885008,0.0014770482,0.0018826975,0.00437094,0.006800893,0.0037296645,0.0027756195,0.00059762923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007471951,0.00017630954,0.0037384988,0.00039155097,0.0000851059,0.00043005758,0.0010226524,0.4758382,0.024088763,0.30961874,0.0024349913,0.18142788],"study_design_scores_gemma":[0.000067717825,0.00023426494,0.00073791295,0.00011843032,0.00009184723,0.00023254608,0.00013263566,0.80930865,0.016833315,0.16228606,0.009893167,0.000063570624],"about_ca_topic_score_codex":0.0049881805,"about_ca_topic_score_gemma":0.0040323306,"teacher_disagreement_score":0.0049881805,"about_ca_system_score_codex":0.0024403946,"about_ca_system_score_gemma":0.002811082,"threshold_uncertainty_score":0.021790922},"labels":[],"label_agreement":null},{"id":"W2147367432","doi":"10.1145/2038642.2038654","title":"Automated distributed implementation of component-based models with priorities","year":2011,"lang":"en","type":"preprint","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Rendezvous; Asynchronous communication; Distributed computing; Component (thermodynamics); Synchronization (alternating current); Set (abstract data type); Scheduling (production processes); Equivalence (formal languages); Execution model; Model checking; Context (archaeology); Theoretical computer science; Programming language; Mathematical optimization","score_opus":0.037484929524865394,"score_gpt":0.28239609093862716,"score_spread":0.24491116141376176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147367432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006713988,0.000014605171,0.9916592,0.000037345115,0.00001166473,0.000034104705,0.0000132297,0.0010704899,0.0004454175],"genre_scores_gemma":[0.24688613,0.000077712146,0.7511676,0.000045280827,0.000015932688,0.00018974085,0.000116385374,0.00050302746,0.0009981145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714917,0.0011062319,0.00018225056,0.00027171135,0.0011070921,0.00018352552],"domain_scores_gemma":[0.99613875,0.001753514,0.00026652226,0.0012810504,0.0004781793,0.000081977094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003020642,0.00060769124,0.00051147677,0.00040712694,0.0006370516,0.0017173354,0.0016940275,0.00080832693,0.0016868021],"category_scores_gemma":[0.008499718,0.0007470694,0.0012266203,0.0003388701,0.0010549503,0.0025218343,0.0019187067,0.0019395689,0.00040382938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025583533,0.00021846045,0.0026360836,0.00026568727,0.000117003445,0.00040630967,0.0014865366,0.43530706,0.040897578,0.3840985,0.0021485256,0.13216245],"study_design_scores_gemma":[0.000057614732,0.00003596804,0.000099576675,0.000024467938,0.000026642116,0.00005778879,0.00006407473,0.9007088,0.022245167,0.06879284,0.00786778,0.000019317391],"about_ca_topic_score_codex":0.0020192503,"about_ca_topic_score_gemma":0.0024914474,"teacher_disagreement_score":0.003020642,"about_ca_system_score_codex":0.0010191643,"about_ca_system_score_gemma":0.0023300038,"threshold_uncertainty_score":0.01597488},"labels":[],"label_agreement":null},{"id":"W2147620415","doi":"","title":"Lfm2000 - Fifth NASA Langley Formal Methods Workshop","year":2000,"lang":"en","type":"article","venue":"NASA Technical Reports Server (NASA)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; U.S. Air Force; Air Force Materiel Command; Directorate for Biological Sciences; University of Toronto; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Royal Academy of Engineering; National Science Foundation","keywords":"Aeronautics; Event (particle physics); Library science; Formal methods; Computer science; Engineering; Software engineering; Physics","score_opus":0.02320589321131141,"score_gpt":0.32410192233830454,"score_spread":0.30089602912699315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147620415","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024865502,0.0075503266,0.9146807,0.004796065,0.002586501,0.00038740522,0.0017377677,0.007480864,0.058293927],"genre_scores_gemma":[0.026454791,0.006020045,0.8464963,0.0011586512,0.0010824109,0.0012695608,0.008035342,0.0035677925,0.1059151],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99626654,0.0013334537,0.00042804793,0.00059283373,0.0011939057,0.00018518652],"domain_scores_gemma":[0.99546176,0.0018219923,0.00015742656,0.001240978,0.0011002873,0.00021750719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011192445,0.0022761738,0.0013187935,0.0020325196,0.0015474344,0.0059176884,0.0036623317,0.0019777224,0.043119807],"category_scores_gemma":[0.010540548,0.0013145818,0.0026883895,0.0015076079,0.0016895434,0.0059399568,0.003470821,0.0039823814,0.017387075],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015302413,0.00025988484,0.00066780654,0.00068442925,0.000107008746,0.00030602244,0.0011708813,0.008142613,0.0025758261,0.3173975,0.20582436,0.46271053],"study_design_scores_gemma":[0.00006268132,0.00003593682,0.00027871318,0.00061221665,0.000031921136,0.00026342724,0.00012893745,0.018260466,0.0019458468,0.12683186,0.85150653,0.000041499028],"about_ca_topic_score_codex":0.0051751644,"about_ca_topic_score_gemma":0.0046207285,"teacher_disagreement_score":0.043119807,"about_ca_system_score_codex":0.0038709205,"about_ca_system_score_gemma":0.0043643024,"threshold_uncertainty_score":0.14425015},"labels":[],"label_agreement":null},{"id":"W2147945285","doi":"10.1109/icdcs.2014.22","title":"Cooperative and Efficient Real-Time Scheduling for Automotive Communications","year":2014,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"FlexRay; Retransmission; Computer science; Scheduling (production processes); Computer network; Schedule; Transmission (telecommunications); Automotive industry; Real-time computing; Reliability (semiconductor); Transmission delay; Embedded system; Distributed computing; Network packet; Engineering; Telecommunications","score_opus":0.018054064066362705,"score_gpt":0.27196628148510155,"score_spread":0.2539122174187388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147945285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07523056,0.00064895034,0.9199424,0.00015842661,0.00007357074,0.00007878775,0.000037979295,0.0005639995,0.0032652582],"genre_scores_gemma":[0.8986618,0.00025359725,0.09911585,0.000040813655,0.000043431122,0.00008196106,0.0000743663,0.000045942717,0.0016822924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929035,0.00021516126,0.00003629081,0.0001253735,0.00020845495,0.00012425767],"domain_scores_gemma":[0.9986092,0.00052273466,0.00019241076,0.0002717254,0.00028458604,0.00011931831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010265093,0.0005596928,0.00046667544,0.0005786027,0.0005919396,0.0005477473,0.001117725,0.0003276758,0.00094896666],"category_scores_gemma":[0.0024185244,0.0002559293,0.00023308917,0.0007241985,0.00040491417,0.0007215339,0.0007066436,0.0005489845,0.00025996598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040524182,0.00012907546,0.0007142864,0.00012007679,0.00003532582,0.00011822498,0.00025686348,0.8072416,0.030801255,0.024409384,0.003191772,0.13257684],"study_design_scores_gemma":[0.000012887362,0.00005345949,0.00010468537,0.000002688003,0.0000061708465,0.000022304366,0.000020743812,0.99242204,0.0026527892,0.0033319078,0.0013643764,0.0000059709478],"about_ca_topic_score_codex":0.0035581277,"about_ca_topic_score_gemma":0.0054070745,"teacher_disagreement_score":0.0035581277,"about_ca_system_score_codex":0.00096053537,"about_ca_system_score_gemma":0.0017810015,"threshold_uncertainty_score":0.007074833},"labels":[],"label_agreement":null},{"id":"W2148583599","doi":"10.1145/2498328.2500073","title":"A taxonomy of protocol frameworks and gap analysis for adaptive publish/subscribe distributed realtime embedded systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The King's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Standardization; Protocol (science); Publication; Taxonomy (biology); Adaptive system; Distributed computing; Context (archaeology); Quality of service; Adaptive management; Profiling (computer programming); Computer network; Artificial intelligence; Operating system","score_opus":0.043835171317583334,"score_gpt":0.27143543136635334,"score_spread":0.22760026004877001,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148583599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010720233,0.009465212,0.96232396,0.0021164706,0.0003074503,0.00085599785,0.00032038082,0.001210848,0.012679334],"genre_scores_gemma":[0.12559375,0.011477108,0.8560612,0.00043070293,0.00023290177,0.001568184,0.0010324428,0.0003564439,0.0032472217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9893505,0.0023321663,0.0021150922,0.0009856723,0.004235816,0.0009807692],"domain_scores_gemma":[0.9825068,0.0074524228,0.0017792721,0.002593939,0.0050416198,0.0006259521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013418612,0.0013935713,0.0017059767,0.009307449,0.0040355604,0.009138535,0.0042484542,0.0035866108,0.0027322788],"category_scores_gemma":[0.02382544,0.001134711,0.00233119,0.009508522,0.0031451914,0.016674887,0.00386861,0.0052744495,0.0009285675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007946082,0.0001364279,0.0023508049,0.00084878405,0.000031078453,0.00034406388,0.0011271118,0.012112828,0.0014789356,0.85486597,0.0039305096,0.12269407],"study_design_scores_gemma":[0.000044565677,0.00021843599,0.0014856849,0.0016198624,0.00009818611,0.0016169831,0.0022213575,0.1671599,0.003389318,0.66717076,0.15479465,0.00018037847],"about_ca_topic_score_codex":0.005110135,"about_ca_topic_score_gemma":0.0028464536,"teacher_disagreement_score":0.013418612,"about_ca_system_score_codex":0.0041430397,"about_ca_system_score_gemma":0.0067789876,"threshold_uncertainty_score":0.07096529},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04416116553926974,"score_gpt":0.2590191950680221,"score_spread":0.21485802952875238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149075075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35650894,0.0036390584,0.596121,0.00046047504,0.00042725675,0.00035851673,0.00035915652,0.03451244,0.0076132035],"genre_scores_gemma":[0.9372604,0.00021185011,0.05907718,0.00017573898,0.000054246477,0.00008405201,0.00029642874,0.00030754274,0.0025324614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950314,0.00009122318,0.0000569278,0.00009850436,0.00013932523,0.00011092542],"domain_scores_gemma":[0.99928623,0.00013553633,0.00009091716,0.00023186284,0.0001725558,0.00008292957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077191164,0.00054478494,0.00050746725,0.00051810144,0.00046508954,0.0007864689,0.0021067755,0.00032844458,0.002322703],"category_scores_gemma":[0.0014537631,0.0003521642,0.0002612578,0.00028177793,0.0003366537,0.0013088176,0.0010651834,0.00070247625,0.00059070846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004550454,0.00048383352,0.006090211,0.000742469,0.00021645523,0.000909692,0.00070367014,0.069762364,0.41851795,0.014971278,0.023434373,0.45961732],"study_design_scores_gemma":[0.00042610336,0.0011138114,0.0026222807,0.000062987,0.0001393959,0.0005969882,0.0001477414,0.656273,0.3047797,0.0040883087,0.029614227,0.00013548066],"about_ca_topic_score_codex":0.0010609935,"about_ca_topic_score_gemma":0.0009671182,"teacher_disagreement_score":0.002322703,"about_ca_system_score_codex":0.00041254674,"about_ca_system_score_gemma":0.0008407483,"threshold_uncertainty_score":0.0077702403},"labels":[],"label_agreement":null},{"id":"W2151048737","doi":"10.1109/real.1992.242670","title":"Adaptive threshold-based scheduling for real-time and non-real-time traffic","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Workload; Network packet; Real-time computing; Scheduling (production processes); Queue; Retard; Bounded function; Computer network; Mathematical optimization; Mathematics","score_opus":0.018514462396695377,"score_gpt":0.24760176252382446,"score_spread":0.22908730012712908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151048737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083240986,0.0005115645,0.9137537,0.00015607402,0.000084625164,0.0000497239,0.000014313493,0.00028950485,0.0018995681],"genre_scores_gemma":[0.8422905,0.00027527052,0.1556355,0.000075856,0.00005807795,0.000040804913,0.000029391098,0.00006449011,0.0015301275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927837,0.000252885,0.000048484977,0.000098287994,0.0002273543,0.00009452931],"domain_scores_gemma":[0.99808717,0.0011316739,0.00014672818,0.000193439,0.00030393508,0.00013715152],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010730671,0.0003729748,0.0004394008,0.00056044094,0.0004894198,0.0009446488,0.0009938314,0.00045982524,0.000892374],"category_scores_gemma":[0.0035182359,0.0002305564,0.00026271056,0.0008053953,0.00048933324,0.0012803789,0.0004104604,0.00072593597,0.00015104697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007656064,0.00033182252,0.0026339795,0.0001598958,0.00007209887,0.00015207219,0.00039579728,0.6602702,0.04201023,0.07647934,0.0018432009,0.21488579],"study_design_scores_gemma":[0.000014219219,0.00007940568,0.00019927624,0.0000045612046,0.000007896967,0.00004377869,0.00002318006,0.9895383,0.0038453653,0.0051837983,0.00105374,0.000006545848],"about_ca_topic_score_codex":0.002391219,"about_ca_topic_score_gemma":0.0012356249,"teacher_disagreement_score":0.002391219,"about_ca_system_score_codex":0.0014235732,"about_ca_system_score_gemma":0.0011482096,"threshold_uncertainty_score":0.01032877},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02277156888542558,"score_gpt":0.23109297511938567,"score_spread":0.2083214062339601,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151250495","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008721511,0.36169648,0.13036636,0.35585615,0.010080109,0.0000699025,0.00022775073,0.00034958948,0.13263215],"genre_scores_gemma":[0.41323435,0.4463099,0.06768443,0.022551361,0.020780785,0.00023380034,0.00021713693,0.00015571504,0.02883249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987632,0.00048621447,0.000041323477,0.00013293512,0.00045860797,0.00011770751],"domain_scores_gemma":[0.99582857,0.002948092,0.00013240933,0.00032967541,0.00043644855,0.00032481135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031732966,0.00067009724,0.0010190046,0.0010349862,0.0020797697,0.0066471677,0.000998071,0.0033697211,0.008259794],"category_scores_gemma":[0.0025241564,0.00040556857,0.0005224212,0.0011949901,0.0077029956,0.017534388,0.0036024048,0.008175643,0.001247145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018465837,0.00003200488,0.00021056847,0.0004499075,0.000013706311,0.0000850123,0.00033446835,0.0015947099,0.0003459833,0.92348236,0.018420363,0.055012472],"study_design_scores_gemma":[0.000006821805,0.000075102034,0.00027232224,0.00040364492,0.00000769515,0.00017864132,0.0013250452,0.0040540523,0.0001452805,0.69063056,0.30287752,0.000023340686],"about_ca_topic_score_codex":0.0012123684,"about_ca_topic_score_gemma":0.0016092316,"teacher_disagreement_score":0.008259794,"about_ca_system_score_codex":0.0020282972,"about_ca_system_score_gemma":0.0033966962,"threshold_uncertainty_score":0.02763182},"labels":[],"label_agreement":null},{"id":"W2151562655","doi":"","title":"Lightweight EDF Scheduling with Deadline Inheritance","year":2003,"lang":"en","type":"article","venue":"University of Twente Research Information","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Computer science; Programmer; Scheduling (production processes); Distributed computing; Earliest deadline first scheduling; Correctness; Dynamic priority scheduling; Fixed-priority pre-emptive scheduling; Operating system; Rate-monotonic scheduling; Programming language; Schedule","score_opus":0.028012443753588682,"score_gpt":0.2541667800736913,"score_spread":0.22615433632010262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151562655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019444505,0.00029164736,0.97162,0.00022365623,0.0002199942,0.00018329825,0.00016054172,0.0034342392,0.004422137],"genre_scores_gemma":[0.44467586,0.00032562515,0.5408368,0.00022258119,0.00020768604,0.00042203456,0.00064480305,0.00066205923,0.012002567],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745303,0.00043035936,0.00026161806,0.00029575036,0.001052121,0.0005072229],"domain_scores_gemma":[0.9953549,0.0011191528,0.00045827334,0.0019863287,0.0007666222,0.0003147838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003590667,0.00074481283,0.0008560071,0.0011497911,0.0011993662,0.0020266792,0.0026654531,0.0010490733,0.003509198],"category_scores_gemma":[0.0069559556,0.0005760528,0.000810787,0.00097440346,0.00087468897,0.0027807849,0.0032111395,0.002015746,0.0008755261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018384388,0.0005382717,0.002813065,0.00058017723,0.000168199,0.000908996,0.0005748821,0.16649334,0.06911438,0.22815116,0.023579141,0.5052399],"study_design_scores_gemma":[0.0004083862,0.00036305856,0.0010791755,0.000075589254,0.00007697044,0.0006116788,0.000086487475,0.79489005,0.048143156,0.07588605,0.07822537,0.00015405082],"about_ca_topic_score_codex":0.0025720203,"about_ca_topic_score_gemma":0.0025506674,"teacher_disagreement_score":0.003590667,"about_ca_system_score_codex":0.0018114013,"about_ca_system_score_gemma":0.0022838318,"threshold_uncertainty_score":0.018989503},"labels":[],"label_agreement":null},{"id":"W2152514708","doi":"10.1109/ipdps.2008.4536574","title":"Formal modeling and analysis of real-time resource-sharing protocols in Real-Time Maude","year":2008,"lang":"en","type":"article","venue":"Proceedings - IEEE International Parallel and Distributed Processing Symposium","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Model checking; Distributed computing; Scheduling (production processes); Shared resource; Formal methods; Real-time computing; Theoretical computer science; Programming language; Operating system; Mathematical optimization","score_opus":0.028858538383555787,"score_gpt":0.2853864491754042,"score_spread":0.2565279107918484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152514708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056440267,0.00009029163,0.99183476,0.00015959344,0.000025621082,0.000072922834,0.00005115147,0.0005372182,0.0015843426],"genre_scores_gemma":[0.2335472,0.00048001742,0.7609959,0.00017380883,0.000062758234,0.0006636131,0.00020817934,0.0005090622,0.003359399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996861,0.0011176877,0.0002765872,0.00035392784,0.0010533076,0.0003375171],"domain_scores_gemma":[0.99518955,0.0023490076,0.00046119234,0.0013984852,0.00049481244,0.00010703554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051898975,0.0008880418,0.00080765714,0.0008693269,0.0008919979,0.0027125708,0.004524248,0.0012747991,0.0020629654],"category_scores_gemma":[0.00883636,0.0013094455,0.0024367883,0.00071055995,0.0031882022,0.004310908,0.0021021282,0.0045636347,0.0005208935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039302762,0.000038041195,0.00038298537,0.0001174051,0.000042486936,0.00016037063,0.000641481,0.11758929,0.0057165255,0.867981,0.000500665,0.0067904326],"study_design_scores_gemma":[0.00008299936,0.00008954186,0.00022976885,0.000099535326,0.0001122841,0.00021042972,0.00017865941,0.6446914,0.018066216,0.29607204,0.040097643,0.00006943823],"about_ca_topic_score_codex":0.003613827,"about_ca_topic_score_gemma":0.0037146588,"teacher_disagreement_score":0.0051898975,"about_ca_system_score_codex":0.0017144238,"about_ca_system_score_gemma":0.0021469134,"threshold_uncertainty_score":0.027447104},"labels":[],"label_agreement":null},{"id":"W2152555261","doi":"10.1002/cpe.876","title":"HLA real‐time extension","year":2004,"lang":"en","type":"article","venue":"Concurrency and Computation Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; High-level architecture; Quality of service; Jitter; Distributed computing; Embedded system; Operating system; Computer network; Interoperability; Telecommunications","score_opus":0.020370849220070392,"score_gpt":0.3145459142218544,"score_spread":0.29417506500178403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152555261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025897713,0.0010203992,0.8423133,0.0016329811,0.0012917654,0.0003670052,0.0007728066,0.015785895,0.110918224],"genre_scores_gemma":[0.40989476,0.0014652262,0.4438687,0.0017943734,0.00089812453,0.00078916596,0.005085028,0.0027564175,0.13344826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983967,0.00048583563,0.00021118624,0.00019415891,0.00048339312,0.00022876005],"domain_scores_gemma":[0.9961957,0.0005161463,0.00023570356,0.0016165847,0.0010831389,0.00035271948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160312,0.00042158537,0.0003060916,0.0004576177,0.00050351646,0.0019119013,0.0011206068,0.000766023,0.020925509],"category_scores_gemma":[0.003926382,0.00029826825,0.00037957195,0.0005386334,0.00060722895,0.0022679684,0.0020158275,0.001941063,0.0080712475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011002881,0.0002911045,0.0022743817,0.00038155896,0.00004083001,0.0009023842,0.0015261879,0.0210522,0.057896953,0.48926684,0.084648915,0.3406184],"study_design_scores_gemma":[0.00009886159,0.00017922737,0.00066009915,0.00008007247,0.00001571174,0.0007140525,0.0000928345,0.030248933,0.017335983,0.02650143,0.92402065,0.000052057807],"about_ca_topic_score_codex":0.0008132588,"about_ca_topic_score_gemma":0.00041500235,"teacher_disagreement_score":0.020925509,"about_ca_system_score_codex":0.0008411498,"about_ca_system_score_gemma":0.0010186004,"threshold_uncertainty_score":0.070002854},"labels":[],"label_agreement":null},{"id":"W2153625234","doi":"10.1109/mascot.1999.805071","title":"Evaluating concurrency options in software specifications","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Concurrency; Thread (computing); Distributed computing; Kernel (algebra); Concurrent computing; Software; Set (abstract data type); Programming language; Operating system","score_opus":0.162678024053914,"score_gpt":0.35999385605067263,"score_spread":0.19731583199675864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153625234","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024893,0.0006965097,0.47909513,0.00045804228,0.00003420681,0.00043657457,0.000233727,0.0008373287,0.015719114],"genre_scores_gemma":[0.82190335,0.00019246095,0.1766924,0.000039672577,0.000010191072,0.00018391586,0.00022422457,0.00008488574,0.0006689233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97243047,0.015940262,0.0012800134,0.001058957,0.008260263,0.0010299607],"domain_scores_gemma":[0.94320005,0.04473222,0.0033770152,0.0041470868,0.0037320987,0.00081166084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0189884,0.0013128708,0.001090896,0.0038398723,0.0010937934,0.004662345,0.0016623685,0.0014010192,0.0027823602],"category_scores_gemma":[0.06278953,0.0009393163,0.0013414564,0.0019316162,0.004032861,0.0071868845,0.0038497217,0.0013752314,0.00020660854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094759895,0.00028667657,0.012008721,0.00042255572,0.00016538582,0.00039132958,0.0010041596,0.6279489,0.009260501,0.25324854,0.00045319003,0.09386235],"study_design_scores_gemma":[0.00013425405,0.00086149416,0.001064795,0.00015225052,0.00013769086,0.00020229559,0.0009608838,0.81617284,0.014574926,0.16232327,0.0033340182,0.00008124699],"about_ca_topic_score_codex":0.002956213,"about_ca_topic_score_gemma":0.0047313278,"teacher_disagreement_score":0.0189884,"about_ca_system_score_codex":0.0033112091,"about_ca_system_score_gemma":0.0030561134,"threshold_uncertainty_score":0.10042149},"labels":[],"label_agreement":null},{"id":"W2153806073","doi":"10.1145/1542452.1542471","title":"Tracing interrupts in embedded software","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Debugging; Tracing; Computer science; Software; Software bug; Background debug mode interface; Embedded system; Operating system; Software development; Embedded software; Programming language; Software engineering","score_opus":0.015155638778312205,"score_gpt":0.2651746178182088,"score_spread":0.25001897903989656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153806073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18946157,0.0063224165,0.7890908,0.00070368557,0.00034995307,0.00015256667,0.00022491883,0.005904909,0.007789156],"genre_scores_gemma":[0.84085447,0.0018141958,0.15216775,0.00012252513,0.000107423475,0.00006597663,0.00020939553,0.0006780379,0.003980192],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9971801,0.00060155283,0.00020514299,0.00052336464,0.0013050245,0.00018486046],"domain_scores_gemma":[0.98969775,0.0050979797,0.0015936514,0.0020790088,0.0011098859,0.0004217395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022625432,0.00069783884,0.0005631292,0.0024375904,0.0010272573,0.0015736925,0.0015841413,0.0010117023,0.0013990653],"category_scores_gemma":[0.023750464,0.0011619598,0.00041751892,0.001844523,0.002013124,0.0026297797,0.0017991584,0.0019894,0.00049909693],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012770783,0.0003960111,0.03481494,0.00092224655,0.00014455462,0.0021391811,0.0064207297,0.24673925,0.034564663,0.18215434,0.007055505,0.48337156],"study_design_scores_gemma":[0.00012426946,0.0002892961,0.0060544037,0.00031133316,0.00017391906,0.00081008713,0.0004492626,0.7647826,0.024673583,0.16775748,0.03446549,0.00010830554],"about_ca_topic_score_codex":0.008274955,"about_ca_topic_score_gemma":0.0049698157,"teacher_disagreement_score":0.008274955,"about_ca_system_score_codex":0.0013205683,"about_ca_system_score_gemma":0.0015669544,"threshold_uncertainty_score":0.016453564},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02365917445607611,"score_gpt":0.2518750639337293,"score_spread":0.22821588947765323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155277639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15030771,0.002070983,0.83593136,0.0011265803,0.00025114685,0.00012957271,0.00016014093,0.0005078951,0.00951455],"genre_scores_gemma":[0.9822104,0.0004520669,0.012811817,0.00012511248,0.00010398425,0.00005184401,0.000063930274,0.00012515008,0.0040557617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803084,0.0005028126,0.00005879543,0.00026721778,0.0005164752,0.0006238635],"domain_scores_gemma":[0.99178183,0.0060947468,0.0005679767,0.00030666776,0.0009519306,0.00029673835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036405812,0.0012501129,0.001213236,0.0010088009,0.0005322534,0.0015614406,0.0016882634,0.00087063207,0.0058250492],"category_scores_gemma":[0.012106921,0.00047585386,0.00078605156,0.0010501242,0.0010501136,0.0014823137,0.00081576465,0.0015555345,0.00051877875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007467523,0.00012615634,0.00086064916,0.0002828897,0.000087037035,0.00016474756,0.00015968474,0.93987244,0.008495725,0.030494511,0.0015958108,0.017113557],"study_design_scores_gemma":[0.000007639777,0.000027256514,0.00015166971,0.0000043662776,0.0000104646,0.000014420215,0.000023939823,0.996256,0.0004160445,0.0029846176,0.00009918135,0.0000044183694],"about_ca_topic_score_codex":0.0066037276,"about_ca_topic_score_gemma":0.0027416418,"teacher_disagreement_score":0.0066037276,"about_ca_system_score_codex":0.0023771534,"about_ca_system_score_gemma":0.0018143153,"threshold_uncertainty_score":0.019486725},"labels":[],"label_agreement":null},{"id":"W2157525104","doi":"10.1109/ccece.2007.378","title":"EDF Feasibility Analysis of Accelerated Tasks","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scheduling (production processes); Task (project management); Processor scheduling; Execution time; Real-time operating system; Embedded system; Operating system; Distributed computing","score_opus":0.05377062040556424,"score_gpt":0.32641713885715884,"score_spread":0.2726465184515946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157525104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030428465,0.0003009285,0.9597025,0.00017923788,0.00007991771,0.00023124469,0.00038267652,0.00022812445,0.008466941],"genre_scores_gemma":[0.46720773,0.0007647153,0.5147338,0.0001980946,0.00016453155,0.0007609161,0.0013776177,0.0003441444,0.0144484565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981121,0.0003674411,0.00011591669,0.00021756902,0.00087869,0.00030835596],"domain_scores_gemma":[0.9943382,0.0033547087,0.0004249804,0.00025848683,0.0015062883,0.000117275675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023946704,0.0011186725,0.00058000104,0.002045538,0.00069012505,0.0010913804,0.0010264546,0.00064236677,0.0072945035],"category_scores_gemma":[0.007861864,0.0005380859,0.0017657494,0.00085916085,0.00079350604,0.0017947663,0.0011986552,0.0013936369,0.00087690784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000683914,0.00015691052,0.0023072832,0.0006199684,0.00008955834,0.0010208726,0.00022080792,0.7431989,0.021979885,0.13858733,0.0033573592,0.08777724],"study_design_scores_gemma":[0.00004246213,0.00015086183,0.0004610089,0.000058961097,0.000026403155,0.00019538206,0.00004633359,0.9465982,0.008312751,0.03759757,0.006482981,0.000027099028],"about_ca_topic_score_codex":0.0037882423,"about_ca_topic_score_gemma":0.0017610925,"teacher_disagreement_score":0.0072945035,"about_ca_system_score_codex":0.00089708716,"about_ca_system_score_gemma":0.0015259411,"threshold_uncertainty_score":0.024402559},"labels":[],"label_agreement":null},{"id":"W2159573106","doi":"10.1109/isorc.2001.922859","title":"Achieving high performance in CORBA-based systems with limited heterogeneity","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Interoperable Object Reference; Interoperability; Object request broker; Workstation; Server; Operating system; Exploit; Distributed computing; Remote direct memory access; Embedded system; Distributed object","score_opus":0.023301442785090488,"score_gpt":0.20469241714385267,"score_spread":0.18139097435876217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159573106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2920131,0.0007267674,0.6786068,0.0018932701,0.00012291683,0.00024932853,0.00006447703,0.007999525,0.01832384],"genre_scores_gemma":[0.8896345,0.00020090939,0.10576297,0.0001881756,0.0000727758,0.00015984823,0.00011886924,0.00046959435,0.0033924645],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962548,0.0009566977,0.00022505244,0.00042086368,0.0014864869,0.0006561033],"domain_scores_gemma":[0.99400556,0.0017966707,0.00053502066,0.0021662614,0.0010819697,0.00041450007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003926125,0.0006324578,0.00090582925,0.0005751355,0.0017947562,0.0028489802,0.0017541752,0.0013511105,0.0018537026],"category_scores_gemma":[0.011488117,0.0005585577,0.00044803318,0.0012501314,0.0012016618,0.0033423922,0.002140452,0.0015307852,0.0014000254],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016674987,0.00095132395,0.013019247,0.0006566226,0.00029742965,0.0017197542,0.0034440279,0.32351092,0.334429,0.12176595,0.010501803,0.18803658],"study_design_scores_gemma":[0.00041747137,0.00048128353,0.004947226,0.00006551416,0.0001140446,0.0007863203,0.0006011164,0.768549,0.10522453,0.08381788,0.03486922,0.00012641608],"about_ca_topic_score_codex":0.0025415774,"about_ca_topic_score_gemma":0.001553713,"teacher_disagreement_score":0.003926125,"about_ca_system_score_codex":0.0012679544,"about_ca_system_score_gemma":0.001440912,"threshold_uncertainty_score":0.020763576},"labels":[],"label_agreement":null},{"id":"W2159723930","doi":"10.1109/ccece.1993.332399","title":"Architecture and scale issues in static schedules","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Scheduling (production processes); Architecture; Processor scheduling; Distributed computing; Parallel computing; Operating system; Mathematical optimization; Mathematics","score_opus":0.012767147966765719,"score_gpt":0.23159989686728868,"score_spread":0.21883274890052296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159723930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13465275,0.004715018,0.7666471,0.008617589,0.0006751002,0.00017935572,0.0002568067,0.0024815423,0.08177472],"genre_scores_gemma":[0.8801982,0.0026306983,0.102150366,0.0009166846,0.0008939329,0.00040919776,0.00024325307,0.00088943116,0.011668267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748814,0.0007572725,0.00013797388,0.00048270682,0.00087484886,0.00025908794],"domain_scores_gemma":[0.9914961,0.0046875393,0.00082501397,0.0020331424,0.00069364964,0.00026461686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034254198,0.0005686431,0.0007552951,0.0009978713,0.0016167976,0.0020364646,0.0012725785,0.0012236224,0.008268293],"category_scores_gemma":[0.025844235,0.0008531876,0.0007046235,0.0013612522,0.0022862735,0.006563733,0.0023209464,0.00225957,0.0015380804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019828604,0.00010193816,0.0028271487,0.00023375181,0.00007455196,0.00039374662,0.001107347,0.20421863,0.0069632037,0.63242,0.008195724,0.14326565],"study_design_scores_gemma":[0.00011699383,0.0002550837,0.0024744847,0.0000951525,0.000091482405,0.00041330472,0.00043617512,0.2496863,0.0033817356,0.70461744,0.038372364,0.000059528626],"about_ca_topic_score_codex":0.0032907971,"about_ca_topic_score_gemma":0.002195489,"teacher_disagreement_score":0.008268293,"about_ca_system_score_codex":0.0015913721,"about_ca_system_score_gemma":0.0012580497,"threshold_uncertainty_score":0.027660191},"labels":[],"label_agreement":null},{"id":"W2160607234","doi":"10.1109/cacwd.2004.1349274","title":"The translator generation in the general intensional programming complier","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Compiler; Programming language; Computer science; Component (thermodynamics); Programming paradigm; Fifth-generation programming language; Second-generation programming language","score_opus":0.033629780567300135,"score_gpt":0.2722693506337631,"score_spread":0.23863957006646297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160607234","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029116865,0.0001750161,0.93534416,0.00037914683,0.0002110614,0.00026646664,0.0003441711,0.021260941,0.012902179],"genre_scores_gemma":[0.1735227,0.00019174894,0.7993782,0.00051449676,0.00012184016,0.00027100675,0.00085737725,0.006687161,0.018455384],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999106,0.00020995579,0.00005640368,0.00030086367,0.00020630745,0.000120464145],"domain_scores_gemma":[0.998801,0.00024363403,0.00009363593,0.0006033241,0.00021805728,0.00004043633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012783045,0.00062823587,0.0004684303,0.000505935,0.00053215906,0.0012015679,0.0012522646,0.000763269,0.009320807],"category_scores_gemma":[0.0024951263,0.00047978107,0.0008478945,0.0004599423,0.00091746816,0.001450867,0.0012104638,0.0014039583,0.0032749712],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001003105,0.00030132165,0.00346563,0.0008800242,0.00014318066,0.0023488773,0.0027532456,0.02419256,0.14818107,0.30572176,0.042749297,0.46825987],"study_design_scores_gemma":[0.00037542783,0.0004951014,0.002122083,0.00018177439,0.00020816087,0.00314459,0.00032095573,0.20719539,0.3461757,0.094345815,0.34523705,0.00019793092],"about_ca_topic_score_codex":0.0005669697,"about_ca_topic_score_gemma":0.00064540375,"teacher_disagreement_score":0.009320807,"about_ca_system_score_codex":0.0004376182,"about_ca_system_score_gemma":0.000851848,"threshold_uncertainty_score":0.031181157},"labels":[],"label_agreement":null},{"id":"W2164263266","doi":"10.1109/real.1993.393506","title":"Architectural considerations in the design of real-time kernels","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Kernel (algebra); Modularity (biology); Flexibility (engineering); Scheduling (production processes); Distributed computing; Software engineering; Engineering","score_opus":0.049518425016443504,"score_gpt":0.24864347431896516,"score_spread":0.19912504930252167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164263266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091006,0.0019175959,0.8880059,0.0015861824,0.00013134153,0.00007439681,0.000029045656,0.0011639561,0.016085597],"genre_scores_gemma":[0.66909087,0.0012900032,0.3162588,0.00035232873,0.000057658544,0.0001075637,0.000066038236,0.00038489967,0.012391888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988519,0.00038518477,0.00010694348,0.000118570315,0.00037093193,0.00016647442],"domain_scores_gemma":[0.99846315,0.0004115709,0.00022528408,0.00031763874,0.00045784452,0.00012447611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017162927,0.00036251041,0.00016607236,0.00037503257,0.000627171,0.002632509,0.0011456414,0.0008000828,0.0014884291],"category_scores_gemma":[0.0034327998,0.0006505936,0.00043800863,0.00035267422,0.0010574613,0.002348308,0.00066333404,0.0011057388,0.000651149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003220686,0.000110654306,0.0035895908,0.0006657281,0.00006439524,0.00091070984,0.0027674595,0.14313494,0.089247935,0.6502105,0.0038465029,0.10512951],"study_design_scores_gemma":[0.00011569319,0.0005074254,0.003885665,0.0002390778,0.00026492742,0.0018034573,0.0010449144,0.4602384,0.075084,0.2538158,0.20286353,0.00013715604],"about_ca_topic_score_codex":0.0014651602,"about_ca_topic_score_gemma":0.0026160718,"teacher_disagreement_score":0.002632509,"about_ca_system_score_codex":0.0009840876,"about_ca_system_score_gemma":0.0010114681,"threshold_uncertainty_score":0.0090767145},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021211683921656913,"score_gpt":0.2740264301753342,"score_spread":0.2528147462536773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164688727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12895463,0.00024244374,0.85579455,0.00020936642,0.000041099778,0.00009326558,0.00006992414,0.0028223204,0.011772315],"genre_scores_gemma":[0.74003816,0.00013266296,0.2560806,0.000047043533,0.000015323849,0.000100715144,0.00016114356,0.00019002803,0.0032342467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995908,0.00010723879,0.000025406714,0.00004359007,0.00013497414,0.00009796932],"domain_scores_gemma":[0.9993955,0.00021448912,0.00006621632,0.00015065528,0.00014615357,0.000026904772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047889468,0.000573767,0.00044224082,0.00031584315,0.00033653094,0.0008255096,0.0009167119,0.00040777618,0.0031150393],"category_scores_gemma":[0.0012815687,0.0003871942,0.00034794371,0.00029070303,0.000287489,0.00077329314,0.00048824184,0.0004402985,0.00058709434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003842308,0.00014574245,0.001198499,0.00027403023,0.000046930694,0.00025296144,0.00023063336,0.706823,0.059116222,0.03337914,0.003438593,0.19471003],"study_design_scores_gemma":[0.0000618535,0.000116095165,0.00028563017,0.000014738337,0.000018062869,0.000073664494,0.000060884155,0.96634877,0.02245457,0.006228806,0.0043261494,0.000010699599],"about_ca_topic_score_codex":0.0014017412,"about_ca_topic_score_gemma":0.0035232177,"teacher_disagreement_score":0.0031150393,"about_ca_system_score_codex":0.000401485,"about_ca_system_score_gemma":0.0009824866,"threshold_uncertainty_score":0.010420799},"labels":[],"label_agreement":null},{"id":"W2165615351","doi":"10.1109/cnsr.2009.39","title":"Message-Streams Oriented Hybrid Slot Allocation Protocol for Tactical Data Link System","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Quality of service; Computer network; Distributed computing; Protocol (science); Bandwidth (computing); Reuse; Key (lock); Bandwidth allocation; Engineering; Computer security","score_opus":0.05344078026598563,"score_gpt":0.34006396050247784,"score_spread":0.2866231802364922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165615351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031248514,0.0008054867,0.961241,0.00028523925,0.00030796748,0.0002747845,0.00007095252,0.00089209,0.0048739803],"genre_scores_gemma":[0.7611007,0.00076342793,0.2294871,0.000328438,0.0002868825,0.0009180625,0.0002705499,0.00011337455,0.006731499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925345,0.00028534624,0.00006518016,0.000077231256,0.00024515385,0.00007365671],"domain_scores_gemma":[0.9991781,0.0003104854,0.00010502768,0.00013031413,0.00021201996,0.00006394544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013575385,0.00040111147,0.00039277686,0.00059694436,0.0007246148,0.0010750178,0.001066286,0.00047906613,0.0014123834],"category_scores_gemma":[0.0015185442,0.00020555379,0.0002506263,0.0004825783,0.0006078511,0.0013942834,0.0011580284,0.0008528502,0.0003594742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013626249,0.00033308213,0.001953004,0.0006525027,0.0002538183,0.00079975324,0.001229926,0.079907425,0.13278262,0.3979162,0.012475486,0.37033367],"study_design_scores_gemma":[0.00024068374,0.0007702909,0.0006360875,0.000058078178,0.00016826407,0.0006994381,0.00021884867,0.77956456,0.08238999,0.051688664,0.08344031,0.00012481389],"about_ca_topic_score_codex":0.0003896928,"about_ca_topic_score_gemma":0.00041244982,"teacher_disagreement_score":0.0014123834,"about_ca_system_score_codex":0.0005503782,"about_ca_system_score_gemma":0.0006479995,"threshold_uncertainty_score":0.007179439},"labels":[],"label_agreement":null},{"id":"W2166667495","doi":"10.1109/tc.2007.70808","title":"Sharp Thresholds for Scheduling Recurring Tasks with Distance Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Dynamic priority scheduling; Scheduling (production processes); Fair-share scheduling; Rate-monotonic scheduling; Two-level scheduling; Job shop scheduling; Round-robin scheduling; Radar; Distributed computing; Fixed-priority pre-emptive scheduling; Mathematical optimization; Quality of service; Mathematics; Computer network","score_opus":0.02853944247007663,"score_gpt":0.24603274053938431,"score_spread":0.21749329806930767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166667495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21961755,0.0009949522,0.7737938,0.00037952702,0.000067328896,0.00018298,0.00017371184,0.00075074116,0.0040394603],"genre_scores_gemma":[0.9327634,0.00032124965,0.065241285,0.00015084796,0.000037659844,0.00017778557,0.00016787015,0.00011888858,0.0010209781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980856,0.00050764356,0.00017146385,0.0003216717,0.00054647116,0.00036721415],"domain_scores_gemma":[0.9850756,0.010505713,0.0019465926,0.0008207095,0.00078537915,0.000866038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023219527,0.00067626964,0.0010172839,0.0011323149,0.0004786448,0.0016661516,0.0010951568,0.00087320287,0.0020176817],"category_scores_gemma":[0.022041082,0.0006241249,0.00054545625,0.0008306741,0.0013728177,0.0025143512,0.0017707505,0.00182132,0.0003305423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007875464,0.00021408171,0.0021655434,0.00039354083,0.00008044833,0.00025663455,0.0005199723,0.7565449,0.04030008,0.1591589,0.0017683737,0.03780998],"study_design_scores_gemma":[0.00007196453,0.0002844798,0.00082795887,0.000029556728,0.00001958944,0.00007660907,0.00009744251,0.8819905,0.0062616514,0.10946837,0.00083023286,0.000041602994],"about_ca_topic_score_codex":0.0014352725,"about_ca_topic_score_gemma":0.0007990858,"teacher_disagreement_score":0.0023219527,"about_ca_system_score_codex":0.0014952353,"about_ca_system_score_gemma":0.0012575501,"threshold_uncertainty_score":0.0122798085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02582778607053425,"score_gpt":0.25254407931111394,"score_spread":0.22671629324057968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166778115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091338076,0.00032348692,0.90348667,0.00011582247,0.000023057686,0.0000511682,0.000035046025,0.0032781146,0.0013486113],"genre_scores_gemma":[0.82185304,0.0002692843,0.1761019,0.00005629765,0.000021636104,0.000085113825,0.000075002165,0.00038532753,0.0011523673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9975616,0.00066806894,0.00012591922,0.0003452308,0.0010197449,0.00027950632],"domain_scores_gemma":[0.99059653,0.004575361,0.0016032677,0.0022606142,0.0007525029,0.00021175915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015440321,0.00087769947,0.0004848567,0.0009802277,0.000565245,0.0008377415,0.0016010968,0.00052534364,0.0009802907],"category_scores_gemma":[0.011894325,0.0006452282,0.00045659984,0.00074720295,0.0013966697,0.0020279603,0.0014068385,0.0010238093,0.00020629066],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000655334,0.00017357453,0.0079044,0.00035379466,0.000071379145,0.00066084525,0.00095979904,0.51964074,0.13297883,0.055619653,0.0013363472,0.27964532],"study_design_scores_gemma":[0.00003517984,0.00023935252,0.0013978423,0.00004694308,0.00005870667,0.0002486934,0.00009484906,0.88547623,0.083296955,0.024678418,0.0043964386,0.000030340227],"about_ca_topic_score_codex":0.0018348764,"about_ca_topic_score_gemma":0.0017903656,"teacher_disagreement_score":0.0018348764,"about_ca_system_score_codex":0.0009308574,"about_ca_system_score_gemma":0.0014559694,"threshold_uncertainty_score":0.008165717},"labels":[],"label_agreement":null},{"id":"W2167060146","doi":"10.1109/isorc.2006.37","title":"From UML/SPT Models to Schedulability Analysis: a Metamodel-Based Transformation","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Metamodeling; Computer science; Unified Modeling Language; Applications of UML; UML tool; Model transformation; Software engineering; Software; Programming language; Artificial intelligence","score_opus":0.022612688207129143,"score_gpt":0.24297568267657876,"score_spread":0.22036299446944962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167060146","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048927306,0.00003967086,0.99022317,0.00016164027,0.00003391365,0.00013985719,0.00017739648,0.0022718995,0.0020597267],"genre_scores_gemma":[0.08289643,0.0002501195,0.91241556,0.00014470851,0.00002431617,0.0004328025,0.00084537186,0.00076213427,0.002228633],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978115,0.0007013028,0.00021699714,0.00029346973,0.00082706084,0.00014973251],"domain_scores_gemma":[0.9976157,0.0008615527,0.00024768765,0.00076552265,0.00044266874,0.000066923996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026870589,0.00080250716,0.00042896223,0.0018450911,0.00047090786,0.0015261823,0.001063976,0.0008101507,0.0016547715],"category_scores_gemma":[0.0061955494,0.000589891,0.0016788082,0.0011046723,0.0007029049,0.0018656559,0.0015435492,0.0021431504,0.0013013596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003240297,0.0006120555,0.0026468032,0.00067354913,0.00017450668,0.0017307553,0.0029636135,0.15641186,0.11794025,0.28850198,0.01019845,0.41782215],"study_design_scores_gemma":[0.00007092421,0.00018990388,0.0008663916,0.00030479438,0.00014413739,0.000916155,0.00053066236,0.6485708,0.11092417,0.12753013,0.109865904,0.000086141285],"about_ca_topic_score_codex":0.0021718286,"about_ca_topic_score_gemma":0.0016954989,"teacher_disagreement_score":0.0026870589,"about_ca_system_score_codex":0.0010740304,"about_ca_system_score_gemma":0.0023060082,"threshold_uncertainty_score":0.014210641},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016267727378757414,"score_gpt":0.24115385902251826,"score_spread":0.22488613164376084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169142010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08023485,0.0002613621,0.91618377,0.00012098492,0.0000660547,0.00005250042,0.00005724185,0.00064424967,0.002379055],"genre_scores_gemma":[0.7923769,0.00026682313,0.2046615,0.000071645845,0.000037077647,0.00010139757,0.00011872771,0.00014006362,0.002225791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992879,0.00016787476,0.000054183278,0.000103125436,0.00024644245,0.00014039737],"domain_scores_gemma":[0.99902165,0.00039912944,0.00014792246,0.00018902925,0.0001515582,0.00009061336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095222035,0.00043358956,0.0006828809,0.00043049615,0.00040216726,0.0013045073,0.0015478263,0.0005370869,0.00104478],"category_scores_gemma":[0.0029174583,0.00048370147,0.0005378536,0.0007208072,0.0005917394,0.0015499841,0.0006232552,0.0008197583,0.00027684277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037792602,0.0001685054,0.0010889124,0.00020055963,0.00007129784,0.00024239335,0.00030919525,0.8126374,0.027973957,0.088409536,0.0021702084,0.06635019],"study_design_scores_gemma":[0.000025273934,0.000043750268,0.00008284325,0.000005992115,0.00000879888,0.000037450434,0.000017592918,0.9788179,0.0032194161,0.016626474,0.0011053211,0.000009285408],"about_ca_topic_score_codex":0.003690273,"about_ca_topic_score_gemma":0.0031804813,"teacher_disagreement_score":0.003690273,"about_ca_system_score_codex":0.0010770521,"about_ca_system_score_gemma":0.0018275018,"threshold_uncertainty_score":0.007814646},"labels":[],"label_agreement":null},{"id":"W2170502774","doi":"10.1017/s0263574704000360","title":"Reconfigurable distributed real-time processing for multi-robot control: Design, implementation and experimentation","year":2004,"lang":"en","type":"article","venue":"Robotica","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Controller (irrigation); Embedded system; Synchronization (alternating current); Software; Real-time Control System; Control system; Real-time computing; Engineering; Control (management); Operating system","score_opus":0.04616690826976223,"score_gpt":0.32630148527249986,"score_spread":0.28013457700273764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170502774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2592354,0.00094427087,0.7295735,0.00027140926,0.00008494678,0.0004119392,0.000060904902,0.0026318775,0.006785779],"genre_scores_gemma":[0.6773845,0.00039744395,0.31970426,0.000040673287,0.000015639072,0.0001936225,0.00010264755,0.00010229125,0.0020588879],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996735,0.000088551955,0.000016192544,0.000052633633,0.0001263609,0.000042851567],"domain_scores_gemma":[0.99964285,0.000106003725,0.000040650826,0.000084632826,0.00009697799,0.000028866989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006453315,0.00040567454,0.00020038264,0.00020814966,0.00018174342,0.0004964148,0.0011526055,0.00034704377,0.0013099662],"category_scores_gemma":[0.0007427304,0.0001992992,0.00019071077,0.000210794,0.00031988905,0.00043651016,0.00018311726,0.00051368587,0.00026045574],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005772126,0.00050895906,0.0035780047,0.0007602461,0.00011057398,0.0003111958,0.00041279625,0.24729465,0.40885624,0.017906046,0.0018240316,0.31786007],"study_design_scores_gemma":[0.00031575243,0.0026282156,0.0046361443,0.00007599364,0.00010195359,0.0004056693,0.00012010503,0.66228443,0.30668968,0.0033305814,0.019360675,0.000050776387],"about_ca_topic_score_codex":0.0016071905,"about_ca_topic_score_gemma":0.0012227072,"teacher_disagreement_score":0.0016071905,"about_ca_system_score_codex":0.00046265515,"about_ca_system_score_gemma":0.0005337872,"threshold_uncertainty_score":0.0043822527},"labels":[],"label_agreement":null},{"id":"W2170753697","doi":"10.1109/tc.2014.2315617","title":"SLA: A Stage-Level Latency Analysisfor Real-Time Communicationin a Pipelined Resource Model","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Carbon Management Canada; Canada Foundation for Innovation","keywords":"Computer science; Latency (audio); Pipeline (software); Parallel computing; Data transmission; Transmission (telecommunications); Distributed computing; Computer network; Operating system; Telecommunications","score_opus":0.030228198371584903,"score_gpt":0.2530044651024675,"score_spread":0.22277626673088258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170753697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019719021,0.00030600396,0.9762249,0.00016386103,0.000035548353,0.00007787456,0.00014363047,0.0006770945,0.002652098],"genre_scores_gemma":[0.77454025,0.00057141104,0.2180363,0.00024452107,0.00016660408,0.00033600096,0.00034348236,0.0005500035,0.00521143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844295,0.00029176034,0.000058081623,0.00017191957,0.00061465095,0.00042062835],"domain_scores_gemma":[0.9974789,0.0011702629,0.00031129396,0.00038027833,0.00053830905,0.00012091013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016845295,0.0013760469,0.0007049731,0.0012814966,0.0006543239,0.0012275425,0.0019575711,0.00069061684,0.00547969],"category_scores_gemma":[0.004543881,0.00070574414,0.0014206648,0.0009664941,0.0010229181,0.0022164413,0.0012371353,0.0016430112,0.0010537826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017293687,0.000066345245,0.0010817156,0.00017433912,0.000047159116,0.0000960798,0.00008997286,0.9297742,0.016457332,0.027291702,0.0015918448,0.023156283],"study_design_scores_gemma":[0.0000062947493,0.00004750645,0.00015158561,0.000006639589,0.000012158606,0.000014924723,0.000011310285,0.9912846,0.0023429692,0.0053506647,0.00076265004,0.0000085814],"about_ca_topic_score_codex":0.006089747,"about_ca_topic_score_gemma":0.004541279,"teacher_disagreement_score":0.006089747,"about_ca_system_score_codex":0.001903975,"about_ca_system_score_gemma":0.0040772413,"threshold_uncertainty_score":0.018331409},"labels":[],"label_agreement":null},{"id":"W2172127605","doi":"10.1109/icci.1993.315376","title":"On the concurrency of C++","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Lakehead University","keywords":"Computer science; Programming language; Concurrency; Thread (computing); Syntax; Semantics (computer science); Process calculus; Interface description language; Function (biology); Concurrency control; Object (grammar); Set (abstract data type); Theoretical computer science; User interface; Artificial intelligence","score_opus":0.036395038869680894,"score_gpt":0.22053245528484777,"score_spread":0.18413741641516687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172127605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040800297,0.004191519,0.9512069,0.0026162714,0.00072836917,0.00012082522,0.000089572604,0.0015461689,0.035420373],"genre_scores_gemma":[0.18900202,0.009415345,0.76462394,0.0032852613,0.001931197,0.0007402296,0.00033998385,0.001730513,0.028931579],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9930656,0.0019514741,0.00044601408,0.0008074296,0.0032192324,0.00051025813],"domain_scores_gemma":[0.9923928,0.0040782085,0.00027457444,0.001484712,0.0014567951,0.00031288769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060481904,0.0012969892,0.0008996937,0.0018402368,0.002145102,0.005074755,0.0026211566,0.0016090844,0.0061691],"category_scores_gemma":[0.019255256,0.0011575707,0.001211525,0.0025761826,0.0075327577,0.00901101,0.004396822,0.0059393235,0.0018722785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006557885,0.000016014425,0.00017329246,0.00012301009,0.000014330904,0.000112437854,0.0004478374,0.008724136,0.0007336332,0.9433114,0.0044724545,0.041805893],"study_design_scores_gemma":[0.00008950978,0.000060754566,0.0001376411,0.0002689866,0.0000309519,0.00022619285,0.00006748303,0.04153963,0.0024162983,0.76053613,0.19454637,0.000080065205],"about_ca_topic_score_codex":0.009386691,"about_ca_topic_score_gemma":0.0046693427,"teacher_disagreement_score":0.009386691,"about_ca_system_score_codex":0.0022777293,"about_ca_system_score_gemma":0.003295843,"threshold_uncertainty_score":0.031986237},"labels":[],"label_agreement":null},{"id":"W22221353","doi":"10.4315/0362-028x.jfp-11-206","title":"A Prioritized Cache for Multi- tasking Real-time Systems","year":2004,"lang":"en","type":"article","venue":"Journal of Food Protection","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Cache; Parallel computing; Embedded system; Real-time computing","score_opus":0.04765246232752905,"score_gpt":0.2771733229173958,"score_spread":0.22952086058986676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22221353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14419824,0.0024201802,0.7866323,0.0017095319,0.00090529834,0.0011158002,0.0011814284,0.047757566,0.014079671],"genre_scores_gemma":[0.54039097,0.0005529445,0.44722238,0.00033783677,0.0001458663,0.0005223411,0.0019979102,0.0013145306,0.0075152633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728215,0.00066793564,0.00022217879,0.000537051,0.0009698699,0.00032081708],"domain_scores_gemma":[0.99307513,0.0017374468,0.00044737902,0.002023086,0.0020371766,0.0006798328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036432839,0.0012485231,0.000989765,0.0010364674,0.0010279621,0.0023058876,0.0031284245,0.0010211632,0.0095334975],"category_scores_gemma":[0.009564569,0.0007423536,0.00060626236,0.0010325286,0.0005753214,0.0030945747,0.0025463365,0.0013717526,0.003222732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056739617,0.001055388,0.01657576,0.0011654866,0.00031938002,0.0012915772,0.0012454302,0.09344862,0.07642745,0.02002339,0.050857294,0.73191625],"study_design_scores_gemma":[0.00032324533,0.00085014245,0.0031330714,0.000102851,0.000109309156,0.00033071305,0.00044507568,0.9240941,0.017626463,0.011254022,0.041643936,0.00008701897],"about_ca_topic_score_codex":0.0072233235,"about_ca_topic_score_gemma":0.011760024,"teacher_disagreement_score":0.0095334975,"about_ca_system_score_codex":0.0012695065,"about_ca_system_score_gemma":0.003038446,"threshold_uncertainty_score":0.031892717},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11583515431485146,"score_gpt":0.35848702047921077,"score_spread":0.2426518661643593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2230430964","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014461771,0.9789386,0.008925197,0.0007049579,0.0006927478,0.00004485798,0.00011505335,0.0001938396,0.008938613],"genre_scores_gemma":[0.012365237,0.97142684,0.009782393,0.0005083106,0.0010853901,0.00007314533,0.00040124333,0.000067928166,0.004289476],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99911934,0.00013281977,0.0001097929,0.00012599118,0.00041429405,0.00009775982],"domain_scores_gemma":[0.99795854,0.0010358798,0.00014987531,0.0001202033,0.00065694936,0.00007850594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010562284,0.0011325527,0.0009878795,0.0033275418,0.0004942326,0.0014897472,0.0016765321,0.0011828227,0.006446801],"category_scores_gemma":[0.0031055785,0.0006875923,0.00064943975,0.0058928085,0.00038925454,0.002998567,0.0007212046,0.0010531844,0.003510224],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067259134,0.000100162884,0.000661921,0.010668865,0.000050108698,0.00008920616,0.00012264725,0.0032237174,0.002460231,0.016913073,0.035410717,0.9302321],"study_design_scores_gemma":[0.000019536828,0.00018769823,0.0011701832,0.00420555,0.00009974159,0.0007421216,0.00013833704,0.0041331197,0.0019271414,0.008510126,0.9788149,0.000051523766],"about_ca_topic_score_codex":0.0019076604,"about_ca_topic_score_gemma":0.0018448988,"teacher_disagreement_score":0.006446801,"about_ca_system_score_codex":0.00084586703,"about_ca_system_score_gemma":0.0021120873,"threshold_uncertainty_score":0.021566749},"labels":[],"label_agreement":null},{"id":"W2243986521","doi":"10.1561/1000000042","title":"Utilization Control and Optimization of Real-Time Embedded Systems","year":2015,"lang":"en","type":"article","venue":"Foundations and Trends® in Electronic Design Automation","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Workload; Overhead (engineering); Correctness; Identification (biology); Model predictive control; Real-time computing; Optimal control; Distributed computing; Control (management); Embedded system","score_opus":0.033771433767366923,"score_gpt":0.27993699571382574,"score_spread":0.24616556194645883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243986521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03705262,0.00088334276,0.95585084,0.00027408113,0.00006486474,0.000034113444,0.0000304374,0.00032902914,0.005480669],"genre_scores_gemma":[0.97902966,0.0004615701,0.018687973,0.00004932042,0.000036115813,0.00005575746,0.000029683024,0.000035575224,0.0016143938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930084,0.0002040244,0.00003492047,0.00015952384,0.0001996918,0.00010107533],"domain_scores_gemma":[0.99924195,0.00034044404,0.00015599089,0.000047658043,0.00018356342,0.000030404897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077806565,0.00087285397,0.00061145716,0.00043320018,0.0003070933,0.0010947844,0.00058274006,0.00050052645,0.000834918],"category_scores_gemma":[0.0020638893,0.00033609974,0.00033830485,0.00043185518,0.0007729385,0.0006733798,0.0006417001,0.0008019777,0.0001878275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026216689,0.0000187053,0.00017149364,0.000041487965,0.000010477403,0.000019332485,0.000024853816,0.98132426,0.0026508628,0.0038360804,0.00019334597,0.011682883],"study_design_scores_gemma":[0.000002242565,0.000011013014,0.000074363845,0.0000021022533,0.0000016167525,0.0000022456877,0.000002645244,0.9988254,0.00036960078,0.0005875311,0.00011921856,0.000001947152],"about_ca_topic_score_codex":0.00466261,"about_ca_topic_score_gemma":0.0023307842,"teacher_disagreement_score":0.00466261,"about_ca_system_score_codex":0.0008002067,"about_ca_system_score_gemma":0.0008313899,"threshold_uncertainty_score":0.009270906},"labels":[],"label_agreement":null},{"id":"W2244692060","doi":"10.4271/2007-01-3246","title":"Development of a Single-Fluid Consumable Infrastructure for Life Support Systems","year":2007,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University; National Aeronautics and Space Administration","keywords":"Computer science","score_opus":0.019630676211252633,"score_gpt":0.2556567362703406,"score_spread":0.23602606005908794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244692060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087652415,0.0005417055,0.872958,0.0005750927,0.00026582295,0.0010148148,0.0005450526,0.007924077,0.028523022],"genre_scores_gemma":[0.3952362,0.00062851043,0.5790528,0.00013226943,0.000078531266,0.0005466591,0.0016206576,0.0005596137,0.022144727],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994893,0.00004611744,0.000023870396,0.000078472345,0.00026777064,0.000094551964],"domain_scores_gemma":[0.99933594,0.000047843136,0.00004824607,0.00008364874,0.0003653733,0.00011893998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059478683,0.0005653832,0.0003838022,0.0007193338,0.00059216365,0.0010223829,0.0015831143,0.0004932518,0.0071801273],"category_scores_gemma":[0.0008404308,0.00030735604,0.0003989679,0.00038615338,0.000286136,0.0014578036,0.00087245984,0.00068114355,0.0037498195],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038995885,0.0005677816,0.0036171216,0.00078857737,0.00004912686,0.00045765666,0.00030729393,0.03683478,0.35500696,0.025464796,0.015711164,0.56080467],"study_design_scores_gemma":[0.00021809747,0.0038103221,0.009770928,0.00032490818,0.00011476871,0.000831341,0.0005010975,0.25967938,0.3729675,0.0058363597,0.34580198,0.00014332004],"about_ca_topic_score_codex":0.0026070187,"about_ca_topic_score_gemma":0.002802138,"teacher_disagreement_score":0.0071801273,"about_ca_system_score_codex":0.00088493683,"about_ca_system_score_gemma":0.0030917504,"threshold_uncertainty_score":0.024019897},"labels":[],"label_agreement":null},{"id":"W2267524288","doi":"10.4271/2004-01-0717","title":"Cost Efficient Integration for Decentralized Automotive ECU","year":2004,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Automotive industry; Computer science; Manufacturing engineering; Engineering","score_opus":0.02100672304752314,"score_gpt":0.2795319903750557,"score_spread":0.25852526732753256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2267524288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15256293,0.00063676824,0.78733987,0.00040518554,0.00011121657,0.00018611492,0.00017816547,0.0039177416,0.054662034],"genre_scores_gemma":[0.7956981,0.00024699542,0.18073373,0.00011177797,0.000054428092,0.00013419101,0.00037013646,0.00030394402,0.022346698],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992822,0.00008553508,0.00002476035,0.00010496963,0.00041579647,0.00008683303],"domain_scores_gemma":[0.9996284,0.000057904937,0.000046751386,0.00013321686,0.00010759788,0.000026073627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033564775,0.00056256965,0.0004966541,0.000517011,0.00036342687,0.0011400236,0.0011281483,0.00055875734,0.0077080266],"category_scores_gemma":[0.00077550736,0.00031744977,0.00033101533,0.0004731996,0.00028512024,0.0012099335,0.0011285712,0.0006054017,0.002727482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003774253,0.00034199862,0.0018305621,0.0003910782,0.000061507955,0.00072461064,0.0002735848,0.15787874,0.28296039,0.062857956,0.00874641,0.48355573],"study_design_scores_gemma":[0.00018085011,0.00132747,0.006905537,0.00008945006,0.00012997295,0.0012463245,0.00025254465,0.7475217,0.13017514,0.024483686,0.087598234,0.0000890716],"about_ca_topic_score_codex":0.00086029706,"about_ca_topic_score_gemma":0.0018203866,"teacher_disagreement_score":0.0077080266,"about_ca_system_score_codex":0.00073982426,"about_ca_system_score_gemma":0.0005993913,"threshold_uncertainty_score":0.025785863},"labels":[],"label_agreement":null},{"id":"W2301657048","doi":"10.4271/2016-01-0063","title":"Hardware and Software Constraints for Automotive Firewall Systems?","year":2016,"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":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Firewall (physics); Computer science; Automotive industry; Software; Embedded system; Operating system; Software engineering; Engineering","score_opus":0.015181498004937382,"score_gpt":0.24725327968685984,"score_spread":0.23207178168192247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301657048","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21696919,0.0092865415,0.31781414,0.018026646,0.0023957011,0.00041817265,0.0013775924,0.0029953904,0.4307166],"genre_scores_gemma":[0.9397705,0.001496195,0.026745887,0.00067461014,0.00030827167,0.00015956406,0.0005084892,0.0003027197,0.030033622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980781,0.00041080767,0.00009845505,0.00030601563,0.0005529735,0.00055369217],"domain_scores_gemma":[0.9959611,0.0017919102,0.00037214422,0.0005862817,0.001027268,0.0002613932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001428437,0.00073987676,0.00054781255,0.0005341364,0.00084032665,0.0035417832,0.0012955804,0.0013939218,0.04363319],"category_scores_gemma":[0.010429691,0.00051030755,0.00042275988,0.00038443203,0.00070538477,0.0055409605,0.0011654416,0.0013455605,0.0056847506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064105005,0.00036043604,0.0076312036,0.0011792603,0.0000970572,0.0009494877,0.00040080643,0.10953762,0.024141883,0.5115288,0.050561223,0.29297125],"study_design_scores_gemma":[0.00014942336,0.0007634339,0.008762498,0.0008199462,0.00013132326,0.0013056058,0.0015486468,0.55719376,0.025155803,0.23849954,0.165532,0.00013808614],"about_ca_topic_score_codex":0.003360326,"about_ca_topic_score_gemma":0.0037895364,"teacher_disagreement_score":0.04363319,"about_ca_system_score_codex":0.0009677873,"about_ca_system_score_gemma":0.0015349649,"threshold_uncertainty_score":0.14596754},"labels":[],"label_agreement":null},{"id":"W2302024315","doi":"10.2514/1.g001830","title":"Gain-Scheduling Control Design in the Presence of Hidden Coupling Terms","year":2016,"lang":"en","type":"article","venue":"Journal of Guidance Control and Dynamics","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Gain scheduling; Control theory (sociology); Scheduling (production processes); Computer science; Coupling (piping); Control (management); Mathematical optimization; Mathematics; Engineering; Artificial intelligence","score_opus":0.012198188914604807,"score_gpt":0.237563135518927,"score_spread":0.22536494660432219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2302024315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022214038,0.00014816089,0.97382915,0.00016737,0.00007362683,0.00003751367,0.000018148836,0.00010544765,0.0034066183],"genre_scores_gemma":[0.9619889,0.00013855202,0.034728974,0.000053567404,0.00005067623,0.00005963811,0.000029741965,0.000030173422,0.002919793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999561,0.000103228995,0.000018552686,0.00009184126,0.00014165793,0.00008366335],"domain_scores_gemma":[0.99903417,0.0004823787,0.00014522363,0.00006498569,0.00021338573,0.000059929203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011714508,0.00097489,0.00092908577,0.00031239414,0.0005361129,0.0010486546,0.00089932175,0.001057627,0.002141936],"category_scores_gemma":[0.0026043234,0.00046836448,0.0004065223,0.00034876398,0.00083526934,0.00081385265,0.0012184004,0.0014332135,0.0003032404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021056348,0.00007024357,0.00026315817,0.00012383619,0.00004233263,0.000092159775,0.000118416785,0.9450613,0.00812423,0.017848661,0.00059863715,0.027446436],"study_design_scores_gemma":[0.000015518757,0.000053860997,0.000060265567,0.0000047551453,0.00000731672,0.000008206365,0.0000050959047,0.9969221,0.00069953623,0.0020355445,0.0001839382,0.000003883073],"about_ca_topic_score_codex":0.0040312656,"about_ca_topic_score_gemma":0.0029741798,"teacher_disagreement_score":0.0040312656,"about_ca_system_score_codex":0.00069498934,"about_ca_system_score_gemma":0.0013912739,"threshold_uncertainty_score":0.008015633},"labels":[],"label_agreement":null},{"id":"W2305990993","doi":"10.1109/icecs.2015.7440344","title":"Implementation of multiple PID controllers on FPGA","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"PID controller; Field-programmable gate array; Computer science; Control theory (sociology); Control (management); Control engineering; Embedded system; Temperature control; Engineering; Artificial intelligence","score_opus":0.041366283276630604,"score_gpt":0.3036625164651144,"score_spread":0.2622962331884838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2305990993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09625548,0.0010314806,0.86003387,0.00022017513,0.0005004271,0.00039971163,0.00018877945,0.015200047,0.026169963],"genre_scores_gemma":[0.58691525,0.00032333634,0.39884555,0.00013190739,0.00006755197,0.00020948901,0.00023924418,0.0001763082,0.013091321],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996903,0.000024765595,0.000025915486,0.00007346423,0.000112561764,0.0000730328],"domain_scores_gemma":[0.9997669,0.00004071205,0.000024485993,0.000056053326,0.00008915332,0.000022772667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002081973,0.00056386716,0.0004228117,0.0005938528,0.00033761168,0.00071794394,0.0010246846,0.00036870895,0.008361474],"category_scores_gemma":[0.00048478553,0.00023356681,0.0002648631,0.0002631608,0.00012499593,0.0004629232,0.00028045045,0.00046383197,0.0014585388],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006719756,0.00030830695,0.002035844,0.0005873617,0.000097869866,0.00085389795,0.0002296754,0.04993579,0.24309956,0.0072185504,0.007941383,0.6870198],"study_design_scores_gemma":[0.00034745832,0.001358827,0.0044388203,0.00013793273,0.00013097786,0.0018959395,0.0001500881,0.48047742,0.41600832,0.0035358376,0.09141176,0.00010668266],"about_ca_topic_score_codex":0.0012523297,"about_ca_topic_score_gemma":0.0013498893,"teacher_disagreement_score":0.008361474,"about_ca_system_score_codex":0.00035511193,"about_ca_system_score_gemma":0.00051979517,"threshold_uncertainty_score":0.027971983},"labels":[],"label_agreement":null},{"id":"W2310760888","doi":"10.4271/2016-01-0056","title":"Feasibility Study for a Secure and Seamless Integration of Over the Air Software Update Capability in an Advanced Board Net Architecture","year":2016,"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":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Computer science; Architecture; Software; Software architecture; Software engineering; Computer architecture; Distributed computing; Embedded system; Operating system","score_opus":0.014926215800456635,"score_gpt":0.2805631115523566,"score_spread":0.26563689575189997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2310760888","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7705266,0.0002303089,0.19333674,0.0012011614,0.00025787615,0.0018602089,0.00014211833,0.0018615931,0.030583417],"genre_scores_gemma":[0.9278115,0.00010782874,0.06280921,0.00016115233,0.00003055558,0.00033695824,0.00014739341,0.00009061042,0.0085048005],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796414,0.00060890184,0.00012997743,0.00019220267,0.00075255777,0.0003521843],"domain_scores_gemma":[0.99654263,0.00078071246,0.00028018057,0.0006190408,0.0013962878,0.0003811702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022002722,0.0004884688,0.00019554507,0.00047166867,0.0004562894,0.001504748,0.0012013351,0.0011255146,0.0065519228],"category_scores_gemma":[0.004579093,0.0002866288,0.00037177882,0.00015793786,0.0005046822,0.0025168508,0.00087018666,0.0009255215,0.0013914773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00523744,0.0040086154,0.027840855,0.0009805004,0.00018113991,0.0044841906,0.0026184116,0.045507543,0.60454977,0.050713815,0.00954331,0.24433449],"study_design_scores_gemma":[0.0013520103,0.027468976,0.02822132,0.0003757915,0.00042392255,0.0029760431,0.0030904044,0.4415408,0.40492034,0.007292499,0.08213486,0.00020310291],"about_ca_topic_score_codex":0.00192992,"about_ca_topic_score_gemma":0.0011280156,"teacher_disagreement_score":0.0065519228,"about_ca_system_score_codex":0.00062152225,"about_ca_system_score_gemma":0.0013882761,"threshold_uncertainty_score":0.021918356},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.016073283377652216,"score_gpt":0.2212362122154326,"score_spread":0.2051629288377804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314658126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049374916,0.00012472628,0.9470921,0.000049447175,0.000029330307,0.000043190004,0.000030838255,0.00026816552,0.0029872963],"genre_scores_gemma":[0.93926525,0.00010130156,0.05894859,0.000019988229,0.000015475314,0.00007961084,0.00006412933,0.000027919208,0.0014776412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996201,0.00008642026,0.00002378253,0.00008355825,0.00013646451,0.00004966784],"domain_scores_gemma":[0.99970835,0.00011366996,0.000053303833,0.000038045266,0.000064282045,0.000022398337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004122281,0.00037911232,0.0003591351,0.00020815543,0.00023465454,0.00038997547,0.0006481888,0.00022433058,0.00080620503],"category_scores_gemma":[0.00075987115,0.00015024471,0.00033871632,0.00018411045,0.00044543322,0.00040034155,0.00030870514,0.0004318688,0.000111193556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000154912,0.00006018452,0.0004711198,0.00008908108,0.00001594483,0.0001290526,0.00010021243,0.91856605,0.01769083,0.032828163,0.0004887736,0.029405756],"study_design_scores_gemma":[0.000011006355,0.000040585473,0.000074541465,0.0000017894465,0.0000035617034,0.000011536893,0.000003818032,0.99522144,0.0018225845,0.0024761818,0.0003294735,0.0000034469006],"about_ca_topic_score_codex":0.0022607688,"about_ca_topic_score_gemma":0.0018279628,"teacher_disagreement_score":0.0022607688,"about_ca_system_score_codex":0.00046058683,"about_ca_system_score_gemma":0.00085957895,"threshold_uncertainty_score":0.004495144},"labels":[],"label_agreement":null},{"id":"W2318672080","doi":"10.2514/6.2009-6813","title":"Space Vehicle Flight Software Analysis via Monte Carlo Driven Simulation","year":2009,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Monte Carlo method; Computer science; Software; Space vehicle; Simulation; Aerospace engineering; Operating system; Engineering; Mathematics; Statistics","score_opus":0.010177167338872533,"score_gpt":0.24868337233594853,"score_spread":0.238506204997076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318672080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05808499,0.00025219904,0.924681,0.00021689411,0.000047461686,0.00018368791,0.0003159671,0.0016764442,0.014541445],"genre_scores_gemma":[0.66663986,0.00045949497,0.32583252,0.000093261784,0.000031422274,0.0004908881,0.0005897599,0.00039006633,0.0054727565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995552,0.00012665793,0.000014788187,0.000037356767,0.00021286047,0.00005321603],"domain_scores_gemma":[0.99820924,0.0012362303,0.00013323849,0.00010946278,0.00026764028,0.000044136876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008581566,0.00046169982,0.0004162756,0.001073563,0.00055311935,0.0009201952,0.0008962781,0.0008124432,0.0039633014],"category_scores_gemma":[0.0032379928,0.00046666677,0.0006804356,0.000637607,0.00051590876,0.00055115717,0.000492993,0.00075440854,0.0005013458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008818133,0.000013594792,0.0004972856,0.000015903232,0.000008611051,0.000018736084,0.00001627431,0.98930043,0.00034714045,0.00589887,0.00024061016,0.0036336319],"study_design_scores_gemma":[0.0000020247564,0.0000035070575,0.00005552433,0.0000025747847,0.0000013734004,0.000004441495,0.0000040463647,0.9981256,0.00015581452,0.0011964052,0.00044685675,0.0000018451273],"about_ca_topic_score_codex":0.020198978,"about_ca_topic_score_gemma":0.0149613805,"teacher_disagreement_score":0.020198978,"about_ca_system_score_codex":0.0012253083,"about_ca_system_score_gemma":0.002121935,"threshold_uncertainty_score":0.0401628},"labels":[],"label_agreement":null},{"id":"W2319966494","doi":"10.3182/20050703-6-cz-1902.01452","title":"AN EVENT-TRIGGERED COMMUNICATION PROTOCOL FOR INTELLIGENT REAL-TIME CONTROL","year":2005,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Node (physics); Identifier; Computer network; Priority ceiling protocol; Scheduling (production processes); Protocol (science); Distributed computing; Event (particle physics); Real-time computing; Dynamic priority scheduling; Engineering; Rate-monotonic scheduling; Quality of service","score_opus":0.017993818745122514,"score_gpt":0.3123048212891355,"score_spread":0.294311002544013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319966494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008813961,0.000293827,0.98354995,0.00018548942,0.00034742037,0.00012156494,0.000047005367,0.0016022281,0.005038503],"genre_scores_gemma":[0.702592,0.0005644997,0.28301594,0.00033281132,0.0003154064,0.0004737489,0.00025710554,0.00023056046,0.012217813],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992611,0.000199527,0.00006960694,0.00010165246,0.00028435088,0.000083829174],"domain_scores_gemma":[0.99907184,0.0003412422,0.00007432985,0.00021060015,0.00023138704,0.00007053978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011996598,0.0005503217,0.0005405333,0.00048210283,0.00062450656,0.0012793946,0.001307708,0.0007409045,0.003973921],"category_scores_gemma":[0.0022197764,0.00022911053,0.00030094013,0.0004553708,0.0005655707,0.0013275127,0.0010200907,0.0013029855,0.00064907747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019467395,0.00041825583,0.0005232855,0.00044675535,0.00014318501,0.00075900333,0.00040210615,0.14700575,0.097931705,0.3263346,0.020462392,0.4036263],"study_design_scores_gemma":[0.00021604396,0.00048938516,0.00028011116,0.000031427873,0.000084338026,0.00036014352,0.000043783628,0.87092936,0.039478283,0.054744594,0.033277232,0.00006518729],"about_ca_topic_score_codex":0.00042912317,"about_ca_topic_score_gemma":0.0006204247,"teacher_disagreement_score":0.003973921,"about_ca_system_score_codex":0.00034053225,"about_ca_system_score_gemma":0.0007743277,"threshold_uncertainty_score":0.013294101},"labels":[],"label_agreement":null},{"id":"W2321521204","doi":"10.3166/jesa.45.173-188","title":"Analyse de latence et fraîcheur pire cas sur systèmes avioniques modulaires intégrés","year":2011,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Art; Humanities","score_opus":0.052565864897659194,"score_gpt":0.2827062150622652,"score_spread":0.230140350164606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2321521204","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9357408,0.0008649191,0.05715455,0.00018765559,0.00007135181,0.000051465613,0.00034212158,0.0008686993,0.004718298],"genre_scores_gemma":[0.99116755,0.00012891777,0.006150886,0.000013471013,0.000020614434,0.000034228877,0.00022511958,0.00009623732,0.0021630677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783903,0.00040872546,0.00008718374,0.00039214635,0.0008885697,0.00038440115],"domain_scores_gemma":[0.98605144,0.010691356,0.00080262363,0.00048586776,0.0016853011,0.00028342986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002593919,0.0011029704,0.0014468775,0.002864518,0.0013093948,0.002554143,0.0008857711,0.0011947807,0.0040575047],"category_scores_gemma":[0.013669779,0.00038762426,0.001270628,0.0012002758,0.0010709848,0.0012051935,0.00067197805,0.001482887,0.0004719806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032330884,0.0004640381,0.041232336,0.00086784025,0.00041791183,0.0021032812,0.0012296818,0.7472492,0.0838489,0.01136027,0.0015650953,0.10642839],"study_design_scores_gemma":[0.00004022559,0.00042680706,0.024817023,0.0000337766,0.00011193261,0.0005451028,0.00030318482,0.94149905,0.029218651,0.001372905,0.0015783184,0.000052975327],"about_ca_topic_score_codex":0.014190339,"about_ca_topic_score_gemma":0.0080024265,"teacher_disagreement_score":0.014190339,"about_ca_system_score_codex":0.0025225661,"about_ca_system_score_gemma":0.001005411,"threshold_uncertainty_score":0.028215528},"labels":[],"label_agreement":null},{"id":"W2322871827","doi":"10.1115/detc2015-47759","title":"Efficiently Handling Process Overruns and Underruns in Real-Time Embedded Systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Process (computing); Real-time computing; Distributed computing; Robustness (evolution); Overhead (engineering); Operating system; Engineering","score_opus":0.03186314673328252,"score_gpt":0.2835030490325499,"score_spread":0.2516399022992674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322871827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096928425,0.0005017719,0.8995341,0.00010965189,0.0000626729,0.0000814264,0.000023065706,0.002158865,0.0005999779],"genre_scores_gemma":[0.6616605,0.0002225395,0.33600503,0.00008509429,0.00006250415,0.000091930975,0.00007908683,0.00045971235,0.0013336596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976999,0.00058695866,0.00019248192,0.00037345634,0.00096754014,0.00017972558],"domain_scores_gemma":[0.99201715,0.0031226575,0.0017306637,0.0018325618,0.0010530273,0.00024382131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025567077,0.0010835056,0.0009980462,0.0010747726,0.0006845118,0.0010251215,0.001470812,0.00056140806,0.0007263214],"category_scores_gemma":[0.010202773,0.000645869,0.0004798396,0.0006260799,0.00086467044,0.0014824705,0.0011208128,0.0013521746,0.00025810066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009344415,0.00026728204,0.015129192,0.00028901125,0.00017765099,0.0006179981,0.0010029784,0.46221507,0.07327516,0.007847481,0.0013213742,0.4369224],"study_design_scores_gemma":[0.00004361198,0.00019793495,0.0020374546,0.000028591616,0.0000572352,0.00023921528,0.000092848044,0.9400042,0.049071427,0.0052002757,0.0029664503,0.00006086093],"about_ca_topic_score_codex":0.0023259514,"about_ca_topic_score_gemma":0.0036890672,"teacher_disagreement_score":0.0025567077,"about_ca_system_score_codex":0.00054611976,"about_ca_system_score_gemma":0.0020338101,"threshold_uncertainty_score":0.013521373},"labels":[],"label_agreement":null},{"id":"W2324668475","doi":"10.2514/6.2016-1667","title":"Hard Real-Time General-Purpose Robotic Simulations of Autonomous Air Vehicles","year":2016,"lang":"en","type":"article","venue":"AIAA Modeling and Simulation Technologies Conference","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Robot; Real-time computing; Aeronautics; Artificial intelligence; Engineering","score_opus":0.0372790976787864,"score_gpt":0.2623757074966967,"score_spread":0.2250966098179103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2324668475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13941528,0.00021736017,0.8380958,0.00025882953,0.00011794586,0.00014964599,0.0003138499,0.0015024565,0.019928899],"genre_scores_gemma":[0.9070836,0.00025184845,0.0852667,0.0001198888,0.000024467101,0.00023588724,0.00035940667,0.0002707405,0.0063874936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952054,0.00012249814,0.000026786292,0.00005940827,0.00018885868,0.00008186231],"domain_scores_gemma":[0.9990877,0.00041557645,0.00010387796,0.0001692253,0.0001282702,0.00009538661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067652855,0.0006907594,0.0005374203,0.00033640684,0.0003706517,0.0010691962,0.0016885567,0.0008433532,0.0031130586],"category_scores_gemma":[0.0027199918,0.0004303435,0.0007081925,0.00019608747,0.0010957813,0.0012668377,0.0016016755,0.0013632203,0.00039970755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046380766,0.000017863755,0.00039670346,0.000028745271,0.000010585762,0.00003675794,0.000045431792,0.98333734,0.0017764381,0.011801189,0.00020872433,0.0022938468],"study_design_scores_gemma":[0.000010552293,0.000014920482,0.0000611665,0.0000031481147,0.0000025158295,0.0000073567185,0.000007074516,0.9957767,0.0008535152,0.0023045,0.0009547378,0.0000038032224],"about_ca_topic_score_codex":0.0048092073,"about_ca_topic_score_gemma":0.0031307407,"teacher_disagreement_score":0.0048092073,"about_ca_system_score_codex":0.00076423265,"about_ca_system_score_gemma":0.00093740615,"threshold_uncertainty_score":0.010414243},"labels":[],"label_agreement":null},{"id":"W2327999114","doi":"10.3166/jesa.47.109-123","title":"Sur la stabilisation de systèmes min-max-plus incertains","year":2013,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.024627361657327682,"score_gpt":0.25712090000257076,"score_spread":0.23249353834524308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2327999114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10231548,0.0028598725,0.86968577,0.0012465616,0.0005791579,0.00014220826,0.0001464684,0.0005675583,0.02245687],"genre_scores_gemma":[0.8939162,0.0027136132,0.06861348,0.00039196172,0.00060134334,0.00033150226,0.0002734282,0.00030575556,0.032852735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982035,0.00064180786,0.00007082588,0.00035909234,0.00050288904,0.00022186506],"domain_scores_gemma":[0.9942579,0.004459795,0.00025874935,0.00018667062,0.00063027267,0.00020654988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029641602,0.0030185503,0.0020271365,0.0012195674,0.0013687883,0.0033232225,0.0012342393,0.0019355622,0.0060691717],"category_scores_gemma":[0.011215318,0.0006163803,0.00164903,0.0009052111,0.0036776161,0.0019177428,0.0021145882,0.00609838,0.0010804083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015110251,0.00011566515,0.0007736718,0.0004387737,0.00020897166,0.00042022162,0.0006148905,0.8225137,0.014070891,0.10692113,0.0024260057,0.049985074],"study_design_scores_gemma":[0.00007578051,0.00027457415,0.00047622347,0.000040993426,0.00003182594,0.000075126205,0.00008724438,0.9655077,0.003880771,0.027706193,0.0018133816,0.00003019059],"about_ca_topic_score_codex":0.01620249,"about_ca_topic_score_gemma":0.0064423042,"teacher_disagreement_score":0.01620249,"about_ca_system_score_codex":0.0025385332,"about_ca_system_score_gemma":0.0020585223,"threshold_uncertainty_score":0.03221637},"labels":[],"label_agreement":null},{"id":"W2333537446","doi":"10.1115/detc2009-87769","title":"Pre-Run-Time Scheduling of Asynchronous and Periodic Processes With Offsets, Release Times, Deadlines, Precedence and Exclusion Relations","year":2009,"lang":"en","type":"article","venue":"Volume 3: ASME/IEEE 2009 International Conference on Mechatronic and Embedded Systems and Applications; 20th Reliability, Stress Analysis, and Failure Prevention Conference","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Uniprocessor system; Asynchronous communication; Computer science; Scheduling (production processes); Offset (computer science); Computation; Distributed computing; Parallel computing; UTC offset; Processor scheduling; Real-time computing; Multiprocessing; Algorithm; Mathematical optimization; Computer network; Mathematics; Schedule; Operating system","score_opus":0.010726381374165343,"score_gpt":0.2598256145242697,"score_spread":0.24909923315010438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333537446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048882455,0.00047722136,0.94589794,0.000067483095,0.0000948939,0.00022119851,0.00004191859,0.000573797,0.0037430804],"genre_scores_gemma":[0.4140918,0.0005340924,0.5806708,0.00005703574,0.00012231685,0.0003629692,0.00016025308,0.00016421416,0.0038365498],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985436,0.00029504293,0.00016487773,0.00022353357,0.00063550594,0.00013737426],"domain_scores_gemma":[0.9970649,0.0013124535,0.0004939807,0.0005913154,0.00039452672,0.00014289295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017365036,0.00062525255,0.00061953184,0.00060073216,0.00083691924,0.0010915946,0.0010001756,0.00033267058,0.0015744398],"category_scores_gemma":[0.003960906,0.00039607912,0.00038916362,0.0005053614,0.000704058,0.0011783297,0.00075730303,0.0012868893,0.0004253527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013924864,0.00045993374,0.00354524,0.0007339697,0.00007860821,0.0011043,0.0012071019,0.17430426,0.21545602,0.16448805,0.0020813018,0.43514875],"study_design_scores_gemma":[0.00029472247,0.0014774709,0.0024178305,0.00016595035,0.00018164894,0.0011869521,0.00036606786,0.61490774,0.25066954,0.069261044,0.058902804,0.0001682412],"about_ca_topic_score_codex":0.0007617714,"about_ca_topic_score_gemma":0.0019711393,"teacher_disagreement_score":0.0017365036,"about_ca_system_score_codex":0.0004813993,"about_ca_system_score_gemma":0.0025891673,"threshold_uncertainty_score":0.009183645},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014735158770347787,"score_gpt":0.2555779986494441,"score_spread":0.2408428398790963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336850053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312303,0.0092770895,0.9135572,0.0017760784,0.0028002192,0.00016391916,0.00012579332,0.0012575188,0.022729918],"genre_scores_gemma":[0.7923431,0.004141996,0.18962365,0.0004960855,0.001958281,0.00009990291,0.00015834629,0.00048154348,0.010697221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977744,0.0007801366,0.00013362292,0.00032970807,0.00064386416,0.00033834146],"domain_scores_gemma":[0.99296135,0.00400498,0.000426516,0.0010731684,0.0010498853,0.00048407048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004254058,0.00086046517,0.0009944058,0.0007539636,0.0006948019,0.0020516485,0.0015162193,0.00076530204,0.0065400177],"category_scores_gemma":[0.009615004,0.00036239848,0.00046417164,0.00103978,0.00068056665,0.0034725496,0.0006550758,0.0018699337,0.0011405786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042053973,0.00036472495,0.0017103584,0.0009895812,0.00014734645,0.00017428817,0.00028221039,0.083110526,0.025099328,0.35607854,0.008889387,0.5189483],"study_design_scores_gemma":[0.0005136819,0.0026089756,0.002032287,0.00016870657,0.00041764555,0.0006078814,0.00033317064,0.6632813,0.038836163,0.2492545,0.04183663,0.000109085544],"about_ca_topic_score_codex":0.0012196457,"about_ca_topic_score_gemma":0.0015862997,"teacher_disagreement_score":0.0065400177,"about_ca_system_score_codex":0.000985028,"about_ca_system_score_gemma":0.001819699,"threshold_uncertainty_score":0.022497892},"labels":[],"label_agreement":null},{"id":"W2342398110","doi":"10.1109/rtas.2016.7461364","title":"Trading Cores for Memory Bandwidth in Real-Time Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Parallel computing; Shared memory; Multi-core processor; Uniform memory access; Memory bandwidth; Scheduling (production processes); Distributed memory; Flat memory model; Bandwidth (computing); Interleaved memory; Set (abstract data type); Distributed computing; Memory management; Semiconductor memory; Computer hardware; Computer network","score_opus":0.023439565737268284,"score_gpt":0.25403590518793395,"score_spread":0.23059633945066565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342398110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20441027,0.0035108048,0.784442,0.00042917405,0.00018756148,0.00009085394,0.000039630933,0.0014542982,0.005435433],"genre_scores_gemma":[0.89501953,0.00031091156,0.103039734,0.000073368625,0.000042110965,0.00004677321,0.000021953963,0.00009065425,0.0013549594],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859756,0.0005814724,0.0001016211,0.00023319184,0.0003088271,0.00017736411],"domain_scores_gemma":[0.9978607,0.0009296117,0.0002542456,0.0006521654,0.0001728508,0.000130396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001467493,0.0006652555,0.0006549403,0.0006672261,0.00086276105,0.0013085197,0.001546432,0.0006050475,0.001344496],"category_scores_gemma":[0.0043665823,0.00038764052,0.0003134861,0.00094668503,0.00072652625,0.002432435,0.0010537565,0.00059061695,0.0002597492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015726733,0.00027364955,0.0029783505,0.00038846832,0.000148561,0.0003030449,0.0006167147,0.44275612,0.06138903,0.044020392,0.0027556948,0.4427973],"study_design_scores_gemma":[0.00009026046,0.00023214752,0.0007884074,0.000022582724,0.000068041845,0.00016943298,0.00008173826,0.9337564,0.030191548,0.02857685,0.0059868265,0.000035764286],"about_ca_topic_score_codex":0.0011549537,"about_ca_topic_score_gemma":0.0022301874,"teacher_disagreement_score":0.001546432,"about_ca_system_score_codex":0.0008765057,"about_ca_system_score_gemma":0.0008935665,"threshold_uncertainty_score":0.007760942},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11538801406367741,"score_gpt":0.34079204929081536,"score_spread":0.22540403522713795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344324982","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30359605,0.0012580736,0.6861854,0.00030140427,0.00006697799,0.00017545663,0.00006651485,0.0019842633,0.006365819],"genre_scores_gemma":[0.940591,0.00007355458,0.058170613,0.000048772825,0.000014122868,0.00003722094,0.000034182576,0.000058785496,0.0009717523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928075,0.00019373444,0.00004925529,0.00009093053,0.00026908598,0.00011631124],"domain_scores_gemma":[0.99851424,0.00056999596,0.00024096902,0.00020677816,0.0003746219,0.00009348406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008997524,0.0004778138,0.00028006142,0.00050222134,0.00048038672,0.0007766785,0.0010072427,0.00026469323,0.0010743211],"category_scores_gemma":[0.0019261177,0.0002491546,0.00015466748,0.0001987614,0.00039366767,0.00083102245,0.000625971,0.0005143701,0.00013237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013712015,0.00028986187,0.008020871,0.00064848445,0.00011676928,0.00046090814,0.00059930695,0.3520377,0.3234328,0.026878228,0.0039629433,0.28218088],"study_design_scores_gemma":[0.000054412045,0.0002529494,0.0011240771,0.00001937359,0.00003867635,0.00014820592,0.000048270296,0.94174707,0.047627896,0.004123672,0.0047829775,0.000032437634],"about_ca_topic_score_codex":0.0024478645,"about_ca_topic_score_gemma":0.00487291,"teacher_disagreement_score":0.0024478645,"about_ca_system_score_codex":0.0006774799,"about_ca_system_score_gemma":0.0011881285,"threshold_uncertainty_score":0.004915476},"labels":[],"label_agreement":null},{"id":"W2351542693","doi":"","title":"The Scheduling System In Distributed Realtime Embedded Middleware","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Distributed computing; Scheduling (production processes); Fair-share scheduling; Earliest deadline first scheduling; Dynamic priority scheduling; Round-robin scheduling; Two-level scheduling; Common Object Request Broker Architecture; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Operating system; Schedule; Mathematical optimization","score_opus":0.013965107618794208,"score_gpt":0.2294716747862808,"score_spread":0.2155065671674866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2351542693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0116459895,0.0009614729,0.9596524,0.00038017947,0.0004888563,0.00022499595,0.00013578979,0.01293707,0.013573226],"genre_scores_gemma":[0.2693177,0.0011486696,0.6874296,0.0005146348,0.00031160214,0.0005008738,0.00065303553,0.0016024644,0.038521376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908566,0.00028017425,0.00010452328,0.00017176566,0.00026962833,0.00008822879],"domain_scores_gemma":[0.99958986,0.000081316684,0.000033791424,0.00014673959,0.00010037106,0.000047928737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015795015,0.00032078262,0.00045122267,0.0004440867,0.0007984811,0.0017423608,0.00109873,0.00062209676,0.0034923707],"category_scores_gemma":[0.0018613525,0.0004337249,0.00043068908,0.0006038558,0.00063040986,0.0012896685,0.0008954723,0.0012156281,0.0019696616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044685436,0.00016635736,0.0018118378,0.00066227576,0.00009430456,0.0006927282,0.0012918315,0.039604057,0.0680445,0.50578076,0.02981613,0.35158834],"study_design_scores_gemma":[0.00026537586,0.00036823886,0.0013079259,0.00019525646,0.00012502361,0.0008618036,0.00021673231,0.23511504,0.080120824,0.09222033,0.5891028,0.00010074837],"about_ca_topic_score_codex":0.001636924,"about_ca_topic_score_gemma":0.0008899728,"teacher_disagreement_score":0.0034923707,"about_ca_system_score_codex":0.0010538719,"about_ca_system_score_gemma":0.00144836,"threshold_uncertainty_score":0.011683166},"labels":[],"label_agreement":null},{"id":"W2354384919","doi":"","title":"A Fusion Mechanism for Analyzing Real-Time Performance of Embedded Systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Real-time computing; Software; Task (project management); Overhead (engineering); Fusion mechanism; Set (abstract data type); Execution time; Embedded system; Real-time operating system; Distributed computing; Fusion; Operating system; Programming language","score_opus":0.013425544362863499,"score_gpt":0.23939331319923532,"score_spread":0.22596776883637182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2354384919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022891086,0.00029969958,0.97299904,0.00007799239,0.000052542637,0.000067813904,0.0001239362,0.0022861985,0.001201645],"genre_scores_gemma":[0.62704897,0.00042403594,0.3703712,0.00009201291,0.00014067943,0.00023838469,0.00040953036,0.00022966447,0.0010454543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994896,0.00063913455,0.00039228672,0.0009918421,0.0027423922,0.00033822728],"domain_scores_gemma":[0.9930661,0.0020411662,0.000980184,0.001789481,0.0018832459,0.00023987282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046277232,0.0013468156,0.0016215561,0.004827994,0.0008568619,0.0023025244,0.0013747901,0.0010720795,0.0011304375],"category_scores_gemma":[0.012417818,0.00056757533,0.0014744006,0.0034267236,0.0010082681,0.004618615,0.001832587,0.0013725178,0.00052403135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018861301,0.00038499312,0.00908826,0.00045728398,0.0005826893,0.00045505527,0.0012122777,0.16076411,0.14600231,0.076182924,0.003461508,0.5995225],"study_design_scores_gemma":[0.00008786067,0.0007672921,0.0065734866,0.00006962293,0.0003269991,0.0006393893,0.00016210403,0.8005684,0.13873175,0.04219611,0.009634381,0.00024249975],"about_ca_topic_score_codex":0.0009455434,"about_ca_topic_score_gemma":0.00028085796,"teacher_disagreement_score":0.004827994,"about_ca_system_score_codex":0.0010709424,"about_ca_system_score_gemma":0.0009836499,"threshold_uncertainty_score":0.024474025},"labels":[],"label_agreement":null},{"id":"W2362858160","doi":"","title":"Time-Triggered Technique Realized on Redundant CAN Channels","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Bandwidth (computing); Distributed computing; Redundancy (engineering); Computer network; Channel (broadcasting); Real-time computing","score_opus":0.015096786345752254,"score_gpt":0.23626380340307798,"score_spread":0.22116701705732572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2362858160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08468552,0.0013200704,0.88768893,0.00029147998,0.0005801193,0.00019454492,0.0001177889,0.0021715981,0.022949992],"genre_scores_gemma":[0.8683457,0.0005103015,0.12500343,0.00013986527,0.00018085055,0.00008115001,0.000091721166,0.00009048104,0.0055566],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994475,0.000093403374,0.000028409802,0.00011181074,0.00021292464,0.00010600939],"domain_scores_gemma":[0.99942374,0.00010956253,0.00008609114,0.00017731015,0.00015452737,0.0000486886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000346703,0.000390805,0.00037074782,0.00056358427,0.0005365006,0.00070155767,0.0010414857,0.0004385783,0.0024785143],"category_scores_gemma":[0.0006371117,0.00021028331,0.0002694509,0.0005586258,0.00035879956,0.0012905089,0.0006036688,0.0004961471,0.00040694865],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016653362,0.00027291971,0.0016722705,0.0007268006,0.00015083258,0.001384612,0.00055525714,0.04760895,0.46363425,0.14860424,0.010085343,0.3236392],"study_design_scores_gemma":[0.00027441437,0.0009936802,0.0010903346,0.00008274321,0.00027566424,0.0014847765,0.00019624815,0.49249747,0.40016186,0.030949851,0.07185616,0.0001367589],"about_ca_topic_score_codex":0.00047162414,"about_ca_topic_score_gemma":0.0005704253,"teacher_disagreement_score":0.0024785143,"about_ca_system_score_codex":0.0003500753,"about_ca_system_score_gemma":0.00053063396,"threshold_uncertainty_score":0.008291423},"labels":[],"label_agreement":null},{"id":"W2371457485","doi":"","title":"Research and Improvement in Mutex Problem of TCP Layer Task in an ERTOS","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Computer science; Semaphore; Zeta-TCP; Preemption; Task (project management); Layer (electronics); Protocol stack; TCP acceleration; Computer network; TCP hole punching; Compound TCP; TCP global synchronization; Operating system; Stack (abstract data type); Transmission Control Protocol; Network packet","score_opus":0.050210823966293436,"score_gpt":0.33644136192077934,"score_spread":0.2862305379544859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371457485","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19511668,0.0049051866,0.78640825,0.0016984382,0.00047391304,0.00015215956,0.000067860274,0.0012106642,0.009966832],"genre_scores_gemma":[0.8631533,0.0028003592,0.12837595,0.00023199603,0.00045079106,0.000115731775,0.000114498594,0.0001538549,0.0046035885],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9972186,0.00081563444,0.00017055897,0.0005009576,0.0008281502,0.00046612736],"domain_scores_gemma":[0.99405,0.0030003698,0.0005742718,0.000746871,0.0013658433,0.00026263206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026791415,0.0006536514,0.0008554892,0.0015207502,0.0013847714,0.0017521683,0.0017698725,0.00088849844,0.0018558026],"category_scores_gemma":[0.010515458,0.00035819734,0.00073033175,0.001006905,0.001069485,0.0045192004,0.0010855845,0.0013588448,0.00026330558],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013102841,0.0006468401,0.019031625,0.00082444825,0.00022779316,0.00079825317,0.0012933625,0.26710466,0.027669765,0.17174602,0.008425061,0.5009219],"study_design_scores_gemma":[0.000054557942,0.00023564548,0.0016349895,0.000057130776,0.000094230825,0.00045354717,0.00035635266,0.949815,0.013407367,0.026766676,0.0070898794,0.000034632736],"about_ca_topic_score_codex":0.0030840146,"about_ca_topic_score_gemma":0.0012858405,"teacher_disagreement_score":0.0030840146,"about_ca_system_score_codex":0.0014375137,"about_ca_system_score_gemma":0.0017380815,"threshold_uncertainty_score":0.014168799},"labels":[],"label_agreement":null},{"id":"W2384806434","doi":"10.1145/2846096","title":"Minimizing Stack Memory for Hard Real-Time Applications on Multicore Platforms with Partitioned Fixed-Priority or EDF Scheduling","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Preemption; Multi-core processor; Scheduling (production processes); Parallel computing; Fixed-priority pre-emptive scheduling; Dynamic priority scheduling; Integer programming; Fair-share scheduling; Distributed computing; Earliest deadline first scheduling; Rate-monotonic scheduling; Algorithm; Operating system; Mathematical optimization; Quality of service; Computer network","score_opus":0.0343571888096782,"score_gpt":0.2681399171626417,"score_spread":0.2337827283529635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2384806434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39951766,0.0012203287,0.5926948,0.00026577784,0.000044580967,0.00016565231,0.000106468746,0.0004899733,0.0054947427],"genre_scores_gemma":[0.83778685,0.00031061246,0.16041699,0.000044050223,0.000009517075,0.00008676258,0.00008368891,0.00007968094,0.0011818737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997173,0.00008599988,0.000012000994,0.000036547262,0.00006830885,0.00007984187],"domain_scores_gemma":[0.99956137,0.00024902518,0.00006786415,0.000029505185,0.000056124976,0.000036037876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000567213,0.000965049,0.00057067815,0.0005473783,0.00040854423,0.0007011333,0.00066889735,0.0003824499,0.000897141],"category_scores_gemma":[0.0015800069,0.00031406197,0.00041349657,0.00052897324,0.00037251305,0.00070877286,0.00048014958,0.00034331865,0.00008895589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010418048,0.000070567774,0.00043753165,0.00009066597,0.0000233444,0.00005497449,0.000034329303,0.9628021,0.0063631767,0.0017614147,0.00026944902,0.027988382],"study_design_scores_gemma":[0.000020579006,0.00008981325,0.00023133484,0.0000061598807,0.000015494477,0.000017885319,0.00003364408,0.9943585,0.0034488454,0.0014387413,0.00033458404,0.0000044215767],"about_ca_topic_score_codex":0.0055744615,"about_ca_topic_score_gemma":0.008147874,"teacher_disagreement_score":0.0055744615,"about_ca_system_score_codex":0.00094698404,"about_ca_system_score_gemma":0.0017505324,"threshold_uncertainty_score":0.01108402},"labels":[],"label_agreement":null},{"id":"W2393017132","doi":"","title":"Improvement of Linux Kernel Real-Time Performance","year":2007,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Interrupt; Linux kernel; Operating system; Kernel (algebra); Time-sharing; Configfs; sysfs; Linux Unified Key Setup; Embedded system","score_opus":0.006386372155005751,"score_gpt":0.2312162952487538,"score_spread":0.22482992309374805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393017132","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6059186,0.007385066,0.29519254,0.0022356557,0.0010204875,0.00015412142,0.0003266834,0.04147003,0.046296876],"genre_scores_gemma":[0.9412998,0.0011693384,0.04954065,0.00012796583,0.00021170921,0.000031032123,0.00032305144,0.0007820802,0.006514368],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988086,0.00015523139,0.00009520141,0.00019385094,0.0004898308,0.0002572233],"domain_scores_gemma":[0.99695516,0.0003212528,0.00021084273,0.00078801764,0.0015074711,0.00021727683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009827329,0.00063296553,0.0005433832,0.0010711112,0.00047306722,0.0012270508,0.001100222,0.00045287327,0.0029312174],"category_scores_gemma":[0.0065117767,0.00017127194,0.00031985794,0.0008592342,0.00021555979,0.0016773416,0.00092621625,0.0007829529,0.0021405658],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001391685,0.0005116352,0.010878259,0.00050472055,0.00009421201,0.0003293975,0.0007287291,0.024304587,0.25807145,0.00980704,0.015175446,0.67820275],"study_design_scores_gemma":[0.0004799709,0.0022535056,0.048967026,0.00011748858,0.00034378655,0.0021071956,0.0003796294,0.3428238,0.49305993,0.0076528275,0.10148877,0.0003261098],"about_ca_topic_score_codex":0.00096243725,"about_ca_topic_score_gemma":0.00039848857,"teacher_disagreement_score":0.0029312174,"about_ca_system_score_codex":0.00057122856,"about_ca_system_score_gemma":0.0006900944,"threshold_uncertainty_score":0.009805858},"labels":[],"label_agreement":null},{"id":"W2401072665","doi":"","title":"An Extension for AADL to Model Mixed-criticality Avionic Systems Deployed on IMA architectures with TTEthernet","year":2014,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Avionics; Extension (predicate logic); Integrated modular avionics; Computer science; Criticality; Engineering; Programming language; Physics; Aerospace engineering","score_opus":0.017630472637712346,"score_gpt":0.2657725053121329,"score_spread":0.2481420326744206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2401072665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075788368,0.00007061016,0.9846474,0.00020508739,0.00007840849,0.00017788606,0.00049104675,0.0036459756,0.0031047633],"genre_scores_gemma":[0.17517257,0.00037163708,0.8118234,0.00035843515,0.00006352524,0.00068467064,0.0016085465,0.0013871107,0.008530088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870753,0.00036295576,0.000228102,0.00019276749,0.0003751512,0.00013353681],"domain_scores_gemma":[0.9980611,0.00062559266,0.00017709746,0.0005903103,0.00044962476,0.000096269054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031140829,0.0009586799,0.00045032823,0.0011992438,0.00065331475,0.002403251,0.0017611193,0.0012304913,0.002629487],"category_scores_gemma":[0.0032653583,0.00069991825,0.0014606557,0.00071675,0.0010928982,0.0024304944,0.0017544983,0.0021161102,0.00087738875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003514615,0.0003760329,0.0040359334,0.00057509495,0.00012949371,0.0012034739,0.0019401405,0.34967408,0.03525936,0.5072653,0.010735365,0.08845419],"study_design_scores_gemma":[0.00006886782,0.00008162797,0.00037824534,0.000210864,0.00007267811,0.00032283657,0.00015860148,0.7106221,0.022243224,0.06401175,0.20176163,0.00006758206],"about_ca_topic_score_codex":0.007811548,"about_ca_topic_score_gemma":0.008553441,"teacher_disagreement_score":0.007811548,"about_ca_system_score_codex":0.0016748044,"about_ca_system_score_gemma":0.002393207,"threshold_uncertainty_score":0.016469061},"labels":[],"label_agreement":null},{"id":"W2402223719","doi":"10.5555/2048370.2048388","title":"Component-oriented interoperation of real-time DEVS engines","year":2011,"lang":"en","type":"article","venue":"Annual Simulation Symposium","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Interoperation; Computer science; Component (thermodynamics); Interoperability; Interface (matter); Reuse; Distributed computing; Reusability; Embedded system; Operating system; Simulation; Engineering; Modeling and simulation","score_opus":0.018490262603528436,"score_gpt":0.24866046913139822,"score_spread":0.2301702065278698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2402223719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017926987,0.0000455024,0.9701054,0.00012054217,0.00006599524,0.00015300955,0.0001386679,0.007948117,0.0034957977],"genre_scores_gemma":[0.37859994,0.00024078538,0.6066281,0.00025471323,0.000033912183,0.0007677522,0.0016172867,0.0036511803,0.008206357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997922,0.000585782,0.0002736945,0.00025286977,0.0007593646,0.00020630087],"domain_scores_gemma":[0.9964414,0.0009829326,0.00014198934,0.0016012237,0.00069064234,0.00014182979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004525662,0.00084223936,0.0007484102,0.0007452566,0.0006152138,0.0024204163,0.0029900486,0.0012250755,0.0035591119],"category_scores_gemma":[0.007999134,0.0011341453,0.0013856224,0.0005908779,0.0012900414,0.0032859507,0.0031831493,0.0020875442,0.00085529697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071740407,0.00063206867,0.0067560067,0.00048334713,0.00022805284,0.00089578715,0.0017504598,0.4846935,0.03860105,0.31786412,0.010041333,0.13733692],"study_design_scores_gemma":[0.00015381855,0.000072062576,0.0004679831,0.00004796897,0.000065111184,0.00013476113,0.000077358614,0.86189085,0.053762335,0.033209763,0.05006282,0.000055217315],"about_ca_topic_score_codex":0.0029606915,"about_ca_topic_score_gemma":0.0025857843,"teacher_disagreement_score":0.004525662,"about_ca_system_score_codex":0.0015580605,"about_ca_system_score_gemma":0.0020171152,"threshold_uncertainty_score":0.023934245},"labels":[],"label_agreement":null},{"id":"W2406821028","doi":"","title":"A Feasible Configuration of AFDX Networks for Real-Time Flows in Avionics Systems.","year":2013,"lang":"en","type":"article","venue":"e-Archivo (Carlos III University of Madrid)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Avionics; Computer science; Real-time computing; Embedded system; Engineering; Aerospace engineering","score_opus":0.011391260314074067,"score_gpt":0.20149931178984054,"score_spread":0.19010805147576648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406821028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24809125,0.000938632,0.7127772,0.0012758881,0.00040024318,0.0005377813,0.0014604725,0.0013617763,0.033156767],"genre_scores_gemma":[0.8673819,0.00026793606,0.12734684,0.00006335493,0.000028388686,0.0001728067,0.00051693874,0.00008603297,0.0041357824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992835,0.00026524407,0.000044867422,0.00015646357,0.00009609555,0.0001538273],"domain_scores_gemma":[0.9983553,0.0007296906,0.00017100322,0.00019021706,0.000266863,0.00028690984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014419457,0.00079225935,0.000716794,0.0010018197,0.0010846644,0.0021887575,0.0015778105,0.0012118287,0.014834024],"category_scores_gemma":[0.005365611,0.0005533429,0.000509399,0.0006219809,0.0008824323,0.0025174613,0.0018469733,0.0007959699,0.00087016716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002457543,0.0002552076,0.0037483652,0.000482593,0.00009932823,0.00088333787,0.0005652295,0.70110655,0.012455303,0.15785664,0.013713484,0.10637641],"study_design_scores_gemma":[0.00020628133,0.00031809942,0.0008337862,0.000099332196,0.000049468155,0.00024506886,0.0003845617,0.92772454,0.0035028132,0.059262984,0.0073319636,0.000041136358],"about_ca_topic_score_codex":0.0035045873,"about_ca_topic_score_gemma":0.0040330007,"teacher_disagreement_score":0.014834024,"about_ca_system_score_codex":0.0010837638,"about_ca_system_score_gemma":0.0011731107,"threshold_uncertainty_score":0.04962474},"labels":[],"label_agreement":null},{"id":"W2464337848","doi":"10.1007/978-3-319-31311-5_4","title":"A Real-Time Concurrent Constraint Calculus for Analyzing Avionic Systems Embedded in the IMA Connected Through TTEthernet","year":2016,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Avionics; Integrated modular avionics; Computer science; Modular design; Bisimulation; Architecture; Embedded system; Engineering; Programming language","score_opus":0.024464786275170073,"score_gpt":0.29545350380965957,"score_spread":0.2709887175344895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464337848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022776807,0.00030110605,0.9910439,0.00009052482,0.00008711143,0.00006411585,0.00009682893,0.00023657133,0.0058020875],"genre_scores_gemma":[0.11743082,0.0009063217,0.8697716,0.00016523978,0.00014440315,0.000249142,0.00031512842,0.00034544483,0.010671934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915886,0.00015803582,0.000057274945,0.00013666705,0.0004011378,0.00008804922],"domain_scores_gemma":[0.9992048,0.0004638739,0.00005142533,0.0000916073,0.00014055343,0.00004775718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014935966,0.00096533686,0.0008705524,0.00092479965,0.0011933282,0.0026546915,0.0027925358,0.0008862819,0.004794951],"category_scores_gemma":[0.0024916679,0.0008075501,0.0021507363,0.0018288072,0.0019604221,0.0019486516,0.0015751964,0.0026769573,0.00068870914],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057770478,0.000093994575,0.00024131703,0.00023682753,0.00007863096,0.000361303,0.00022714518,0.3166068,0.008254427,0.5991675,0.0032875452,0.071386725],"study_design_scores_gemma":[0.000023150405,0.000020161355,0.00011583971,0.000047658184,0.00004517151,0.00007467429,0.00003613131,0.7110036,0.002303446,0.26857018,0.017727356,0.000032710665],"about_ca_topic_score_codex":0.016355172,"about_ca_topic_score_gemma":0.023798376,"teacher_disagreement_score":0.016355172,"about_ca_system_score_codex":0.0016719254,"about_ca_system_score_gemma":0.0031428016,"threshold_uncertainty_score":0.032519937},"labels":[],"label_agreement":null},{"id":"W2465345317","doi":"10.1016/j.future.2015.11.017","title":"Special Issue on: Multicore and Many-core Architectures for Future Generation Embedded Systems","year":2015,"lang":"en","type":"article","venue":"Future Generation Computer Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Variety (cybernetics); Scalability; Big data; Benchmarking; Cloud computing; Data science; Multi-core processor; Cyber-physical system; Distributed computing; Database; Artificial intelligence; Parallel computing; Data mining","score_opus":0.04792471002696753,"score_gpt":0.2705382721750546,"score_spread":0.22261356214808709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465345317","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017743788,0.035171542,0.0031787883,0.017635902,0.8594439,0.00023960363,0.0004625229,0.00042772543,0.08166561],"genre_scores_gemma":[0.006467622,0.034522202,0.0015667282,0.005975435,0.7145821,0.0001396845,0.00097603106,0.00047096808,0.23529921],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988864,0.00010481283,0.000114217895,0.00020252241,0.0005240757,0.00016803457],"domain_scores_gemma":[0.99638855,0.00071306486,0.00026078068,0.00020305591,0.0017066684,0.0007278969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016112768,0.0023850913,0.0022475861,0.0028368982,0.001511466,0.004117595,0.0019790828,0.0039633787,0.09462151],"category_scores_gemma":[0.0025571939,0.00067017326,0.0012026214,0.0020130973,0.0007448789,0.0029963609,0.0016568485,0.002819691,0.024781005],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009162712,0.00007063238,0.00014473638,0.000519257,0.000023694516,0.00013243042,0.000009378931,0.00036722678,0.0008635223,0.0016895655,0.95149034,0.044597585],"study_design_scores_gemma":[0.000024154673,0.00012221614,0.0008876874,0.00017731861,0.000030067575,0.0002539131,0.00002045247,0.00089993066,0.0005325946,0.0022504062,0.9947803,0.000021058318],"about_ca_topic_score_codex":0.0006924034,"about_ca_topic_score_gemma":0.0023947922,"teacher_disagreement_score":0.09462151,"about_ca_system_score_codex":0.0012520875,"about_ca_system_score_gemma":0.0018410147,"threshold_uncertainty_score":0.31654048},"labels":[],"label_agreement":null},{"id":"W2488681590","doi":"10.1177/1548512916657907","title":"Multi-objective mapping of full-mission simulators on heterogeneous distributed multi-processor systems","year":2016,"lang":"en","type":"article","venue":"The Journal of Defense Modeling and Simulation Applications Methodology Technology","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CAE (Canada); Polytechnique Montréal","funders":"","keywords":"Computer science; Heuristics; Distributed computing; Set (abstract data type); Task (project management); Symmetric multiprocessor system; Computation; Real-time computing; Systems engineering; Algorithm","score_opus":0.10565170454235023,"score_gpt":0.34719808563579435,"score_spread":0.24154638109344412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488681590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08020563,0.00026759948,0.91351616,0.00017658107,0.000038265727,0.00014200748,0.000066611545,0.000284881,0.005302188],"genre_scores_gemma":[0.84844476,0.00022219785,0.14756435,0.0000838077,0.000021195765,0.00030580204,0.0001413537,0.00008151144,0.0031350509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99961144,0.00016629288,0.000014284459,0.000057014277,0.00009038515,0.000060580183],"domain_scores_gemma":[0.9994746,0.00032321387,0.00006510138,0.00003523487,0.00006206517,0.000039810217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009079571,0.0009434727,0.00074320793,0.0005119631,0.00034374668,0.00085109356,0.0009911762,0.0007786011,0.0020298285],"category_scores_gemma":[0.0014403906,0.00047148505,0.0008616401,0.00035960035,0.0005249613,0.00065674423,0.0011573733,0.00062233343,0.00017645181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011530552,0.000014365065,0.000101387464,0.000017044707,0.000011324236,0.000021782433,0.000010340613,0.9947285,0.00056766893,0.0012220185,0.000052826093,0.0032412491],"study_design_scores_gemma":[0.0000032523128,0.000016009652,0.000034103115,0.0000017855295,0.000002259434,0.0000028511545,0.00000341343,0.99900925,0.00017690701,0.0006193333,0.00012956242,0.0000011476941],"about_ca_topic_score_codex":0.0037894659,"about_ca_topic_score_gemma":0.0021238886,"teacher_disagreement_score":0.0037894659,"about_ca_system_score_codex":0.0008006811,"about_ca_system_score_gemma":0.0009387289,"threshold_uncertainty_score":0.007534802},"labels":[],"label_agreement":null},{"id":"W2492219158","doi":"10.1145/2983185.2983193","title":"Towards compositional mixed-criticality real-time scheduling in open systems","year":2016,"lang":"en","type":"article","venue":"ACM SIGBED Review","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Mixed criticality; Criticality; Computer science; Scheduling (production processes); Distributed computing; Intersection (aeronautics); Engineering","score_opus":0.041796073743281224,"score_gpt":0.3272743033045267,"score_spread":0.2854782295612455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2492219158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010857519,0.0020702872,0.98247176,0.00053251535,0.00015790667,0.000050220904,0.000014336811,0.00028310175,0.0035624797],"genre_scores_gemma":[0.39658248,0.0035957526,0.5945839,0.0005116015,0.00060655014,0.0002432162,0.00011924138,0.0002855399,0.0034716546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979559,0.00063634943,0.00014031243,0.00037381626,0.0006614797,0.00023222558],"domain_scores_gemma":[0.9966798,0.0014676069,0.00026901573,0.00057873357,0.00076822704,0.0002366219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041991803,0.00082145125,0.00066923274,0.0011228144,0.0008931622,0.0021995418,0.0016843452,0.0009142695,0.0017950585],"category_scores_gemma":[0.0073161367,0.0007930329,0.0010137361,0.0009895132,0.0025669083,0.0050980523,0.002577694,0.0032648477,0.0005107628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117482996,0.000081959886,0.0006380782,0.0005964145,0.00006996642,0.00018349262,0.00074294105,0.08138314,0.013939382,0.8172607,0.0018534379,0.0831331],"study_design_scores_gemma":[0.000042559288,0.00012172997,0.0002395594,0.00009984323,0.00006718312,0.00015953807,0.00019696902,0.28641546,0.0075884038,0.677315,0.027714303,0.00003942797],"about_ca_topic_score_codex":0.0012277886,"about_ca_topic_score_gemma":0.001331445,"teacher_disagreement_score":0.0041991803,"about_ca_system_score_codex":0.0014829752,"about_ca_system_score_gemma":0.0022704569,"threshold_uncertainty_score":0.022207618},"labels":[],"label_agreement":null},{"id":"W2518296955","doi":"10.1109/tc.2016.2602833","title":"Schedulability Analysis for Real-Time Task Set on Resource with Performance Degradation and Dual-Level Periodic Rejuvenations","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Canadian Pain Society; National Science Foundation","keywords":"Scheduling (production processes); Computer science; Resource (disambiguation); Job shop scheduling; Set (abstract data type); Processor scheduling; Algorithm; Mathematics; Embedded system; Programming language; Mathematical optimization; Computer network","score_opus":0.02530828708885076,"score_gpt":0.23928973228766115,"score_spread":0.2139814451988104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518296955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22863288,0.00084003794,0.7643234,0.00042326475,0.000108763685,0.000088759916,0.00014316528,0.00040600705,0.0050337114],"genre_scores_gemma":[0.96344537,0.0002102502,0.03403975,0.00007878558,0.000072258146,0.000097649536,0.0001650432,0.00005617047,0.001834785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982868,0.00028829215,0.000096158765,0.00027908362,0.0006453957,0.00040425517],"domain_scores_gemma":[0.99772614,0.0010385296,0.00045332024,0.0002822242,0.0003704436,0.00012929227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014739753,0.0006389609,0.00062762335,0.00096998573,0.00045938842,0.0008969474,0.00078148337,0.0005157322,0.001090338],"category_scores_gemma":[0.004825012,0.00033477866,0.0011168597,0.0004935304,0.00086235953,0.0011751093,0.0006058372,0.0009622776,0.00013628289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041390827,0.00014992806,0.004344838,0.00022319032,0.00008719195,0.0007288138,0.00031472868,0.8626989,0.034585614,0.069764435,0.0015716502,0.025116833],"study_design_scores_gemma":[0.00001366678,0.000054955875,0.00061247137,0.000008094806,0.000013325209,0.00006694367,0.000036161273,0.9834427,0.002559298,0.01263817,0.0005436592,0.000010586715],"about_ca_topic_score_codex":0.005866192,"about_ca_topic_score_gemma":0.0024702637,"teacher_disagreement_score":0.005866192,"about_ca_system_score_codex":0.0014906994,"about_ca_system_score_gemma":0.0018343079,"threshold_uncertainty_score":0.011664093},"labels":[],"label_agreement":null},{"id":"W2518924066","doi":"10.1007/978-3-319-46613-2_11","title":"Model-Driven Approach to the Optimal Configuration of Time-Triggered Flows in a TTEthernet Network","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Polytechnique Montréal","funders":"","keywords":"Avionics; Metamodeling; Computer science; Control reconfiguration; Scheduling (production processes); Automation; Model transformation; Distributed computing; Ethernet; Embedded system; Engineering; Software engineering; Computer network","score_opus":0.02036381908507798,"score_gpt":0.23269234487448465,"score_spread":0.21232852578940667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2518924066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014107819,0.00031992694,0.97797674,0.00023715531,0.00007696134,0.00005480147,0.00007020039,0.00015787376,0.0069984775],"genre_scores_gemma":[0.84222233,0.00072737323,0.14669871,0.00014007476,0.00008327847,0.00024009797,0.00015255736,0.00014595005,0.009589623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996371,0.00014010251,0.000013715579,0.000051608164,0.00010557424,0.000051917785],"domain_scores_gemma":[0.999476,0.00031249726,0.00004881729,0.00003220106,0.000084622094,0.000045915654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858539,0.0008215655,0.0009985889,0.00054646627,0.00046491873,0.0014236917,0.0016804794,0.0012657805,0.003670958],"category_scores_gemma":[0.0015882333,0.00077659485,0.0008885387,0.0005403282,0.00080194674,0.0009285051,0.0010353388,0.0011969341,0.00030159985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014553925,0.000010654817,0.000036192967,0.000016577933,0.000008342,0.000023098157,0.000012184323,0.9843056,0.00048392688,0.01242695,0.00016433894,0.0024975599],"study_design_scores_gemma":[0.0000024378971,0.0000047732524,0.000008794237,0.0000022296956,0.0000017285349,0.0000034872537,0.0000025159775,0.995017,0.000076446944,0.0047499915,0.00012883401,0.0000018482324],"about_ca_topic_score_codex":0.005834684,"about_ca_topic_score_gemma":0.006410505,"teacher_disagreement_score":0.005834684,"about_ca_system_score_codex":0.0015672513,"about_ca_system_score_gemma":0.0016835813,"threshold_uncertainty_score":0.012280583},"labels":[],"label_agreement":null},{"id":"W2534642913","doi":"10.1109/distra.2001.946437","title":"HLA real-time extension","year":2001,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Common Object Request Broker Architecture; Computer science; High-level architecture; Quality of service; Jitter; The Internet; Construct (python library); Suite; Distributed computing; Embedded system; Computer network; Operating system; Interoperability; Telecommunications","score_opus":0.015899902042742844,"score_gpt":0.24589914252057585,"score_spread":0.229999240477833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2534642913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010108801,0.00120967,0.8434991,0.0019012919,0.0017113481,0.00043732807,0.0015116716,0.027671183,0.11194951],"genre_scores_gemma":[0.2503799,0.0030838428,0.55196303,0.0032196343,0.0014163175,0.0012034583,0.01008424,0.005180348,0.17346933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980829,0.0005104986,0.0003007976,0.00019038725,0.0005696813,0.00034576983],"domain_scores_gemma":[0.9955343,0.0006381455,0.00023518367,0.0018692407,0.0013554087,0.00036764838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037269157,0.0005065606,0.0004032324,0.0007046514,0.0006967016,0.002469156,0.0014216508,0.0012772761,0.02657244],"category_scores_gemma":[0.006073704,0.00040956613,0.00057718775,0.0007328472,0.0006524359,0.0026058634,0.0021528741,0.0025155426,0.014144492],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009953751,0.00025969232,0.0016606824,0.00035206802,0.000045016768,0.00077797694,0.0010118565,0.010480082,0.02581774,0.5057474,0.14181928,0.31103283],"study_design_scores_gemma":[0.00008615548,0.000119622666,0.000307255,0.00007380466,0.00001710545,0.000701928,0.00005805626,0.0145343505,0.009046924,0.024148287,0.950861,0.00004551025],"about_ca_topic_score_codex":0.0011635853,"about_ca_topic_score_gemma":0.0006332724,"teacher_disagreement_score":0.02657244,"about_ca_system_score_codex":0.0008211378,"about_ca_system_score_gemma":0.0014638479,"threshold_uncertainty_score":0.08889365},"labels":[],"label_agreement":null},{"id":"W2536052456","doi":"10.1109/etfa.2014.7005359","title":"D-RES: Correct transitive distributed service sharing","year":2014,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Shared resource; Scheduling (production processes); Service (business); Transitive relation; Isolation (microbiology); Loose coupling; Computer network","score_opus":0.013255297382243231,"score_gpt":0.22664390279769,"score_spread":0.21338860541544677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2536052456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03206833,0.00018004251,0.94264454,0.0004098896,0.00028078895,0.00022281845,0.0002916893,0.017986197,0.0059156944],"genre_scores_gemma":[0.6950587,0.00019082628,0.2939314,0.00045840672,0.00015663356,0.00031148345,0.0007770902,0.0015084378,0.007607058],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99341476,0.0015202215,0.0008141506,0.0010169281,0.0024132174,0.000820709],"domain_scores_gemma":[0.98421466,0.0025510327,0.0011407706,0.010003101,0.0014993023,0.00059109775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055805207,0.0010281036,0.0011808246,0.0010832187,0.0014528669,0.0026749517,0.0032221382,0.0012909614,0.0036234825],"category_scores_gemma":[0.014547831,0.0008078842,0.000985826,0.00069158437,0.0028202853,0.003660855,0.0068526603,0.0020823306,0.0013816752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028786082,0.00071521255,0.0109345345,0.00063429924,0.00028512723,0.0011646083,0.0017025928,0.25341645,0.06856954,0.28711668,0.038428705,0.33415362],"study_design_scores_gemma":[0.00040318584,0.00024230173,0.0006827206,0.00004924841,0.000085545624,0.00044262366,0.00018025354,0.77575207,0.062028844,0.108747736,0.05126593,0.0001195488],"about_ca_topic_score_codex":0.0032510213,"about_ca_topic_score_gemma":0.0032457367,"teacher_disagreement_score":0.0055805207,"about_ca_system_score_codex":0.0015585821,"about_ca_system_score_gemma":0.0032248667,"threshold_uncertainty_score":0.029512942},"labels":[],"label_agreement":null},{"id":"W2541034532","doi":"10.22360/springsim.2016.tmsdevs.043","title":"Scheduling Predictability In I-DEVS By Schedulability Analysis","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Scheduling (production processes); DEVS; Predictability; Computation; Distributed computing; Dynamic priority scheduling; Schedule; Modeling and simulation; Mathematical optimization; Algorithm; Simulation; Operating system","score_opus":0.007883236542402479,"score_gpt":0.23350159801024017,"score_spread":0.2256183614678377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541034532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022451866,0.00028512525,0.97452974,0.000106551444,0.000040733135,0.000052367264,0.0000716337,0.0006223712,0.0018395197],"genre_scores_gemma":[0.619895,0.00045216933,0.3774862,0.00009356384,0.00009533365,0.0002421132,0.00027773654,0.00027644116,0.0011814507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99671125,0.0011034848,0.00027842345,0.00038656892,0.0012063133,0.00031391738],"domain_scores_gemma":[0.99441886,0.0032834162,0.00063504773,0.0010480665,0.0005277252,0.000086863874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038984574,0.0007416836,0.0008533498,0.0011579803,0.00062167924,0.0023356602,0.0010593745,0.00046433497,0.0012451794],"category_scores_gemma":[0.008646123,0.0005805881,0.001177118,0.0007930479,0.0014963875,0.0019580678,0.0013033536,0.0013865253,0.00027772365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005396264,0.0000971328,0.0029479424,0.00041694922,0.00011277438,0.00036173168,0.0003852399,0.71241605,0.02820789,0.12289462,0.0012959541,0.13032396],"study_design_scores_gemma":[0.000033597942,0.00009585284,0.00039240977,0.00004728373,0.00004193591,0.000075390395,0.000048586604,0.9294738,0.015116501,0.051094964,0.003547892,0.000031855547],"about_ca_topic_score_codex":0.0020890755,"about_ca_topic_score_gemma":0.0015891417,"teacher_disagreement_score":0.0038984574,"about_ca_system_score_codex":0.0010475467,"about_ca_system_score_gemma":0.0017397999,"threshold_uncertainty_score":0.020617247},"labels":[],"label_agreement":null},{"id":"W2542639808","doi":"10.1109/cns.1988.4976","title":"Implementation of the ISO file transfer, access and management protocol in the Unix environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Unix; Protocol (science); Computer science; File transfer; Operating system; SSH File Transfer Protocol; Transfer (computing); Database; Programming language; File system; Self-certifying File System; Software","score_opus":0.020341842388804498,"score_gpt":0.29759169743294817,"score_spread":0.2772498550441437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542639808","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023534646,0.0005165251,0.848568,0.00066317385,0.0006159322,0.0020924946,0.001598608,0.040056944,0.0823537],"genre_scores_gemma":[0.1755431,0.0010124454,0.7381764,0.00043452147,0.00031788027,0.0032473654,0.008647885,0.0056128874,0.06700754],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816823,0.00035577084,0.00020227105,0.00016622218,0.0008936669,0.0002138055],"domain_scores_gemma":[0.99781847,0.00022937577,0.00012399351,0.0010414317,0.00060527056,0.00018160907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024551991,0.000625733,0.0007194747,0.0013672386,0.0014199041,0.003182172,0.002737744,0.00081692135,0.01699964],"category_scores_gemma":[0.004487196,0.00070422236,0.00038099667,0.0013765253,0.0007852105,0.0023896906,0.0010960182,0.0022263667,0.009891836],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011674099,0.001389884,0.004109765,0.0006387466,0.00006710936,0.0008604773,0.0013232399,0.015753623,0.071205184,0.21564159,0.12569137,0.56215155],"study_design_scores_gemma":[0.00032470003,0.0011319432,0.0042051757,0.00023992108,0.00007096464,0.0012081807,0.00050529913,0.12190157,0.10190905,0.035555582,0.73270124,0.00024632242],"about_ca_topic_score_codex":0.0040008253,"about_ca_topic_score_gemma":0.0031461215,"teacher_disagreement_score":0.01699964,"about_ca_system_score_codex":0.0014844312,"about_ca_system_score_gemma":0.0021915983,"threshold_uncertainty_score":0.056869447},"labels":[],"label_agreement":null},{"id":"W2545114774","doi":"10.1109/dft.2016.7684067","title":"Effects of online fault detection mechanisms on Probabilistic Timing Analysis","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Probabilistic logic; Hidden Markov model; Static timing analysis; Fault detection and isolation; Real-time computing; Software bug; Transient (computer programming); Markov process; Software; Embedded system; Artificial intelligence; Parallel computing","score_opus":0.011585874996940379,"score_gpt":0.2407377661569665,"score_spread":0.2291518911600261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2545114774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4479758,0.0012230111,0.54411626,0.00027956834,0.00011875389,0.000075249176,0.000112577916,0.0047826204,0.0013160651],"genre_scores_gemma":[0.9583971,0.000094985364,0.040927008,0.0000939945,0.000021335061,0.000029805298,0.0000502981,0.00011332301,0.0002721754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932175,0.0022144965,0.0004397905,0.0009784099,0.0026101444,0.0005396897],"domain_scores_gemma":[0.8998793,0.07487847,0.007838951,0.011866687,0.00477371,0.0007629178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005694921,0.0010765264,0.00086396787,0.0011234296,0.00048012144,0.0010817755,0.0019618042,0.0012816875,0.00092457846],"category_scores_gemma":[0.04136518,0.0005449272,0.0005318249,0.00051913783,0.00096693716,0.0022403842,0.0011813162,0.0014062404,0.00019114403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025529591,0.0004818408,0.01536337,0.00021106792,0.00020255236,0.00032709178,0.00027089615,0.75285524,0.035100404,0.0040621716,0.0007178852,0.18785456],"study_design_scores_gemma":[0.000044774748,0.00039103266,0.0019464851,0.00001803319,0.00005892618,0.0001577885,0.00002548115,0.95900196,0.036066364,0.0019548668,0.00029619221,0.000038069407],"about_ca_topic_score_codex":0.0021990968,"about_ca_topic_score_gemma":0.0015903072,"teacher_disagreement_score":0.005694921,"about_ca_system_score_codex":0.0010179209,"about_ca_system_score_gemma":0.0015149248,"threshold_uncertainty_score":0.030117989},"labels":[],"label_agreement":null},{"id":"W2546246579","doi":"10.1109/dft.2016.7684070","title":"Fault-tolerant scheduling of multicore mixed-criticality systems under permanent failures","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Multi-core processor; Mixed criticality; Fault tolerance; Processor scheduling; Criticality; Scheduling (production processes); Distributed computing; Embedded system; Parallel computing; Operating system; Engineering","score_opus":0.022868043918267918,"score_gpt":0.2618016411577261,"score_spread":0.23893359723945817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546246579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45938012,0.00049225695,0.5344682,0.0002931306,0.00007967364,0.00011272426,0.000049583094,0.0003871718,0.004737198],"genre_scores_gemma":[0.9710816,0.00006401114,0.027828705,0.000024088822,0.000011341897,0.000044763754,0.000025507346,0.000013734431,0.0009063481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965394,0.00008703217,0.000021171783,0.00004988285,0.00008732866,0.00010062996],"domain_scores_gemma":[0.9993599,0.0002575062,0.00014178957,0.00004318168,0.00012663077,0.00007099929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006513501,0.0004869869,0.00038304977,0.00033635568,0.0005890631,0.0006505663,0.0006048797,0.00035886813,0.00082351756],"category_scores_gemma":[0.0013022262,0.00025103547,0.00028410892,0.00026138962,0.00040790314,0.0004922469,0.00054439745,0.00039480196,0.000087038134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021855606,0.000055152643,0.0009921669,0.000092107504,0.00003082997,0.00027885317,0.0001353393,0.9455311,0.020602945,0.008391476,0.0003393897,0.023332153],"study_design_scores_gemma":[0.000017798602,0.00012347446,0.0002584085,0.0000059520703,0.000009837011,0.00003306818,0.00003342366,0.9920357,0.003451837,0.0034776016,0.00054791704,0.0000050853887],"about_ca_topic_score_codex":0.0028125728,"about_ca_topic_score_gemma":0.0026061323,"teacher_disagreement_score":0.0028125728,"about_ca_system_score_codex":0.0006064938,"about_ca_system_score_gemma":0.00096705,"threshold_uncertainty_score":0.005592406},"labels":[],"label_agreement":null},{"id":"W2550346889","doi":"10.23919/tms.2016.7918819","title":"A Kernel for embedded systems development and simulation using the Boost library","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Kernel (algebra); Usability; Principal (computer security); Development (topology); Computer architecture; Distributed computing; Software engineering; Embedded system; Operating system; Modeling and simulation; Simulation","score_opus":0.040782970376971796,"score_gpt":0.2713435231945081,"score_spread":0.23056055281753632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550346889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035132347,0.00013184667,0.89911026,0.00009334655,0.000047677568,0.000099760735,0.00026029194,0.09077151,0.005972074],"genre_scores_gemma":[0.16056278,0.00081097236,0.7921996,0.0003751558,0.000072025825,0.00054276787,0.0026100085,0.025011258,0.01781546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992493,0.00012335689,0.00006839137,0.00010017872,0.0003750339,0.0000838465],"domain_scores_gemma":[0.9982856,0.0006216605,0.0001162414,0.00053647626,0.00030911656,0.00013085373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013752622,0.0009533141,0.00058643724,0.0006811659,0.0003474882,0.0013798198,0.0019653235,0.0007174884,0.012157324],"category_scores_gemma":[0.0040724734,0.001221211,0.001225819,0.0004217849,0.00061292807,0.00212653,0.0020048353,0.0026432802,0.008823924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014891069,0.0007271045,0.0078095086,0.001952056,0.000433796,0.0010569172,0.0012332704,0.13305826,0.094843246,0.17121504,0.09998996,0.48619172],"study_design_scores_gemma":[0.00026839788,0.00024291658,0.0016851368,0.00023032023,0.00014467855,0.000821321,0.000054303167,0.6098865,0.07539227,0.043088805,0.26802358,0.00016175129],"about_ca_topic_score_codex":0.0014988919,"about_ca_topic_score_gemma":0.0016033693,"teacher_disagreement_score":0.012157324,"about_ca_system_score_codex":0.00061573234,"about_ca_system_score_gemma":0.0014889607,"threshold_uncertainty_score":0.040670276},"labels":[],"label_agreement":null},{"id":"W2561253484","doi":"10.1145/2968445","title":"Optimized Implementation of Multirate Mixed-Criticality Synchronous Reactive Models","year":2016,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Mixed criticality; Scheduling (production processes); Criticality; Distributed computing; Certification; Mathematical optimization","score_opus":0.028731679556122866,"score_gpt":0.28600681220522317,"score_spread":0.2572751326491003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561253484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04454263,0.00012739009,0.94765127,0.00008977487,0.000039690978,0.00006764758,0.000073668125,0.0009698081,0.00643813],"genre_scores_gemma":[0.8307527,0.000088065775,0.16680138,0.00003821095,0.000010596144,0.000109058186,0.000093274226,0.00013355158,0.0019731962],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994702,0.00014960699,0.000028934017,0.00007294726,0.00018494095,0.00009339515],"domain_scores_gemma":[0.999311,0.00025470444,0.00011162085,0.00013113413,0.00015330446,0.00003824688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009999645,0.00071799866,0.00039585412,0.00042956093,0.00030498902,0.0009065886,0.0013554352,0.0003954287,0.002569395],"category_scores_gemma":[0.0015832771,0.00034973156,0.0005013167,0.0002527811,0.0003393524,0.00078779616,0.0006199837,0.00069733994,0.00034356932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010005743,0.000042990847,0.0003762694,0.000053920856,0.00001668354,0.00005542141,0.000037097874,0.95154613,0.0075496417,0.017273081,0.00038675053,0.022561945],"study_design_scores_gemma":[0.0000100662555,0.000022630722,0.00003083307,0.0000025619217,0.000006004522,0.0000049374053,0.000004786944,0.99605125,0.0018731039,0.0014848061,0.00050664996,0.00000243254],"about_ca_topic_score_codex":0.003634168,"about_ca_topic_score_gemma":0.0062695285,"teacher_disagreement_score":0.003634168,"about_ca_system_score_codex":0.00080695096,"about_ca_system_score_gemma":0.0015070739,"threshold_uncertainty_score":0.008595526},"labels":[],"label_agreement":null},{"id":"W2561968680","doi":"10.5821/dissertation-2117-96600","title":"Improving time predictability of shared hardware resources in real-time multicore systems : emphasis on the space domain","year":2016,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; Università degli Studi di Padova; European Space Agency; Barcelona Supercomputing Center; Nunavut General Monitoring Plan","keywords":"Composability; Computer science; Predictability; Multi-core processor; Static timing analysis; Embedded system; Component (thermodynamics); Correctness; Distributed computing; Worst-case execution time; Process (computing); Computer architecture; Execution time; Parallel computing; Operating system","score_opus":0.011177353948833228,"score_gpt":0.2376011528046536,"score_spread":0.22642379885582037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561968680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16989358,0.008991839,0.80843914,0.0009950344,0.0002796408,0.000106498606,0.00006502076,0.0010125259,0.010216693],"genre_scores_gemma":[0.88564163,0.0026007076,0.10853348,0.00016480338,0.00013864356,0.00009884606,0.0000659488,0.00015856136,0.002597443],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926144,0.00012093414,0.000051981933,0.00013325967,0.00030488463,0.00012756599],"domain_scores_gemma":[0.99795735,0.00078364514,0.00038579464,0.00041373092,0.0003616549,0.0000978207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083523954,0.00067794684,0.00044723466,0.00055789336,0.00056385563,0.0015136112,0.0008141878,0.00035913475,0.0017888824],"category_scores_gemma":[0.0026429722,0.0002624612,0.0005042898,0.00052587746,0.000670896,0.0017804117,0.00091354724,0.00096962077,0.000295921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005062326,0.0001719445,0.0053701,0.0010637813,0.00014467612,0.00029518822,0.0006437538,0.34477675,0.17721535,0.09086189,0.0022373337,0.37671304],"study_design_scores_gemma":[0.00006395187,0.0009377023,0.003342258,0.0002198269,0.0002561607,0.00039559262,0.00025659986,0.7955867,0.1253624,0.04041137,0.0330919,0.000075513206],"about_ca_topic_score_codex":0.0015086641,"about_ca_topic_score_gemma":0.0020865768,"teacher_disagreement_score":0.0017888824,"about_ca_system_score_codex":0.0007430986,"about_ca_system_score_gemma":0.0020833286,"threshold_uncertainty_score":0.0059844255},"labels":[],"label_agreement":null},{"id":"W2566625505","doi":"10.22360/summersim.2016.scsc.038","title":"Simulation-based Schedulability Assessment for Real-Time Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Avionics; Correctness; Embedded system; Multiprocessing; Set (abstract data type); Process (computing); Distributed computing; Context (archaeology); Worst-case execution time; Static timing analysis; Scheduling (production processes); Execution time; Parallel computing; Algorithm","score_opus":0.023200478110104162,"score_gpt":0.3065417344725814,"score_spread":0.2833412563624772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2566625505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14279443,0.00065883086,0.85188144,0.00011629376,0.00006315996,0.00019117545,0.0001443061,0.0010813623,0.00306891],"genre_scores_gemma":[0.87157255,0.00020647152,0.12725456,0.000026719414,0.00002578895,0.00021939637,0.00023831519,0.00007857137,0.00037768754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981142,0.0010275064,0.00012368664,0.00013052655,0.00046242817,0.00014157948],"domain_scores_gemma":[0.9947524,0.003701653,0.00049950165,0.0004078305,0.0005311432,0.00010750678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022941248,0.0012025292,0.0008458654,0.0024999268,0.00045391163,0.0007842313,0.0008383903,0.00087622675,0.0014469574],"category_scores_gemma":[0.007884215,0.00036695265,0.0011047997,0.00077848684,0.00063917466,0.00070032594,0.00050482026,0.00052583416,0.000174447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001530249,0.000058194968,0.0016897726,0.000065594555,0.00006043493,0.00003749543,0.000027301796,0.9766714,0.005139258,0.0027608743,0.000112906244,0.013223727],"study_design_scores_gemma":[0.0000080994305,0.000035569283,0.00030284273,0.000007077099,0.000008394203,0.000012785662,0.0000067249307,0.9961546,0.002102035,0.0011741715,0.00018087775,0.00000678431],"about_ca_topic_score_codex":0.0039199255,"about_ca_topic_score_gemma":0.0021128785,"teacher_disagreement_score":0.0039199255,"about_ca_system_score_codex":0.0015213375,"about_ca_system_score_gemma":0.0013349799,"threshold_uncertainty_score":0.012132645},"labels":[],"label_agreement":null},{"id":"W2567563269","doi":"10.1109/dasc.2016.7777999","title":"Partition modeling and optimization of ARINC 653 operating systems in the context of IMA","year":2016,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Avionics; Computer science; Partition (number theory); Integrated modular avionics; Integer programming; Schedule; Modular design; Scheduling (production processes); Distributed computing; Linear programming; Mathematical optimization; Software; Engineering; Algorithm; Operating system","score_opus":0.02467418408834775,"score_gpt":0.24131191784608988,"score_spread":0.21663773375774212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567563269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24726623,0.0010727227,0.7330465,0.0003773106,0.000072397976,0.00014246134,0.0002977182,0.00033115956,0.017393509],"genre_scores_gemma":[0.95654994,0.00041931702,0.037864663,0.000040685674,0.000023652434,0.00014771555,0.00015604832,0.00008035361,0.0047178045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996288,0.00012418814,0.000010726449,0.00005662112,0.000081684935,0.00009807363],"domain_scores_gemma":[0.99962926,0.00019524881,0.00006715353,0.000015666279,0.000061006005,0.000031638843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007123035,0.0010549282,0.0007090468,0.0006459044,0.00043982637,0.001188108,0.0007832525,0.00071672123,0.0016659398],"category_scores_gemma":[0.0011173174,0.00047837317,0.00065588043,0.00064657634,0.0006049103,0.00064922875,0.00057760376,0.0008254923,0.00020071764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112221815,0.0000052753135,0.00006274039,0.0000061291485,0.0000025842642,0.0000059061044,0.000006851502,0.9975598,0.00020771763,0.001171432,0.000048984835,0.00091137993],"study_design_scores_gemma":[0.0000014634217,0.000008261755,0.000051685194,0.0000010746128,0.0000019345778,0.0000016484665,0.00000451889,0.99925,0.00007838109,0.00048738808,0.00011247517,0.0000011252129],"about_ca_topic_score_codex":0.024047446,"about_ca_topic_score_gemma":0.017678011,"teacher_disagreement_score":0.024047446,"about_ca_system_score_codex":0.0019249218,"about_ca_system_score_gemma":0.0019355789,"threshold_uncertainty_score":0.047814906},"labels":[],"label_agreement":null},{"id":"W2586096421","doi":"10.1177/0037549716684552","title":"DEVS for AUTOSAR-based system deployment modeling and simulation","year":2017,"lang":"en","type":"article","venue":"SIMULATION","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Flanders Make","keywords":"AUTOSAR; DEVS; Software deployment; Automotive industry; Computer science; Embedded system; Software; Software engineering; Engineering; Systems engineering; Modeling and simulation; Operating system; Simulation","score_opus":0.05398159689055471,"score_gpt":0.32366445361783314,"score_spread":0.26968285672727843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586096421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007028729,0.00013091281,0.98056865,0.00015037484,0.00006356192,0.00015920629,0.0011877583,0.004479666,0.0062312083],"genre_scores_gemma":[0.2276922,0.0008068803,0.7542275,0.00017179294,0.00007101322,0.001529424,0.0055036847,0.001827005,0.008170446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992944,0.00027659815,0.000082789746,0.0000727142,0.00020932216,0.00006415556],"domain_scores_gemma":[0.9985629,0.00080643,0.000106845975,0.00020624958,0.00026356665,0.000053983615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016771492,0.000992362,0.00066763227,0.00074514083,0.00046768854,0.0010617559,0.001616987,0.0008166715,0.0076797437],"category_scores_gemma":[0.0026766974,0.0007700774,0.0014298639,0.00050103816,0.0004784765,0.0008104499,0.001081536,0.0017365036,0.0012373839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065897235,0.00006239019,0.001112699,0.00020275856,0.0000482441,0.0001854104,0.00016285693,0.9102696,0.0033489657,0.06515862,0.0039936616,0.015388861],"study_design_scores_gemma":[0.000022509495,0.000019719391,0.000110417146,0.000026553618,0.0000093243525,0.000033938766,0.000017907189,0.9753411,0.0016285591,0.0064489283,0.016333045,0.000007997721],"about_ca_topic_score_codex":0.006621519,"about_ca_topic_score_gemma":0.007199764,"teacher_disagreement_score":0.0076797437,"about_ca_system_score_codex":0.00092821725,"about_ca_system_score_gemma":0.0014322426,"threshold_uncertainty_score":0.02569127},"labels":[],"label_agreement":null},{"id":"W2589767984","doi":"10.1007/s12652-017-0449-9","title":"Design and simulation of distributed IMA architectures using TTEthernet: a model-driven approach","year":2017,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Concordia University; École de Technologie Supérieure","funders":"Consortium de Recherche et d’innovation en Aérospatiale au Québec","keywords":"Computer science; Computational intelligence; Artificial intelligence","score_opus":0.09158938883882435,"score_gpt":0.3240468884647782,"score_spread":0.23245749962595386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589767984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18002461,0.00022766102,0.7921611,0.00046057045,0.0001335749,0.00021181542,0.00026412343,0.0012977408,0.025218792],"genre_scores_gemma":[0.934203,0.00010997453,0.061784476,0.00006234502,0.000013104506,0.0002097699,0.00012123798,0.000102085396,0.0033938906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997961,0.00007942256,0.000008364093,0.000027573187,0.000049561124,0.000038988324],"domain_scores_gemma":[0.99952245,0.00026355562,0.00004478341,0.00004403091,0.00008607148,0.000039178638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053818,0.0005174719,0.0006912796,0.000472076,0.0006190098,0.0010250161,0.0013093787,0.0010249023,0.0041532074],"category_scores_gemma":[0.0011521061,0.00047585275,0.00074058113,0.0002718709,0.00062645384,0.0006906501,0.00070713845,0.00068683055,0.00037073667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012892247,0.000016363514,0.00013129904,0.000010614585,0.000005379462,0.0000120449595,0.000015158781,0.99652326,0.0004126644,0.0017570732,0.00005527329,0.0010479689],"study_design_scores_gemma":[0.000003204799,0.000006687572,0.000017310645,0.0000014559774,0.0000015717354,0.0000012394913,0.000004938613,0.9991837,0.0001669511,0.00046876434,0.00014303187,0.0000011957109],"about_ca_topic_score_codex":0.009042522,"about_ca_topic_score_gemma":0.009375994,"teacher_disagreement_score":0.009042522,"about_ca_system_score_codex":0.00095363485,"about_ca_system_score_gemma":0.0012602936,"threshold_uncertainty_score":0.0179798},"labels":[],"label_agreement":null},{"id":"W2599029076","doi":"","title":"How to solve ODEs in real-time HLA distributed simulation","year":2016,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"High-level architecture; Computer science; Ode; Context (archaeology); Ordinary differential equation; Consistency (knowledge bases); Distributed computing; Key (lock); Component (thermodynamics); Asynchronous communication; Protocol (science); Architecture; Simulation; Differential equation; Mathematics; Artificial intelligence","score_opus":0.01615245295039668,"score_gpt":0.25398543538997165,"score_spread":0.23783298243957496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599029076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005662843,0.00007886169,0.9881734,0.00036337282,0.00009267054,0.000038780323,0.00009943975,0.0010090008,0.0044816327],"genre_scores_gemma":[0.19642009,0.0003066194,0.79040873,0.0002730635,0.0000774531,0.00021031639,0.00036647994,0.0013837465,0.010553556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996847,0.00009779472,0.000028668905,0.000049981816,0.00010035799,0.00003854601],"domain_scores_gemma":[0.9989654,0.00052415766,0.00005239145,0.00017878317,0.00020230484,0.000076934906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093162135,0.0005380489,0.0007519159,0.00036005743,0.00067559624,0.001312857,0.0012009518,0.0011469033,0.01189079],"category_scores_gemma":[0.0046557994,0.000447431,0.0009398288,0.0004157717,0.0007664845,0.0017797414,0.0014620445,0.0018292738,0.0021078966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007513036,0.00008701496,0.0011115462,0.00027362228,0.00006499945,0.00016097233,0.00021585678,0.7505511,0.005788994,0.11963664,0.005252195,0.11678195],"study_design_scores_gemma":[0.000021691356,0.0000061995233,0.000054315682,0.000013970629,0.0000072568096,0.000018592444,0.00002461781,0.94216865,0.001416529,0.05113474,0.005126078,0.0000074079653],"about_ca_topic_score_codex":0.005528326,"about_ca_topic_score_gemma":0.0051923203,"teacher_disagreement_score":0.01189079,"about_ca_system_score_codex":0.0005291654,"about_ca_system_score_gemma":0.0010809633,"threshold_uncertainty_score":0.03977871},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0256239308304009,"score_gpt":0.2869912638162117,"score_spread":0.26136733298581083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604079157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16088457,0.00079060893,0.8091522,0.00030488177,0.0003349081,0.00048179948,0.0001031874,0.0064763715,0.021471359],"genre_scores_gemma":[0.7693592,0.00031167959,0.21383283,0.00022063672,0.00004118663,0.00028569662,0.00018436648,0.00038838972,0.015376],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99935085,0.00013043516,0.000055416327,0.000119016186,0.00020276464,0.00014154875],"domain_scores_gemma":[0.999561,0.00008871603,0.000057013032,0.00009023272,0.00016019128,0.000042934604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053340144,0.0005693329,0.00034781703,0.00047656518,0.00034429526,0.0012306267,0.0014602955,0.0009198806,0.004600091],"category_scores_gemma":[0.0005851996,0.00039235712,0.00044555703,0.00019058425,0.00028939501,0.0007463842,0.00048345467,0.0006132498,0.0013606766],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001055772,0.00095165335,0.007424738,0.0010802647,0.00029506933,0.0018979082,0.0005796518,0.20680417,0.445485,0.026252866,0.0064096595,0.30176327],"study_design_scores_gemma":[0.00020930957,0.0013008498,0.0031410828,0.00010418352,0.00020767834,0.0007546331,0.000093929346,0.68399686,0.25999293,0.0020510375,0.04808168,0.00006584447],"about_ca_topic_score_codex":0.0011539838,"about_ca_topic_score_gemma":0.0010661599,"teacher_disagreement_score":0.004600091,"about_ca_system_score_codex":0.00046824705,"about_ca_system_score_gemma":0.00080256065,"threshold_uncertainty_score":0.015388787},"labels":[],"label_agreement":null},{"id":"W2612242064","doi":"10.1145/3019611","title":"PMC","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Locality; Schedule; Memory controller; Task (project management); Memory management; Embedded system; Distributed computing; Computer architecture; Overlay; Computer hardware; Operating system; Semiconductor memory","score_opus":0.03294344845944493,"score_gpt":0.2937799310877797,"score_spread":0.2608364826283348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2612242064","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01553673,0.0013362623,0.8853184,0.0010645711,0.0007994908,0.00033350263,0.00055167184,0.0058230935,0.0892363],"genre_scores_gemma":[0.3937665,0.0014401007,0.5215668,0.001069068,0.00054788083,0.0004868577,0.0016582472,0.0009961886,0.078468375],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943465,0.00007474518,0.00003487163,0.00015981538,0.00023178032,0.00006412865],"domain_scores_gemma":[0.9992741,0.00010771999,0.00006448395,0.0002663399,0.0002221227,0.000065232554],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043728956,0.00050111767,0.0003084739,0.0006256367,0.0005866175,0.0016786244,0.0014545732,0.0006744129,0.021779496],"category_scores_gemma":[0.0015494772,0.00026735305,0.00033498264,0.00044008996,0.0003700044,0.0014138173,0.0012652882,0.000723669,0.0076452224],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030464574,0.00018026076,0.0021849582,0.0005031386,0.000058108948,0.0005043964,0.00036144262,0.04414937,0.05105639,0.2399804,0.043474324,0.6172426],"study_design_scores_gemma":[0.00010463927,0.00032690764,0.0012502589,0.00012191002,0.00006955465,0.0012250401,0.00019583225,0.30515614,0.047133856,0.110305205,0.53405803,0.000052547337],"about_ca_topic_score_codex":0.0010067323,"about_ca_topic_score_gemma":0.0016932575,"teacher_disagreement_score":0.9782205,"about_ca_system_score_codex":0.00058611896,"about_ca_system_score_gemma":0.00140728,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08792575374304948,"score_gpt":0.3202627539257511,"score_spread":0.23233700018270162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2622064324","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18293346,0.0021073425,0.80932456,0.00038012463,0.000071938055,0.00006724743,0.00008157755,0.0015735143,0.0034601588],"genre_scores_gemma":[0.95174176,0.0002803156,0.04727337,0.000044104443,0.000021830368,0.000050820094,0.000056615943,0.000065993656,0.00046533823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987098,0.0003489421,0.000086353335,0.00012985009,0.0005705313,0.00015459645],"domain_scores_gemma":[0.99690044,0.001242012,0.000562129,0.00072716177,0.0004722734,0.000096053074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014894401,0.00038293717,0.00033493605,0.00053079886,0.00050881447,0.0010206763,0.00091312604,0.0003168529,0.0007529735],"category_scores_gemma":[0.0048132595,0.00028993769,0.00023018695,0.0005662396,0.000682525,0.0013044823,0.0006110933,0.0008126922,0.00011727005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002779561,0.00011949352,0.0035112624,0.00029185787,0.0000701557,0.00018078895,0.00025464542,0.81469333,0.051049657,0.05080628,0.001554959,0.07718955],"study_design_scores_gemma":[0.00001814592,0.00013448668,0.0003562458,0.0000118921025,0.00001917966,0.00006484116,0.000032900287,0.9722493,0.015990714,0.009411857,0.0016984446,0.0000120009745],"about_ca_topic_score_codex":0.00166023,"about_ca_topic_score_gemma":0.0034349277,"teacher_disagreement_score":0.00166023,"about_ca_system_score_codex":0.0009435131,"about_ca_system_score_gemma":0.0017217522,"threshold_uncertainty_score":0.007877052},"labels":[],"label_agreement":null},{"id":"W2625961595","doi":"10.1109/ccece.2017.7946686","title":"Microcontroller based supervisory control of a solar tracker","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Supervisor; Microcontroller; Supervisory control; Event (particle physics); Synchronization (alternating current); Tracking (education); Computer science; Controller (irrigation); Embedded system; Control engineering; Control system; Real-time computing; Computer hardware; Control (management); Engineering; Electrical engineering","score_opus":0.02580372256068352,"score_gpt":0.24233912824586057,"score_spread":0.21653540568517704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625961595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25388402,0.0004727039,0.7179997,0.00012308719,0.0002370618,0.00018434241,0.00014109728,0.0089130225,0.018045004],"genre_scores_gemma":[0.96456426,0.00007878355,0.03117232,0.000019554807,0.000021940064,0.000066999455,0.000052587326,0.000057281122,0.00396631],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998331,0.000023752778,0.000008196663,0.000041816114,0.00007546343,0.000017649916],"domain_scores_gemma":[0.9997923,0.00006737716,0.000030568277,0.000027235477,0.00006186079,0.000020750984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014307284,0.00021223637,0.00024188713,0.0001607632,0.00019161355,0.00045470474,0.00059380947,0.00023926605,0.0025349497],"category_scores_gemma":[0.00047930863,0.00014236655,0.00012099654,0.000097275006,0.00015793755,0.00019066785,0.00020106454,0.00037529581,0.0005150455],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008816841,0.00041636408,0.0038122348,0.0004837934,0.0000644132,0.00068048434,0.0004364232,0.18343356,0.49595568,0.008418699,0.0042770645,0.30113965],"study_design_scores_gemma":[0.00017450735,0.00090974837,0.0034438288,0.00003998639,0.000044469358,0.0003997703,0.00003735033,0.80358225,0.17009996,0.001476528,0.019757923,0.000033539072],"about_ca_topic_score_codex":0.0005253339,"about_ca_topic_score_gemma":0.00059936504,"teacher_disagreement_score":0.0025349497,"about_ca_system_score_codex":0.00016891959,"about_ca_system_score_gemma":0.00035940929,"threshold_uncertainty_score":0.008480251},"labels":[],"label_agreement":null},{"id":"W2627060877","doi":"10.1145/3061639.3062287","title":"Modeling the Effects of AUTOSAR Overheads on Application Timing and Schedulability","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"AUTOSAR; Computer science; Embedded system; Automotive industry; Construct (python library); Overhead (engineering); Architecture; Operating system; Engineering; Software; Computer network","score_opus":0.018601116592397788,"score_gpt":0.27642477678735977,"score_spread":0.257823660194962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2627060877","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7275222,0.00040004312,0.2621027,0.00021712632,0.00005728899,0.0001765216,0.00026987013,0.0007461344,0.008508098],"genre_scores_gemma":[0.9647817,0.00013070632,0.03412634,0.000021838325,0.00001508854,0.00007146655,0.000090195324,0.00006995312,0.0006926825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990113,0.00028834437,0.00006483403,0.00013037417,0.00033995524,0.00016515609],"domain_scores_gemma":[0.99252266,0.0051854677,0.0010782178,0.0006038517,0.0004908858,0.00011891191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014885335,0.0010920116,0.00035821288,0.0007404662,0.000310038,0.0006810565,0.00085913844,0.0004927069,0.0009702764],"category_scores_gemma":[0.0064643747,0.00054595893,0.00048531167,0.0005019112,0.0003611417,0.0010347171,0.0004245263,0.0008421792,0.00013052973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009327615,0.000060098708,0.0021192161,0.000044549088,0.00001392649,0.000044767232,0.000038614853,0.98304904,0.0055744573,0.0018843666,0.00009695513,0.006980646],"study_design_scores_gemma":[0.000007178015,0.00004031337,0.0005902996,0.000004681874,0.000014787427,0.000012539651,0.000008738955,0.9956536,0.0025824537,0.0008701226,0.00021109002,0.0000041708977],"about_ca_topic_score_codex":0.0050915023,"about_ca_topic_score_gemma":0.006218631,"teacher_disagreement_score":0.0050915023,"about_ca_system_score_codex":0.0011918861,"about_ca_system_score_gemma":0.0016934695,"threshold_uncertainty_score":0.01012373},"labels":[],"label_agreement":null},{"id":"W2735588461","doi":"","title":"Special issue: best papers from the Real-Time and Embedded Technology and Applications Symposium (RTAS) 2004 : [ ... top papers presented at the 10th IEEE Real-Time and Embedded Technology and Applications Symposium ... held in Toronto, Canada, May 26th - 28th, 2004]","year":2005,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Operations research; Engineering","score_opus":0.0042293450969306,"score_gpt":0.22428518988528412,"score_spread":0.22005584478835352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735588461","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013484159,0.030186128,0.0016671672,0.0315606,0.8311174,0.00033754823,0.005503738,0.0009130536,0.09736601],"genre_scores_gemma":[0.00436649,0.03299059,0.0010697555,0.0066604107,0.28699088,0.00018023209,0.009059887,0.0009990311,0.65768266],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99890983,0.00010083835,0.00013637729,0.00016609822,0.00053195417,0.00015491806],"domain_scores_gemma":[0.98966026,0.0012674875,0.00048563373,0.00036088785,0.0060813325,0.0021443814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016923621,0.0030222177,0.003355368,0.0050451364,0.0019312137,0.008020989,0.0021907089,0.0026805915,0.2543737],"category_scores_gemma":[0.005307667,0.00068465626,0.0015212288,0.005035402,0.00052157213,0.003628185,0.0014598499,0.0024747623,0.17172648],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000724558,0.00003100083,0.000060306225,0.000229604,0.000009166721,0.000038548602,0.000005641703,0.000056411307,0.00015468222,0.00014872126,0.9835194,0.015674232],"study_design_scores_gemma":[0.000040527193,0.000068168796,0.0010141432,0.0002503261,0.000030570358,0.000088687506,0.00002775603,0.00017088656,0.0003118771,0.0004966677,0.9974831,0.000017306465],"about_ca_topic_score_codex":0.0022913935,"about_ca_topic_score_gemma":0.0054155793,"teacher_disagreement_score":0.2543737,"about_ca_system_score_codex":0.001979079,"about_ca_system_score_gemma":0.0022060585,"threshold_uncertainty_score":0.8509648},"labels":[],"label_agreement":null},{"id":"W2740888784","doi":"","title":"Hierarchical Timed Symbolic Abstract State Machines for precise WCET estimation","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; State (computer science); Estimation; Programming language; Theoretical computer science; Distributed computing; Engineering; Systems engineering","score_opus":0.015750706199260903,"score_gpt":0.2505193146701455,"score_spread":0.2347686084708846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2740888784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011813557,0.00014665129,0.9842211,0.00004421524,0.00003283865,0.000041739764,0.0002990237,0.0025936938,0.0008070722],"genre_scores_gemma":[0.533442,0.00025441858,0.46215245,0.00006965182,0.00006865002,0.00029664306,0.001171622,0.0005286465,0.002015967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983486,0.00042429622,0.00014858277,0.00035544,0.0005453306,0.00017785607],"domain_scores_gemma":[0.9952331,0.0025019674,0.00050236087,0.0010943789,0.0005544133,0.00011382295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009698965,0.0009923739,0.0011358081,0.0015323244,0.000572897,0.0016908563,0.0018030067,0.0007874292,0.0050774734],"category_scores_gemma":[0.0070608966,0.0007221675,0.0009925474,0.0016536603,0.0011126127,0.0021855077,0.0015344131,0.0017263406,0.0009119835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068387995,0.00009844768,0.0014566603,0.00045266756,0.00008757462,0.0002161523,0.00028486224,0.7722055,0.027514696,0.07892563,0.0020408689,0.1160331],"study_design_scores_gemma":[0.000022331298,0.00004522483,0.00016405915,0.000022042334,0.00002423584,0.000015895981,0.000017640981,0.9519144,0.007356665,0.039035637,0.0013681451,0.000013556984],"about_ca_topic_score_codex":0.0034125794,"about_ca_topic_score_gemma":0.005340274,"teacher_disagreement_score":0.0050774734,"about_ca_system_score_codex":0.0010789642,"about_ca_system_score_gemma":0.0017662866,"threshold_uncertainty_score":0.016985893},"labels":[],"label_agreement":null},{"id":"W2741763455","doi":"10.1109/sies.2017.7993373","title":"Static probabilistic timing analysis with a permanent fault detection mechanism","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Probabilistic logic; Cache; Computer science; Fault detection and isolation; Fault (geology); Mechanism (biology); Parallel computing; Embedded system; Real-time computing; Artificial intelligence","score_opus":0.023030634240098664,"score_gpt":0.2624971397554001,"score_spread":0.23946650551530146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741763455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011689617,0.00021527096,0.9862303,0.000044260232,0.000026488871,0.00002138408,0.000053773823,0.00092318945,0.0007957107],"genre_scores_gemma":[0.7349347,0.00041172988,0.26172665,0.00010893444,0.00012917523,0.00015027505,0.00021107827,0.0003313488,0.0019961633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840087,0.00037014196,0.00009122083,0.0002451508,0.0007480675,0.00014469746],"domain_scores_gemma":[0.9959997,0.0018530448,0.00059648656,0.0007747089,0.0007139424,0.00006216457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010874636,0.0009131965,0.00060904166,0.0015223388,0.00038141623,0.0007678278,0.0011758007,0.00061046024,0.0018988602],"category_scores_gemma":[0.0058907,0.0005128263,0.00089698756,0.0010188775,0.0006339886,0.0011732907,0.0006694685,0.0008693359,0.00037908845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017360733,0.000051771996,0.0023445084,0.00017993918,0.00009154215,0.00013454181,0.00006905583,0.83661073,0.019565593,0.038356323,0.0012421482,0.10118024],"study_design_scores_gemma":[0.000009142114,0.000043100335,0.0002541115,0.000008244723,0.000033155236,0.00008752811,0.000004712437,0.983126,0.0065991706,0.0086159995,0.0012045205,0.000014427636],"about_ca_topic_score_codex":0.0021233966,"about_ca_topic_score_gemma":0.0016814148,"teacher_disagreement_score":0.0021233966,"about_ca_system_score_codex":0.000750844,"about_ca_system_score_gemma":0.0013975744,"threshold_uncertainty_score":0.0063523054},"labels":[],"label_agreement":null},{"id":"W2751452110","doi":"10.1109/cirsyssim.2017.8023196","title":"Real-time benchmark set synthesis based on pWCET estimation and bounded hyper-periods","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bounded function; Benchmark (surveying); Task (project management); Construct (python library); Set (abstract data type); Interval (graph theory); Algorithm; Matrix (chemical analysis); Time complexity; Execution time; Parallel computing; Mathematics","score_opus":0.018134679679558494,"score_gpt":0.26830078919426203,"score_spread":0.2501661095147035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751452110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2534701,0.00058696157,0.7322883,0.00021626762,0.00009872939,0.00040959136,0.0008454189,0.00448065,0.00760386],"genre_scores_gemma":[0.71216154,0.00018905569,0.2843985,0.00005837512,0.000018227965,0.00042097902,0.0014154724,0.00032947538,0.001008345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864036,0.00041522481,0.0001130227,0.00020154433,0.00048369047,0.00014616297],"domain_scores_gemma":[0.9963348,0.0020457022,0.00035131082,0.00063139497,0.000558888,0.00007784975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015449484,0.0010744004,0.00046004774,0.0014988983,0.0003220147,0.00073875306,0.0012414899,0.00035065328,0.001426944],"category_scores_gemma":[0.007102465,0.00031535723,0.00056342175,0.001482656,0.0004680286,0.0010573554,0.000550846,0.000694561,0.00020738896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025037938,0.00014318255,0.0016823012,0.00018900349,0.000043442782,0.000063216714,0.00004009028,0.9175822,0.011220647,0.0067542573,0.0010955633,0.06093571],"study_design_scores_gemma":[0.000021977705,0.00010511769,0.00036540785,0.000008814574,0.000009196546,0.000020459505,0.000008793181,0.9869566,0.009631112,0.0022814218,0.0005843005,0.000006793011],"about_ca_topic_score_codex":0.0035668788,"about_ca_topic_score_gemma":0.0040517356,"teacher_disagreement_score":0.0035668788,"about_ca_system_score_codex":0.0010896159,"about_ca_system_score_gemma":0.0016249361,"threshold_uncertainty_score":0.008170605},"labels":[],"label_agreement":null},{"id":"W2752742484","doi":"10.1145/3123877","title":"An Adaptive Markov Model for the Timing Analysis of Probabilistic Caches","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Design Automation of Electronic Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Markov chain; State space; Cache; State (computer science); Markov model; Markov process; Computation; Parallel computing; Algorithm; Artificial intelligence; Mathematics","score_opus":0.07235459296917826,"score_gpt":0.308379183978513,"score_spread":0.23602459100933473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752742484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013954508,0.00017284225,0.98439467,0.00011480301,0.000019413532,0.000035218058,0.00010581255,0.0002498596,0.00095269986],"genre_scores_gemma":[0.86818117,0.0007509859,0.12435562,0.00015335131,0.00010460773,0.00047352482,0.00041702128,0.000102177764,0.0054614265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942195,0.00018317449,0.000029458279,0.00011598128,0.00016178648,0.0000877329],"domain_scores_gemma":[0.99818593,0.0012803747,0.00019787067,0.00011811545,0.00018017669,0.000037487804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096156914,0.00061390526,0.00079957297,0.00060927996,0.00035805823,0.0007001864,0.0015196104,0.0008249631,0.0025493745],"category_scores_gemma":[0.0036542309,0.0005513022,0.0011283467,0.00072389765,0.0007265253,0.0011242074,0.00056802825,0.001517708,0.0004393187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033853023,0.000014710574,0.00033828386,0.000022983651,0.000013224631,0.000030618005,0.000023753248,0.9795419,0.00090848375,0.013566028,0.00016636906,0.005339809],"study_design_scores_gemma":[0.0000020710281,0.000005430927,0.000032322114,0.0000013233423,0.0000031067702,0.0000033723998,9.132085e-7,0.99787366,0.00010009616,0.0018816122,0.00009417621,0.000001853005],"about_ca_topic_score_codex":0.009804136,"about_ca_topic_score_gemma":0.008649381,"teacher_disagreement_score":0.009804136,"about_ca_system_score_codex":0.00089355715,"about_ca_system_score_gemma":0.001349018,"threshold_uncertainty_score":0.019494116},"labels":[],"label_agreement":null},{"id":"W2762223164","doi":"10.1145/3125503.3125566","title":"Modelling probabilistic timing analysis","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Hamilton Medical Research Group","funders":"","keywords":"Probabilistic logic; Computer science; Statistical model; Probabilistic relevance model; Probabilistic analysis of algorithms; Code (set theory); Process (computing); Model checking; Execution time; Probabilistic CTL; State (computer science); Divergence-from-randomness model; Theoretical computer science; Programming language; Machine learning; Artificial intelligence","score_opus":0.06525835605447375,"score_gpt":0.28989138770861167,"score_spread":0.22463303165413792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762223164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002078267,0.00012356827,0.9933235,0.00011142521,0.000027973381,0.00006508058,0.00013939313,0.00059584057,0.0035349804],"genre_scores_gemma":[0.24840257,0.0011220115,0.7392139,0.00024349695,0.00016899225,0.0008455764,0.00083490345,0.0008178041,0.00835077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641645,0.00090023386,0.00024563752,0.00055528275,0.0015455642,0.00033673883],"domain_scores_gemma":[0.99224323,0.004916398,0.00082366087,0.0010995795,0.0007837037,0.00013343738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034587511,0.0017515261,0.0009156107,0.0022781163,0.00072433095,0.0028628744,0.0025973113,0.0017310731,0.007876062],"category_scores_gemma":[0.013501096,0.0010957563,0.0025298921,0.0015960216,0.0021481141,0.0031874445,0.0017933171,0.0024764603,0.0018292668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004721551,0.000033603712,0.00065020006,0.00016896758,0.000062181396,0.00023824294,0.00016812402,0.56450546,0.0034315425,0.4110379,0.0010892479,0.018567346],"study_design_scores_gemma":[0.00001706924,0.000023259927,0.00009479426,0.000037187125,0.000027378705,0.00012534915,0.000010296803,0.7939204,0.0019093668,0.195361,0.00845038,0.000023470453],"about_ca_topic_score_codex":0.0043019014,"about_ca_topic_score_gemma":0.0037588887,"teacher_disagreement_score":0.007876062,"about_ca_system_score_codex":0.0015755412,"about_ca_system_score_gemma":0.0023772563,"threshold_uncertainty_score":0.026348054},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025016963715371397,"score_gpt":0.2542686612242818,"score_spread":0.22925169750891042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763046940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5566784,0.00022382344,0.43868116,0.00015574551,0.000045000215,0.00019990285,0.00006070196,0.0005080827,0.0034471569],"genre_scores_gemma":[0.9491421,0.00005628738,0.049875494,0.000021500857,0.0000112519265,0.00008162381,0.000050980863,0.000030435183,0.0007303699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996232,0.000105740844,0.00002269313,0.000057378125,0.000096358235,0.00009457915],"domain_scores_gemma":[0.9990889,0.0004870974,0.0001583257,0.00010488809,0.00010399971,0.00005684498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063012243,0.00070159754,0.0004327938,0.0004336412,0.0003807503,0.00046361185,0.00078204804,0.00036610305,0.0011216417],"category_scores_gemma":[0.0019247212,0.00028800117,0.0003726503,0.00027458108,0.00039568625,0.00056259375,0.0006024687,0.000427054,0.0001445143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033051983,0.00015008872,0.0015347713,0.00012911607,0.000036007892,0.00023569274,0.00020614872,0.9209209,0.022726862,0.0067655733,0.0004199314,0.04654439],"study_design_scores_gemma":[0.00003944004,0.00026155025,0.00032394033,0.0000046976465,0.0000134861775,0.000056967296,0.000037366764,0.9894739,0.004878358,0.0043196734,0.00058432115,0.000006310045],"about_ca_topic_score_codex":0.0020497073,"about_ca_topic_score_gemma":0.0017884722,"teacher_disagreement_score":0.0020497073,"about_ca_system_score_codex":0.0005357928,"about_ca_system_score_gemma":0.00075936515,"threshold_uncertainty_score":0.004075527},"labels":[],"label_agreement":null},{"id":"W2766592657","doi":"10.1115/detc2017-68412","title":"Efficiently Handling Process Overruns and Underruns on Multiprocessors in Real-Time Embedded Systems","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Multiprocessing; Computer science; Overhead (engineering); Parallel computing; Multiprocessor scheduling; Execution time; Process (computing); Real-time operating system; Embedded system; Processor scheduling; Scheduling (production processes); Operating system; Distributed computing; Dynamic priority scheduling; Rate-monotonic scheduling; Engineering; Schedule","score_opus":0.024535260427542435,"score_gpt":0.3024542316415905,"score_spread":0.27791897121404807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766592657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40720066,0.0015369768,0.5864529,0.00035951837,0.00017934642,0.00015321013,0.00004799685,0.0024928642,0.0015763824],"genre_scores_gemma":[0.86231107,0.0003166215,0.13525805,0.00012895213,0.00007743664,0.000065208435,0.00009304386,0.00037746894,0.0013720851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974837,0.0007719257,0.00027928705,0.0003888632,0.000703668,0.00037249443],"domain_scores_gemma":[0.99188316,0.003377558,0.001283355,0.002012115,0.0010196799,0.00042403216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002899712,0.0011342166,0.0014120431,0.0011819021,0.0014235976,0.0015216245,0.0021130554,0.0006644974,0.0009149972],"category_scores_gemma":[0.010115198,0.000742522,0.00058264646,0.0011222567,0.0010975673,0.0024925747,0.0020667266,0.0014356785,0.00024980062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022548304,0.00039857705,0.021051856,0.0003731187,0.0002526308,0.0020161106,0.0017307323,0.47928247,0.0906824,0.007035917,0.0023186533,0.39260277],"study_design_scores_gemma":[0.00006886432,0.0003762599,0.0029982626,0.000025306745,0.00011788394,0.00036006665,0.00031678943,0.94668776,0.03887075,0.0071577244,0.002964488,0.000055831293],"about_ca_topic_score_codex":0.002638435,"about_ca_topic_score_gemma":0.0048722075,"teacher_disagreement_score":0.002899712,"about_ca_system_score_codex":0.00054799876,"about_ca_system_score_gemma":0.0022626582,"threshold_uncertainty_score":0.015335321},"labels":[],"label_agreement":null},{"id":"W2769044384","doi":"","title":"Work-in-progress: modelling probabilistic timing analysis","year":2017,"lang":"en","type":"article","venue":"Embedded Software","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Probabilistic logic; Computer science; Statistical model; Probabilistic analysis of algorithms; Probabilistic relevance model; Probabilistic CTL; Process (computing); Code (set theory); Execution time; Divergence-from-randomness model; Theoretical computer science; Parallel computing; Programming language; Machine learning; Artificial intelligence","score_opus":0.04372164591286296,"score_gpt":0.2944737158277456,"score_spread":0.25075206991488264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769044384","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008350688,0.00030462857,0.9788112,0.00032257958,0.000074940835,0.00011041315,0.00030513215,0.001812111,0.009908275],"genre_scores_gemma":[0.38722748,0.0016032114,0.5929907,0.00019396187,0.00018295241,0.0005917043,0.001285679,0.0019940077,0.013930424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955395,0.0014884287,0.00034414485,0.00069519563,0.0015402407,0.00039245794],"domain_scores_gemma":[0.98972696,0.0056304294,0.00084366155,0.002585072,0.0009541025,0.00025970477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005174106,0.001902064,0.0009214867,0.0019097122,0.00087024475,0.0034127026,0.0038257155,0.0017151958,0.009290997],"category_scores_gemma":[0.016606247,0.0012074934,0.002200889,0.0015359627,0.0027620909,0.0055992096,0.0021098154,0.0022732606,0.002795077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010959716,0.00008245002,0.0012928237,0.00032823588,0.00008397131,0.000399656,0.00042828178,0.68047976,0.0029660782,0.2666464,0.0019693428,0.045213453],"study_design_scores_gemma":[0.00003092097,0.00006089487,0.0001785117,0.000103510414,0.00006325449,0.00014827664,0.00003739472,0.7918563,0.0076020034,0.17720667,0.022662424,0.000049892045],"about_ca_topic_score_codex":0.004307328,"about_ca_topic_score_gemma":0.0028704337,"teacher_disagreement_score":0.009290997,"about_ca_system_score_codex":0.0009962688,"about_ca_system_score_gemma":0.0027602832,"threshold_uncertainty_score":0.031081498},"labels":[],"label_agreement":null},{"id":"W2784095737","doi":"","title":"Deployment Specification challenges in the context of large scale systems.","year":2017,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Software deployment; Computer science; Context (archaeology); Scale (ratio); Systems engineering; Software engineering; Engineering; Geology","score_opus":0.245831721189091,"score_gpt":0.43298631498745094,"score_spread":0.18715459379835994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784095737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032527264,0.0046633664,0.9207391,0.024357727,0.0008019176,0.00043071664,0.00049514085,0.0019278572,0.014056922],"genre_scores_gemma":[0.4846241,0.0052867737,0.4947895,0.0035352204,0.0013243076,0.0005985548,0.0015785897,0.0011846081,0.0070783915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.97302735,0.014499861,0.0026971435,0.0021539317,0.005857272,0.0017645503],"domain_scores_gemma":[0.9136602,0.061381668,0.004047863,0.009155014,0.008641323,0.0031138712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.031625558,0.0009800274,0.0013592811,0.0010475278,0.0028500764,0.009751863,0.0054423427,0.0053148917,0.004011924],"category_scores_gemma":[0.06795544,0.0021622838,0.0014006771,0.0023726467,0.0036926584,0.01502715,0.005855779,0.007986562,0.001541336],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027415648,0.0003026794,0.0053164666,0.0020718707,0.0002413936,0.0034097498,0.005184542,0.11826446,0.008880968,0.666617,0.040215615,0.1492211],"study_design_scores_gemma":[0.00013697948,0.00022005307,0.0018034931,0.00078839855,0.00015738419,0.002368385,0.006034473,0.3620067,0.005759357,0.47183308,0.14874248,0.00014920275],"about_ca_topic_score_codex":0.007939357,"about_ca_topic_score_gemma":0.0105509525,"teacher_disagreement_score":0.031625558,"about_ca_system_score_codex":0.002514258,"about_ca_system_score_gemma":0.0059996955,"threshold_uncertainty_score":0.16725391},"labels":[],"label_agreement":null},{"id":"W2785694091","doi":"","title":"Hierarchical Timed Abstract State Machines for WCET Estimation","year":2013,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Computer science; State (computer science); Estimation; Programming language; Engineering; Systems engineering","score_opus":0.01166161131424865,"score_gpt":0.2341529700974909,"score_spread":0.22249135878324225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2785694091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023011446,0.00012340254,0.9959573,0.000025565223,0.000027480552,0.000029242938,0.00010115679,0.0007969131,0.0006378051],"genre_scores_gemma":[0.31634793,0.0006989214,0.67764765,0.000105557985,0.00014598416,0.0005018989,0.0009813203,0.0004038879,0.0031668695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979042,0.00065468764,0.00020347515,0.0004200199,0.0006626368,0.00015504408],"domain_scores_gemma":[0.99642074,0.001790585,0.0004200059,0.00093127124,0.00037371315,0.00006370016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014823963,0.0010314175,0.0007752739,0.0015834919,0.00042490306,0.0014957152,0.0015689968,0.0009127198,0.004140349],"category_scores_gemma":[0.007884722,0.000552653,0.0011977723,0.00172586,0.0009405794,0.0024973536,0.0011893281,0.0017306752,0.00118504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017256376,0.00004570174,0.0008636841,0.0002338556,0.000050245315,0.0000837281,0.00012101842,0.7425459,0.007987654,0.17763789,0.0011800186,0.06907775],"study_design_scores_gemma":[0.0000099636445,0.00003260803,0.00013833026,0.000028549548,0.00002022818,0.000019867526,0.000009669803,0.93642884,0.0029875746,0.056313157,0.003997872,0.000013466766],"about_ca_topic_score_codex":0.0027500456,"about_ca_topic_score_gemma":0.0020090758,"teacher_disagreement_score":0.004140349,"about_ca_system_score_codex":0.0010466959,"about_ca_system_score_gemma":0.0011365396,"threshold_uncertainty_score":0.013850868},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.032473658038513945,"score_gpt":0.299995266139455,"score_spread":0.26752160810094106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786904362","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8703204,0.009489478,0.08038582,0.000580946,0.0002317494,0.00021289109,0.0005145959,0.0017395021,0.036524713],"genre_scores_gemma":[0.99131936,0.0006740346,0.0069146254,0.00006843974,0.000028794691,0.000040074538,0.00019815238,0.0000518891,0.0007045089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777704,0.0005109764,0.00012721152,0.00025170736,0.0010351583,0.00029784194],"domain_scores_gemma":[0.9939983,0.003644891,0.00050053897,0.0007103313,0.00095909595,0.00018688316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001941656,0.00050215435,0.00040690965,0.0011144594,0.0004976789,0.0010573444,0.001466064,0.0004333534,0.0032476361],"category_scores_gemma":[0.0074997908,0.00024221482,0.00035487488,0.0009034162,0.00038292073,0.0016803546,0.0006556526,0.0005675707,0.00025648577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030002983,0.000607872,0.016350567,0.001333913,0.0003245009,0.0004060774,0.00041182502,0.61839074,0.02396075,0.048586275,0.0071643163,0.27946287],"study_design_scores_gemma":[0.00024321096,0.004067874,0.007147243,0.0001219022,0.0002519552,0.0005210413,0.000569317,0.9266433,0.033240303,0.009081138,0.018044593,0.000068048386],"about_ca_topic_score_codex":0.0014699355,"about_ca_topic_score_gemma":0.0018491888,"teacher_disagreement_score":0.0032476361,"about_ca_system_score_codex":0.00086374854,"about_ca_system_score_gemma":0.0012440124,"threshold_uncertainty_score":0.010864496},"labels":[],"label_agreement":null},{"id":"W2789401778","doi":"10.1016/j.automatica.2017.12.010","title":"Priority-free conditionally-preemptive scheduling of modular sporadic real-time systems","year":2018,"lang":"en","type":"article","venue":"Automatica","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Science and Technology Development Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Modular design; Automaton; Computer science; Scheduling (production processes); Preemption; Distributed computing; Real-time operating system; Real-time computing; Fixed-priority pre-emptive scheduling; Supervisory control theory; Dynamic priority scheduling; Rate-monotonic scheduling; Supervisory control; Theoretical computer science; Embedded system; Control (management); Programming language; Mathematics; Mathematical optimization; Schedule; Operating system; Artificial intelligence","score_opus":0.010231371481794389,"score_gpt":0.2439742486604671,"score_spread":0.2337428771786727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789401778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4349648,0.00027625664,0.55833894,0.00017953302,0.000113497204,0.00006056666,0.0001036082,0.001359412,0.0046034018],"genre_scores_gemma":[0.96879834,0.000047585858,0.02972408,0.000027295004,0.000025581881,0.00002435162,0.000077376084,0.00007270023,0.0012026048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955744,0.000093176975,0.000024021698,0.000059829672,0.00012149208,0.00014391249],"domain_scores_gemma":[0.9985877,0.00051788084,0.00019822348,0.00020274702,0.0002918182,0.0002016529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010957076,0.0004524625,0.00039016342,0.0003986645,0.0005252273,0.00057308766,0.00088041706,0.00021741235,0.0022744364],"category_scores_gemma":[0.002877062,0.00029306868,0.00028317244,0.00029046394,0.00045144875,0.000549907,0.00060210755,0.0006349846,0.00026601664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027666842,0.00037436484,0.0029608852,0.0003634576,0.00007785879,0.00043448026,0.0005027721,0.6238936,0.113454044,0.083994895,0.004078702,0.16709816],"study_design_scores_gemma":[0.00009897607,0.00024013725,0.0008081756,0.000011413276,0.000028392,0.000059368347,0.000021625754,0.9682311,0.012383213,0.01694741,0.0011527089,0.000017386295],"about_ca_topic_score_codex":0.0019729808,"about_ca_topic_score_gemma":0.0029734587,"teacher_disagreement_score":0.0022744364,"about_ca_system_score_codex":0.0005284245,"about_ca_system_score_gemma":0.001616149,"threshold_uncertainty_score":0.0076087117},"labels":[],"label_agreement":null},{"id":"W2794026029","doi":"10.1145/3130265.3130320","title":"An analysis of random cache effects on real-time multi-core scheduling algorithms","year":2017,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache algorithms; Scheduling (production processes); Dynamic priority scheduling; Multiprocessing; Fair-share scheduling; Distributed computing; Earliest deadline first scheduling; Least slack time scheduling; CPU cache; Cache-oblivious algorithm; Response time; Cache invalidation; Rate-monotonic scheduling; Algorithm; Operating system; Mathematical optimization","score_opus":0.029626446957239996,"score_gpt":0.31469883496308165,"score_spread":0.28507238800584167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794026029","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8136512,0.0010970042,0.18097399,0.00019855589,0.0000469954,0.00007271783,0.00011003827,0.0004984112,0.0033510814],"genre_scores_gemma":[0.9819012,0.00012111684,0.01755793,0.000031185216,0.000011033657,0.000028995473,0.000054570297,0.000063289976,0.00023056935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783933,0.0011127025,0.00008179042,0.00021475113,0.0005369308,0.0002143413],"domain_scores_gemma":[0.973859,0.021546604,0.0015241532,0.0015566917,0.0013412101,0.00017231458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003203293,0.00062187033,0.00044858918,0.0006278959,0.00025827542,0.00041111966,0.00071819266,0.000418478,0.00084312103],"category_scores_gemma":[0.021300986,0.00033065546,0.00042416347,0.00053906994,0.00049149414,0.0009846194,0.00030946927,0.00048838404,0.00009344129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022430164,0.00007753454,0.0016342447,0.00007905849,0.00004727899,0.000043539625,0.00002584222,0.9736872,0.010664778,0.0026054878,0.00014467398,0.010766094],"study_design_scores_gemma":[0.000010382662,0.00010475073,0.0006421339,0.0000037163609,0.000015649643,0.000018968565,0.0000040588307,0.995059,0.0035418961,0.0005021971,0.00009274322,0.0000045086144],"about_ca_topic_score_codex":0.0013407392,"about_ca_topic_score_gemma":0.0012367707,"teacher_disagreement_score":0.003203293,"about_ca_system_score_codex":0.0007797579,"about_ca_system_score_gemma":0.0008335651,"threshold_uncertainty_score":0.016940832},"labels":[],"label_agreement":null},{"id":"W2801647199","doi":"","title":"A Risk-Constrained Markov Decision Process Approach to Scheduling Mixed-Criticality Job Sets","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vancouver Biotech (Canada)","funders":"","keywords":"Markov decision process; Probabilistic logic; Computer science; Scheduling (production processes); Mathematical optimization; Markov process; Criticality; Markov chain; Dynamic priority scheduling; Mixed criticality; Job shop scheduling; Mathematics; Schedule; Artificial intelligence; Machine learning","score_opus":0.015680847227864725,"score_gpt":0.2597981633115673,"score_spread":0.24411731608370257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801647199","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013493081,0.00048097642,0.98209494,0.00060254335,0.00013437733,0.00011212933,0.00014969059,0.00017087867,0.0027613267],"genre_scores_gemma":[0.75780773,0.001190037,0.22509362,0.00042867506,0.00050787255,0.00058675755,0.0004864205,0.00032198205,0.013576859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975326,0.0010409376,0.00010555754,0.00041661318,0.00048794324,0.00041629627],"domain_scores_gemma":[0.9885843,0.0093063265,0.0005839188,0.00019800825,0.00072968216,0.0005977268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005679699,0.0017765614,0.0036855182,0.0017572248,0.0010868002,0.0027359726,0.003467338,0.0026491776,0.007664917],"category_scores_gemma":[0.011304659,0.0024963466,0.002064904,0.0017123871,0.0020072048,0.0021262174,0.0023591185,0.0038439296,0.0005280788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052167965,0.000035520065,0.0001329129,0.000050157574,0.000034869805,0.00003856049,0.00003161113,0.97831935,0.00020477085,0.017624766,0.00042642903,0.0030488737],"study_design_scores_gemma":[0.000008006486,0.000011768884,0.000030177285,0.0000047561157,0.0000068264467,0.0000041588705,0.000004204713,0.99074906,0.000035261244,0.0090362625,0.0001041824,0.0000054446045],"about_ca_topic_score_codex":0.019599581,"about_ca_topic_score_gemma":0.016047064,"teacher_disagreement_score":0.019599581,"about_ca_system_score_codex":0.0035000807,"about_ca_system_score_gemma":0.0048219515,"threshold_uncertainty_score":0.038971007},"labels":[],"label_agreement":null},{"id":"W2805169968","doi":"","title":"Parallelisation efficace de larges applications temps-reel","year":2018,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Parallel computing; Computer science; Scale (ratio); Computational science; Physics","score_opus":0.01510714857538297,"score_gpt":0.24110006491417796,"score_spread":0.22599291633879498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805169968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13169257,0.0006255157,0.8277272,0.00026760768,0.00016925452,0.00016444403,0.0002678942,0.02684215,0.012243354],"genre_scores_gemma":[0.57492954,0.00034079768,0.41174078,0.00011338455,0.00011964265,0.0002323829,0.0004987462,0.003089641,0.00893508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990109,0.00022601598,0.000039733957,0.00023803822,0.00036090516,0.00012438248],"domain_scores_gemma":[0.9984199,0.0007441923,0.000107088956,0.00037207964,0.00023755936,0.00011916357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091511616,0.0016362789,0.0008876502,0.0010373376,0.000642521,0.0014589112,0.0010679547,0.00085368444,0.0054895347],"category_scores_gemma":[0.0023563718,0.0004946266,0.0012179456,0.00050878467,0.0009988392,0.00080540637,0.0008453888,0.0013408125,0.0016756329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010965309,0.000652255,0.0030061444,0.0006452293,0.00017245581,0.0008393295,0.0005823926,0.43586165,0.10289183,0.01896617,0.008002262,0.42728376],"study_design_scores_gemma":[0.00023626312,0.00022796258,0.0014679554,0.000023317802,0.000036789923,0.0002399096,0.000047555794,0.93181515,0.04993478,0.004627372,0.011306194,0.000036828224],"about_ca_topic_score_codex":0.004636368,"about_ca_topic_score_gemma":0.0049727666,"teacher_disagreement_score":0.0054895347,"about_ca_system_score_codex":0.00093199156,"about_ca_system_score_gemma":0.00093996944,"threshold_uncertainty_score":0.01836431},"labels":[],"label_agreement":null},{"id":"W2810740386","doi":"10.4230/lites-v005-i001-a001","title":"Risk-Aware Scheduling of Dual Criticality Job Systems Using Demand Distributions","year":2018,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Criticality; Computer science; Exploit; Probabilistic logic; Scheduling (production processes); Job scheduler; Distributed computing; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","score_opus":0.025800413825419095,"score_gpt":0.29354077942873463,"score_spread":0.26774036560331554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2810740386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3644508,0.00039793085,0.6286447,0.00083995244,0.000110759844,0.0001990271,0.00029239943,0.0005054952,0.004558966],"genre_scores_gemma":[0.96124715,0.00007926775,0.036946774,0.000077262084,0.000037122332,0.0000798503,0.00014619768,0.00008374348,0.0013025146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988028,0.00034798158,0.00005308705,0.0002555372,0.00024067573,0.00029990193],"domain_scores_gemma":[0.99569786,0.0025012793,0.00064095925,0.0002386057,0.00030981613,0.00061155396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025973925,0.0010421799,0.0012213663,0.00056030415,0.00061938574,0.0015027706,0.0014747011,0.00084481906,0.0019053892],"category_scores_gemma":[0.0069555435,0.001024163,0.00078217697,0.00047193762,0.0010359337,0.0014106418,0.0012860518,0.0014483511,0.00023202022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017386983,0.00004141006,0.00086694234,0.000030072179,0.000024613908,0.00006626541,0.000045615277,0.9862585,0.0013789178,0.007259713,0.00027737432,0.0035766133],"study_design_scores_gemma":[0.000009123782,0.000028606371,0.00013755934,0.000002304494,0.0000036628269,0.000008543327,0.000010225296,0.9951544,0.00023324706,0.0043176957,0.00009059599,0.00000409732],"about_ca_topic_score_codex":0.003892753,"about_ca_topic_score_gemma":0.0029929641,"teacher_disagreement_score":0.003892753,"about_ca_system_score_codex":0.0014289791,"about_ca_system_score_gemma":0.0018457735,"threshold_uncertainty_score":0.013736486},"labels":[],"label_agreement":null},{"id":"W2897601682","doi":"10.1145/3273905.3273917","title":"On Budgeting and Quality, with an Application to Safety-Critical Real-time Systems","year":2018,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Scheduling (production processes); Time horizon; Task (project management); Quality (philosophy); Execution time; Network calculus; Bandwidth (computing); Term (time); Distributed computing; Mathematical optimization; Real-time computing; Computer network; Mathematics","score_opus":0.017604766880597873,"score_gpt":0.30659518705773353,"score_spread":0.28899042017713567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897601682","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063366983,0.0018208558,0.98498684,0.0007786207,0.000102602484,0.00005052345,0.00004891365,0.00016011577,0.0057147583],"genre_scores_gemma":[0.529419,0.005760731,0.45649967,0.0005947874,0.00067778025,0.0004501361,0.0001587682,0.0005345483,0.005904543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99724966,0.0010912175,0.00018876919,0.00043625204,0.00071163,0.00032243133],"domain_scores_gemma":[0.981023,0.014326808,0.0013762979,0.0015576859,0.0011674954,0.0005486938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006390182,0.0020916427,0.0014666651,0.002120658,0.00096702366,0.0029571308,0.0021523149,0.001426474,0.004048585],"category_scores_gemma":[0.033126336,0.0009316972,0.0014553138,0.0027556089,0.0061215158,0.007625495,0.0036815214,0.0046426784,0.0006086737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121856174,0.000050636245,0.0007268708,0.00023086248,0.00003112975,0.00012938115,0.00032559191,0.32741284,0.0034393608,0.639414,0.0015549765,0.026562585],"study_design_scores_gemma":[0.000037456397,0.000116330964,0.00035167357,0.0000942421,0.000029051253,0.00008658945,0.000091963426,0.5909795,0.0021576276,0.3999898,0.006023269,0.00004245431],"about_ca_topic_score_codex":0.004398816,"about_ca_topic_score_gemma":0.002600724,"teacher_disagreement_score":0.006390182,"about_ca_system_score_codex":0.0037552353,"about_ca_system_score_gemma":0.0017257673,"threshold_uncertainty_score":0.03379494},"labels":[],"label_agreement":null},{"id":"W2905356337","doi":"10.22215/etd/2014-10087","title":"Improving Digital Control System Performance Through a Novel Jitter Compensating Method","year":2014,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Jitter; PID controller; Control theory (sociology); Computer science; Controller (irrigation); Overhead (engineering); Digital control; Sampling (signal processing); Control engineering; Control (management); Engineering; Electronic engineering; Telecommunications; Temperature control","score_opus":0.011391547861057089,"score_gpt":0.250900686715878,"score_spread":0.23950913885482092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905356337","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025983654,0.0006159664,0.96701974,0.00010318363,0.00020937741,0.000065704444,0.00002407561,0.0015862818,0.004392028],"genre_scores_gemma":[0.6451407,0.00055437704,0.34696004,0.0001386133,0.00018765916,0.00007599961,0.000061601495,0.00008344074,0.0067975633],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99974436,0.000017316015,0.000016654429,0.00006824844,0.00012297509,0.000030342766],"domain_scores_gemma":[0.99980694,0.000037674905,0.00003533948,0.00004136678,0.00006334277,0.000015309884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021649348,0.00044085877,0.00029074957,0.0004976402,0.000475492,0.00054674555,0.0007930845,0.00039712148,0.0016847807],"category_scores_gemma":[0.00056869164,0.00014040593,0.0002182327,0.0003820764,0.00023182959,0.00048926467,0.00034220162,0.00049157144,0.00037154887],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002458799,0.00017819593,0.0003995084,0.00013933599,0.000023608487,0.00014376584,0.00009655849,0.031844027,0.38487512,0.009187738,0.0021584886,0.57070774],"study_design_scores_gemma":[0.000059295762,0.00042260071,0.00074372126,0.000020637686,0.000056483364,0.0003367664,0.000018017221,0.79096586,0.19269292,0.0018749996,0.01276988,0.000038879545],"about_ca_topic_score_codex":0.0009156604,"about_ca_topic_score_gemma":0.0011707324,"teacher_disagreement_score":0.0016847807,"about_ca_system_score_codex":0.0004371493,"about_ca_system_score_gemma":0.00051845465,"threshold_uncertainty_score":0.0056361556},"labels":[],"label_agreement":null},{"id":"W2910067318","doi":"10.1049/iet-cdt.2018.5043","title":"Probabilistic timing analysis of time‐randomised caches with fault detection mechanisms","year":2019,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Cache; Probabilistic analysis of algorithms; Static timing analysis; Fault detection and isolation; Real-time computing; Reliability engineering; Algorithm; Parallel computing; Embedded system; Artificial intelligence; Engineering","score_opus":0.007505424122112765,"score_gpt":0.21055296918920588,"score_spread":0.2030475450670931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910067318","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0950266,0.00035567296,0.90303963,0.000086564396,0.000022804776,0.00003382031,0.00005102066,0.0005096991,0.0008741568],"genre_scores_gemma":[0.955422,0.000137178,0.04358093,0.000039704424,0.000022702303,0.000045745473,0.000063534375,0.00004072405,0.00064744835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793893,0.0006061027,0.00012037392,0.00028440426,0.0008564815,0.00019356915],"domain_scores_gemma":[0.9896902,0.0070492118,0.0012890823,0.0008877249,0.0009711628,0.00011258055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020980781,0.000576507,0.00062418735,0.00083566894,0.00031935272,0.0007921065,0.0013270887,0.00081115024,0.0008391289],"category_scores_gemma":[0.011817658,0.00043986496,0.00069827295,0.0006688722,0.0006659767,0.0011755588,0.00062509876,0.0008081175,0.00013622845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095559815,0.00002047905,0.00085798703,0.000034737408,0.000025040084,0.000029667317,0.00003238055,0.9753151,0.0037178271,0.00550587,0.00008022277,0.014285104],"study_design_scores_gemma":[0.0000023950836,0.000022075395,0.0001386381,0.0000020367638,0.000006370283,0.00001229098,0.0000016428579,0.99716645,0.0013025205,0.001269613,0.00007221158,0.0000037005996],"about_ca_topic_score_codex":0.0043144235,"about_ca_topic_score_gemma":0.0027406383,"teacher_disagreement_score":0.0043144235,"about_ca_system_score_codex":0.0011551072,"about_ca_system_score_gemma":0.0014346384,"threshold_uncertainty_score":0.011095881},"labels":[],"label_agreement":null},{"id":"W2934871861","doi":"10.1109/hase.2019.00020","title":"Isochronous Execution Models for High-Assurance Real-Time Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Real-time computing","score_opus":0.010858577510332425,"score_gpt":0.22142368577126034,"score_spread":0.21056510826092792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934871861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01385172,0.0002583954,0.98044616,0.0003044299,0.0000485605,0.00005496028,0.00005254389,0.00027480745,0.00470841],"genre_scores_gemma":[0.6477898,0.001090018,0.33709195,0.0002454273,0.00018615864,0.00045869566,0.0002750816,0.00029228604,0.012570596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998516,0.00052846625,0.00009033279,0.00020098739,0.00047710544,0.00018711928],"domain_scores_gemma":[0.99740547,0.0011949668,0.00037919873,0.0005239751,0.00030425453,0.00019217643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024622246,0.0011367156,0.0006225841,0.0006583921,0.000654492,0.0018178298,0.0022018692,0.0011000198,0.0029783882],"category_scores_gemma":[0.0048317113,0.00051698706,0.0009632082,0.00062539376,0.0017960885,0.002847703,0.001453235,0.002649965,0.00072274305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009702381,0.000060193324,0.00030296273,0.000073804855,0.000019155568,0.000112965,0.00025228795,0.52993935,0.0030567541,0.45606902,0.0011421102,0.008874352],"study_design_scores_gemma":[0.000026751237,0.000038395938,0.000051834348,0.000012585684,0.000012304412,0.000028615603,0.000027795959,0.88033235,0.00075263943,0.11530555,0.0034003186,0.000010822133],"about_ca_topic_score_codex":0.003072253,"about_ca_topic_score_gemma":0.003631997,"teacher_disagreement_score":0.003072253,"about_ca_system_score_codex":0.0014059753,"about_ca_system_score_gemma":0.0017400931,"threshold_uncertainty_score":0.013021648},"labels":[],"label_agreement":null},{"id":"W2949359797","doi":"10.1145/3320271","title":"Partitioning and Selection of Data Consistency Mechanisms for Multicore Real-Time Systems","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Scalability; Distributed computing; Multi-core processor; Scheduling (production processes); Integer programming; Shared resource; Heuristic; Lock (firearm); Task (project management); Shared memory; Blocking (statistics); Parallel computing; Computer network; Mathematical optimization; Algorithm; Operating system","score_opus":0.0354643310126777,"score_gpt":0.2844457369966519,"score_spread":0.24898140598397417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949359797","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073019184,0.00085353706,0.92380476,0.00019466398,0.00005904207,0.00015848603,0.00004702977,0.00053389714,0.0013294694],"genre_scores_gemma":[0.6055457,0.00021868365,0.39282757,0.00008861009,0.000031927055,0.00020705262,0.00012685973,0.000087861685,0.00086573506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804723,0.000624315,0.0002097727,0.00033491896,0.0005019807,0.0002818566],"domain_scores_gemma":[0.9965269,0.0014039836,0.00053776323,0.00075489515,0.00058709044,0.0001893555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024376984,0.00052832474,0.0005340422,0.0008710091,0.0008624048,0.0011690703,0.0015170397,0.0006141783,0.0008766815],"category_scores_gemma":[0.0053427946,0.00045312417,0.00046176167,0.0008471043,0.00061098294,0.0012851481,0.001006044,0.00070783996,0.0001634432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087435456,0.00045606148,0.004977394,0.0006503644,0.00016093854,0.0003438938,0.0007982102,0.43120298,0.13791396,0.037860144,0.0033862162,0.38137552],"study_design_scores_gemma":[0.00018310308,0.00028745836,0.0014343958,0.000049479175,0.000067756606,0.00024736073,0.0002440244,0.89737946,0.07731052,0.014715743,0.0080139795,0.000066736175],"about_ca_topic_score_codex":0.0014275298,"about_ca_topic_score_gemma":0.0017261187,"teacher_disagreement_score":0.0024376984,"about_ca_system_score_codex":0.000797857,"about_ca_system_score_gemma":0.0019999288,"threshold_uncertainty_score":0.012891948},"labels":[],"label_agreement":null},{"id":"W2951872852","doi":"10.1109/fccm.2019.00070","title":"Safe Task Interruption for FPGAs","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Task (project management); Field-programmable gate array; Computer science; Deadlock; Context (archaeology); Context switch; Embedded system; Task analysis; State (computer science); Real-time computing; Distributed computing; Programming language; Engineering","score_opus":0.022764199389620012,"score_gpt":0.2775659991230609,"score_spread":0.2548017997334409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951872852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38145435,0.0011350616,0.59598666,0.00027488344,0.0002195681,0.00025439466,0.0003997376,0.007893442,0.012382013],"genre_scores_gemma":[0.94661355,0.00018245545,0.050444536,0.00007901048,0.000012585969,0.000097844924,0.00014939901,0.00020313014,0.0022175717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994054,0.00012489433,0.00005037897,0.0000829151,0.0001801094,0.00015632247],"domain_scores_gemma":[0.9988475,0.0003844247,0.00016287433,0.0003545212,0.00017542842,0.00007528227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054499786,0.000558188,0.00033380536,0.00036737954,0.00037502561,0.0006340735,0.0008719504,0.00041916792,0.0023076357],"category_scores_gemma":[0.0021232257,0.00028520235,0.0003528025,0.0001906184,0.00043659363,0.0007041882,0.0004948626,0.00073168636,0.00039622092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017856989,0.00020010334,0.009371204,0.0006057978,0.00008963816,0.0010480622,0.00067568384,0.69089544,0.09347659,0.0453645,0.0055293823,0.15095788],"study_design_scores_gemma":[0.00009831472,0.0005355042,0.0010876715,0.00006676954,0.00005880709,0.00026869867,0.000069071124,0.8950327,0.07181174,0.013560265,0.01736863,0.00004171344],"about_ca_topic_score_codex":0.0019854892,"about_ca_topic_score_gemma":0.0018303538,"teacher_disagreement_score":0.0023076357,"about_ca_system_score_codex":0.0004911207,"about_ca_system_score_gemma":0.0009035583,"threshold_uncertainty_score":0.007719755},"labels":[],"label_agreement":null},{"id":"W2952692618","doi":"10.48550/arxiv.1508.06203","title":"Integrating Schedulability Analysis with UML-RT","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; Trojan Technologies (Canada)","funders":"","keywords":"Computer science; Distributed computing; Unified Modeling Language; Jitter; Scheduling (production processes); Static timing analysis; Object-oriented programming; Object-oriented analysis and design; Object-oriented design; Real-time computing; Software; Embedded system; Programming language","score_opus":0.07517917784417777,"score_gpt":0.19876878714637616,"score_spread":0.1235896093021984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952692618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023257653,0.00009240704,0.9916781,0.000120521734,0.00003808691,0.00005253974,0.000048315313,0.0036256001,0.0020186065],"genre_scores_gemma":[0.08825391,0.00027296843,0.9077459,0.00010084212,0.00008082671,0.0001719031,0.0003344093,0.00093921676,0.0021000982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995827,0.0016141383,0.0004238102,0.00039575816,0.001458991,0.00028025988],"domain_scores_gemma":[0.9922767,0.004130377,0.0009651033,0.0012777228,0.0012567727,0.00009329829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006070535,0.0010865876,0.00053507136,0.0030526402,0.00053451245,0.0021040807,0.0013712347,0.00083838083,0.003722844],"category_scores_gemma":[0.012156981,0.00069022534,0.0014248705,0.0007574265,0.00078582886,0.0024163083,0.0010669566,0.0012692411,0.0017062406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018890304,0.00028833118,0.0036902677,0.0006560003,0.00017804143,0.00074057694,0.0010709355,0.24787593,0.034985747,0.25857738,0.007191077,0.4445569],"study_design_scores_gemma":[0.000045539276,0.00006658777,0.0005928845,0.00017866404,0.00008251778,0.00025876195,0.00013425761,0.83719796,0.025444185,0.09918733,0.03674388,0.000067416906],"about_ca_topic_score_codex":0.004224565,"about_ca_topic_score_gemma":0.0026633714,"teacher_disagreement_score":0.006070535,"about_ca_system_score_codex":0.0014533777,"about_ca_system_score_gemma":0.0025213356,"threshold_uncertainty_score":0.032104492},"labels":[],"label_agreement":null},{"id":"W2961686043","doi":"10.1007/978-3-030-24094-3_8","title":"Inversion of Control","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reversing; Inversion (geology); Computer science; Control flow; Code (set theory); Separation of concerns; Software; Software engineering; Programming language; Engineering; Mechanical engineering","score_opus":0.013283015482449364,"score_gpt":0.20469208307683368,"score_spread":0.1914090675943843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2961686043","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022712548,0.00428879,0.28292388,0.0013494298,0.0019858386,0.000039299925,0.00010480449,0.0003190033,0.7067177],"genre_scores_gemma":[0.2295512,0.0072791693,0.06020675,0.0010965964,0.0014268826,0.00016349978,0.00023660868,0.0003873738,0.6996519],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99975425,0.000043844953,0.000008684436,0.000056379275,0.000114604874,0.000022207232],"domain_scores_gemma":[0.999863,0.000038404818,0.000011031376,0.000036039888,0.000041589992,0.000009868198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025818284,0.0007208398,0.0003642458,0.0005005474,0.00042718102,0.0015821281,0.0005878121,0.00061467517,0.027644482],"category_scores_gemma":[0.0007687191,0.00023160447,0.0003076093,0.00040411612,0.0017745366,0.0013532869,0.00095026,0.0016150421,0.005533611],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017557317,0.000013594364,0.000032917775,0.00007714817,0.0000048367283,0.00001987809,0.00007612555,0.00414703,0.0016792164,0.89146596,0.0126089165,0.0898568],"study_design_scores_gemma":[0.000012245651,0.00005650982,0.0001410237,0.00009367043,0.0000094890665,0.00010923375,0.00007826749,0.03134967,0.0027315058,0.58258456,0.3828145,0.000019373596],"about_ca_topic_score_codex":0.0015998945,"about_ca_topic_score_gemma":0.0012235676,"teacher_disagreement_score":0.027644482,"about_ca_system_score_codex":0.000868931,"about_ca_system_score_gemma":0.00069462514,"threshold_uncertainty_score":0.092480004},"labels":[],"label_agreement":null},{"id":"W2962790766","doi":"","title":"THE ASSERT SET OF TOOLS FOR ENGINEERING (TASTE): DEMONSTRATOR, HW/SW CODESIGN, AND FUTURE","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Set (abstract data type); Taste; Computer science; Software engineering; Engineering drawing; Programming language; Computer architecture; Systems engineering; Engineering; Chemistry","score_opus":0.01868399423504756,"score_gpt":0.2302958920060202,"score_spread":0.2116118977709726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962790766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023393873,0.00013074916,0.9510818,0.0003865843,0.00018045981,0.00012455914,0.00044821648,0.03770947,0.0075987875],"genre_scores_gemma":[0.09232285,0.0005844178,0.86354434,0.0008931956,0.00022744092,0.00073809293,0.0035538492,0.019806214,0.01832958],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973007,0.00056338613,0.00029492925,0.00047314048,0.0010375255,0.00033026576],"domain_scores_gemma":[0.99566454,0.0009942644,0.00025690097,0.0020722782,0.0007053517,0.0003066561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003804097,0.0026333893,0.0011516304,0.0017099801,0.0010446507,0.004554667,0.003915813,0.0019526054,0.022972051],"category_scores_gemma":[0.008527971,0.001546717,0.00247281,0.0010404622,0.0022319856,0.006255679,0.006036537,0.0046101892,0.012942627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089854666,0.0004357955,0.0020819013,0.001699584,0.00011957742,0.00093404413,0.0011314029,0.01924159,0.04149543,0.40251192,0.08183969,0.44761047],"study_design_scores_gemma":[0.00037872393,0.0007377722,0.0008324231,0.00086729845,0.00018875829,0.0012795483,0.00028902656,0.20113553,0.07108969,0.37086755,0.35211265,0.00022098071],"about_ca_topic_score_codex":0.0011542195,"about_ca_topic_score_gemma":0.0014525066,"teacher_disagreement_score":0.022972051,"about_ca_system_score_codex":0.0006953925,"about_ca_system_score_gemma":0.0024735266,"threshold_uncertainty_score":0.07684916},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030438748299913297,"score_gpt":0.2935015980062963,"score_spread":0.26306284970638305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973123143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52818966,0.013400982,0.40898082,0.0014958943,0.0014464095,0.00016887499,0.00078743,0.012586864,0.03294302],"genre_scores_gemma":[0.9633884,0.00048918545,0.030138683,0.0001448692,0.00008212374,0.000031377018,0.0002061551,0.00013834158,0.00538084],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961555,0.000071455645,0.000023310575,0.000053905147,0.000106203304,0.00012958517],"domain_scores_gemma":[0.9994854,0.00012321307,0.000050397128,0.00015021086,0.00014610162,0.000044745975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032384502,0.00062896527,0.00040697015,0.0006175066,0.0005234628,0.0006583582,0.001355858,0.00026707177,0.007108534],"category_scores_gemma":[0.0010689236,0.00019025635,0.00019918104,0.00046818657,0.00024880562,0.0008598263,0.00065558666,0.0005960543,0.00084623386],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044631236,0.00057830586,0.002979746,0.0011400568,0.00021160216,0.00049953646,0.000294028,0.2214494,0.28050926,0.041398644,0.033086225,0.41339004],"study_design_scores_gemma":[0.00024211901,0.0014501022,0.0019248492,0.000058370046,0.00019648013,0.00037001574,0.00023483211,0.78839236,0.17212899,0.012340435,0.02260359,0.00005787611],"about_ca_topic_score_codex":0.0015867505,"about_ca_topic_score_gemma":0.0046734596,"teacher_disagreement_score":0.007108534,"about_ca_system_score_codex":0.0006605441,"about_ca_system_score_gemma":0.0012093057,"threshold_uncertainty_score":0.023780406},"labels":[],"label_agreement":null},{"id":"W2977079268","doi":"10.1049/iet-cps.2018.5062","title":"Extending resources for avoiding overloads of mixed‐criticality tasks in cyber‐physical systems","year":2019,"lang":"en","type":"article","venue":"IET Cyber-Physical Systems Theory & Applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Mixed criticality; Criticality; Scheduling (production processes); Distributed computing; Cyber-physical system; Schedule; Leverage (statistics); Automotive industry; Cloud computing; Multiprocessing; Embedded system; Parallel computing; Operating system; Engineering; Artificial intelligence","score_opus":0.011979155491199885,"score_gpt":0.274989783906591,"score_spread":0.26301062841539113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2977079268","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24590272,0.0008558115,0.74885255,0.00021850191,0.00008939908,0.00012255421,0.000049795533,0.0010081149,0.0029005178],"genre_scores_gemma":[0.9494715,0.000113797876,0.049719486,0.000040610994,0.000017034694,0.00006376187,0.00003685028,0.000055091492,0.00048179983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994962,0.0001322696,0.000026844791,0.00010084001,0.00011140512,0.00013241563],"domain_scores_gemma":[0.998841,0.0004784652,0.00016608313,0.00024148988,0.00015369411,0.000119276265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007533004,0.00065478985,0.0005490779,0.0005258472,0.0007168483,0.0006388437,0.00088930095,0.00035023087,0.0013433057],"category_scores_gemma":[0.0027170195,0.00025380647,0.0003158877,0.00033187767,0.00063518644,0.0014220997,0.0012698433,0.0006290382,0.00022284704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004987921,0.00024885114,0.0032207926,0.000231321,0.00005208876,0.00033166597,0.00042836767,0.7949864,0.037425913,0.011565852,0.0014290933,0.14958079],"study_design_scores_gemma":[0.000020221605,0.00014636264,0.00080945296,0.000014273216,0.000018928822,0.0000678892,0.000068922665,0.984654,0.0064286194,0.0064457348,0.0013133201,0.000012265796],"about_ca_topic_score_codex":0.0020002888,"about_ca_topic_score_gemma":0.0024687343,"teacher_disagreement_score":0.0020002888,"about_ca_system_score_codex":0.00043428843,"about_ca_system_score_gemma":0.0013616872,"threshold_uncertainty_score":0.0044938326},"labels":[],"label_agreement":null},{"id":"W2980077948","doi":"10.18429/jacow-ipac2019-weprb004","title":"Sawtooth Generation and Regulation with a Single FPGA for TRIUMF’s ARIEL Prebuncher","year":2019,"lang":"en","type":"article","venue":"JACOW","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"TRIUMF","funders":"","keywords":"Sawtooth wave; Computer science; Physics; Telecommunications","score_opus":0.020590110107725625,"score_gpt":0.21330782787459743,"score_spread":0.1927177177668718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980077948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13193059,0.0008778479,0.80387986,0.0004101153,0.0006677461,0.00045999337,0.0002543767,0.017393999,0.044125527],"genre_scores_gemma":[0.74830616,0.00024544692,0.22065428,0.00030884278,0.000132326,0.00022825754,0.00027881432,0.0006715046,0.02917429],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99958366,0.000036480746,0.000022543873,0.000107110965,0.00016252624,0.000087740904],"domain_scores_gemma":[0.9997292,0.00007100954,0.000035499677,0.000049942017,0.00008428765,0.000030064062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029420134,0.00052928773,0.00033505677,0.0005103107,0.0002681738,0.00069117977,0.0006516159,0.0002888459,0.014440292],"category_scores_gemma":[0.0005883003,0.0002326194,0.00016433472,0.00020985148,0.00020977466,0.0005290232,0.00031500356,0.0006603351,0.0027459436],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014980298,0.00028558625,0.0018591206,0.00037838213,0.00007162304,0.0007043974,0.00037408125,0.011354817,0.506734,0.01694627,0.019769376,0.44002432],"study_design_scores_gemma":[0.00043435843,0.0023964995,0.004937033,0.00013119509,0.00010817184,0.0018235364,0.00011154322,0.20024087,0.63314044,0.0030534817,0.15347616,0.00014671576],"about_ca_topic_score_codex":0.0008305605,"about_ca_topic_score_gemma":0.0013665622,"teacher_disagreement_score":0.014440292,"about_ca_system_score_codex":0.0005490318,"about_ca_system_score_gemma":0.0005493066,"threshold_uncertainty_score":0.048307598},"labels":[],"label_agreement":null},{"id":"W2988896746","doi":"10.1145/3349568.3351549","title":"Delay-bound function for cyber-physical systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ontario Institute of Technology","funders":"","keywords":"Cyber-physical system; Criticality; Computer science; Component (thermodynamics); Mixed criticality; Interval (graph theory); Physical system; Distributed computing; Function (biology); Reliability engineering; Transient (computer programming); Upper and lower bounds; Computation; Real-time computing; Algorithm; Engineering; Mathematics","score_opus":0.013480157964102903,"score_gpt":0.24149578140877706,"score_spread":0.22801562344467416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988896746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039453965,0.00047394013,0.9564598,0.0000831597,0.000059428945,0.00007170784,0.000187818,0.0006113859,0.0025988223],"genre_scores_gemma":[0.76154906,0.0007743623,0.23331995,0.00014375836,0.00012425728,0.000327207,0.00059563003,0.00029789185,0.002867872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877185,0.00026298774,0.00010181094,0.00020518339,0.00047193278,0.00018618129],"domain_scores_gemma":[0.99592566,0.0026440057,0.00036789727,0.00033607392,0.0006060873,0.00012021772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021075145,0.001364358,0.0006950824,0.002277465,0.00063223636,0.0021127407,0.00088205613,0.0009080764,0.0017620785],"category_scores_gemma":[0.008045489,0.0003117702,0.0009221964,0.0010273604,0.0010447701,0.002323704,0.0007076147,0.0012331001,0.00044845213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003611774,0.000125302,0.0037697335,0.00036521014,0.00007428565,0.00033652468,0.00033297174,0.6686281,0.03017525,0.23175411,0.0020132049,0.062064204],"study_design_scores_gemma":[0.000015198882,0.0000949297,0.00047381004,0.000028447233,0.000016492912,0.00010882032,0.000025921072,0.9563331,0.007578709,0.032456845,0.0028416323,0.000026003645],"about_ca_topic_score_codex":0.0023488845,"about_ca_topic_score_gemma":0.00091615133,"teacher_disagreement_score":0.0023488845,"about_ca_system_score_codex":0.0018809878,"about_ca_system_score_gemma":0.0015143587,"threshold_uncertainty_score":0.013647616},"labels":[],"label_agreement":null},{"id":"W2991137365","doi":"10.23919/date48585.2020.9116364","title":"Period Adaptation for Continuous Security Monitoring in Multicore Real-Time Systems","year":2020,"lang":"en","type":"preprint","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Computer science; Multi-core processor; Intrusion detection system; Adaptation (eye); Embedded system; Task (project management); Real-time computing; Distributed computing; Computer security; Operating system; Engineering","score_opus":0.04081518976609716,"score_gpt":0.28149281044787944,"score_spread":0.24067762068178228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991137365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064969115,0.0008428127,0.9275793,0.00016584828,0.00010863793,0.00012931696,0.00008896415,0.0035357403,0.0025801682],"genre_scores_gemma":[0.74140793,0.00016509638,0.25648627,0.00012033915,0.000043433498,0.00016891533,0.00008602827,0.00035754213,0.0011644781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751747,0.000736764,0.00013535992,0.0003990419,0.0009532261,0.00025817577],"domain_scores_gemma":[0.9954228,0.0019447828,0.0007960324,0.00096834044,0.0006217856,0.0002462417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003158579,0.0006521853,0.0005012228,0.0007286987,0.00040587047,0.000984203,0.001492617,0.00043233935,0.0017897349],"category_scores_gemma":[0.0074878167,0.00036700882,0.00043109962,0.0003827397,0.00065541925,0.00093724317,0.00088230614,0.0011703928,0.00022983343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013181721,0.0002415818,0.00818424,0.0006044783,0.00020300581,0.00021998517,0.00040235577,0.56430835,0.10380775,0.03498207,0.0037443747,0.28198364],"study_design_scores_gemma":[0.000042931097,0.0001714176,0.0010056994,0.000032007847,0.000035200177,0.00007391073,0.000021163683,0.964422,0.02593256,0.004870676,0.0033678727,0.000024654151],"about_ca_topic_score_codex":0.0023773545,"about_ca_topic_score_gemma":0.002525958,"teacher_disagreement_score":0.003158579,"about_ca_system_score_codex":0.0012978814,"about_ca_system_score_gemma":0.0019330548,"threshold_uncertainty_score":0.01670438},"labels":[],"label_agreement":null},{"id":"W2991772634","doi":"10.7873/date2014.306","title":"Generation of communication schedules for multi-mode distributed real-time applications","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Distributed computing; Mode (computer interface); Real-time computing; Scheduling (production processes); Workflow; Key (lock); Mathematical optimization","score_opus":0.11025414322075337,"score_gpt":0.3244195755139697,"score_spread":0.21416543229321633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991772634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034996737,0.00005274955,0.9622441,0.000067465,0.000021559532,0.00013418272,0.00007200581,0.00056030956,0.0018508978],"genre_scores_gemma":[0.51414996,0.000090537374,0.48332977,0.00003597892,0.000012892394,0.0002941169,0.00028664383,0.00025996577,0.0015401206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941194,0.0002073942,0.000033499542,0.00008616519,0.00020204851,0.00005892594],"domain_scores_gemma":[0.99849737,0.0007558993,0.00017322105,0.00020425716,0.00031177263,0.00005759052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010574416,0.00047711653,0.00031068572,0.00047388906,0.00039360035,0.00039032765,0.0006861106,0.00032587888,0.0017921398],"category_scores_gemma":[0.0037128946,0.00029204003,0.00039473156,0.00031631353,0.00032718544,0.0004349874,0.0004529799,0.00052079937,0.00026297593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012043207,0.00009748275,0.00071720924,0.00012660546,0.000021635113,0.0001496776,0.00015359813,0.8855446,0.01588573,0.016269349,0.0013080204,0.07960574],"study_design_scores_gemma":[0.000027457523,0.000053397052,0.0001353258,0.000007576318,0.00000680989,0.000027339236,0.000037270715,0.98678744,0.006638606,0.0045875236,0.0016857237,0.0000054736383],"about_ca_topic_score_codex":0.0019739226,"about_ca_topic_score_gemma":0.0032721953,"teacher_disagreement_score":0.0019739226,"about_ca_system_score_codex":0.00072236464,"about_ca_system_score_gemma":0.0016087819,"threshold_uncertainty_score":0.0059952736},"labels":[],"label_agreement":null},{"id":"W2996001114","doi":"10.29007/brkj","title":"A Software Architecture for Handling Complex Critical Section Constraints on Multiprocessors in a Fault-Tolerant Real-Time Embedded System","year":2019,"lang":"en","type":"article","venue":"EPiC series in computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Critical section; Fault tolerance; Multiprocessing; Task (project management); Architecture; Section (typography); Software; Embedded system; State (computer science); Distributed computing; Parallel computing; Operating system; Programming language; Engineering","score_opus":0.017655359937206978,"score_gpt":0.2807336872351716,"score_spread":0.26307832729796465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996001114","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083406106,0.0004572298,0.90746105,0.00024764787,0.000090837864,0.0001596981,0.00003618795,0.0042811534,0.0038601286],"genre_scores_gemma":[0.45065176,0.00035392548,0.5435884,0.0001424433,0.000058930702,0.00019944225,0.00013349546,0.00020469293,0.0046669827],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997217,0.00004558223,0.000031240404,0.000048382946,0.00010190669,0.000051215276],"domain_scores_gemma":[0.99931693,0.0001288234,0.00010119925,0.00014953184,0.00022290213,0.0000805583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004917556,0.00043197605,0.0003405303,0.00062061247,0.00059568294,0.0009287011,0.00149848,0.00063925143,0.0016085875],"category_scores_gemma":[0.0011784812,0.00040162745,0.00032968973,0.00047184993,0.00059038313,0.00080222887,0.0007595989,0.00071808073,0.0005048359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000608596,0.00027007898,0.0047187386,0.0005655888,0.00017040946,0.0010355124,0.0008720338,0.26653478,0.22329204,0.074188985,0.009313401,0.41842985],"study_design_scores_gemma":[0.00015959184,0.0009393779,0.0017250029,0.000067127745,0.00016869284,0.0005301602,0.00013262236,0.89309746,0.05374661,0.015574541,0.033791382,0.00006748283],"about_ca_topic_score_codex":0.0025049949,"about_ca_topic_score_gemma":0.0045901933,"teacher_disagreement_score":0.0025049949,"about_ca_system_score_codex":0.0006026553,"about_ca_system_score_gemma":0.0013904183,"threshold_uncertainty_score":0.0053812265},"labels":[],"label_agreement":null},{"id":"W2998774570","doi":"","title":"Work-in-Progress: Delay-Bound Function for Cyber-Physical Systems","year":2019,"lang":"en","type":"article","venue":"Embedded Software","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Criticality; Computer science; Cyber-physical system; Component (thermodynamics); Mixed criticality; Interval (graph theory); Distributed computing; Physical system; Reliability engineering; Function (biology); Transient (computer programming); Computation; Upper and lower bounds; Real-time computing; Engineering; Algorithm; Mathematics; Operating system","score_opus":0.012461501515391394,"score_gpt":0.2546082364092983,"score_spread":0.24214673489390692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998774570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025581393,0.00276667,0.96177244,0.000388354,0.00031595567,0.00012499749,0.00019586687,0.0008366895,0.008017647],"genre_scores_gemma":[0.6831486,0.003493893,0.30327734,0.00032070186,0.0007697428,0.00040972847,0.0006989905,0.000766391,0.0071145394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973828,0.00076065643,0.00018634272,0.00047611605,0.0008649735,0.00032912105],"domain_scores_gemma":[0.9911226,0.005267161,0.0007394488,0.0012639769,0.0012552761,0.00035150774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004110882,0.0021836618,0.0013046955,0.0027309123,0.0010533414,0.0038877567,0.0021036712,0.0017559562,0.003580512],"category_scores_gemma":[0.013232345,0.0005252896,0.0015763756,0.002018281,0.001979402,0.0049639214,0.0014844914,0.0024477257,0.0013399841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003449249,0.0002160805,0.0029681958,0.00071532594,0.00012520315,0.00038460002,0.00056878343,0.49219492,0.01017206,0.3169662,0.005297235,0.17004646],"study_design_scores_gemma":[0.0000160039,0.0001471722,0.00037081962,0.000096131516,0.000039355455,0.00014512576,0.000047487407,0.91835004,0.005583162,0.06576589,0.009398061,0.000040677598],"about_ca_topic_score_codex":0.0021074763,"about_ca_topic_score_gemma":0.0007155901,"teacher_disagreement_score":0.004110882,"about_ca_system_score_codex":0.002158194,"about_ca_system_score_gemma":0.00207629,"threshold_uncertainty_score":0.021740735},"labels":[],"label_agreement":null},{"id":"W2999579632","doi":"10.1007/s12652-020-01705-9","title":"A situation-aware task model for adaptive real-time systems","year":2020,"lang":"en","type":"article","venue":"Journal of Ambient Intelligence and Humanized Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Task (project management); Adaptation (eye); Overhead (engineering); Scheduling (production processes); Automotive industry; Real-time operating system; Usability; Real-time computing; Distributed computing; Human–computer interaction; Embedded system; Systems engineering","score_opus":0.06551607432976236,"score_gpt":0.2813760848787473,"score_spread":0.21586001054898496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999579632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01516247,0.00011190013,0.9815654,0.00022566518,0.000069341026,0.00006469289,0.00016821203,0.00045098117,0.0021813193],"genre_scores_gemma":[0.80073786,0.00032355398,0.19348282,0.0001214872,0.00008986483,0.00037394505,0.00041106195,0.00015123768,0.004308307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993044,0.00020839428,0.000060164828,0.0001578338,0.0001638694,0.00010521892],"domain_scores_gemma":[0.99926895,0.000290257,0.00007619106,0.000113759095,0.00016487682,0.00008591541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009524354,0.0007419272,0.0008536779,0.0005141054,0.0005197401,0.0013910837,0.001955896,0.0009203781,0.0030033377],"category_scores_gemma":[0.0026954084,0.0004405609,0.0009801908,0.0006009243,0.000523057,0.0017527055,0.0012323785,0.0014118187,0.00073435274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011227942,0.000082788465,0.00036410431,0.000054063352,0.00003272257,0.00007158966,0.00013093911,0.9573018,0.0018419242,0.024885966,0.0008042904,0.014317416],"study_design_scores_gemma":[0.0000069463754,0.000013565782,0.000041543015,0.0000027829055,0.000007135281,0.0000064086576,0.0000075302805,0.99419594,0.0000984812,0.0053078285,0.00030785345,0.00000392098],"about_ca_topic_score_codex":0.008757041,"about_ca_topic_score_gemma":0.008387855,"teacher_disagreement_score":0.008757041,"about_ca_system_score_codex":0.00082106347,"about_ca_system_score_gemma":0.0017402968,"threshold_uncertainty_score":0.017412186},"labels":[],"label_agreement":null},{"id":"W3011043901","doi":"","title":"1-Synchronous Programming of Large Scale, Multi-Periodic Real-Time Applications with Functional Degrees of Freedom","year":2020,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Scale (ratio); Computer science; Degrees of freedom (physics and chemistry); Physics; Geography; Cartography","score_opus":0.01560887969408399,"score_gpt":0.22901547408363995,"score_spread":0.21340659438955595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011043901","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028128842,0.00005323222,0.9648989,0.00016205882,0.000041139534,0.000057970465,0.000047417107,0.0008751581,0.005735351],"genre_scores_gemma":[0.5068288,0.00015773151,0.48250154,0.0002199104,0.00008135374,0.00027234727,0.000120467295,0.00041274336,0.009405283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994461,0.00020246377,0.00003256319,0.00009613978,0.00015240457,0.000070410926],"domain_scores_gemma":[0.9994235,0.00031752096,0.000076914344,0.0000923748,0.00006458328,0.000025034931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091813056,0.0004552738,0.0002420066,0.0001854615,0.00030348945,0.0008687815,0.0006886573,0.00038844885,0.0028541107],"category_scores_gemma":[0.0015688131,0.00020089919,0.0005839919,0.00020876204,0.0010821713,0.0010672545,0.0008495864,0.00075690076,0.00044776424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025932284,0.00012479772,0.0009732033,0.00024365538,0.00003703028,0.0004677231,0.00042187574,0.37267715,0.052980985,0.50641876,0.0029378387,0.06245757],"study_design_scores_gemma":[0.0000545953,0.000116924166,0.00023697643,0.000025241448,0.00001725281,0.000094651776,0.00004549778,0.8778246,0.016715778,0.09368908,0.011162261,0.000017104874],"about_ca_topic_score_codex":0.0011117931,"about_ca_topic_score_gemma":0.0022521527,"teacher_disagreement_score":0.0028541107,"about_ca_system_score_codex":0.00055274175,"about_ca_system_score_gemma":0.00084062293,"threshold_uncertainty_score":0.009547949},"labels":[],"label_agreement":null},{"id":"W3014575727","doi":"10.1109/rtss46320.2019.00044","title":"CARP: A Data Communication Mechanism for Multi-core Mixed-Criticality Systems","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Criticality; Latency (audio); Communications protocol; Mixed criticality; Cache; Core (optical fiber); Distributed computing; Protocol (science); Cache coherence; Computer network; CPU cache; Telecommunications","score_opus":0.15545239476755376,"score_gpt":0.3494063698481579,"score_spread":0.19395397508060416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014575727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07297375,0.0015472184,0.90546674,0.00031941297,0.00025741654,0.00046657902,0.0002293916,0.013338602,0.0054008435],"genre_scores_gemma":[0.8058024,0.00033139056,0.18842088,0.00027667283,0.00016141063,0.0005585804,0.00026758906,0.0006823894,0.0034986571],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984301,0.0003237388,0.0001457318,0.00020834661,0.0006586396,0.00023348784],"domain_scores_gemma":[0.99521327,0.0012223703,0.00078596215,0.0013648312,0.0011004785,0.00031298166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002401114,0.0009255599,0.0005437842,0.0013294809,0.0008411947,0.0011843442,0.003388933,0.00076554576,0.003453758],"category_scores_gemma":[0.0052957977,0.00056350935,0.00043064656,0.0007518303,0.0009631422,0.0019348152,0.002040809,0.0014060283,0.0006422146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026661803,0.0005696512,0.0048980652,0.0019521221,0.0003461828,0.0010125452,0.0009294686,0.32949346,0.20720245,0.0717979,0.03003679,0.3490952],"study_design_scores_gemma":[0.00030491763,0.0016481428,0.0010649576,0.0001492861,0.00016605538,0.0006571045,0.000107483895,0.82320285,0.115899675,0.0133964075,0.043187633,0.00021547772],"about_ca_topic_score_codex":0.0011246214,"about_ca_topic_score_gemma":0.0014730239,"teacher_disagreement_score":0.003453758,"about_ca_system_score_codex":0.0009294336,"about_ca_system_score_gemma":0.0018777399,"threshold_uncertainty_score":0.012698472},"labels":[],"label_agreement":null},{"id":"W3015172527","doi":"10.1109/rtss46320.2019.00032","title":"Segment Streaming for the Three-Phase Execution Model: Design and Implementation","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; MPSoC; Compiler; Embedded system; Scheduling (production processes); Multiprocessing; Real-time operating system; Task (project management); Parallel computing; Scheme (mathematics); Operating system","score_opus":0.03481709008434538,"score_gpt":0.31959142504782084,"score_spread":0.2847743349634755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3015172527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033813134,0.00059983245,0.95326096,0.00015465044,0.000074926545,0.00037771833,0.00019392885,0.00722305,0.004301789],"genre_scores_gemma":[0.52604544,0.0005343105,0.4654612,0.00016547315,0.00005399343,0.0005583866,0.000482191,0.00055056624,0.006148492],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996582,0.000059436115,0.000030828345,0.00006678046,0.00012843625,0.00005623661],"domain_scores_gemma":[0.9996025,0.00008635184,0.00006318473,0.00008143971,0.00011800106,0.000048597933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004707201,0.00055929925,0.0003129167,0.00036717366,0.0002759113,0.00076613977,0.0015653126,0.0004117686,0.004596001],"category_scores_gemma":[0.00073580386,0.00028029515,0.0003838275,0.0003666266,0.00030188062,0.0006796787,0.00038562604,0.0005782965,0.0011172901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019890468,0.0005315303,0.0051541594,0.00088335504,0.00017120283,0.0004489075,0.0005381473,0.2929748,0.21010381,0.04143875,0.0142480675,0.43151817],"study_design_scores_gemma":[0.00009107343,0.00052484166,0.0005038451,0.00003606453,0.00004784536,0.00015841766,0.000036859932,0.9250491,0.052390367,0.0031714987,0.017955838,0.00003423729],"about_ca_topic_score_codex":0.0035319955,"about_ca_topic_score_gemma":0.0032055809,"teacher_disagreement_score":0.004596001,"about_ca_system_score_codex":0.00080992957,"about_ca_system_score_gemma":0.0012424535,"threshold_uncertainty_score":0.015375137},"labels":[],"label_agreement":null},{"id":"W3018182837","doi":"10.1002/spe.2831","title":"Designing real‐time systems using imprecise discrete‐event system specifications","year":2020,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; DEVS; Scalability; Set (abstract data type); Event (particle physics); Transient (computer programming); Formal methods; Distributed computing; Software; Formal verification; Theoretical computer science; Programming language; Modeling and simulation; Simulation","score_opus":0.053565307091369786,"score_gpt":0.2985414029193482,"score_spread":0.24497609582797844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018182837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006292454,0.000059842645,0.9916174,0.00014176084,0.000019319532,0.00005069778,0.000046368048,0.0003962754,0.0013758743],"genre_scores_gemma":[0.29668334,0.0004982673,0.69880605,0.00013596381,0.000032035583,0.00039615278,0.00036697485,0.00021924818,0.0028619948],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961153,0.0015048702,0.00040554092,0.00029153994,0.0014396086,0.0002431864],"domain_scores_gemma":[0.9931593,0.0040473905,0.0006079597,0.0012826395,0.00076914823,0.00013345745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005378774,0.0007898784,0.00054727687,0.0006883974,0.00047198505,0.0024078828,0.0013110721,0.00087449304,0.001931188],"category_scores_gemma":[0.008851412,0.0008850992,0.0013017631,0.00039017177,0.0018425365,0.0022252072,0.0012980439,0.0024006858,0.00046878407],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008141146,0.0000473421,0.0010866348,0.00030350432,0.000051700277,0.00034110277,0.0007847634,0.7119992,0.011804239,0.2431539,0.00084486895,0.029501341],"study_design_scores_gemma":[0.000046696907,0.00008072458,0.00021009051,0.0001435962,0.000042841435,0.00013900961,0.00017350189,0.90472984,0.017188724,0.052176382,0.025028713,0.000039881157],"about_ca_topic_score_codex":0.0027496063,"about_ca_topic_score_gemma":0.0031782386,"teacher_disagreement_score":0.005378774,"about_ca_system_score_codex":0.0012365934,"about_ca_system_score_gemma":0.0018766196,"threshold_uncertainty_score":0.02844596},"labels":[],"label_agreement":null},{"id":"W3021177675","doi":"10.1109/dasc43569.2019.9081787","title":"Empirical Bounds of Multicore Cache Interference for Real-Time Schedulability Analysis","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Multi-core processor; Predictability; Cache; Worst-case execution time; Execution time; Preemption; Embedded system; Upper and lower bounds; Scalability; Parallel computing; Distributed computing; Operating system","score_opus":0.027592091289228078,"score_gpt":0.31023761074352063,"score_spread":0.28264551945429256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021177675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12731896,0.0011539306,0.8626872,0.00055094226,0.00007536038,0.00014562502,0.00024762037,0.0006406811,0.007179672],"genre_scores_gemma":[0.91339374,0.00025819615,0.08517253,0.00013247356,0.00007186394,0.00019864952,0.00028693152,0.0001095112,0.00037605493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899565,0.0037033902,0.0006266037,0.0010405926,0.003935105,0.00073780934],"domain_scores_gemma":[0.764246,0.19765583,0.014638933,0.015277084,0.006916529,0.0012655766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020215057,0.001026169,0.00086225895,0.00213872,0.00088829995,0.0019470295,0.0019407265,0.0014474115,0.0016141782],"category_scores_gemma":[0.17966539,0.00060526637,0.00069775805,0.0012648501,0.0021537081,0.0028885633,0.0020623617,0.0035134228,0.00025726925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036415452,0.00034487754,0.024993176,0.00025749044,0.00014649775,0.00020579796,0.000334109,0.83537304,0.010399418,0.08103974,0.0011491664,0.04539248],"study_design_scores_gemma":[0.000025236684,0.00017051381,0.0045262035,0.00008369721,0.000019380572,0.00011919243,0.00007274305,0.9573594,0.0059345514,0.03060283,0.0010535136,0.000032746364],"about_ca_topic_score_codex":0.0024070952,"about_ca_topic_score_gemma":0.0022610785,"teacher_disagreement_score":0.020215057,"about_ca_system_score_codex":0.0019390171,"about_ca_system_score_gemma":0.0025469419,"threshold_uncertainty_score":0.10690868},"labels":[],"label_agreement":null},{"id":"W3041894101","doi":"10.1109/mdat.2020.3007729","title":"Runtime Protection of Real-time Critical Control Applications against Known Threats","year":2020,"lang":"en","type":"article","venue":"IEEE Design and Test","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Computer security; Control (management); Artificial intelligence","score_opus":0.033170085555116795,"score_gpt":0.25742214271573943,"score_spread":0.22425205716062263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041894101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09311052,0.00034549632,0.8978796,0.00024681338,0.000094194635,0.00011754495,0.000073824725,0.004521539,0.003610524],"genre_scores_gemma":[0.9229063,0.00017715276,0.074529715,0.00008156705,0.00003774992,0.00008360327,0.000096859665,0.00023799551,0.0018490559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987644,0.00033796747,0.000093393224,0.00020544697,0.0004197642,0.00017908435],"domain_scores_gemma":[0.99738365,0.00097004033,0.00036533602,0.00077481463,0.00042612752,0.00008003691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001283234,0.000618775,0.00042063955,0.00055740145,0.0005244506,0.00140788,0.0008234806,0.00044407338,0.0014915506],"category_scores_gemma":[0.004303407,0.0002711303,0.00058318867,0.00021084325,0.00078541966,0.0009778226,0.0007544549,0.00090580294,0.00035013404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011676592,0.00026891104,0.007362238,0.00059658557,0.00013970293,0.0010799272,0.0010745487,0.31900287,0.27271613,0.086659,0.0036786885,0.30625367],"study_design_scores_gemma":[0.000039624225,0.000367986,0.0014438624,0.00007284188,0.000071364295,0.0003634731,0.00009498543,0.84052986,0.12972812,0.018816145,0.008434912,0.000036918693],"about_ca_topic_score_codex":0.0012404203,"about_ca_topic_score_gemma":0.0013504795,"teacher_disagreement_score":0.0014915506,"about_ca_system_score_codex":0.0006832236,"about_ca_system_score_gemma":0.0014488809,"threshold_uncertainty_score":0.0067864656},"labels":[],"label_agreement":null},{"id":"W3048800322","doi":"10.1504/ijes.2020.10031197","title":"A software-based calibration approach to increase the robustness of embedded systems","year":2020,"lang":"en","type":"article","venue":"International Journal of Embedded Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Robustness (evolution); Computer science; Calibration; Software; Component (thermodynamics); Robustness testing; Embedded system; Reliability engineering; Kernel (algebra); Real-time computing; Engineering; Operating system","score_opus":0.03146036450752794,"score_gpt":0.26230050714015546,"score_spread":0.23084014263262753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048800322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047547486,0.00037121243,0.9426685,0.00016265913,0.00006671426,0.00013639318,0.00004786331,0.006643683,0.0023554768],"genre_scores_gemma":[0.7065894,0.00015063543,0.291102,0.00014096271,0.00006707708,0.00015302438,0.000106623746,0.0004533119,0.001237044],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9958748,0.0007987598,0.0002882475,0.00077426917,0.0020182237,0.00024566796],"domain_scores_gemma":[0.99128824,0.0023528882,0.0016001324,0.0024972474,0.002063689,0.00019779691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026544565,0.0009651842,0.00061666174,0.0019397239,0.00046084987,0.0011888219,0.0018943029,0.00083724427,0.0015097484],"category_scores_gemma":[0.013659752,0.0004493347,0.00058634614,0.0010111984,0.0007545023,0.0016351965,0.0014590687,0.0014152499,0.00056718534],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005355886,0.0004827285,0.0063401563,0.00041609808,0.0001435099,0.00032133536,0.0005386191,0.22399005,0.33438388,0.014609628,0.001975759,0.4162627],"study_design_scores_gemma":[0.000050024235,0.00077017175,0.003206507,0.000058486592,0.00008828079,0.00042217504,0.00006704709,0.7889561,0.18987615,0.007568331,0.0088484315,0.00008829586],"about_ca_topic_score_codex":0.0007361454,"about_ca_topic_score_gemma":0.0004534735,"teacher_disagreement_score":0.0026544565,"about_ca_system_score_codex":0.00074970396,"about_ca_system_score_gemma":0.0008759204,"threshold_uncertainty_score":0.014038324},"labels":[],"label_agreement":null},{"id":"W3094684774","doi":"10.1109/cjece.2020.3005360","title":"Real-Time Event Handling and Preemptive Hardware RTOS Scheduling on a Custom CPU Implementation","year":2020,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Context switch; Embedded system; Field-programmable gate array; Real-time operating system; Scheduling (production processes); Datapath; Computer hardware; Engineering","score_opus":0.008720188782649449,"score_gpt":0.211667118834812,"score_spread":0.20294693005216258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094684774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2328689,0.00046481093,0.72921443,0.00015115984,0.00025524467,0.00037861147,0.00020220882,0.011662729,0.024801869],"genre_scores_gemma":[0.8571613,0.00018853886,0.13210036,0.00008825042,0.00004034642,0.00011014462,0.00020544487,0.0003040167,0.009801577],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967027,0.00004900437,0.000033153934,0.00007063531,0.000101933234,0.00007510976],"domain_scores_gemma":[0.99947256,0.00009181948,0.00008518502,0.0001765361,0.0001387831,0.000035152567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029539698,0.00049679185,0.00023198484,0.00045044653,0.00023327128,0.00055885984,0.0010183287,0.0002538648,0.004976897],"category_scores_gemma":[0.0007649212,0.00022947344,0.00030472135,0.00032701952,0.00024932594,0.00044731988,0.0002493483,0.00040741058,0.00072654255],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021265033,0.0005680909,0.0038081284,0.00066722743,0.00013770013,0.0011401788,0.00039536646,0.11459435,0.45464334,0.044404015,0.009880187,0.3676349],"study_design_scores_gemma":[0.00032494208,0.0014557895,0.0034883413,0.00007074941,0.00016743822,0.001212911,0.0000877966,0.5279674,0.40718395,0.004722056,0.053230796,0.00008789713],"about_ca_topic_score_codex":0.0023714607,"about_ca_topic_score_gemma":0.0032074938,"teacher_disagreement_score":0.004976897,"about_ca_system_score_codex":0.0006214675,"about_ca_system_score_gemma":0.0010679145,"threshold_uncertainty_score":0.016649365},"labels":[],"label_agreement":null},{"id":"W3094768887","doi":"10.1145/384268.378799","title":"Automation support for software performance engineering","year":2001,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Nortel (Canada)","funders":"","keywords":"Computer science; Software; Automation; Set (abstract data type); Software system; Heuristic; Software engineering; Embedded software; Distributed computing; Embedded system; Operating system; Programming language; Engineering","score_opus":0.06148041236818427,"score_gpt":0.32118656264350065,"score_spread":0.2597061502753164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3094768887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010041913,0.0017715083,0.88358605,0.0030313048,0.00029117527,0.00028676222,0.00029069695,0.012852415,0.08784812],"genre_scores_gemma":[0.30791405,0.0028114226,0.655327,0.00069443596,0.00074109767,0.000652514,0.0010601039,0.0014340805,0.029365275],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9957135,0.0013898924,0.0002859861,0.00046473855,0.0018806123,0.00026536558],"domain_scores_gemma":[0.9885421,0.0049652904,0.000825697,0.0035600986,0.0018286222,0.00027821708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037185294,0.0009760374,0.0005334536,0.0016725248,0.0010036238,0.0036349643,0.0013283442,0.0011424272,0.0111466935],"category_scores_gemma":[0.019376943,0.0005432255,0.0006890955,0.0017457779,0.0011527801,0.0033718564,0.0019195655,0.0019441157,0.008289457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011659496,0.00014562685,0.001190061,0.00037179445,0.000038277787,0.00021427778,0.00047251818,0.021702161,0.00708531,0.41980988,0.023556681,0.52529675],"study_design_scores_gemma":[0.00011972687,0.00022041395,0.001382594,0.00041591085,0.000055413093,0.0003973703,0.00014121392,0.1346148,0.012235972,0.44852737,0.40181687,0.000072310904],"about_ca_topic_score_codex":0.0016457888,"about_ca_topic_score_gemma":0.0010132814,"teacher_disagreement_score":0.0111466935,"about_ca_system_score_codex":0.0012230963,"about_ca_system_score_gemma":0.0018350284,"threshold_uncertainty_score":0.03728938},"labels":[],"label_agreement":null},{"id":"W3095132872","doi":"10.1145/3417990.3422003","title":"MReplayer","year":2020,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Timestamp; TRACE (psycholinguistics); State (computer science); Unified Modeling Language; Distributed computing; Set (abstract data type); Overhead (engineering); Programming language; Real-time computing; Software","score_opus":0.028795215022854464,"score_gpt":0.2175887679567291,"score_spread":0.18879355293387465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095132872","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010126635,0.00065123755,0.57967174,0.00048543132,0.0005141791,0.0006245718,0.0061372234,0.37799937,0.023789577],"genre_scores_gemma":[0.2161769,0.0014866022,0.6298857,0.0016512148,0.00034146765,0.0012155282,0.039644167,0.04949317,0.060105238],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99710673,0.0004354952,0.00034960246,0.0005823939,0.0012138553,0.00031197566],"domain_scores_gemma":[0.99366015,0.001221806,0.00034838277,0.0036231137,0.00094213453,0.0002044052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030541252,0.0017150211,0.0008050416,0.0012387808,0.00042763227,0.0026873362,0.004340024,0.0010926359,0.02181037],"category_scores_gemma":[0.01007122,0.0012097596,0.0013835911,0.00069812825,0.0005218785,0.005455033,0.0046068337,0.0022217636,0.012772065],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026201578,0.0006653009,0.0057057193,0.0029132736,0.00055431906,0.0012394905,0.0011452207,0.029683653,0.035269722,0.07709059,0.25043756,0.592675],"study_design_scores_gemma":[0.00026291754,0.00048788343,0.0027193676,0.00032983097,0.00022659311,0.000985992,0.00019626108,0.1684628,0.09649296,0.024375468,0.7051997,0.0002601937],"about_ca_topic_score_codex":0.0022440143,"about_ca_topic_score_gemma":0.0020938395,"teacher_disagreement_score":0.02181037,"about_ca_system_score_codex":0.00055323064,"about_ca_system_score_gemma":0.0018085049,"threshold_uncertainty_score":0},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.024255244880311895,"score_gpt":0.284122712876489,"score_spread":0.2598674679961771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127604390","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09344201,0.006176906,0.69994456,0.031768866,0.0016492622,0.00019071497,0.0001350141,0.0032961534,0.16339654],"genre_scores_gemma":[0.8342391,0.003928759,0.13027146,0.0040531023,0.0006494969,0.00020131876,0.00020753266,0.0004782556,0.025970895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996327,0.00086173066,0.00013190453,0.00068187295,0.0012347383,0.00076273136],"domain_scores_gemma":[0.9940916,0.0010712704,0.00046274223,0.0019333764,0.0017836076,0.00065739057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004429463,0.0005131593,0.00039133662,0.00057614205,0.0015753681,0.004783258,0.0020317596,0.0025744422,0.005606595],"category_scores_gemma":[0.006143499,0.0005172648,0.0004471089,0.00061569683,0.0026002564,0.009599492,0.004142038,0.0041273185,0.0024038318],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012032643,0.000115428025,0.0017499932,0.00022166291,0.000029815506,0.00035732385,0.00070331054,0.027101686,0.007428822,0.82491136,0.023773296,0.113486946],"study_design_scores_gemma":[0.00011953288,0.00033132787,0.0022874186,0.0004229308,0.000063027255,0.000594457,0.0020213502,0.11357768,0.010898412,0.46640074,0.40315822,0.00012491173],"about_ca_topic_score_codex":0.0022537336,"about_ca_topic_score_gemma":0.0038917845,"teacher_disagreement_score":0.005606595,"about_ca_system_score_codex":0.0017731484,"about_ca_system_score_gemma":0.0032062454,"threshold_uncertainty_score":0.02342552},"labels":[],"label_agreement":null},{"id":"W3128625398","doi":"10.1145/3471904","title":"Worst-case Execution Time Calculation for Query-based Monitors by Witness Generation","year":2021,"lang":"en","type":"preprint","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Worst-case execution time; Graph; Scheduling (production processes); Execution time; Solver; Computation; Distributed computing; Theoretical computer science; Programming language","score_opus":0.03140584034871354,"score_gpt":0.2845694853112479,"score_spread":0.2531636449625344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128625398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09393465,0.000092041904,0.90163165,0.00007214786,0.000018657709,0.000070769325,0.00017992097,0.0030482144,0.0009518668],"genre_scores_gemma":[0.6945847,0.00009963442,0.30335802,0.000044546305,0.000013596342,0.00015303881,0.0005643993,0.0005701631,0.0006119072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988931,0.00026111724,0.00006239274,0.00024431775,0.00043539607,0.00010372637],"domain_scores_gemma":[0.99510324,0.0032230918,0.0004867777,0.00066585466,0.00042918648,0.000091832444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013575507,0.0008623641,0.00048016882,0.0009900796,0.00022052498,0.00079788483,0.0009846574,0.00059061556,0.0020229993],"category_scores_gemma":[0.010158273,0.0003105347,0.0006202414,0.00064018334,0.0006680867,0.0016037395,0.0007556047,0.0008350282,0.00024482966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071672956,0.00015667238,0.0079177935,0.0002823817,0.00008539074,0.00028212272,0.00027281707,0.80004877,0.059495784,0.023674892,0.0014079888,0.10565871],"study_design_scores_gemma":[0.000012365645,0.000042488806,0.00027645717,0.0000044135486,0.000008971822,0.000022763887,0.000011468253,0.9859962,0.010283102,0.0030789906,0.0002581129,0.000004722555],"about_ca_topic_score_codex":0.002410771,"about_ca_topic_score_gemma":0.0029495796,"teacher_disagreement_score":0.002410771,"about_ca_system_score_codex":0.0008345883,"about_ca_system_score_gemma":0.0012287707,"threshold_uncertainty_score":0.0071794987},"labels":[],"label_agreement":null},{"id":"W3130317758","doi":"10.1007/s10664-022-10170-1","title":"Optimal priority assignment for real-time systems: a coevolution-based approach","year":2022,"lang":"en","type":"article","venue":"Empirical Software Engineering","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Université du Luxembourg","keywords":"Coevolution; Computer science; Real-time computing; Biology","score_opus":0.01832058550148069,"score_gpt":0.24808763269531386,"score_spread":0.22976704719383317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130317758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03855381,0.00048167177,0.95646745,0.00032248508,0.000042857613,0.000099401674,0.000024392948,0.00020004192,0.0038078744],"genre_scores_gemma":[0.62309957,0.0003512991,0.37270427,0.00022506439,0.00006716923,0.00029561142,0.000093025,0.0001299922,0.0030340233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925,0.00027797735,0.000037851,0.00014210332,0.0001974818,0.00009448084],"domain_scores_gemma":[0.9975477,0.0015751962,0.00020143538,0.00012414559,0.0004174662,0.00013397736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021788056,0.001145737,0.001225058,0.0018356644,0.0006790076,0.0012156003,0.0019979437,0.0015584581,0.0023316194],"category_scores_gemma":[0.006256476,0.00066174666,0.00088488875,0.0009772638,0.0011371049,0.0012043478,0.001119359,0.0014387469,0.00024948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002787393,0.000062400264,0.0008081261,0.00004819427,0.00004940666,0.000052961797,0.00008312893,0.9612432,0.0010457869,0.010712361,0.0004259801,0.025440583],"study_design_scores_gemma":[0.0000059450754,0.000011759592,0.000065918575,0.000003415435,0.000005282629,0.000008737861,0.000009941497,0.9971928,0.00012325564,0.0023878103,0.00018227332,0.0000028466627],"about_ca_topic_score_codex":0.007372376,"about_ca_topic_score_gemma":0.005395437,"teacher_disagreement_score":0.007372376,"about_ca_system_score_codex":0.0017498903,"about_ca_system_score_gemma":0.0017799769,"threshold_uncertainty_score":0.014658928},"labels":[],"label_agreement":null},{"id":"W3136648576","doi":"10.1145/3255467","title":"Session details: Embedded systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Session (web analytics); Computer science; World Wide Web","score_opus":0.018850415537670945,"score_gpt":0.2716131974436416,"score_spread":0.2527627819059707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136648576","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029407241,0.006005989,0.005020264,0.007571118,0.025171991,0.0005846828,0.009762713,0.0036836904,0.9392588],"genre_scores_gemma":[0.004801469,0.0021578819,0.00044111372,0.00043035077,0.0016351737,0.00008144498,0.0014543751,0.00033646738,0.98866165],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995864,0.000046074263,0.00002289205,0.0001092052,0.00013547532,0.00009995243],"domain_scores_gemma":[0.9981786,0.0004969306,0.000056950692,0.00024180498,0.0003856806,0.0006400254],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00086117757,0.0018506021,0.0019723424,0.0008971359,0.00157835,0.0039394316,0.0012060198,0.0032974414,0.9045253],"category_scores_gemma":[0.0019707407,0.00039078042,0.0010965326,0.0012062668,0.00040641634,0.0015565064,0.0015695997,0.0020666006,0.7732906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042533656,0.00024470626,0.00018619273,0.0005020281,0.000026652684,0.00009436661,0.00004789789,0.0003248346,0.0024998514,0.0016064148,0.906,0.088041715],"study_design_scores_gemma":[0.000071572955,0.00019116962,0.00065414276,0.0001459452,0.000019810903,0.00006956898,0.000038082,0.00045918336,0.0007812685,0.00078202586,0.9967751,0.000012219864],"about_ca_topic_score_codex":0.000895526,"about_ca_topic_score_gemma":0.0019824319,"teacher_disagreement_score":0.09547472,"about_ca_system_score_codex":0.00066022563,"about_ca_system_score_gemma":0.0009492212,"threshold_uncertainty_score":0.13618302},"labels":[],"label_agreement":null},{"id":"W3136670412","doi":"10.4271/2021-01-0786","title":"A Domain-Centralized Automotive Powertrain E/E Architecture","year":2021,"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":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Powertrain; Automotive industry; Computer science; Architecture; Domain (mathematical analysis); Automotive engineering; Engineering; Torque","score_opus":0.010269920775819716,"score_gpt":0.2462910832569102,"score_spread":0.2360211624810905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136670412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06441465,0.00021535251,0.9037223,0.00028614534,0.00007389779,0.00018837163,0.000091830916,0.004464364,0.026543088],"genre_scores_gemma":[0.7331285,0.00027903545,0.24687265,0.00029876668,0.00004258649,0.00011376081,0.00039035737,0.0001903118,0.018684087],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997657,0.000030333491,0.00001518383,0.00007231528,0.00006617386,0.000050343617],"domain_scores_gemma":[0.99980336,0.000018975597,0.0000115778,0.00007110996,0.00006453417,0.000030509202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029277545,0.00030182654,0.00022070062,0.00025281313,0.00044312488,0.001066826,0.001433156,0.00061558594,0.0040944363],"category_scores_gemma":[0.0002754734,0.00023892752,0.00029682575,0.0003476897,0.00042336097,0.0010419273,0.00095996313,0.00081675715,0.0016087306],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050935766,0.0005804736,0.00349655,0.00034406016,0.00010313421,0.00059377664,0.00050641614,0.34628406,0.13205971,0.124341086,0.015492226,0.37568918],"study_design_scores_gemma":[0.00014115183,0.00038221607,0.0021797079,0.000064001855,0.000069103975,0.00045441708,0.00030676211,0.82546526,0.07147777,0.02766953,0.07171302,0.000077008604],"about_ca_topic_score_codex":0.0031904336,"about_ca_topic_score_gemma":0.0039540417,"teacher_disagreement_score":0.0040944363,"about_ca_system_score_codex":0.0006725105,"about_ca_system_score_gemma":0.001200942,"threshold_uncertainty_score":0.013697207},"labels":[],"label_agreement":null},{"id":"W3157260796","doi":"","title":"Bounding memory access interferences on the Kalray MPPA3 compute cluster","year":2021,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"","keywords":"Cluster (spacecraft); Computer science; Bounding overwatch; Parallel computing; Computer network; Artificial intelligence","score_opus":0.042163698479347124,"score_gpt":0.2657350947517174,"score_spread":0.2235713962723703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157260796","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84897023,0.0005320971,0.13520993,0.00032442738,0.000040313866,0.00008539965,0.00040667655,0.0042200647,0.010210922],"genre_scores_gemma":[0.95764846,0.00010835206,0.040238265,0.00007462668,0.000012776182,0.00007407659,0.0003892037,0.00023224439,0.0012219485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884903,0.0002039619,0.000036003712,0.00018165122,0.0005047352,0.0002246135],"domain_scores_gemma":[0.99694353,0.0017240978,0.00032063993,0.00040960754,0.00043867098,0.0001634587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009190141,0.0010020455,0.00050780934,0.0007014755,0.00064245315,0.0007827224,0.0014105359,0.00045784586,0.0020964246],"category_scores_gemma":[0.004220459,0.00030654864,0.00045628392,0.0009052826,0.0009035824,0.00088192924,0.0011059606,0.000990338,0.00029361097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007004379,0.00010982897,0.0058393124,0.00010663908,0.000045547833,0.000158293,0.00011263869,0.9358083,0.020931335,0.01024083,0.0023755261,0.023571387],"study_design_scores_gemma":[0.000014006698,0.00008590099,0.000905695,0.000003849481,0.000011893544,0.000021887823,0.000014638967,0.9887729,0.008069093,0.0015061199,0.0005866836,0.0000073852634],"about_ca_topic_score_codex":0.010241804,"about_ca_topic_score_gemma":0.009812157,"teacher_disagreement_score":0.010241804,"about_ca_system_score_codex":0.0021018242,"about_ca_system_score_gemma":0.0021958286,"threshold_uncertainty_score":0.020364404},"labels":[],"label_agreement":null},{"id":"W3160003420","doi":"10.22215/etd/2007-08061","title":"An environment for development and benchmarking DEVS applications","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Benchmarking; DEVS; Computer science; Simulation; Business; Modeling and simulation","score_opus":0.017259159129704656,"score_gpt":0.2978719417561905,"score_spread":0.2806127826264858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160003420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03879344,0.0008472347,0.5093811,0.00045828207,0.0005953859,0.00156232,0.017335868,0.40802333,0.023003053],"genre_scores_gemma":[0.14019038,0.0012281929,0.70866144,0.00035506333,0.00013649673,0.0030419298,0.07766728,0.04649582,0.022223467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968213,0.00085209956,0.00042136695,0.00055330934,0.0011201561,0.00023175369],"domain_scores_gemma":[0.9941725,0.002194517,0.00037211415,0.0018043463,0.0009952495,0.00046115884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054975506,0.0018812696,0.001052354,0.0021652426,0.00087811484,0.0021294318,0.003131885,0.0009918881,0.011303683],"category_scores_gemma":[0.008242812,0.0015665762,0.0011592204,0.0020967366,0.0004992865,0.0025418412,0.0026829306,0.0024179146,0.00697865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033814267,0.0024062882,0.010161021,0.0027993275,0.00056676805,0.0012558181,0.0016326354,0.06302302,0.06908649,0.027965369,0.29121453,0.5265073],"study_design_scores_gemma":[0.0017306935,0.0013610284,0.009667891,0.0004867949,0.00027162387,0.0009731062,0.00047203474,0.3534821,0.09298715,0.016845047,0.5213404,0.0003821265],"about_ca_topic_score_codex":0.0026757647,"about_ca_topic_score_gemma":0.003386613,"teacher_disagreement_score":0.011303683,"about_ca_system_score_codex":0.00068361964,"about_ca_system_score_gemma":0.0017792739,"threshold_uncertainty_score":0.037814617},"labels":[],"label_agreement":null},{"id":"W3160136784","doi":"10.4271/2021-01-5050","title":"Automated Generation of Automotive Open System Architecture Electronic Control Unit Configurations Using Xtend: Watchdog Driver Example","year":2021,"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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Electronic control unit; Automotive industry; Computer science; Architecture; Embedded system; Automotive electronics; Open architecture; Control unit; Control (management); Unit (ring theory); Automotive engineering; Engineering; Operating system; Artificial intelligence; Software","score_opus":0.028217163454666763,"score_gpt":0.27447063029798785,"score_spread":0.24625346684332108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160136784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2303911,0.0001561957,0.6766517,0.00019489358,0.000093664574,0.0004443677,0.0018930411,0.068999775,0.021175368],"genre_scores_gemma":[0.62649935,0.00012366014,0.35134563,0.00005727655,0.0000128942875,0.00028772498,0.0030772039,0.00308398,0.015512184],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999818,0.000032193588,0.000011607157,0.00004932305,0.00006312222,0.000025740455],"domain_scores_gemma":[0.9996971,0.00012798786,0.000023654837,0.00007262006,0.000058396945,0.000020314994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002555448,0.0006467853,0.0002636256,0.00044542257,0.00022983145,0.0003809593,0.00066380267,0.00050531566,0.008959548],"category_scores_gemma":[0.0006695205,0.00034314033,0.0003968437,0.0002596034,0.00023681784,0.00037453257,0.00046281068,0.00030632046,0.0016497965],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078052393,0.0004789531,0.0065229926,0.0008224631,0.000073460695,0.003830706,0.0011597847,0.17143379,0.15781952,0.019191947,0.034439802,0.60344607],"study_design_scores_gemma":[0.000251029,0.00036348918,0.0054743066,0.000051204854,0.000045433568,0.0010053501,0.00017701757,0.72531164,0.20651683,0.0050183376,0.055703137,0.00008221842],"about_ca_topic_score_codex":0.0018655448,"about_ca_topic_score_gemma":0.0022282668,"teacher_disagreement_score":0.008959548,"about_ca_system_score_codex":0.00025938614,"about_ca_system_score_gemma":0.0002682771,"threshold_uncertainty_score":0.029972732},"labels":[],"label_agreement":null},{"id":"W3161584219","doi":"10.1109/access.2021.3075640","title":"An Energy-Efficient Periodic Resource Model for Bounded Delay-Tolerant Real-Time Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ontario Institute of Technology","keywords":"Computer science; Reservation; Provisioning; Energy consumption; Workload; Interval (graph theory); Distributed computing; Resource (disambiguation); Bounded function; Real-time computing; Range (aeronautics); Computer network; Engineering","score_opus":0.03090649705840569,"score_gpt":0.2920771606781124,"score_spread":0.2611706636197067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161584219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013085221,0.00054760935,0.981075,0.00026597566,0.00010916587,0.00006174275,0.00009484884,0.00019084311,0.0045696283],"genre_scores_gemma":[0.9034061,0.0008366777,0.08764342,0.00014059746,0.00009148276,0.00022883355,0.00016549692,0.000096084186,0.0073912456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00011323672,0.000024433659,0.000081387836,0.0001234239,0.00007708424],"domain_scores_gemma":[0.9995499,0.000228213,0.000064653505,0.00003509131,0.00008646819,0.000035536836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007919642,0.00097535364,0.0011498481,0.0004927318,0.0005221696,0.0012028201,0.0017890536,0.00102833,0.0033686867],"category_scores_gemma":[0.0019282739,0.00040792042,0.00067441026,0.00066043617,0.00066992897,0.0011680139,0.0007134084,0.0011215594,0.00045538147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003605766,0.000012562846,0.00007704599,0.000038724604,0.000008153319,0.000049894337,0.000020322166,0.9791886,0.0007087767,0.015467721,0.0004241152,0.0039681103],"study_design_scores_gemma":[0.0000034597053,0.000006323481,0.000011240812,0.0000019649256,0.0000018224064,0.0000057387265,0.0000026107257,0.9980568,0.00006184652,0.0016892524,0.00015711431,0.0000018262236],"about_ca_topic_score_codex":0.0052341097,"about_ca_topic_score_gemma":0.0037070645,"teacher_disagreement_score":0.0052341097,"about_ca_system_score_codex":0.0011220676,"about_ca_system_score_gemma":0.0012169969,"threshold_uncertainty_score":0.011269331},"labels":[],"label_agreement":null},{"id":"W3169233553","doi":"10.1016/j.sysarc.2021.102178","title":"An Analyzable Inter-core Communication Framework for High-Performance Multicore Embedded Systems","year":2021,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung; Alexander von Humboldt-Stiftung; National Science Foundation","keywords":"Computer science; Multi-core processor; Benchmark (surveying); Bounding overwatch; Suite; Parallel computing; Core (optical fiber); Perspective (graphical); Interference (communication); Distributed computing; Computer network; Telecommunications; Artificial intelligence","score_opus":0.02187477213000893,"score_gpt":0.2857350683721201,"score_spread":0.26386029624211116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169233553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013073491,0.00032551493,0.9804017,0.0001270063,0.000074874995,0.0000854215,0.0000849931,0.0033026652,0.0025244507],"genre_scores_gemma":[0.4085925,0.00034008254,0.58501613,0.00012721361,0.000065421154,0.00020353391,0.0002582482,0.0006144258,0.0047824495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993113,0.00019069522,0.000040307415,0.000099578545,0.00024593988,0.00011218298],"domain_scores_gemma":[0.999295,0.0002605294,0.00005700922,0.00016735597,0.00017192587,0.000048144906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011004327,0.0009758171,0.0004974851,0.000732376,0.0007165956,0.0012188287,0.0016550157,0.0006059094,0.0034253302],"category_scores_gemma":[0.001995365,0.00049831806,0.0009093982,0.00045237943,0.0005957536,0.001451162,0.0010988854,0.0015099209,0.0007304275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00062486174,0.00026669158,0.0015173365,0.00046528832,0.00016901664,0.00044823645,0.00028861657,0.5410254,0.066060685,0.15470612,0.0069377855,0.22748993],"study_design_scores_gemma":[0.000020001851,0.00008594738,0.00014588554,0.000023756456,0.000035775858,0.000053853175,0.00001929906,0.96817017,0.0073859533,0.018675776,0.0053665736,0.000017028939],"about_ca_topic_score_codex":0.0033994964,"about_ca_topic_score_gemma":0.0061247516,"teacher_disagreement_score":0.0034253302,"about_ca_system_score_codex":0.0008490409,"about_ca_system_score_gemma":0.0022507526,"threshold_uncertainty_score":0.011458874},"labels":[],"label_agreement":null},{"id":"W3175249668","doi":"10.1109/icit46573.2021.9453575","title":"Triton: a Domain Specific Language for Cyber-Physical Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cyber-physical system; Domain-specific language; Low-level programming language; Delegation; Domain (mathematical analysis); Embedded system; Programming language; Distributed computing; Operating system; Programming paradigm","score_opus":0.016251183354207034,"score_gpt":0.2630765928663744,"score_spread":0.2468254095121674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175249668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001781799,0.00012743268,0.9736597,0.00021530234,0.00013278516,0.00017414958,0.0010182861,0.019124568,0.0037659958],"genre_scores_gemma":[0.060439494,0.0007870048,0.90166354,0.0008538565,0.00016182415,0.0012582438,0.006001684,0.013904424,0.01492985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984748,0.0003750625,0.00040191697,0.00021881562,0.0003877895,0.00014154556],"domain_scores_gemma":[0.9978822,0.00096262264,0.00025055572,0.00045505908,0.0003229877,0.00012659664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001689508,0.0014446133,0.00064001925,0.00085184316,0.00055656134,0.003267887,0.0022140509,0.001466427,0.009813773],"category_scores_gemma":[0.003980018,0.0012637458,0.001901701,0.00069037767,0.0014238586,0.0036602046,0.0025766606,0.004372262,0.005463465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050871534,0.00018684498,0.0015715832,0.0027014937,0.00015385522,0.0012749657,0.0027779855,0.042344138,0.04987929,0.6119624,0.10787557,0.17876312],"study_design_scores_gemma":[0.00017091076,0.00016949115,0.00036361665,0.00046597712,0.00006675464,0.0013570191,0.00024701585,0.10791867,0.023227056,0.07796062,0.78793967,0.00011328359],"about_ca_topic_score_codex":0.0011330756,"about_ca_topic_score_gemma":0.0013477164,"teacher_disagreement_score":0.009813773,"about_ca_system_score_codex":0.0006476201,"about_ca_system_score_gemma":0.0024273274,"threshold_uncertainty_score":0.032830358},"labels":[],"label_agreement":null},{"id":"W3182910460","doi":"10.23919/cisti52073.2021.9476353","title":"Modeling and simulation of tasks interactions using graphical interface","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Humber Polytechnic","funders":"","keywords":"Computer science; Usability; Graphical user interface; Human–computer interaction; Interface (matter); Programming language; Parallel computing","score_opus":0.04600042470818835,"score_gpt":0.3299249519778482,"score_spread":0.2839245272696599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182910460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023601396,0.000087116794,0.96363705,0.00009349424,0.000046830628,0.00014930766,0.0003578618,0.009207869,0.0028191425],"genre_scores_gemma":[0.47006786,0.0005232462,0.52087516,0.000112137626,0.000030283065,0.00070511096,0.0012693286,0.0012550199,0.005161965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929905,0.00028016733,0.000064405365,0.00010086416,0.00018953579,0.000065950044],"domain_scores_gemma":[0.99851674,0.00089223584,0.00009389691,0.00023930517,0.00018970844,0.000068105124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009522058,0.0011709678,0.0006114414,0.0007602195,0.00034093976,0.0012873068,0.0019618724,0.0012477285,0.005428058],"category_scores_gemma":[0.0032373522,0.00046988289,0.0010515392,0.0005685477,0.00061044045,0.0010645493,0.0008627643,0.0013012765,0.00094002316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032937704,0.00016336865,0.0021047029,0.00027284867,0.000079914986,0.0002068978,0.00037742255,0.9284158,0.023383616,0.0137535315,0.002000649,0.028911898],"study_design_scores_gemma":[0.00005304767,0.00006534982,0.00025862135,0.000017689192,0.000028165343,0.0000446854,0.00001725816,0.9825602,0.008155752,0.0032043564,0.005574574,0.000020272733],"about_ca_topic_score_codex":0.0040169344,"about_ca_topic_score_gemma":0.0026690466,"teacher_disagreement_score":0.005428058,"about_ca_system_score_codex":0.00042241847,"about_ca_system_score_gemma":0.00079534174,"threshold_uncertainty_score":0.018158615},"labels":[],"label_agreement":null},{"id":"W3183606772","doi":"10.23919/date51398.2021.9474078","title":"Empirical Evidence for MPSoCs in Critical Systems: The Case of NXP's T2080 Cache Coherence","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"H2020 European Research Council; Natural Sciences and Engineering Research Council of Canada; Ministerio de Ciencia e Innovación; European Commission","keywords":"Computer science; Cache coherence; MPSoC; MESIF protocol; MESI protocol; Embedded system; Coherence (philosophical gambling strategy); Architecture; Cache; Computer architecture; Avionics; Bus sniffing; System on a chip; Protocol (science); Key (lock); CPU cache; Parallel computing; Cache algorithms; Operating system; Engineering","score_opus":0.23903091776715465,"score_gpt":0.4294903587654676,"score_spread":0.19045944099831294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3183606772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007604,0.0123381745,0.02322063,0.019794377,0.0002541444,0.00020687978,0.001798459,0.00009773576,0.041529123],"genre_scores_gemma":[0.9947218,0.00081045745,0.0021457605,0.00072293484,0.00010796303,0.000037848058,0.00038545163,0.000039074403,0.0010288134],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9776039,0.009956667,0.0014510496,0.004847446,0.0052093286,0.0009316762],"domain_scores_gemma":[0.32594106,0.5706396,0.057050187,0.022773506,0.01981949,0.0037761203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03260175,0.00044207476,0.00049855653,0.0028486282,0.0011456377,0.002655785,0.0021484136,0.002290441,0.013921016],"category_scores_gemma":[0.2872818,0.00033345644,0.00074004073,0.0029531168,0.0049126614,0.004159355,0.0023508251,0.0035954828,0.0013163503],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013511961,0.0004016349,0.88455516,0.0009314961,0.00091219915,0.001784724,0.006050315,0.0022361022,0.0007486291,0.043810215,0.0047654314,0.052452832],"study_design_scores_gemma":[0.00022833099,0.0017355265,0.88861805,0.0020573419,0.00097157026,0.0025986314,0.013191473,0.0131635675,0.0021136005,0.03826657,0.036948595,0.00010671278],"about_ca_topic_score_codex":0.005152168,"about_ca_topic_score_gemma":0.0046783197,"teacher_disagreement_score":0.03260175,"about_ca_system_score_codex":0.00094858103,"about_ca_system_score_gemma":0.0018481717,"threshold_uncertainty_score":0.17241663},"labels":[],"label_agreement":null},{"id":"W3193234722","doi":"10.1109/dsn-w52860.2021.00022","title":"A Safety Architecture for Centralized E/E Architectures","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Architecture; Domain (mathematical analysis); Computer science; Controller (irrigation); Architecture domain; Distributed computing; Control (management); Enterprise architecture framework; Embedded system; Systems architecture; Artificial intelligence","score_opus":0.012603765070471281,"score_gpt":0.2522010144159121,"score_spread":0.2395972493454408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193234722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025626536,0.0001771528,0.955083,0.00040350124,0.00006983838,0.00013796991,0.00004799894,0.0018443901,0.01660952],"genre_scores_gemma":[0.77828336,0.00027512628,0.20555528,0.00027662277,0.000082896266,0.00019735975,0.0001903795,0.00012199193,0.0150170205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940026,0.00007853977,0.0000433124,0.00012813693,0.00022389738,0.00012582462],"domain_scores_gemma":[0.9992022,0.000100752106,0.00008296293,0.00019200153,0.00034794814,0.00007423244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007231671,0.0004198826,0.00029384508,0.00050407497,0.0009829346,0.0014849917,0.0012544368,0.0009913212,0.004686967],"category_scores_gemma":[0.0009016125,0.0002638283,0.0004326684,0.00031019148,0.0010637464,0.0016197173,0.0018997352,0.0014370977,0.0012358656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003303646,0.00026909573,0.0022328203,0.0002718774,0.000062002786,0.0005081014,0.0005793887,0.29863372,0.066941924,0.4030492,0.010262104,0.2168594],"study_design_scores_gemma":[0.00010511995,0.00044384864,0.0010762085,0.000090341906,0.00007638185,0.00042095894,0.0002212823,0.8072429,0.04218632,0.092835635,0.05522392,0.000077144374],"about_ca_topic_score_codex":0.0021226208,"about_ca_topic_score_gemma":0.0022504313,"teacher_disagreement_score":0.004686967,"about_ca_system_score_codex":0.000832405,"about_ca_system_score_gemma":0.0018533901,"threshold_uncertainty_score":0.015679538},"labels":[],"label_agreement":null},{"id":"W3202278229","doi":"10.1145/3477244.3477622","title":"An energy-aware optimization model for real-time systems analysis and design","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Provisioning; Workload; Efficient energy use; Task (project management); Energy (signal processing); Resource (disambiguation); Distributed computing; Real-time computing; Reliability engineering; Systems engineering; Engineering; Operating system; Computer network","score_opus":0.023886204478319125,"score_gpt":0.2524975751804647,"score_spread":0.22861137070214554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202278229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014949824,0.00022686887,0.99558926,0.00020223195,0.000029422146,0.00003126516,0.00005820193,0.00014104003,0.0022268037],"genre_scores_gemma":[0.33389628,0.0020057263,0.6472818,0.00041948594,0.00018643464,0.0009773383,0.0005058881,0.00037068964,0.014356355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921286,0.00023830646,0.000049997834,0.00011775444,0.00030267707,0.00007838969],"domain_scores_gemma":[0.99930465,0.00036293667,0.00008236989,0.00007332134,0.00014640854,0.000030306379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013400824,0.001412343,0.0009110455,0.00063217425,0.0004298939,0.0015700952,0.001645285,0.0010849512,0.0035012935],"category_scores_gemma":[0.0022246756,0.0006097398,0.0012924075,0.00096303935,0.00066156185,0.0017025166,0.00078107987,0.001865187,0.001042111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001965239,0.000025831101,0.00008496786,0.000051847714,0.000017626724,0.000029319643,0.000020378484,0.96125805,0.0011637483,0.02624577,0.0008442327,0.01023855],"study_design_scores_gemma":[0.00000444098,0.00000902569,0.000022044354,0.0000048978363,0.0000058265346,0.000007877649,0.000003213284,0.9900809,0.00023256526,0.008390927,0.001235103,0.0000031752786],"about_ca_topic_score_codex":0.003401851,"about_ca_topic_score_gemma":0.00536379,"teacher_disagreement_score":0.0035012935,"about_ca_system_score_codex":0.0013034629,"about_ca_system_score_gemma":0.0017098498,"threshold_uncertainty_score":0.011713028},"labels":[],"label_agreement":null},{"id":"W3206697535","doi":"10.1145/3471904","title":"Worst-Case Execution Time Calculation for Query-Based Monitors by Witness Generation","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Witness; Query optimization; Database; Programming language","score_opus":0.05359104345350239,"score_gpt":0.18974023988538039,"score_spread":0.136149196431878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206697535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085239924,0.00008234174,0.9105523,0.00007640296,0.000017895361,0.0000673157,0.00018012813,0.002902713,0.0008810196],"genre_scores_gemma":[0.68065864,0.00009789189,0.31720498,0.00004985577,0.000014874287,0.00015917905,0.00060171017,0.000610113,0.0006027779],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889034,0.00026983462,0.000060289087,0.00024696326,0.0004268303,0.00010583366],"domain_scores_gemma":[0.994766,0.0034904415,0.00050368236,0.0007022516,0.00043661593,0.000101043974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014300492,0.00088909216,0.00048920966,0.0009909648,0.00022512788,0.0008272566,0.0010185752,0.00060788007,0.0020737338],"category_scores_gemma":[0.010757873,0.00032757866,0.0006574989,0.00065756653,0.0006821673,0.001620633,0.00076620624,0.00088163425,0.00025343118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070077676,0.00016244294,0.007712357,0.0002858678,0.00008608139,0.00026875525,0.0002734106,0.8073115,0.05530903,0.026268968,0.001448776,0.10017206],"study_design_scores_gemma":[0.000013673022,0.000043476524,0.00026508438,0.000004667712,0.000009696688,0.00002304186,0.000011737279,0.9848316,0.010529245,0.003985491,0.00027748538,0.0000048300803],"about_ca_topic_score_codex":0.0022297408,"about_ca_topic_score_gemma":0.002690564,"teacher_disagreement_score":0.0022297408,"about_ca_system_score_codex":0.00084326806,"about_ca_system_score_gemma":0.0012890514,"threshold_uncertainty_score":0.0075629354},"labels":[],"label_agreement":null},{"id":"W3211114587","doi":"10.1109/isie45552.2021.9576354","title":"Machine Operating Speed, Fault Security and Fault Tolerance for Performability Analysis in Industrial Automation","year":2021,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cisco Systems (Canada)","funders":"","keywords":"Downtime; Automation; Computer science; Fault tolerance; Reliability engineering; Reliability (semiconductor); Context (archaeology); Software fault tolerance; Fault model; Embedded system; Fault (geology); Fault injection; Distributed computing; Engineering; Operating system; Software","score_opus":0.02302983766359801,"score_gpt":0.27600026654827314,"score_spread":0.25297042888467514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211114587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13332456,0.0015878188,0.860381,0.00017493681,0.00004077677,0.000025443946,0.00007206976,0.00021940756,0.004173903],"genre_scores_gemma":[0.9629163,0.00068199984,0.034746688,0.000019663494,0.00003689304,0.00002870779,0.00005029665,0.000073399126,0.0014460536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994831,0.00014942385,0.000023830033,0.00006426848,0.00020610502,0.00007318107],"domain_scores_gemma":[0.9986603,0.0008548688,0.00020801621,0.00017543971,0.00007786071,0.000023575876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071722997,0.0006943392,0.000463347,0.0008491672,0.00023802824,0.0005905829,0.00046695757,0.00048881513,0.0011849581],"category_scores_gemma":[0.0027070993,0.00027341128,0.0005696136,0.0011542317,0.00073211634,0.0011156603,0.00038178748,0.0007536178,0.00020749102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038287966,0.000032573418,0.0012757223,0.000052536525,0.000021143696,0.000045987774,0.000028360904,0.9394266,0.0056154886,0.03517795,0.00018848514,0.018096823],"study_design_scores_gemma":[0.000002885236,0.00005835409,0.00066946185,0.000008294859,0.00000837452,0.000046374473,0.000010180331,0.9764405,0.002376438,0.019745305,0.00062528125,0.00000856184],"about_ca_topic_score_codex":0.0014162429,"about_ca_topic_score_gemma":0.0011012014,"teacher_disagreement_score":0.0014162429,"about_ca_system_score_codex":0.0007139185,"about_ca_system_score_gemma":0.00052887015,"threshold_uncertainty_score":0.0051798224},"labels":[],"label_agreement":null},{"id":"W3212504974","doi":"","title":"Work-in-Progress: An Energy-Aware Optimization Model for Real-Time Systems Analysis and Design","year":2021,"lang":"en","type":"article","venue":"Embedded Software","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Workload; Computer science; Provisioning; Efficient energy use; Task (project management); Energy (signal processing); Work (physics); Resource (disambiguation); Reliability engineering; Distributed computing; Systems engineering; Engineering","score_opus":0.02348017683161627,"score_gpt":0.2626473437162036,"score_spread":0.2391671668845873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212504974","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039823237,0.00042527696,0.9900712,0.00048729658,0.000082573926,0.00006060997,0.0001134689,0.00030919266,0.004468142],"genre_scores_gemma":[0.44671366,0.0023766938,0.52867883,0.00033704154,0.00031401738,0.00089428696,0.0007479083,0.0007460668,0.019191502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984285,0.0005548665,0.000094164345,0.00022270204,0.0005360809,0.00016371622],"domain_scores_gemma":[0.997787,0.0009740858,0.00027265583,0.000361468,0.00048260146,0.00012225745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031980127,0.0022104408,0.00115483,0.0011538034,0.0007555438,0.0019784104,0.0033077756,0.0013165909,0.0045602117],"category_scores_gemma":[0.0052085947,0.0007816595,0.0016058313,0.001439561,0.0011670213,0.0037075838,0.0014242601,0.0019601544,0.0015389572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006184751,0.00005143756,0.00023889284,0.000096112766,0.00003098875,0.000075834854,0.000051597235,0.93170017,0.0011453567,0.04540327,0.0016001512,0.019544324],"study_design_scores_gemma":[0.000009589778,0.000029176983,0.000045992976,0.000013775817,0.000015618043,0.000018338622,0.000008609529,0.97651154,0.0007142157,0.019823126,0.0028018318,0.000008178825],"about_ca_topic_score_codex":0.0031633493,"about_ca_topic_score_gemma":0.0031257414,"teacher_disagreement_score":0.0045602117,"about_ca_system_score_codex":0.0011271493,"about_ca_system_score_gemma":0.0017844415,"threshold_uncertainty_score":0.016912937},"labels":[],"label_agreement":null},{"id":"W33594364","doi":"10.1007/978-3-540-31862-0_28","title":"Real Time Reactive Programming in Lucid Enriched with Contexts","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Programming language; Lucid dream; Class (philosophy); State (computer science); Property (philosophy); Declarative programming; Theoretical computer science; Programming paradigm; Inductive programming; Artificial intelligence","score_opus":0.009640569646042582,"score_gpt":0.23626985810264522,"score_spread":0.22662928845660263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W33594364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013551243,0.0004551595,0.95140225,0.00022314505,0.00015308581,0.00005353163,0.0001390893,0.007024907,0.026997626],"genre_scores_gemma":[0.24930303,0.00046018758,0.7172013,0.00028209522,0.00008579453,0.00018949201,0.00034378117,0.0023426395,0.029791653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.00013304588,0.0000385615,0.00011549935,0.00018715794,0.000106694526],"domain_scores_gemma":[0.9996126,0.00016079342,0.000025449903,0.00011268748,0.00005220716,0.00003625608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008539603,0.00069613644,0.0006240889,0.00047799188,0.00064880535,0.001747557,0.0015111027,0.00042269478,0.006420685],"category_scores_gemma":[0.0014385243,0.0007817805,0.0009826345,0.00047500545,0.0012609672,0.0024330553,0.0024035757,0.0024917698,0.001807166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004069183,0.00008800779,0.0005729538,0.0003862779,0.000045702447,0.0002952527,0.0010021264,0.057954565,0.013520935,0.7458918,0.009075579,0.17075981],"study_design_scores_gemma":[0.00011083167,0.00010572798,0.0003241428,0.00019293714,0.00009640331,0.0002708937,0.00015273664,0.25241628,0.021343773,0.5975313,0.12736087,0.00009409706],"about_ca_topic_score_codex":0.0020553723,"about_ca_topic_score_gemma":0.0050168517,"teacher_disagreement_score":0.006420685,"about_ca_system_score_codex":0.0008453662,"about_ca_system_score_gemma":0.00078110996,"threshold_uncertainty_score":0.021479309},"labels":[],"label_agreement":null},{"id":"W339586478","doi":"10.1007/978-1-4615-0288-3_29","title":"A Web-Based Distribution Protocol for Large Scale Analysis and Optimization Applications","year":2003,"lang":"en","type":"book-chapter","venue":"High Performance Computing Systems and Applications","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Server; Scalability; Protocol (science); Context (archaeology); Distributed computing; Operating system; Remote procedure call","score_opus":0.012238833982937073,"score_gpt":0.25518209733718866,"score_spread":0.2429432633542516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W339586478","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042916364,0.00014091138,0.9606776,0.00019721128,0.00019585244,0.00021950064,0.00027026192,0.02429861,0.009708348],"genre_scores_gemma":[0.1870793,0.00056514156,0.7132504,0.00077926635,0.00035145396,0.0016581598,0.002798972,0.009206857,0.084310494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991289,0.0002051767,0.00009128561,0.00009224018,0.0004085242,0.00007395651],"domain_scores_gemma":[0.99766076,0.00058306515,0.00007483143,0.0010554554,0.00047079634,0.00015504633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015553515,0.000768059,0.00078964996,0.0010113057,0.0009490137,0.0016183563,0.0019456799,0.0012523589,0.022840323],"category_scores_gemma":[0.00360523,0.0006641001,0.00047266876,0.0015598276,0.0006673631,0.0025592283,0.002469486,0.0023761922,0.009636706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010734554,0.000855453,0.0009186571,0.00024685235,0.00010751935,0.00047857815,0.0002748327,0.034001496,0.04160285,0.07518154,0.1370233,0.70823544],"study_design_scores_gemma":[0.0004587736,0.00020944896,0.0010967095,0.00006744007,0.00007248116,0.00068908377,0.000074159536,0.6569596,0.048250277,0.115080744,0.17692786,0.00011343299],"about_ca_topic_score_codex":0.0014335806,"about_ca_topic_score_gemma":0.0015548696,"teacher_disagreement_score":0.022840323,"about_ca_system_score_codex":0.0005574113,"about_ca_system_score_gemma":0.00091466075,"threshold_uncertainty_score":0.076408505},"labels":[],"label_agreement":null},{"id":"W38737772","doi":"10.1007/978-1-4614-0314-2_2","title":"Reference Architecture of a CAN-Based System","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Architecture; Computer science; Computer architecture; History; Archaeology","score_opus":0.033682598501805563,"score_gpt":0.21012411349863827,"score_spread":0.1764415149968327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38737772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011953658,0.0026791224,0.68737125,0.0013861813,0.0009887313,0.0003756645,0.00082095206,0.012470142,0.28195435],"genre_scores_gemma":[0.3549793,0.004679573,0.42056018,0.0010962108,0.00045640982,0.00071915734,0.0037414667,0.002007513,0.21176009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952245,0.0000835999,0.000031150586,0.00009584749,0.00018893255,0.00007801894],"domain_scores_gemma":[0.9995671,0.00003519118,0.000014396638,0.000117751704,0.00023540472,0.000030141113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005539823,0.00067809934,0.0005373768,0.00076327333,0.0009623148,0.002744937,0.0023673568,0.0014145061,0.02148979],"category_scores_gemma":[0.0008246495,0.0004364929,0.00042576648,0.0012158656,0.00058947393,0.0018362707,0.00085629994,0.0010654214,0.00972579],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047687753,0.00014128962,0.0005329236,0.0007192214,0.00008402374,0.0005006826,0.00062231236,0.110252164,0.023751806,0.5219194,0.097470604,0.24352871],"study_design_scores_gemma":[0.00011009282,0.00026985118,0.00070854137,0.00027891988,0.00014618627,0.00044759994,0.00022724322,0.29451203,0.019934837,0.09203543,0.5912328,0.000096479496],"about_ca_topic_score_codex":0.011449821,"about_ca_topic_score_gemma":0.010365256,"teacher_disagreement_score":0.02148979,"about_ca_system_score_codex":0.0014764456,"about_ca_system_score_gemma":0.0014476425,"threshold_uncertainty_score":0.07189053},"labels":[],"label_agreement":null},{"id":"W38781062","doi":"","title":"Investigation of real-time multi-user application development frameworks.","year":2001,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science","score_opus":0.023037924750495844,"score_gpt":0.22584752259151675,"score_spread":0.2028095978410209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38781062","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63562113,0.006941584,0.3087896,0.0019883171,0.00013167961,0.0011279068,0.00023457958,0.0015385573,0.04362661],"genre_scores_gemma":[0.7903187,0.0015004686,0.20139076,0.00014770897,0.00001599289,0.00041007114,0.0003437333,0.00019187249,0.005680675],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961475,0.0018826562,0.00012939239,0.00033266653,0.0011864154,0.0003212985],"domain_scores_gemma":[0.98563504,0.010117851,0.0010666257,0.0012173409,0.0014447682,0.0005183855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008117692,0.00049976434,0.00022849053,0.0010111728,0.0007255763,0.0020354437,0.0014455079,0.00068319857,0.0016224765],"category_scores_gemma":[0.02030494,0.00034810827,0.00050029316,0.0005222153,0.00080064184,0.0025398594,0.0010963462,0.0010207454,0.00024978918],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008318277,0.0020095771,0.046325084,0.0019873872,0.00019667122,0.0012568767,0.010783027,0.057790488,0.03804879,0.34861535,0.006819188,0.4853358],"study_design_scores_gemma":[0.00028425397,0.0024212624,0.030317347,0.0009696014,0.0002921352,0.0034614122,0.008348701,0.6149398,0.055113826,0.065568775,0.21812181,0.00016108462],"about_ca_topic_score_codex":0.002583563,"about_ca_topic_score_gemma":0.003300569,"teacher_disagreement_score":0.008117692,"about_ca_system_score_codex":0.0012718042,"about_ca_system_score_gemma":0.0022113612,"threshold_uncertainty_score":0.04293096},"labels":[],"label_agreement":null},{"id":"W4210469492","doi":"10.2514/6.iac-04-v.3.07","title":"High Speed Re-Entry: the Main Challenge","year":2004,"lang":"en","type":"article","venue":"55th International Astronautical Congress of the International Astronautical Federation, the International Academy of Astronautics, and the International Institute of Space Law","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bombardier (Canada)","funders":"","keywords":"Computer science","score_opus":0.019135694838103453,"score_gpt":0.2629264329790378,"score_spread":0.24379073814093433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210469492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13160668,0.048074555,0.4173942,0.16160892,0.023413148,0.00039267784,0.0020213688,0.0107045155,0.20478402],"genre_scores_gemma":[0.76453924,0.015477455,0.077547766,0.010500366,0.0063566607,0.00021766547,0.0023074658,0.0024534538,0.12059995],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978021,0.00034973703,0.000081979546,0.0004989338,0.00077480305,0.00049250113],"domain_scores_gemma":[0.98951846,0.003374555,0.00056818355,0.0018693199,0.003400467,0.001269057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028979254,0.001315255,0.001549787,0.00081821927,0.0017427763,0.004298508,0.004996542,0.0034355167,0.03596204],"category_scores_gemma":[0.011732928,0.00049472466,0.00047553756,0.0017231758,0.0011568178,0.009656691,0.0025070892,0.0049665743,0.013429898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010347962,0.00033868026,0.0026993179,0.0009494325,0.000093534414,0.00034279114,0.00045325872,0.04925812,0.010695217,0.119284414,0.31504104,0.49980938],"study_design_scores_gemma":[0.00021890862,0.00052287546,0.002287343,0.00034098863,0.00007739114,0.0009834723,0.0026987137,0.21977194,0.008236631,0.27086613,0.4938469,0.00014865809],"about_ca_topic_score_codex":0.0036359606,"about_ca_topic_score_gemma":0.0048905127,"teacher_disagreement_score":0.03596204,"about_ca_system_score_codex":0.0010899953,"about_ca_system_score_gemma":0.0029543808,"threshold_uncertainty_score":0.120305},"labels":[],"label_agreement":null},{"id":"W4210556045","doi":"10.1155/2022/2086717","title":"Comparison of Two Algorithms for Multiline Bus Dynamic Dispatching","year":2022,"lang":"en","type":"article","venue":"Discrete Dynamics in Nature and Society","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Computer science; Algorithm","score_opus":0.01225795366971294,"score_gpt":0.3428987871531343,"score_spread":0.3306408334834214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210556045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13219655,0.0025081371,0.84922385,0.0004775774,0.00035809682,0.00022301482,0.0001779921,0.0013833832,0.013451357],"genre_scores_gemma":[0.70119536,0.00090849434,0.29405823,0.00015266164,0.00008420579,0.00021907597,0.00033714346,0.00019756978,0.0028472713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987979,0.00039261044,0.00008005247,0.00021055584,0.0003407565,0.00017812169],"domain_scores_gemma":[0.9981477,0.0011008126,0.00012896396,0.00013438,0.00039477198,0.00009332541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014705873,0.0010767771,0.0011230472,0.0016705309,0.00084285747,0.0014735745,0.0012621778,0.0010881646,0.0025004],"category_scores_gemma":[0.004148709,0.00029647135,0.00078130356,0.0015111206,0.00042279938,0.0016325822,0.00083683716,0.0009369981,0.00030008718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032462156,0.00018841312,0.001430424,0.00013503086,0.0001290436,0.000030696177,0.0000806283,0.821438,0.0011475226,0.009114197,0.0011899319,0.1647914],"study_design_scores_gemma":[0.000033352175,0.00006363872,0.00035260245,0.0000072753533,0.000018286259,0.000018674133,0.000031025837,0.9963193,0.0005921421,0.0018370879,0.00071865757,0.00000792907],"about_ca_topic_score_codex":0.007910225,"about_ca_topic_score_gemma":0.0053028683,"teacher_disagreement_score":0.007910225,"about_ca_system_score_codex":0.0018635119,"about_ca_system_score_gemma":0.0020511379,"threshold_uncertainty_score":0.015728354},"labels":[],"label_agreement":null},{"id":"W4213360460","doi":"10.1201/9781420038163-8","title":"Real-Time in Embedded Systems","year":2005,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Science and Technology Major Project; Ministero dello Sviluppo Economico; Ministero dell’Istruzione, dell’Università e della Ricerca; Università di Pisa; Youngsan University; Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science","score_opus":0.015784678496541454,"score_gpt":0.2331392656930814,"score_spread":0.21735458719653997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213360460","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017416779,0.34087583,0.13656077,0.0053396253,0.0124545265,0.00012283438,0.00032698532,0.0012876698,0.5012901],"genre_scores_gemma":[0.02894979,0.2580741,0.08245757,0.0039583277,0.008191976,0.00028380103,0.00071659713,0.0012392309,0.6161287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938035,0.00009516873,0.00004589699,0.00011051258,0.00033163343,0.00003635331],"domain_scores_gemma":[0.9994092,0.00029934972,0.000026471955,0.00009443931,0.00013487565,0.00003567406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005214775,0.0012475621,0.0006192255,0.0010896786,0.00072712335,0.0029448378,0.0008620589,0.0012256672,0.030559368],"category_scores_gemma":[0.0015290384,0.00051854237,0.00040843812,0.0023347528,0.0010552553,0.0032772166,0.0011751613,0.0031839784,0.017822368],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020685264,0.000041951844,0.0001156245,0.0009484056,0.000018999252,0.0001441166,0.00064886716,0.002865478,0.002194946,0.45055395,0.20457305,0.33787397],"study_design_scores_gemma":[0.000002650397,0.000013201428,0.000075342425,0.0002408774,0.000004557769,0.00016436851,0.00003333214,0.0006911103,0.00028687212,0.031390626,0.96708953,0.0000074532395],"about_ca_topic_score_codex":0.00095417426,"about_ca_topic_score_gemma":0.0011394824,"teacher_disagreement_score":0.030559368,"about_ca_system_score_codex":0.001040048,"about_ca_system_score_gemma":0.000896656,"threshold_uncertainty_score":0.102231264},"labels":[],"label_agreement":null},{"id":"W4221136597","doi":"10.1145/3520136","title":"Beyond Just Safety: Delay-aware Security Monitoring for Real-time Control Systems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Cyber-Physical Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Predictability; Computer science; Control (management); Metric (unit); Computer security; Focus (optics); Security controls; Computer security model; Engineering; Artificial intelligence; Operations management","score_opus":0.01648873780720936,"score_gpt":0.261369271593018,"score_spread":0.24488053378580862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221136597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052505173,0.0011248502,0.9387706,0.00090519263,0.00017263369,0.00007612776,0.00003777294,0.0015498209,0.0048578177],"genre_scores_gemma":[0.94172484,0.00029509232,0.056114506,0.00021213997,0.0000724702,0.000036827292,0.000024939847,0.00009088707,0.0014281943],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888307,0.00020902559,0.0000447756,0.00022252164,0.0004378292,0.00020277973],"domain_scores_gemma":[0.99669915,0.0011612305,0.00059216144,0.00073594693,0.0005603131,0.00025111262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013654096,0.0009487845,0.00049109163,0.0006007167,0.00055274414,0.0016375327,0.0013943785,0.0008659711,0.0014271628],"category_scores_gemma":[0.0054060696,0.00038873035,0.00033523407,0.00037105597,0.001113436,0.0028912919,0.0012372372,0.001963069,0.00026533983],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087965024,0.00026829392,0.0044658505,0.00047698605,0.00010303727,0.00026079363,0.00052768044,0.6146035,0.09738944,0.103976384,0.0041509615,0.17289746],"study_design_scores_gemma":[0.00003795837,0.00029899,0.00071328704,0.00006118681,0.00004479376,0.00013825268,0.00006315451,0.9504516,0.02061665,0.020440029,0.007104039,0.000030070927],"about_ca_topic_score_codex":0.0019107653,"about_ca_topic_score_gemma":0.002170022,"teacher_disagreement_score":0.0019107653,"about_ca_system_score_codex":0.0010938857,"about_ca_system_score_gemma":0.0018528908,"threshold_uncertainty_score":0.007936716},"labels":[],"label_agreement":null},{"id":"W4224318715","doi":"10.1145/3489517.3530614","title":"Predictable sharing of last-level cache partitions for multi-core safety-critical systems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 59th ACM/IEEE Design Automation Conference","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cache; Computer science; Partition (number theory); Parallel computing; Multi-core processor; Latency (audio); Cache pollution; Cache algorithms; CPU cache; Distributed computing; Cache invalidation; Mathematics","score_opus":0.21541242315019649,"score_gpt":0.32324212021196125,"score_spread":0.10782969706176476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224318715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21631294,0.0013764015,0.77576596,0.00039662595,0.00011414704,0.0000892906,0.000075863034,0.001311499,0.0045571965],"genre_scores_gemma":[0.9511394,0.00012970809,0.047738746,0.000062560954,0.00003125273,0.000044908502,0.00005084371,0.000060840055,0.0007417511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.00019153558,0.000061681996,0.00010730327,0.00035104257,0.00016619821],"domain_scores_gemma":[0.9983967,0.0003328096,0.00026020734,0.0005523624,0.0003202098,0.0001377397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010182633,0.00034508685,0.00034371705,0.00044924906,0.0008778609,0.00082342775,0.0010523751,0.0002919682,0.0010605095],"category_scores_gemma":[0.002002994,0.0003045497,0.00030231208,0.00039921538,0.0005337302,0.0011096251,0.0010243698,0.0005907909,0.00024080375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084378244,0.00025211563,0.0058046244,0.00024500582,0.00010513834,0.0004949168,0.00073313847,0.6513233,0.14571595,0.034072604,0.0033405852,0.15706874],"study_design_scores_gemma":[0.000051171282,0.00057947374,0.0015927559,0.000034458328,0.000053719945,0.00026096794,0.00013882521,0.93071055,0.043283004,0.014983033,0.008273289,0.000038751114],"about_ca_topic_score_codex":0.0011976635,"about_ca_topic_score_gemma":0.0035495246,"teacher_disagreement_score":0.0011976635,"about_ca_system_score_codex":0.00092271017,"about_ca_system_score_gemma":0.0013839179,"threshold_uncertainty_score":0.006694734},"labels":[],"label_agreement":null},{"id":"W4231154768","doi":"10.1145/2499369.2465572","title":"A two-step optimization technique for functions placement, partitioning, and priority assignment in distributed systems","year":2013,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Software deployment; Scheduling (production processes); Distributed computing; Integer programming; Implementation; Execution time; Linear programming; Mathematical optimization; Algorithm; Operating system; Software engineering","score_opus":0.018810438735579065,"score_gpt":0.25966782428337354,"score_spread":0.24085738554779448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231154768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008442085,0.0000454047,0.99840707,0.000040904102,0.000013604625,0.00003073162,0.000006047676,0.00009025637,0.00052179786],"genre_scores_gemma":[0.06192874,0.00014914299,0.9353109,0.00008552808,0.000034632485,0.0002810564,0.00004061148,0.00011434558,0.0020550129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991394,0.00030481603,0.000030473244,0.000112250564,0.00033707736,0.000075914584],"domain_scores_gemma":[0.99936527,0.00038696543,0.00006582824,0.000049367813,0.000108541,0.000024025738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014540829,0.0015906382,0.00087045826,0.0010047398,0.00069072907,0.0007195028,0.0013455958,0.0009945896,0.0025340216],"category_scores_gemma":[0.0024863984,0.0009346878,0.0012875838,0.0010734848,0.00092174794,0.00086292345,0.0011197174,0.0021124692,0.0006376766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081010796,0.00010540849,0.00023934817,0.00018245986,0.000059238646,0.00008761001,0.00015031571,0.81696737,0.013568121,0.036665455,0.0022928917,0.12960075],"study_design_scores_gemma":[0.000031937398,0.00011804689,0.00012199254,0.0000204854,0.000021982762,0.00005898645,0.000018548788,0.9805398,0.004058104,0.011536675,0.003457967,0.000015487678],"about_ca_topic_score_codex":0.0030774975,"about_ca_topic_score_gemma":0.0038758733,"teacher_disagreement_score":0.0030774975,"about_ca_system_score_codex":0.001062409,"about_ca_system_score_gemma":0.0018184452,"threshold_uncertainty_score":0.008477151},"labels":[],"label_agreement":null},{"id":"W4231984224","doi":"10.7873/date.2014.306","title":"Generation of communication schedules for multi-mode distributed real-time applications","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Mode (computer interface); Real-time computing; Distributed computing; Operating system","score_opus":0.11025414322075337,"score_gpt":0.3244195755139697,"score_spread":0.21416543229321633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231984224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034996737,0.00005274955,0.9622441,0.000067465,0.000021559532,0.00013418272,0.00007200581,0.00056030956,0.0018508978],"genre_scores_gemma":[0.51414996,0.000090537374,0.48332977,0.00003597892,0.000012892394,0.0002941169,0.00028664383,0.00025996577,0.0015401206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941194,0.0002073942,0.000033499542,0.00008616519,0.00020204851,0.00005892594],"domain_scores_gemma":[0.99849737,0.0007558993,0.00017322105,0.00020425716,0.00031177263,0.00005759052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010574416,0.00047711653,0.00031068572,0.00047388906,0.00039360035,0.00039032765,0.0006861106,0.00032587888,0.0017921398],"category_scores_gemma":[0.0037128946,0.00029204003,0.00039473156,0.00031631353,0.00032718544,0.0004349874,0.0004529799,0.00052079937,0.00026297593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012043207,0.00009748275,0.00071720924,0.00012660546,0.000021635113,0.0001496776,0.00015359813,0.8855446,0.01588573,0.016269349,0.0013080204,0.07960574],"study_design_scores_gemma":[0.000027457523,0.000053397052,0.0001353258,0.000007576318,0.00000680989,0.000027339236,0.000037270715,0.98678744,0.006638606,0.0045875236,0.0016857237,0.0000054736383],"about_ca_topic_score_codex":0.0019739226,"about_ca_topic_score_gemma":0.0032721953,"teacher_disagreement_score":0.0019739226,"about_ca_system_score_codex":0.00072236464,"about_ca_system_score_gemma":0.0016087819,"threshold_uncertainty_score":0.0059952736},"labels":[],"label_agreement":null},{"id":"W4234525794","doi":"10.1145/2491899.2465572","title":"A two-step optimization technique for functions placement, partitioning, and priority assignment in distributed systems","year":2013,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Software deployment; Computer science; Scheduling (production processes); Integer programming; Distributed computing; Linear programming; Processor scheduling; Execution time; Genetic algorithm; Mathematical optimization; Computer network; Algorithm","score_opus":0.014145678379973126,"score_gpt":0.24843016156189507,"score_spread":0.23428448318192194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234525794","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008542587,0.00004668805,0.9984351,0.000037750513,0.000013621884,0.000031669173,0.0000058623878,0.0000779809,0.0004970948],"genre_scores_gemma":[0.062133282,0.0001560719,0.93524146,0.000082252496,0.000035436056,0.00030620318,0.000040409435,0.000110584406,0.0018943731],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917465,0.00029476912,0.000029337096,0.00010752464,0.00032251282,0.000071168055],"domain_scores_gemma":[0.99934417,0.0004044141,0.00006811711,0.00004853295,0.000110359135,0.000024403644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015035184,0.001641486,0.00094389124,0.0010596571,0.0006924499,0.00071063376,0.0013360305,0.0010436117,0.0024239593],"category_scores_gemma":[0.0024950479,0.0009244248,0.0013610888,0.0010898384,0.000925001,0.00085492583,0.0011219281,0.0020825604,0.00059612904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074572396,0.000104062616,0.00022972893,0.00019374638,0.00006263697,0.0000890548,0.00014636674,0.8311675,0.012847574,0.03423557,0.002048244,0.11880078],"study_design_scores_gemma":[0.00003238553,0.0001163546,0.00012685785,0.00002125974,0.00002290686,0.000060605773,0.00001775427,0.98160547,0.0039240792,0.010798698,0.0032571778,0.000016401173],"about_ca_topic_score_codex":0.0029590323,"about_ca_topic_score_gemma":0.0035465844,"teacher_disagreement_score":0.0029590323,"about_ca_system_score_codex":0.0010472992,"about_ca_system_score_gemma":0.0017599544,"threshold_uncertainty_score":0.0081089735},"labels":[],"label_agreement":null},{"id":"W4235836908","doi":"10.7873/date.2014.041","title":"Minimizing stack memory for hard real-time applications on multicore platforms","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Preemption; Computer science; Scheduling (production processes); Multi-core processor; Distributed computing; Integer programming; Parallel computing; Dynamic priority scheduling; Heuristic; Embedded system; Mathematical optimization; Algorithm; Quality of service; Operating system","score_opus":0.06643841776005163,"score_gpt":0.2872892765267359,"score_spread":0.22085085876668428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235836908","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6850649,0.002083586,0.30283722,0.00050252775,0.000044497352,0.0001577511,0.000088373716,0.00061572454,0.008605402],"genre_scores_gemma":[0.9361589,0.00036961623,0.061873686,0.00004885725,0.000010694098,0.000059462753,0.000055039967,0.00009873502,0.0013249915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996222,0.00012607999,0.000013046452,0.000041606516,0.00008829284,0.00010873874],"domain_scores_gemma":[0.9993382,0.0003834041,0.000098666445,0.0000392781,0.000073007286,0.000067445726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083886064,0.0009911229,0.00062533986,0.000679273,0.00049643253,0.0009770842,0.0006684092,0.0005066847,0.0011082656],"category_scores_gemma":[0.0019657959,0.00034993366,0.00033542624,0.00065120956,0.00045754138,0.000849771,0.0006164564,0.00053278153,0.00014303725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016587612,0.000089113935,0.0008255561,0.0001502332,0.000025626561,0.00007838543,0.00006617751,0.95094824,0.013479707,0.0034986394,0.00055002753,0.030122433],"study_design_scores_gemma":[0.000014318502,0.00012579816,0.0005006772,0.0000075575194,0.000016215412,0.000019384002,0.00005779818,0.99188715,0.0047699492,0.0022094937,0.00038487115,0.000006771151],"about_ca_topic_score_codex":0.004882379,"about_ca_topic_score_gemma":0.0072457553,"teacher_disagreement_score":0.004882379,"about_ca_system_score_codex":0.0011199953,"about_ca_system_score_gemma":0.0017862796,"threshold_uncertainty_score":0.009707868},"labels":[],"label_agreement":null},{"id":"W4236855035","doi":"10.1145/974044.974083","title":"Performance of parallel architectures for CORBA-based systems","year":2004,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Distributed computing; Object request broker; Computer architecture; Architecture; Distributed object","score_opus":0.017005682456883945,"score_gpt":0.23797041458523135,"score_spread":0.2209647321283474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236855035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91137874,0.0013263952,0.060742874,0.0007834913,0.00017844912,0.00012313253,0.00014868904,0.0033499077,0.021968251],"genre_scores_gemma":[0.98634213,0.0002797858,0.011247231,0.000026864393,0.000029495253,0.00003968865,0.00015657934,0.00012805362,0.0017500368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799746,0.0005549389,0.00008588371,0.00016440013,0.00094829855,0.00024896796],"domain_scores_gemma":[0.9966474,0.0013422685,0.00022855903,0.0006665945,0.0009168337,0.00019829242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022109952,0.0006349721,0.00039994653,0.0005860427,0.00082298374,0.0014177334,0.00077059056,0.00051525317,0.0032962332],"category_scores_gemma":[0.0076996027,0.00032535454,0.00018605946,0.0010001836,0.0005353566,0.0013817844,0.00069997594,0.0007345701,0.0008021765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004758867,0.0011203685,0.012273859,0.0005647294,0.00018777094,0.00040274762,0.0009930478,0.54884773,0.23693635,0.039948303,0.006737509,0.14722875],"study_design_scores_gemma":[0.00021947852,0.0012168137,0.0071017114,0.000032476208,0.00007879592,0.00018303888,0.0003182681,0.87861323,0.0828313,0.0194969,0.009858975,0.000049002927],"about_ca_topic_score_codex":0.0029010992,"about_ca_topic_score_gemma":0.0014353017,"teacher_disagreement_score":0.0032962332,"about_ca_system_score_codex":0.0010129681,"about_ca_system_score_gemma":0.00095013593,"threshold_uncertainty_score":0.011692941},"labels":[],"label_agreement":null},{"id":"W4237294698","doi":"10.1007/978-1-4614-6170-8_100361","title":"Component-Based Web Applications","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Component (thermodynamics); Computer science; Physics","score_opus":0.017007595049705476,"score_gpt":0.22462212514496613,"score_spread":0.20761453009526065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237294698","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074129053,0.018504906,0.68508565,0.0006959899,0.0013709748,0.00016860441,0.00037317764,0.011667476,0.2747203],"genre_scores_gemma":[0.09794957,0.030791495,0.31556663,0.0006367076,0.000814514,0.00026174745,0.0023706919,0.0045849746,0.5470236],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997625,0.000028438602,0.000012000551,0.00004539546,0.00013089468,0.000020783536],"domain_scores_gemma":[0.99978656,0.000072107156,0.0000070518627,0.00005361442,0.000063102954,0.000017669809],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021296428,0.0011563748,0.00045765608,0.0008042962,0.00035980693,0.0018138826,0.0013333599,0.00063428323,0.019542934],"category_scores_gemma":[0.00072248344,0.0005612585,0.0004402089,0.0021306076,0.00023339673,0.0020968935,0.0009132861,0.0015321261,0.013578254],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065387074,0.00013677523,0.00015503365,0.0005700881,0.000045228073,0.0001297481,0.00016082343,0.0110384375,0.015290794,0.084657446,0.08934146,0.7984088],"study_design_scores_gemma":[0.000023809116,0.000044799726,0.00068444846,0.00024183099,0.00005444584,0.00049169286,0.000065493776,0.06611782,0.015078338,0.07839969,0.83876234,0.000035334346],"about_ca_topic_score_codex":0.0008493314,"about_ca_topic_score_gemma":0.0011502687,"teacher_disagreement_score":0.019542934,"about_ca_system_score_codex":0.00040732918,"about_ca_system_score_gemma":0.00038450205,"threshold_uncertainty_score":0.06537759},"labels":[],"label_agreement":null},{"id":"W4238243910","doi":"10.1504/ijes.2020.110662","title":"A software-based calibration approach to increase the robustness of embedded systems","year":2020,"lang":"en","type":"article","venue":"International Journal of Embedded Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Robustness (evolution); Computer science; Calibration; Software; Robustness testing; Component (thermodynamics); Embedded system; Real-time computing; Reliability engineering; Engineering; Operating system","score_opus":0.03146036450752794,"score_gpt":0.26230050714015546,"score_spread":0.23084014263262753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238243910","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047547486,0.00037121243,0.9426685,0.00016265913,0.00006671426,0.00013639318,0.00004786331,0.006643683,0.0023554768],"genre_scores_gemma":[0.7065894,0.00015063543,0.291102,0.00014096271,0.00006707708,0.00015302438,0.000106623746,0.0004533119,0.001237044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958748,0.0007987598,0.0002882475,0.00077426917,0.0020182237,0.00024566796],"domain_scores_gemma":[0.99128824,0.0023528882,0.0016001324,0.0024972474,0.002063689,0.00019779691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026544565,0.0009651842,0.00061666174,0.0019397239,0.00046084987,0.0011888219,0.0018943029,0.00083724427,0.0015097484],"category_scores_gemma":[0.013659752,0.0004493347,0.00058634614,0.0010111984,0.0007545023,0.0016351965,0.0014590687,0.0014152499,0.00056718534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005355886,0.0004827285,0.0063401563,0.00041609808,0.0001435099,0.00032133536,0.0005386191,0.22399005,0.33438388,0.014609628,0.001975759,0.4162627],"study_design_scores_gemma":[0.000050024235,0.00077017175,0.003206507,0.000058486592,0.00008828079,0.00042217504,0.00006704709,0.7889561,0.18987615,0.007568331,0.0088484315,0.00008829586],"about_ca_topic_score_codex":0.0007361454,"about_ca_topic_score_gemma":0.0004534735,"teacher_disagreement_score":0.0026544565,"about_ca_system_score_codex":0.00074970396,"about_ca_system_score_gemma":0.0008759204,"threshold_uncertainty_score":0.014038324},"labels":[],"label_agreement":null},{"id":"W4238423925","doi":"10.22360/springsim.2019.tms.016","title":"Design and Implementation of a Building Control System in Real-time Devs","year":2019,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Occupancy; Energy consumption; Building automation; Controller (irrigation); Building management system; Computer science; Energy modeling; Efficient energy use; Control (management); Automation; Energy conservation; Control system; Energy (signal processing); Event (particle physics); Greenhouse gas; Architectural engineering; Engineering; Simulation; Modeling and simulation","score_opus":0.01083270203011254,"score_gpt":0.26290981351590487,"score_spread":0.2520771114857923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238423925","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041340355,0.00013823646,0.93210816,0.00016858989,0.00015074172,0.0002572352,0.00016941382,0.015017394,0.010649877],"genre_scores_gemma":[0.7634036,0.00012686782,0.22321446,0.00018816518,0.00004833482,0.00030743997,0.00042630683,0.00045051612,0.011834316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999678,0.00004110149,0.000020634317,0.00008194629,0.00012186695,0.000056412515],"domain_scores_gemma":[0.9996865,0.000061080464,0.00002997369,0.00005924561,0.00012630485,0.000036886202],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043384795,0.00040214483,0.0004032243,0.00025564543,0.00025926006,0.00084031513,0.0010958585,0.0004624779,0.0041676234],"category_scores_gemma":[0.00071038696,0.00028171696,0.0003148195,0.00013692754,0.00035068224,0.00040809158,0.00044057082,0.00064214366,0.0010435808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009727418,0.000705005,0.005114306,0.00069223985,0.00017138191,0.0011484507,0.00066234684,0.43147156,0.21725021,0.03470187,0.014499067,0.29261088],"study_design_scores_gemma":[0.00013563414,0.00034637965,0.0009800626,0.00002939258,0.000048297403,0.00020373428,0.000041846975,0.8715674,0.09377732,0.0018494426,0.030988432,0.000032102882],"about_ca_topic_score_codex":0.0025464587,"about_ca_topic_score_gemma":0.0018019679,"teacher_disagreement_score":0.0041676234,"about_ca_system_score_codex":0.00047075935,"about_ca_system_score_gemma":0.00080618303,"threshold_uncertainty_score":0.013942063},"labels":[],"label_agreement":null},{"id":"W4238563957","doi":"10.1007/978-1-4614-0314-2_5","title":"Statistical Analysis","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science","score_opus":0.03033517514422973,"score_gpt":0.2394865481979971,"score_spread":0.20915137305376738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238563957","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006633906,0.0010065102,0.8875206,0.0011929751,0.0016473084,0.0016254149,0.015480861,0.011850682,0.07304176],"genre_scores_gemma":[0.17484592,0.0020758177,0.5470278,0.0033181251,0.002001429,0.012110025,0.030753173,0.01187919,0.2159885],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9934604,0.0020818904,0.0004574814,0.0014869146,0.0021568555,0.0003564561],"domain_scores_gemma":[0.9799921,0.009278629,0.00082014676,0.0050323326,0.004590235,0.00028662253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074131126,0.001243346,0.0017104546,0.0029756534,0.00092739996,0.002468179,0.0014366502,0.00072548055,0.09837007],"category_scores_gemma":[0.037360013,0.00046044256,0.001574514,0.0032140268,0.0011189721,0.000999444,0.0013427825,0.0023551513,0.040001575],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006971956,0.00025555622,0.005082457,0.0010521486,0.00041610276,0.00023500569,0.0004354679,0.004366614,0.004309383,0.06968023,0.22078407,0.6926857],"study_design_scores_gemma":[0.0002389694,0.0011836011,0.01801075,0.0006952513,0.0006297002,0.0013990261,0.00060896704,0.043344237,0.014775827,0.14423935,0.7746964,0.00017781508],"about_ca_topic_score_codex":0.0016396678,"about_ca_topic_score_gemma":0.0018648934,"teacher_disagreement_score":0.09837007,"about_ca_system_score_codex":0.0009824792,"about_ca_system_score_gemma":0.0035395508,"threshold_uncertainty_score":0.3290807},"labels":[],"label_agreement":null},{"id":"W4241998759","doi":"10.1007/978-1-4939-7131-2_100183","title":"Component-Based Web Applications","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Component (thermodynamics); Computer science; World Wide Web; Physics","score_opus":0.02157560785690598,"score_gpt":0.2374900181623289,"score_spread":0.2159144103054229,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241998759","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008196094,0.017421009,0.70131,0.0007688416,0.0016498372,0.00017353446,0.00041154027,0.013185909,0.2568832],"genre_scores_gemma":[0.11652316,0.030025056,0.33948642,0.00071654754,0.0010349109,0.00029574646,0.0028442715,0.005456363,0.50361747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997451,0.000030951698,0.000013141016,0.00005139271,0.0001357699,0.000023710743],"domain_scores_gemma":[0.9997447,0.00008235069,0.000008366735,0.00006776089,0.0000735208,0.000023334209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024293525,0.0011817703,0.0004676536,0.00078934035,0.00036885575,0.0019250893,0.0013944256,0.00066033733,0.02031645],"category_scores_gemma":[0.00086222193,0.000568693,0.0004720625,0.0021635015,0.00023931624,0.002153706,0.0009949869,0.0016611313,0.014497468],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084202366,0.00015780507,0.00017609834,0.0006714001,0.000054024324,0.00013178721,0.00016266799,0.013334964,0.016283177,0.09414165,0.09464233,0.78016],"study_design_scores_gemma":[0.000026363998,0.00005123072,0.0007278823,0.00023702496,0.00006064885,0.0004655657,0.00006376971,0.07282981,0.015362427,0.09077298,0.819367,0.00003533004],"about_ca_topic_score_codex":0.0007476574,"about_ca_topic_score_gemma":0.0009435226,"teacher_disagreement_score":0.02031645,"about_ca_system_score_codex":0.00042832768,"about_ca_system_score_gemma":0.00042175115,"threshold_uncertainty_score":0.06796533},"labels":[],"label_agreement":null},{"id":"W4243357604","doi":"10.22215/etd/2007-06405","title":"Model-based dynamic resource management for multi tier informaiton systems","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage","funders":"","keywords":"Computer science; Humanities; Art","score_opus":0.02421683113604229,"score_gpt":0.31162851298181876,"score_spread":0.2874116818457765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243357604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029166175,0.000653361,0.96007794,0.0007302988,0.00015324452,0.000121240715,0.00022132882,0.0014394699,0.007436906],"genre_scores_gemma":[0.8652204,0.0004786914,0.12712829,0.00016340702,0.000050290226,0.00018556323,0.00028723333,0.00016109778,0.0063249995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992361,0.00025287914,0.000043744778,0.00011588587,0.00022842306,0.00012299557],"domain_scores_gemma":[0.9993488,0.00030687047,0.00006452206,0.00010004281,0.000117920055,0.000061749604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010513825,0.00064113125,0.00093662407,0.0004683935,0.00063588476,0.0024256618,0.0013162079,0.00077985605,0.0038923095],"category_scores_gemma":[0.0021885962,0.00042750489,0.0005766568,0.00059455476,0.00046181097,0.0015069233,0.0011476,0.0009931272,0.0005059868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104904175,0.00007186947,0.00030421047,0.000049910406,0.000032848024,0.000047179426,0.00005252164,0.95662856,0.0020739802,0.015106182,0.001931137,0.023596695],"study_design_scores_gemma":[0.00000600615,0.000012535752,0.000033626082,0.0000024551991,0.0000041362573,0.000006215118,0.000006528313,0.9961152,0.00022466965,0.003010706,0.000575021,0.000002842475],"about_ca_topic_score_codex":0.0104200095,"about_ca_topic_score_gemma":0.014328172,"teacher_disagreement_score":0.0104200095,"about_ca_system_score_codex":0.0018224595,"about_ca_system_score_gemma":0.0018462306,"threshold_uncertainty_score":0.020718753},"labels":[],"label_agreement":null},{"id":"W4243598353","doi":"10.7873/date2014.042","title":"Time-predictable execution of multithreaded applications on multicore systems","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Parallel computing; Schedule; Worst-case execution time; Execution time; Multithreading; Scheme (mathematics); Distributed computing; Embedded system; Thread (computing); Operating system","score_opus":0.04595093506235526,"score_gpt":0.2680291410086602,"score_spread":0.22207820594630495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243598353","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153906,0.0009155422,0.47739556,0.0001684526,0.00008303923,0.00013020918,0.00006747708,0.0021177055,0.0037314224],"genre_scores_gemma":[0.946344,0.00016947111,0.052587148,0.000033848126,0.000012996359,0.000049898215,0.000049137925,0.000072811425,0.0006806587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929655,0.00016551014,0.000051989264,0.00009553247,0.00025915325,0.00013129904],"domain_scores_gemma":[0.9990625,0.0002588915,0.00019152337,0.00023957323,0.00016279276,0.00008474259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006701819,0.0004830334,0.00028103153,0.0003247902,0.00037265723,0.00045011795,0.000788784,0.00019187042,0.00064205704],"category_scores_gemma":[0.001375437,0.00022511608,0.00023825825,0.00034148202,0.0003274307,0.0004943801,0.0005312752,0.0004807319,0.00013737795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006192078,0.00021135644,0.0056474623,0.00025033962,0.00008664865,0.00034979102,0.00025403878,0.6172384,0.24400714,0.011207124,0.0013903917,0.11873811],"study_design_scores_gemma":[0.000025609097,0.0002732291,0.0012109024,0.000008315507,0.000023290368,0.000057982194,0.000029463241,0.95466393,0.039887767,0.0020912753,0.001716643,0.000011648555],"about_ca_topic_score_codex":0.0023496924,"about_ca_topic_score_gemma":0.0042337924,"teacher_disagreement_score":0.0023496924,"about_ca_system_score_codex":0.0005209052,"about_ca_system_score_gemma":0.0013360439,"threshold_uncertainty_score":0.004671991},"labels":[],"label_agreement":null},{"id":"W4245609265","doi":"10.1007/978-1-4614-0314-2_8","title":"CAN Tools","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Generality; Computer science; Psychology","score_opus":0.05494820980656908,"score_gpt":0.2256621844191149,"score_spread":0.1707139746125458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245609265","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040601144,0.0010452814,0.061474923,0.0008404565,0.00064250914,0.00013878627,0.0023178621,0.017287316,0.91584677],"genre_scores_gemma":[0.0050608665,0.0014592025,0.03588951,0.00079656456,0.00018630114,0.00019970351,0.0054721637,0.0061496655,0.94478595],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988971,0.00015173684,0.000054037024,0.00017435449,0.0005650864,0.00015763966],"domain_scores_gemma":[0.99857664,0.00039074844,0.000044222823,0.0004772577,0.00036377308,0.0001474312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010383764,0.0014785856,0.0007806032,0.0030923472,0.0012096075,0.0054974128,0.0026947688,0.0015646993,0.44192052],"category_scores_gemma":[0.0037289415,0.0010068091,0.0009716409,0.003138945,0.0007468709,0.0067542023,0.0038797432,0.0019560524,0.30663478],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006603113,0.000062374915,0.00011158241,0.00031981076,0.00001096271,0.000097038086,0.00025792536,0.0005438585,0.0010564264,0.083468065,0.5974252,0.3165806],"study_design_scores_gemma":[0.000006044101,0.000004245311,0.00004987221,0.00006432529,0.000004102808,0.00006678038,0.00004056485,0.00038382006,0.00040857316,0.01174253,0.9872214,0.000007656033],"about_ca_topic_score_codex":0.0030042387,"about_ca_topic_score_gemma":0.0067277546,"teacher_disagreement_score":0.44192052,"about_ca_system_score_codex":0.0011359368,"about_ca_system_score_gemma":0.0016163567,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4247152190","doi":"10.7873/date2014.041","title":"Minimizing stack memory for hard real-time applications on multicore platforms","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Preemption; Computer science; Multi-core processor; Scheduling (production processes); Distributed computing; Parallel computing; Integer programming; Dynamic priority scheduling; Heuristic; Embedded system; Mathematical optimization; Algorithm; Quality of service; Operating system; Computer network","score_opus":0.06643841776005163,"score_gpt":0.2872892765267359,"score_spread":0.22085085876668428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247152190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6850649,0.002083586,0.30283722,0.00050252775,0.000044497352,0.0001577511,0.000088373716,0.00061572454,0.008605402],"genre_scores_gemma":[0.9361589,0.00036961623,0.061873686,0.00004885725,0.000010694098,0.000059462753,0.000055039967,0.00009873502,0.0013249915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996222,0.00012607999,0.000013046452,0.000041606516,0.00008829284,0.00010873874],"domain_scores_gemma":[0.9993382,0.0003834041,0.000098666445,0.0000392781,0.000073007286,0.000067445726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083886064,0.0009911229,0.00062533986,0.000679273,0.00049643253,0.0009770842,0.0006684092,0.0005066847,0.0011082656],"category_scores_gemma":[0.0019657959,0.00034993366,0.00033542624,0.00065120956,0.00045754138,0.000849771,0.0006164564,0.00053278153,0.00014303725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016587612,0.000089113935,0.0008255561,0.0001502332,0.000025626561,0.00007838543,0.00006617751,0.95094824,0.013479707,0.0034986394,0.00055002753,0.030122433],"study_design_scores_gemma":[0.000014318502,0.00012579816,0.0005006772,0.0000075575194,0.000016215412,0.000019384002,0.00005779818,0.99188715,0.0047699492,0.0022094937,0.00038487115,0.000006771151],"about_ca_topic_score_codex":0.004882379,"about_ca_topic_score_gemma":0.0072457553,"teacher_disagreement_score":0.004882379,"about_ca_system_score_codex":0.0011199953,"about_ca_system_score_gemma":0.0017862796,"threshold_uncertainty_score":0.009707868},"labels":[],"label_agreement":null},{"id":"W4248424962","doi":"10.1145/354222.353174","title":"Object-oriented real-time concurrency","year":2000,"lang":"en","type":"article","venue":"ACM SIGPLAN Notices","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Concurrency; Distributed computing; Scheduling (production processes); Extensibility; Predictability; Priority inheritance; Concurrent object-oriented programming; Programming language; Dynamic priority scheduling; Operating system; Programming paradigm; Reactive programming; Rate-monotonic scheduling; Inductive programming","score_opus":0.012861763121817667,"score_gpt":0.2500457315601948,"score_spread":0.2371839684383771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248424962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008598104,0.0015904226,0.95575196,0.0008639436,0.0003388919,0.00018539892,0.00009235096,0.0050646127,0.027514314],"genre_scores_gemma":[0.3127927,0.0031935375,0.63146365,0.0011152347,0.0005963796,0.0006255282,0.00045387284,0.0020625056,0.047696657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99628484,0.00080398517,0.0002917687,0.0005104863,0.0017043836,0.00040442604],"domain_scores_gemma":[0.99358565,0.0023450775,0.00046246906,0.0021422112,0.0011172434,0.0003472872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005467789,0.0008448207,0.00070115435,0.0007800511,0.0012978276,0.0062212124,0.0023861874,0.0010765473,0.0067883246],"category_scores_gemma":[0.010611997,0.0010026471,0.00096264767,0.0011582004,0.0032035764,0.0066959267,0.0032503465,0.002785483,0.0018538118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019253766,0.00008621919,0.0010354372,0.0002718766,0.000040786454,0.0002789902,0.001213274,0.011336272,0.0056234817,0.8654419,0.007433069,0.10704618],"study_design_scores_gemma":[0.00030454015,0.00013602854,0.0005949565,0.00012995156,0.00013960914,0.0007759048,0.00024181651,0.07506311,0.013223965,0.6276837,0.28160515,0.00010129222],"about_ca_topic_score_codex":0.0028428421,"about_ca_topic_score_gemma":0.0027994888,"teacher_disagreement_score":0.0067883246,"about_ca_system_score_codex":0.0013921923,"about_ca_system_score_gemma":0.0022153754,"threshold_uncertainty_score":0.028916776},"labels":[],"label_agreement":null},{"id":"W4248783987","doi":"10.1109/isss.2001.957953","title":"Synthesizing distributed real-time systems modeled by a timed version of a subset of LOTOS","year":2002,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Distributed computing; Programming language; Theoretical computer science; Real-time computing","score_opus":0.011957178959851702,"score_gpt":0.19997891450430416,"score_spread":0.18802173554445245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248783987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041528005,0.00008367186,0.954907,0.000056425055,0.000047384783,0.00010644458,0.000098188706,0.0008038112,0.002368992],"genre_scores_gemma":[0.56720316,0.00020179483,0.42927232,0.00009563043,0.00003013588,0.00038825,0.00031237816,0.00017722283,0.0023191143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995579,0.000110674504,0.000052003306,0.00009655164,0.00013534207,0.00004753655],"domain_scores_gemma":[0.99926335,0.00036538666,0.00011791817,0.00013973995,0.000081498394,0.000032129028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006010829,0.0005205118,0.00044262296,0.00023668558,0.00022476006,0.0005837142,0.0006647827,0.00039025286,0.001747666],"category_scores_gemma":[0.0012606748,0.0003244232,0.00094733917,0.0001884762,0.0004706449,0.000628279,0.0004259926,0.00062122673,0.00026838787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038628088,0.00016260662,0.0010883881,0.00062846526,0.000109223794,0.00077776687,0.000444592,0.74423677,0.112486154,0.091290005,0.0008926501,0.04749715],"study_design_scores_gemma":[0.00011112847,0.00025278848,0.0001768559,0.000039884766,0.000065798384,0.00014446978,0.000043947995,0.9370139,0.03743315,0.018143477,0.006557194,0.00001735981],"about_ca_topic_score_codex":0.00071658334,"about_ca_topic_score_gemma":0.0010904372,"teacher_disagreement_score":0.001747666,"about_ca_system_score_codex":0.0004362211,"about_ca_system_score_gemma":0.0007860044,"threshold_uncertainty_score":0.00584656},"labels":[],"label_agreement":null},{"id":"W4249372405","doi":"10.1145/503271.503239","title":"Engineering component-based net-centric systems for embedded applications","year":2001,"lang":"en","type":"article","venue":"ACM SIGSOFT Software Engineering Notes","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Component (thermodynamics); The Internet; Computer science; Component-based software engineering; Embedded system; Software engineering; Software; Embedded software; Software deployment; Systems engineering; Software system; Engineering; Operating system","score_opus":0.016099119337578762,"score_gpt":0.23221118464122192,"score_spread":0.21611206530364316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249372405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003599223,0.00030399594,0.99213785,0.00014631121,0.000051871208,0.000102601225,0.000022385379,0.00050764193,0.0031281298],"genre_scores_gemma":[0.07824745,0.0012539125,0.91283137,0.000094114126,0.000057482113,0.00035414196,0.00025573533,0.0002535606,0.006652338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993198,0.00018497574,0.000053382042,0.00006300214,0.00033011072,0.000048828046],"domain_scores_gemma":[0.99922645,0.00032466883,0.0000674342,0.0001557839,0.00018188839,0.000043772772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011582468,0.00074804865,0.0003864386,0.00065277674,0.0004884888,0.0014083915,0.0010340834,0.00092084776,0.0024814776],"category_scores_gemma":[0.002677999,0.0005006228,0.00046113,0.0007432809,0.00092157285,0.0014027609,0.0012092465,0.001250706,0.0012054277],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006677849,0.00012120541,0.0008640589,0.00067165325,0.000074067146,0.00041338298,0.0006493424,0.25898397,0.031901002,0.51266235,0.0051977895,0.18839434],"study_design_scores_gemma":[0.000081237675,0.0001502761,0.00028841908,0.00011909991,0.00006262301,0.00034315497,0.0001022026,0.62042725,0.0171207,0.22384888,0.13742693,0.000029202114],"about_ca_topic_score_codex":0.001168576,"about_ca_topic_score_gemma":0.0019877714,"teacher_disagreement_score":0.0024814776,"about_ca_system_score_codex":0.00064930826,"about_ca_system_score_gemma":0.0012828257,"threshold_uncertainty_score":0.008301437},"labels":[],"label_agreement":null},{"id":"W4249530205","doi":"10.1145/2658982.2527270","title":"Real-time programming on accelerator many-core processors","year":2013,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Dynamics (Canada)","funders":"","keywords":"Computer science; Concurrency; Correctness; Software development; Programming language; Software; Distributed computing; Programming paradigm; Multi-core processor; Parallel computing","score_opus":0.02073493688878678,"score_gpt":0.24383965326702536,"score_spread":0.2231047163782386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249530205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14762053,0.00051309355,0.8230609,0.0008771758,0.00022818406,0.00008695468,0.0000952311,0.0018706676,0.025647132],"genre_scores_gemma":[0.7113117,0.00047844936,0.26500142,0.00015742985,0.00007718239,0.00009285926,0.00013960793,0.00022610436,0.02251516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99974865,0.000069968424,0.0000161648,0.00003235318,0.00009602767,0.000036726608],"domain_scores_gemma":[0.999496,0.00021720328,0.000048668535,0.00010511631,0.000090910835,0.000042145464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005491614,0.00019122024,0.00023480425,0.0001395481,0.00031263666,0.00082573894,0.00057922874,0.00029130868,0.0024616239],"category_scores_gemma":[0.0012499142,0.00015026321,0.0002124753,0.0001789807,0.00043668682,0.00070929044,0.00040054406,0.0007081571,0.00045129945],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042120504,0.00017137463,0.0027042038,0.0002665855,0.000030061254,0.0004257796,0.00050667935,0.37599528,0.04745236,0.4704855,0.008494229,0.093046665],"study_design_scores_gemma":[0.000041474454,0.000092461785,0.0005282753,0.000017950775,0.000009299294,0.000083232786,0.000056865374,0.9153304,0.0062907813,0.057301007,0.02023775,0.0000105190165],"about_ca_topic_score_codex":0.0017263867,"about_ca_topic_score_gemma":0.00442652,"teacher_disagreement_score":0.0024616239,"about_ca_system_score_codex":0.00044431133,"about_ca_system_score_gemma":0.00083669403,"threshold_uncertainty_score":0.008234918},"labels":[],"label_agreement":null},{"id":"W4249789463","doi":"10.22215/etd/2010-08887","title":"Software/hardware RTOS and system overhead in a hard real-time environment","year":2010,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Real-time operating system; Operating system; Computer science; Software; Overhead (engineering); Embedded system","score_opus":0.0073008101769865144,"score_gpt":0.21615265285258572,"score_spread":0.2088518426755992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249789463","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9722401,0.00042631858,0.020721244,0.00020621928,0.00007016859,0.000012325729,0.00009086798,0.00048614916,0.0057467176],"genre_scores_gemma":[0.9962831,0.00006431934,0.0020268764,0.000014998664,0.00001895555,0.0000047446892,0.000044368768,0.00007822361,0.0014643384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998985,0.0002121333,0.00004744632,0.00013888325,0.00037109604,0.0002454913],"domain_scores_gemma":[0.9941703,0.0037464362,0.00065025024,0.00050304044,0.00058214174,0.0003478201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009089156,0.0003805945,0.00029442666,0.00055191835,0.00030278196,0.0007247218,0.00038488474,0.00023589144,0.0033249583],"category_scores_gemma":[0.006826305,0.00020713756,0.00014119793,0.00046257052,0.00033324034,0.0011555495,0.00035390456,0.0005759575,0.00032039598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007091421,0.0010722784,0.033146277,0.0004102282,0.000136324,0.0011959014,0.0010100938,0.5517062,0.15544654,0.019669035,0.005732931,0.22338277],"study_design_scores_gemma":[0.00010074093,0.0010021443,0.028200569,0.000030305142,0.00014257537,0.00046923128,0.00032803376,0.90812624,0.050989024,0.0073036505,0.0032547012,0.000052863837],"about_ca_topic_score_codex":0.0011853431,"about_ca_topic_score_gemma":0.0020775867,"teacher_disagreement_score":0.0033249583,"about_ca_system_score_codex":0.0007643401,"about_ca_system_score_gemma":0.00050475245,"threshold_uncertainty_score":0.011123061},"labels":[],"label_agreement":null},{"id":"W4252180614","doi":"10.24124/2007/bpgub480","title":"Design and simulation of an adaptive concurrency control protocol for distributed real-time database systems.","year":2007,"lang":"en","type":"dissertation","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage; University of Northern British Columbia","funders":"","keywords":"Concurrency control; Computer science; Protocol (science); Concurrency; Distributed concurrency control; Multiversion concurrency control; Database; Operating system; Database transaction","score_opus":0.04142496458819977,"score_gpt":0.3565948682208695,"score_spread":0.3151699036326697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252180614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11315157,0.00046172042,0.8713041,0.00044372454,0.00018951356,0.0006022165,0.00016893438,0.0015717819,0.012106512],"genre_scores_gemma":[0.8569543,0.00023213837,0.13842441,0.000080734804,0.000017046166,0.0006176239,0.00016002043,0.00010892534,0.0034048047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911875,0.00033309415,0.000053755284,0.00008849843,0.00031647444,0.000089444664],"domain_scores_gemma":[0.99793184,0.0011986062,0.0001343894,0.00026877222,0.00034693888,0.00011947415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016934945,0.00047085044,0.0005576448,0.00043569412,0.0004931291,0.0013054525,0.0016933688,0.0009785454,0.0035954334],"category_scores_gemma":[0.0051003215,0.0004103845,0.00053358654,0.00024927268,0.00078199396,0.001091881,0.000921291,0.0010009019,0.00029625636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019302098,0.00013756592,0.001058744,0.00008687683,0.00004236862,0.000097373275,0.00012988521,0.9632775,0.004781119,0.01697792,0.00059814187,0.012619325],"study_design_scores_gemma":[0.000033315686,0.0000343337,0.00004621673,0.000004269474,0.000007608134,0.000007045781,0.000009352892,0.9967319,0.0011279788,0.0014367788,0.00055856316,0.000002756916],"about_ca_topic_score_codex":0.0053247623,"about_ca_topic_score_gemma":0.0035888199,"teacher_disagreement_score":0.0053247623,"about_ca_system_score_codex":0.00095685484,"about_ca_system_score_gemma":0.0020056504,"threshold_uncertainty_score":0.012027979},"labels":[],"label_agreement":null},{"id":"W4252322519","doi":"10.7873/date.2014.042","title":"Time-predictable execution of multithreaded applications on multicore systems","year":2014,"lang":"en","type":"article","venue":"Design, Automation & Test in Europe Conference & Exhibition (DATE), 2014","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Schedule; Parallel computing; Execution time; Worst-case execution time; Multithreading; Scheme (mathematics); Distributed computing; Embedded system; Thread (computing); Operating system","score_opus":0.04595093506235526,"score_gpt":0.2680291410086602,"score_spread":0.22207820594630495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252322519","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5153906,0.0009155422,0.47739556,0.0001684526,0.00008303923,0.00013020918,0.00006747708,0.0021177055,0.0037314224],"genre_scores_gemma":[0.946344,0.00016947111,0.052587148,0.000033848126,0.000012996359,0.000049898215,0.000049137925,0.000072811425,0.0006806587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929655,0.00016551014,0.000051989264,0.00009553247,0.00025915325,0.00013129904],"domain_scores_gemma":[0.9990625,0.0002588915,0.00019152337,0.00023957323,0.00016279276,0.00008474259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006701819,0.0004830334,0.00028103153,0.0003247902,0.00037265723,0.00045011795,0.000788784,0.00019187042,0.00064205704],"category_scores_gemma":[0.001375437,0.00022511608,0.00023825825,0.00034148202,0.0003274307,0.0004943801,0.0005312752,0.0004807319,0.00013737795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006192078,0.00021135644,0.0056474623,0.00025033962,0.00008664865,0.00034979102,0.00025403878,0.6172384,0.24400714,0.011207124,0.0013903917,0.11873811],"study_design_scores_gemma":[0.000025609097,0.0002732291,0.0012109024,0.000008315507,0.000023290368,0.000057982194,0.000029463241,0.95466393,0.039887767,0.0020912753,0.001716643,0.000011648555],"about_ca_topic_score_codex":0.0023496924,"about_ca_topic_score_gemma":0.0042337924,"teacher_disagreement_score":0.0023496924,"about_ca_system_score_codex":0.0005209052,"about_ca_system_score_gemma":0.0013360439,"threshold_uncertainty_score":0.004671991},"labels":[],"label_agreement":null},{"id":"W4252826554","doi":"10.1149/ma2019-01/6/571","title":"Design Considerations for Lithium-Ion Battery Safety Used in Unique/Military Platforms","year":2019,"lang":"en","type":"article","venue":"ECS Meeting Abstracts","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Battery (electricity); Automotive engineering; Short circuit; Engineering; Nuclear engineering; Computer science; Electrical engineering; Forensic engineering; Power (physics); Voltage","score_opus":0.03666537584071494,"score_gpt":0.25697188266500154,"score_spread":0.2203065068242866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252826554","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23098817,0.035171468,0.4373405,0.010168388,0.0024650034,0.0012354266,0.002073899,0.004357837,0.2761993],"genre_scores_gemma":[0.7979707,0.011505052,0.11472727,0.0016817263,0.00038423832,0.0006805077,0.0010045082,0.00082397205,0.071221985],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988055,0.00013863655,0.00010039144,0.00011610568,0.0007294744,0.00010982165],"domain_scores_gemma":[0.9984785,0.00023060104,0.00016713935,0.00008643829,0.00096989865,0.00006752409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011491096,0.0007149837,0.00064524665,0.000756386,0.00063507294,0.001368536,0.0013887441,0.0014563722,0.006838241],"category_scores_gemma":[0.0023448318,0.0004049674,0.0005918412,0.000405469,0.00038266784,0.0015993539,0.0007009957,0.0006981792,0.006002204],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010214089,0.00020805515,0.0060796416,0.0059231455,0.00014716684,0.002367064,0.0010696506,0.033748284,0.5540194,0.04404576,0.03293652,0.31843388],"study_design_scores_gemma":[0.00013609059,0.0027690069,0.0049507027,0.00077122706,0.00035835966,0.0076661794,0.00091148546,0.038714096,0.3497601,0.017714757,0.5760406,0.00020744649],"about_ca_topic_score_codex":0.00082269206,"about_ca_topic_score_gemma":0.0013247366,"teacher_disagreement_score":0.006838241,"about_ca_system_score_codex":0.0010694946,"about_ca_system_score_gemma":0.00065605104,"threshold_uncertainty_score":0.022876143},"labels":[],"label_agreement":null},{"id":"W4255527491","doi":"10.1109/csmr.1999.756687","title":"Extracting Java library subsets for deployment on embedded systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Java; Vendor; Real time Java; Software deployment; Operating system; Java annotation; strictfp; Embedded system; Programming language","score_opus":0.027869970984840158,"score_gpt":0.25772127066328077,"score_spread":0.22985129967844062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255527491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1596903,0.00057029934,0.76312935,0.0003112859,0.00011391855,0.00071444025,0.0017895559,0.06446424,0.009216634],"genre_scores_gemma":[0.26651096,0.0007421658,0.70033,0.00015231076,0.00006231025,0.00062844495,0.00938623,0.016063312,0.0061243186],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990784,0.00016854084,0.0001388054,0.0001723959,0.00032245595,0.00011954914],"domain_scores_gemma":[0.9952426,0.0013999882,0.00042470964,0.0018465787,0.0008945205,0.0001916206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010980938,0.0012197067,0.0010898915,0.0016935065,0.00065605954,0.001479265,0.001164174,0.0004402408,0.003161224],"category_scores_gemma":[0.008486311,0.0014178245,0.0009527112,0.0020205893,0.0003109729,0.0031748929,0.0015265914,0.0010229894,0.0036481596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012409376,0.00037932897,0.0088390885,0.00081593596,0.000067768626,0.0017003763,0.0015085274,0.015515024,0.20920096,0.00745775,0.018543711,0.73473054],"study_design_scores_gemma":[0.00041348833,0.0009599408,0.011363251,0.00031993157,0.000275742,0.0022674617,0.0012861657,0.24162248,0.5347028,0.011110686,0.19548245,0.00019556521],"about_ca_topic_score_codex":0.0011102764,"about_ca_topic_score_gemma":0.0015788685,"teacher_disagreement_score":0.003161224,"about_ca_system_score_codex":0.0003583294,"about_ca_system_score_gemma":0.0010600751,"threshold_uncertainty_score":0.010575354},"labels":[],"label_agreement":null},{"id":"W4255813111","doi":"10.1109/snpd.2007.539","title":"A Software Architecture For Simplifying Verification of System Timing Properties","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Embedded software; Software; Architecture; Embedded system; Software architecture; Processor scheduling; Software system; Static timing analysis; Reference architecture; Task (project management); Real-time computing; Computer architecture; Operating system; Engineering","score_opus":0.04301016030172697,"score_gpt":0.2619615841525505,"score_spread":0.21895142385082353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255813111","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01431172,0.00015537119,0.979901,0.00010433755,0.00005875635,0.00008204448,0.000028636598,0.0029216323,0.0024364844],"genre_scores_gemma":[0.1502246,0.00029084992,0.8467381,0.000075313015,0.000048624253,0.00017671903,0.00014042173,0.00026994097,0.002035408],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905556,0.00020746699,0.00009118233,0.00014060321,0.00041493858,0.00009014933],"domain_scores_gemma":[0.9978613,0.00058468845,0.00019395858,0.00084997836,0.00043111033,0.00007893573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010665571,0.0006818469,0.00040697987,0.0008029129,0.0006084832,0.0008829357,0.0013477312,0.0007815485,0.002004098],"category_scores_gemma":[0.0033165559,0.00072637334,0.0006735027,0.00047878467,0.0008583234,0.0015390349,0.0008268306,0.0022478846,0.00085607474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034716778,0.00029367863,0.001687929,0.00048720866,0.000092359405,0.00059207994,0.00048988353,0.12720688,0.34314203,0.28057617,0.0045502475,0.24053444],"study_design_scores_gemma":[0.0002491661,0.00097522006,0.0017376443,0.0001806819,0.00026764476,0.0010114616,0.00008832024,0.5709644,0.25573805,0.06704766,0.101635195,0.00010458414],"about_ca_topic_score_codex":0.001259128,"about_ca_topic_score_gemma":0.002109229,"teacher_disagreement_score":0.002004098,"about_ca_system_score_codex":0.0005858634,"about_ca_system_score_gemma":0.0017185785,"threshold_uncertainty_score":0.0067043304},"labels":[],"label_agreement":null},{"id":"W4281260023","doi":"10.1177/00375497221099548","title":"Integrating I-DEVS and schedulability methods for analyzing real-time systems constraints","year":2022,"lang":"en","type":"article","venue":"SIMULATION","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"DEVS; Computer science; Formalism (music); Design space exploration; Distributed computing; Real-time operating system; Execution time; Real-time computing; Embedded system; Modeling and simulation; Simulation","score_opus":0.028955963102326707,"score_gpt":0.3553818330061303,"score_spread":0.32642586990380357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281260023","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018751884,0.00011489512,0.99703324,0.000043659496,0.000018229464,0.00002883741,0.000024726805,0.00018442774,0.00067683606],"genre_scores_gemma":[0.1318318,0.00051499676,0.8654409,0.0000968176,0.00007538983,0.00037845463,0.00022622805,0.00032232027,0.0011130377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99545515,0.002083769,0.00039933118,0.00040981596,0.0014031815,0.00024880332],"domain_scores_gemma":[0.98933953,0.007487208,0.0008665271,0.0013204722,0.00083219324,0.00015411514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062391507,0.001695871,0.00090072426,0.0017834981,0.0005000646,0.0016610537,0.0017989401,0.00079851534,0.0017843617],"category_scores_gemma":[0.011436401,0.0009858435,0.0019830302,0.0010563793,0.0016510754,0.0020965342,0.0013941089,0.0022901054,0.00035897727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012656463,0.00011557915,0.002065889,0.0005448709,0.0001577353,0.00021867247,0.00044031124,0.6228967,0.011815685,0.24944037,0.0013439363,0.11083373],"study_design_scores_gemma":[0.00003859369,0.000073417825,0.0002020378,0.00009662986,0.00003841369,0.00008748449,0.00006334802,0.89832366,0.010041881,0.08094438,0.010057907,0.000032289074],"about_ca_topic_score_codex":0.0022713817,"about_ca_topic_score_gemma":0.00253372,"teacher_disagreement_score":0.0062391507,"about_ca_system_score_codex":0.0016884514,"about_ca_system_score_gemma":0.0021687257,"threshold_uncertainty_score":0.032996178},"labels":[],"label_agreement":null},{"id":"W4283215439","doi":"","title":"Certifiable memory management system for safety critical partitioned system","year":2022,"lang":"en","type":"preprint","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Memory management; Reliability engineering; Operating system; Engineering","score_opus":0.017913406461191977,"score_gpt":0.252393920313605,"score_spread":0.23448051385241306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283215439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32452098,0.0022564102,0.62674516,0.0007105681,0.00035875008,0.00036611408,0.0008093719,0.033476967,0.0107556395],"genre_scores_gemma":[0.89488673,0.00023391006,0.09759052,0.00017692563,0.00008854567,0.00014233605,0.0008621981,0.00044005516,0.0055788816],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952567,0.00010653681,0.00003500296,0.00009321507,0.00012204946,0.000117548574],"domain_scores_gemma":[0.9986304,0.00038018654,0.00015886969,0.00043373473,0.0002856024,0.00011123241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008973313,0.00053096534,0.0006190142,0.0006748552,0.0005763216,0.0009042275,0.001519632,0.0004644618,0.0072125634],"category_scores_gemma":[0.0022575187,0.00025772615,0.00024929314,0.00043050846,0.00035693048,0.00078898284,0.00091661984,0.0007642793,0.00071710214],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005911134,0.0007281071,0.0051477477,0.00094831665,0.00014775609,0.0013945715,0.0007424674,0.16532564,0.1745849,0.03169032,0.04359966,0.56977934],"study_design_scores_gemma":[0.00049775286,0.0007707179,0.0014944405,0.000059565973,0.000092483984,0.00038213094,0.00010860114,0.91039926,0.061763998,0.0097335335,0.014653922,0.00004362472],"about_ca_topic_score_codex":0.0020674083,"about_ca_topic_score_gemma":0.0028258746,"teacher_disagreement_score":0.0072125634,"about_ca_system_score_codex":0.0009217458,"about_ca_system_score_gemma":0.0016469957,"threshold_uncertainty_score":0.024128377},"labels":[],"label_agreement":null},{"id":"W4284962442","doi":"10.1145/3546941","title":"Estimating Probabilistic Safe WCET Ranges of Real-Time Systems at Design Stages","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission; Université du Luxembourg","keywords":"Computer science; Probabilistic logic; Worst-case execution time; Scheduling (production processes); Task (project management); Set (abstract data type); Execution time; Point (geometry); Real-time computing; Distributed computing; Mathematical optimization; Artificial intelligence; Programming language; Systems engineering","score_opus":0.07499825737973446,"score_gpt":0.29155091299379854,"score_spread":0.21655265561406406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4284962442","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16761526,0.00042926506,0.8286357,0.00017011806,0.000013928669,0.000089665074,0.00031370472,0.0014758416,0.0012564918],"genre_scores_gemma":[0.8803867,0.00014915175,0.118134364,0.000042850996,0.000013082696,0.00012378175,0.00059072516,0.00019129468,0.00036792504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641645,0.001135772,0.00022243072,0.00067562016,0.0013236078,0.00022605398],"domain_scores_gemma":[0.97490466,0.017954748,0.0031809774,0.0021019906,0.001642004,0.00021553959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039632884,0.001216654,0.00063768914,0.0026527718,0.0004220874,0.0009967022,0.0012361117,0.00096751854,0.00071810914],"category_scores_gemma":[0.03246803,0.0008248047,0.0009318228,0.0012708615,0.0008666744,0.0018983759,0.00096259214,0.0013287492,0.00027346343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001104954,0.000041039828,0.008032635,0.0000738207,0.000043902768,0.00015369586,0.00010845272,0.96237135,0.005468798,0.0024135844,0.00024125671,0.02094094],"study_design_scores_gemma":[0.000007333282,0.00003573283,0.0018010573,0.0000087938815,0.000010379884,0.00006738521,0.000021716423,0.9892497,0.004010113,0.0044840993,0.00029163025,0.000012015525],"about_ca_topic_score_codex":0.0037484036,"about_ca_topic_score_gemma":0.0038350767,"teacher_disagreement_score":0.0039632884,"about_ca_system_score_codex":0.0009528951,"about_ca_system_score_gemma":0.0011918134,"threshold_uncertainty_score":0.020960152},"labels":[],"label_agreement":null},{"id":"W4289383899","doi":"10.48550/arxiv.1810.07059","title":"On the Off-chip Memory Latency of Real-Time Systems: Is DDR DRAM Really\\n the Best Option?","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Memory controller; Computer science; CAS latency; Dram; Registered memory; Latency (audio); Embedded system; Interleaved memory; Memory refresh; Uniform memory access; Conventional memory; Semiconductor memory; Memory management; Computer hardware; Extended memory; Computer memory","score_opus":0.05508953975301869,"score_gpt":0.19964159179321544,"score_spread":0.14455205204019675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289383899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32163882,0.061797798,0.5416131,0.010517361,0.001809789,0.00006387216,0.0005304749,0.0025003864,0.059528437],"genre_scores_gemma":[0.97029096,0.008334255,0.015210859,0.00057374476,0.00036507836,0.000022673723,0.00013329378,0.00018705982,0.0048821587],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944776,0.00008406053,0.00002185551,0.000120700875,0.00020338102,0.00012227958],"domain_scores_gemma":[0.99872226,0.00063799054,0.00018261017,0.0002195246,0.00018284662,0.00005471413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055185973,0.0004878434,0.00039368612,0.00033233422,0.00037580795,0.0015135587,0.0008665262,0.0004947556,0.0034393375],"category_scores_gemma":[0.0033946824,0.00020250658,0.0001532666,0.0005614404,0.0005286552,0.0028430868,0.0006116419,0.0009317509,0.0006733535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007707652,0.00021082684,0.0078834165,0.00093888567,0.000090867936,0.00038191103,0.00036764643,0.27122673,0.08788772,0.20084392,0.012692528,0.41670477],"study_design_scores_gemma":[0.00004411231,0.00051328924,0.0042082146,0.00022868726,0.00010173285,0.0004972337,0.0005117013,0.7586709,0.081105135,0.09327827,0.060754906,0.000085796666],"about_ca_topic_score_codex":0.0015624661,"about_ca_topic_score_gemma":0.0027579556,"teacher_disagreement_score":0.0034393375,"about_ca_system_score_codex":0.0010187397,"about_ca_system_score_gemma":0.0012333614,"threshold_uncertainty_score":0.011505723},"labels":[],"label_agreement":null},{"id":"W4292596050","doi":"10.1145/3556975","title":"PISCOT: A Pipelined Split-Transaction COTS-Coherent Bus for Multi-Core Real-Time Systems","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Cache coherence; Correctness; Embedded system; Avionics; Testbed; Coherence (philosophical gambling strategy); Distributed computing; Latency (audio); Real-time computing; Computer architecture; Parallel computing; Cache; CPU cache; Computer network; Algorithm","score_opus":0.0524732397244535,"score_gpt":0.3011950507367037,"score_spread":0.24872181101225022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292596050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18944015,0.003163193,0.76521987,0.0007050913,0.000442544,0.0008908808,0.0008851331,0.017591193,0.021661958],"genre_scores_gemma":[0.79539174,0.00057899806,0.19280005,0.00030206176,0.00007906271,0.00036505618,0.0015201226,0.00056231534,0.008400541],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994679,0.00008753543,0.00003797171,0.00008152355,0.00024207625,0.00008289957],"domain_scores_gemma":[0.99916863,0.00011653956,0.00013450076,0.00018554523,0.0002931414,0.00010167515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069848023,0.0006285401,0.0002649399,0.0006912526,0.0004848248,0.0008446291,0.0018574974,0.00040455995,0.005724148],"category_scores_gemma":[0.0012523559,0.00036072533,0.00019675438,0.0006438043,0.00044295428,0.0012656184,0.0008544804,0.0011384983,0.0009880188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022735398,0.0007745162,0.006612212,0.0012589695,0.00019841563,0.00077210605,0.00053718104,0.17980945,0.22522731,0.09204753,0.060098406,0.43039048],"study_design_scores_gemma":[0.00037153176,0.0032806783,0.0028516594,0.00011709958,0.0001133923,0.0005230077,0.00016354672,0.7920711,0.12162608,0.009859603,0.068908505,0.000113729424],"about_ca_topic_score_codex":0.0036055604,"about_ca_topic_score_gemma":0.00924758,"teacher_disagreement_score":0.005724148,"about_ca_system_score_codex":0.000990868,"about_ca_system_score_gemma":0.0024884914,"threshold_uncertainty_score":0.019149244},"labels":[],"label_agreement":null},{"id":"W4307715675","doi":"10.36001/phmconf.2022.v14i1.3168","title":"Voltage-Based Physical Layer Fault Diagnosis for Controller Area Network","year":2022,"lang":"en","type":"article","venue":"Annual Conference of the PHM Society","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"General Motors (Canada)","funders":"","keywords":"Troubleshooting; Reliability (semiconductor); Fault (geology); Physical layer; Controller (irrigation); Automotive industry; Computer science; CAN bus; Voltage; Real-time computing; Reliability engineering; Embedded system; Engineering; Computer network; Electrical engineering; Wireless; Telecommunications; Power (physics)","score_opus":0.03614686357989949,"score_gpt":0.262169568752326,"score_spread":0.2260227051724265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307715675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10066918,0.0010265337,0.8898245,0.00017115749,0.00017170863,0.00011603106,0.00025271927,0.0042339414,0.0035342942],"genre_scores_gemma":[0.89903605,0.00021201024,0.09850037,0.00005646944,0.000039135455,0.0000478741,0.00025731846,0.000033699314,0.0018170959],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997155,0.0000479665,0.000014369598,0.00006612941,0.000118954296,0.000037006368],"domain_scores_gemma":[0.99940646,0.00020471645,0.00008387776,0.00006434965,0.00021217664,0.000028383234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021825559,0.00044263093,0.0002817046,0.0008911195,0.00026932042,0.0005394269,0.00047955796,0.00032096036,0.0017663632],"category_scores_gemma":[0.0013616716,0.00011173425,0.0001310338,0.00040806548,0.00019850381,0.00059774343,0.00028029623,0.0003076454,0.00037265508],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085763185,0.00021323076,0.0076410268,0.00025192625,0.00006573976,0.00019318213,0.00011172765,0.20887037,0.099703066,0.00447937,0.0042637596,0.67334896],"study_design_scores_gemma":[0.000020969877,0.00013867204,0.0025572574,0.000015403491,0.000015290649,0.00008148246,0.000026346454,0.966399,0.02711635,0.0018136065,0.0018017493,0.000013823861],"about_ca_topic_score_codex":0.0042417743,"about_ca_topic_score_gemma":0.004566155,"teacher_disagreement_score":0.0042417743,"about_ca_system_score_codex":0.0008327025,"about_ca_system_score_gemma":0.0005512767,"threshold_uncertainty_score":0.008434176},"labels":[],"label_agreement":null},{"id":"W4308390525","doi":"10.1109/emsoft55006.2022.00012","title":"Work-in-Progress: A Resource-Aware Optimization Model for Real-Time Systems Analysis and Design","year":2022,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Resource (disambiguation); Work (physics); Distributed computing; Computer architecture; Engineering; Computer network","score_opus":0.02533387830451369,"score_gpt":0.24765225009032593,"score_spread":0.22231837178581224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308390525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032322474,0.0005467469,0.99105585,0.00042326938,0.00009504358,0.00006880171,0.00012088778,0.0003060855,0.0041510793],"genre_scores_gemma":[0.4343345,0.0028658581,0.5443675,0.0003286304,0.0003525932,0.0009917866,0.000774424,0.0006199385,0.01536478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998456,0.00054087,0.000095191586,0.00024738497,0.00049134094,0.00016912895],"domain_scores_gemma":[0.99817896,0.0008281702,0.00025431818,0.00026685634,0.00034087658,0.00013086273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003121069,0.002296041,0.0013149531,0.0012148833,0.00073439715,0.0021321124,0.0032891082,0.0014724784,0.004221525],"category_scores_gemma":[0.0043053036,0.00084039476,0.0017776239,0.0016268371,0.0011274532,0.0031058283,0.001485885,0.0021286842,0.001351673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004904549,0.000044152206,0.00019278987,0.00009447168,0.000030924195,0.00007367033,0.000042533145,0.94791996,0.000892653,0.033099934,0.0013417719,0.016218062],"study_design_scores_gemma":[0.000008015724,0.00002728533,0.000041158186,0.000012449391,0.00001479921,0.000016555545,0.000007661265,0.9832707,0.0003780648,0.013878495,0.002337908,0.0000069065336],"about_ca_topic_score_codex":0.0042134584,"about_ca_topic_score_gemma":0.0038134304,"teacher_disagreement_score":0.004221525,"about_ca_system_score_codex":0.0012272858,"about_ca_system_score_gemma":0.0021338805,"threshold_uncertainty_score":0.016505957},"labels":[],"label_agreement":null},{"id":"W4311356845","doi":"10.18280/mmep.090509","title":"Simulator for Scheduling Real-Time Systems with Reduced Power Consumption","year":2022,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Scheduling (production processes); Power consumption; Real-time computing; Software; Embedded system; Power demand; Energy consumption; Green computing; Distributed computing; Power (physics); Operating system; Engineering; Electrical engineering; Cloud computing","score_opus":0.021903804834252395,"score_gpt":0.21607471252278754,"score_spread":0.19417090768853515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311356845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08068562,0.00053883425,0.89532584,0.00035293624,0.00023548839,0.0004646862,0.0021395471,0.0060608448,0.014196148],"genre_scores_gemma":[0.6822555,0.00095866073,0.30114675,0.0001601707,0.000049806644,0.0011898058,0.002952438,0.00055205036,0.010734838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99962044,0.00012474263,0.000036775516,0.00004230439,0.0001296151,0.000046050398],"domain_scores_gemma":[0.9987772,0.0006924739,0.00011855546,0.00013788736,0.00022337507,0.00005046392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006242457,0.00051703583,0.00052914524,0.00049405126,0.000255275,0.0005067118,0.00131898,0.0006602102,0.00489465],"category_scores_gemma":[0.0023010776,0.00034591908,0.0005943697,0.00051861256,0.0002720991,0.0005636603,0.00037788876,0.0010043273,0.0005877589],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006923975,0.000050188282,0.00062145863,0.00012741906,0.000031589152,0.00004965947,0.000051117135,0.9794926,0.0047987876,0.0074895094,0.0012880866,0.0059302747],"study_design_scores_gemma":[0.000020538444,0.00003147185,0.00009872273,0.0000070283754,0.00000787203,0.000014238685,0.0000072890384,0.99409795,0.0016270226,0.0011611317,0.0029227203,0.000004009803],"about_ca_topic_score_codex":0.0042759283,"about_ca_topic_score_gemma":0.004683498,"teacher_disagreement_score":0.00489465,"about_ca_system_score_codex":0.0006503311,"about_ca_system_score_gemma":0.001539402,"threshold_uncertainty_score":0.01637423},"labels":[],"label_agreement":null},{"id":"W4319866890","doi":"10.1007/978-3-031-25803-9_3","title":"Shellac: A Compiler Synthesizer for Concurrent Programs","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Compiler; Computer science; Programming language; Executable; Compiler correctness; Compiler construction; Verilog; Embedded system; Field-programmable gate array","score_opus":0.040762247601643875,"score_gpt":0.2738627897267375,"score_spread":0.23310054212509362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319866890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009552148,0.00043967817,0.90429056,0.00006798773,0.00023858459,0.0001481958,0.00044913276,0.0720475,0.0127662225],"genre_scores_gemma":[0.11325397,0.00048728613,0.8339976,0.00026228194,0.0001488583,0.000371418,0.0021490818,0.022515394,0.026814139],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995395,0.000056262117,0.000037903475,0.00010834004,0.00020600445,0.0000519674],"domain_scores_gemma":[0.9994535,0.00022718389,0.000039070084,0.000091367525,0.00015402598,0.000034785233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043693418,0.0012220256,0.0006858851,0.0008706644,0.000455872,0.0008518021,0.0013265338,0.0006051663,0.016810803],"category_scores_gemma":[0.0013674541,0.0011878008,0.00079831755,0.00064766424,0.00036835164,0.0010913335,0.00096869696,0.0012629469,0.0055789514],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079583767,0.00019477386,0.00063363457,0.0009829829,0.00009571689,0.00040686174,0.0003121303,0.021097122,0.17639397,0.028594272,0.053729217,0.7167635],"study_design_scores_gemma":[0.0006117888,0.00063694164,0.001179146,0.0002080316,0.0002161609,0.0012666573,0.0001303185,0.3185351,0.3738188,0.02919358,0.27405825,0.00014521672],"about_ca_topic_score_codex":0.0009336371,"about_ca_topic_score_gemma":0.0015274733,"teacher_disagreement_score":0.016810803,"about_ca_system_score_codex":0.000317675,"about_ca_system_score_gemma":0.0008462524,"threshold_uncertainty_score":0.056237757},"labels":[],"label_agreement":null},{"id":"W4321524520","doi":"10.48550/arxiv.2302.10288","title":"Probabilistic Safe WCET Estimation for Weakly Hard Real-Time Systems at Design Stages","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; European Commission; Université du Luxembourg","keywords":"Computer science; Leverage (statistics); Probabilistic logic; Worst-case execution time; Scheduling (production processes); Set (abstract data type); Execution time; Reliability engineering; Mathematical optimization; Distributed computing; Machine learning; Artificial intelligence","score_opus":0.1411484833195927,"score_gpt":0.21808132501809444,"score_spread":0.07693284169850173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321524520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060786236,0.00036379648,0.93689436,0.00026727992,0.0000123660775,0.00003423774,0.00011468574,0.0006442573,0.0008828127],"genre_scores_gemma":[0.894072,0.00021519767,0.10376983,0.00009972665,0.000039879953,0.00009315229,0.00034842262,0.000180409,0.0011814733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978465,0.0009050362,0.00009906618,0.00049144414,0.00048198586,0.00017591639],"domain_scores_gemma":[0.98898005,0.008310935,0.0012668766,0.00066140987,0.00055559527,0.00022504557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027213115,0.0011728745,0.0010052798,0.0014924407,0.00037243223,0.0011413227,0.0013726896,0.0010229665,0.0011575271],"category_scores_gemma":[0.017258283,0.00069223583,0.00085115066,0.0008951246,0.001136581,0.0013690172,0.0012357497,0.001799693,0.00031142353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007453722,0.000020438396,0.0021751714,0.000048074253,0.000022424229,0.000050999864,0.000040154784,0.9786155,0.0015565336,0.001955464,0.00018880024,0.015251835],"study_design_scores_gemma":[0.000003211544,0.000010851196,0.00037938185,0.0000048204224,0.0000034522593,0.000009966644,0.000006544755,0.9951929,0.00064006343,0.003627422,0.00011793931,0.0000036610513],"about_ca_topic_score_codex":0.005494791,"about_ca_topic_score_gemma":0.0049720705,"teacher_disagreement_score":0.005494791,"about_ca_system_score_codex":0.0011451598,"about_ca_system_score_gemma":0.0013488246,"threshold_uncertainty_score":0.0143918395},"labels":[],"label_agreement":null},{"id":"W4324142396","doi":"10.1145/3587694","title":"Lazy Load Scheduling for Mixed-criticality Applications in Heterogeneous MPSoCs","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundação de Desenvolvimento da Pesquisa; Office of Naval Research; Bundesministerium für Bildung und Forschung; National Science Foundation","keywords":"Computer science; MPSoC; Cache; Hypervisor; Scheduling (production processes); Embedded system; Shared memory; Mixed criticality; Multiprocessing; Computer architecture; Parallel computing; Distributed computing; System on a chip; Operating system; Virtualization; Criticality; Cloud computing","score_opus":0.03192219255787733,"score_gpt":0.30586937234216116,"score_spread":0.27394717978428385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324142396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45631164,0.0006440236,0.53965396,0.00016237324,0.00006458528,0.00010178584,0.000025488063,0.00094423105,0.0020919933],"genre_scores_gemma":[0.97878563,0.00006725285,0.020470437,0.000020996022,0.000021525477,0.000027384287,0.000013319486,0.00005588654,0.00053769985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995969,0.000096479096,0.000025546746,0.00005998504,0.00012117207,0.000099947276],"domain_scores_gemma":[0.9993205,0.00024477314,0.00014980815,0.0000834154,0.000106771346,0.00009466194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062922464,0.0005769226,0.0004054526,0.00048561807,0.0007460319,0.0006829304,0.0008325117,0.00028784006,0.00065128034],"category_scores_gemma":[0.0015843697,0.00024841217,0.00022974054,0.00031000463,0.00045655348,0.0006792937,0.0007031313,0.00040122372,0.00017054465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000915031,0.00027989494,0.004394923,0.00025308065,0.00007420277,0.00050578907,0.00060021563,0.7122027,0.14039518,0.01568806,0.0013677876,0.12332315],"study_design_scores_gemma":[0.000025983603,0.00012677273,0.0004915616,0.000005225196,0.00001812938,0.00003379116,0.00005360979,0.98586595,0.010130177,0.0025056663,0.00073427137,0.00000888468],"about_ca_topic_score_codex":0.0018151436,"about_ca_topic_score_gemma":0.003011165,"teacher_disagreement_score":0.0018151436,"about_ca_system_score_codex":0.00072880846,"about_ca_system_score_gemma":0.0011887545,"threshold_uncertainty_score":0.0052879453},"labels":[],"label_agreement":null},{"id":"W4360605285","doi":"10.1109/icnc57223.2023.10074096","title":"An edge computing-based monitoring framework for situation-aware embedded real-time systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Edge computing; Real-time computing; Enhanced Data Rates for GSM Evolution; Node (physics); Distributed computing; Adaptation (eye); Scheduling (production processes); Service (business); Edge device; Cloud computing; Engineering; Operating system","score_opus":0.03331858935905425,"score_gpt":0.3228842722535293,"score_spread":0.28956568289447504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360605285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074726264,0.00035270763,0.98741746,0.00015255688,0.000041502793,0.000109431465,0.00030280507,0.0018102046,0.0023406853],"genre_scores_gemma":[0.2581811,0.00052014756,0.7377819,0.00014548325,0.000060698225,0.00023754415,0.001123177,0.0001692075,0.0017806928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933666,0.00013917669,0.00007241617,0.00016428213,0.00020414751,0.000083263585],"domain_scores_gemma":[0.9994174,0.00018542494,0.00007381599,0.000113105256,0.00015164744,0.000058474558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000830291,0.0007508386,0.0005847165,0.0010566149,0.0005869245,0.0015729893,0.0018409876,0.0005922791,0.0014939664],"category_scores_gemma":[0.0018432575,0.0003037022,0.00077314686,0.0010162028,0.0004956899,0.0017654939,0.0012954009,0.00094945496,0.0003797162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031464803,0.000237759,0.0037904806,0.0004599673,0.00012665107,0.0007379834,0.00060371327,0.61810464,0.014439209,0.13251135,0.009464578,0.2192091],"study_design_scores_gemma":[0.000013285572,0.000035848134,0.00057538657,0.000031660886,0.000035126046,0.00009465627,0.000070746355,0.9563133,0.0031355238,0.025509048,0.014163766,0.000021525779],"about_ca_topic_score_codex":0.008752725,"about_ca_topic_score_gemma":0.0084288,"teacher_disagreement_score":0.008752725,"about_ca_system_score_codex":0.0007923329,"about_ca_system_score_gemma":0.0012036035,"threshold_uncertainty_score":0.017403603},"labels":[],"label_agreement":null},{"id":"W4365143541","doi":"10.4271/2023-01-0848","title":"A New Generation Automotive Tool Access Architecture for Remote in-Field Diagnosis","year":2023,"lang":"en","type":"article","venue":"SAE International Journal of Advances and Current Practices in Mobility","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Embedded system; Firmware; Computer science; Ethernet; Interface (matter); Software; Operating system; Automotive industry; Electronic control unit; Class (philosophy); Engineering","score_opus":0.061474088853590673,"score_gpt":0.42145363250104817,"score_spread":0.3599795436474575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365143541","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028026005,0.00065185624,0.89071655,0.00013777397,0.0001326561,0.0001946112,0.00016514107,0.07063387,0.009341671],"genre_scores_gemma":[0.67044526,0.00042053143,0.2919826,0.0006627575,0.0001645448,0.00034119035,0.0014320551,0.0029719034,0.03157906],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988366,0.00018060615,0.000084135725,0.0002203239,0.0005217999,0.00015653178],"domain_scores_gemma":[0.99861205,0.00026985415,0.00011429875,0.0005038103,0.00041606883,0.00008392234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007544046,0.00094181066,0.000608527,0.0018359071,0.00030176755,0.0013372545,0.0025081472,0.0009942704,0.009525769],"category_scores_gemma":[0.0015943713,0.00043397347,0.0004528066,0.00065899064,0.00045651713,0.0019223802,0.0015267426,0.00095624925,0.003805989],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008554801,0.0004336342,0.0060854447,0.0006454726,0.00016652339,0.0008743119,0.0010346409,0.009019558,0.17947921,0.025216391,0.026122488,0.7500668],"study_design_scores_gemma":[0.00023959442,0.0020800002,0.0078011304,0.00019060553,0.0004179314,0.0040189484,0.00023170655,0.3409833,0.31372845,0.010617148,0.31939918,0.00029206884],"about_ca_topic_score_codex":0.0012598364,"about_ca_topic_score_gemma":0.0010594992,"teacher_disagreement_score":0.009525769,"about_ca_system_score_codex":0.0005636874,"about_ca_system_score_gemma":0.0005840662,"threshold_uncertainty_score":0.031866908},"labels":[],"label_agreement":null},{"id":"W4367038237","doi":"","title":"A heuristic design grid for past and future uses of Token+Constraint systems","year":2022,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Berger (Canada)","funders":"","keywords":"Computer science; Security token; Constraint (computer-aided design); Heuristic; Grid; Distributed computing; Grid computing; Artificial intelligence; Engineering; Computer security; Mathematics","score_opus":0.021703223186786812,"score_gpt":0.2336463645933305,"score_spread":0.2119431414065437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367038237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030428143,0.0002080599,0.94626606,0.00035976985,0.00007155812,0.0003334414,0.00028799888,0.0010952799,0.02094971],"genre_scores_gemma":[0.24920109,0.000162105,0.7461074,0.00006278828,0.00001753593,0.00018281084,0.00025989328,0.0002477964,0.0037585925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898916,0.0004292226,0.000058418573,0.00015236626,0.00022331085,0.0001474135],"domain_scores_gemma":[0.9983436,0.00069408,0.00014351406,0.00033518043,0.0003546828,0.00012891534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017069832,0.0005937916,0.00076084933,0.001379021,0.0010308861,0.0021604162,0.0016496693,0.0010058029,0.013579601],"category_scores_gemma":[0.004250361,0.00063600845,0.00082338694,0.0013898151,0.00074061466,0.0017682977,0.0014237406,0.0009108871,0.0011105393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002571675,0.00011856319,0.001490656,0.00017929143,0.000039689232,0.00019404097,0.00019176918,0.76853144,0.002657169,0.07135108,0.0051277606,0.14986145],"study_design_scores_gemma":[0.000042058673,0.000059034875,0.00020033772,0.000027411514,0.00001858942,0.00004833801,0.00009179471,0.96119344,0.0014430431,0.029550126,0.0073085697,0.000017310795],"about_ca_topic_score_codex":0.0069902614,"about_ca_topic_score_gemma":0.015851311,"teacher_disagreement_score":0.013579601,"about_ca_system_score_codex":0.0016089978,"about_ca_system_score_gemma":0.003180681,"threshold_uncertainty_score":0.045428336},"labels":[],"label_agreement":null},{"id":"W4367322028","doi":"10.18280/mmep.100240","title":"Using Interval Parameters for Latest Start Time and Mission Floats Operation Networks","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interval (graph theory); Duration (music); Computer science; Real-time computing; Aeronautics; Operations research; Geodesy; Environmental science; Meteorology; Geography; Engineering; Mathematics; Physics","score_opus":0.06596180989402917,"score_gpt":0.25201565276505367,"score_spread":0.1860538428710245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367322028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042220396,0.0001828653,0.9939884,0.000032186166,0.000051577263,0.000028599243,0.000051247924,0.00015497125,0.0012881504],"genre_scores_gemma":[0.2462465,0.00065463764,0.7498408,0.000053715892,0.00010210006,0.00026453508,0.0002859458,0.00019150975,0.0023602098],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989599,0.00032469616,0.00007613997,0.00024610633,0.00032458376,0.000068582034],"domain_scores_gemma":[0.9987293,0.0006847936,0.00019418838,0.00011750152,0.00023109472,0.000043076438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012880487,0.0011977867,0.00059466297,0.001768218,0.00042626698,0.001590935,0.0012291892,0.0009222188,0.0032895147],"category_scores_gemma":[0.0050433204,0.00034193127,0.00084086374,0.002050082,0.00069350173,0.0031601603,0.0006529269,0.0015382583,0.00068748055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022726828,0.00006829072,0.0017095653,0.0003629846,0.000054632103,0.00014319067,0.00026376595,0.5858985,0.011484223,0.12929326,0.0019296132,0.26856467],"study_design_scores_gemma":[0.000024317438,0.0001591497,0.00059322995,0.00007046718,0.000028271743,0.0001481551,0.000093173025,0.9286425,0.0061473413,0.051580038,0.012432286,0.00008108928],"about_ca_topic_score_codex":0.0021017462,"about_ca_topic_score_gemma":0.0012090718,"teacher_disagreement_score":0.0032895147,"about_ca_system_score_codex":0.0007715825,"about_ca_system_score_gemma":0.00092132605,"threshold_uncertainty_score":0.011004567},"labels":[],"label_agreement":null},{"id":"W4379116080","doi":"10.23919/date56975.2023.10136986","title":"Ditty: Directory-based Cache Coherence for Multicore Safety-critical Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"MESI protocol; Computer science; Cache coherence; MESIF protocol; Scalability; Directory; Bus sniffing; Multi-core processor; Cache; Parallel computing; Cache algorithms; Coherence (philosophical gambling strategy); CPU cache; Operating system","score_opus":0.04772445816760726,"score_gpt":0.3191943841421753,"score_spread":0.2714699259745681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379116080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20840628,0.0043951264,0.7243099,0.0008553562,0.0004225585,0.00076304213,0.0013931106,0.040149316,0.019305268],"genre_scores_gemma":[0.8570278,0.00042174163,0.13360578,0.00029375026,0.00008220281,0.0003497613,0.0014202308,0.0006105131,0.006188181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882954,0.00019115249,0.00009044228,0.00012206536,0.00056914054,0.00019763719],"domain_scores_gemma":[0.99742496,0.0005077914,0.0003384548,0.00072624534,0.0008171869,0.00018540116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011044192,0.00053379993,0.00031742224,0.000999495,0.0008562363,0.0009532475,0.0015754378,0.0004609617,0.0036959033],"category_scores_gemma":[0.0028971073,0.0003146038,0.00023518628,0.0008856855,0.0006994548,0.0013135443,0.0012504065,0.00080645934,0.0005736169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023659405,0.0006351419,0.014215881,0.0018749216,0.00027371538,0.00063667377,0.00079977437,0.23389307,0.16049789,0.07063475,0.08405958,0.43011263],"study_design_scores_gemma":[0.00056288595,0.0017178885,0.0037826095,0.00011636509,0.00010868328,0.00060026307,0.00020313641,0.7363074,0.1663084,0.014338525,0.075826444,0.00012746561],"about_ca_topic_score_codex":0.0046503334,"about_ca_topic_score_gemma":0.010845379,"teacher_disagreement_score":0.0046503334,"about_ca_system_score_codex":0.001517059,"about_ca_system_score_gemma":0.0025765134,"threshold_uncertainty_score":0.01236403},"labels":[],"label_agreement":null},{"id":"W4379616663","doi":"10.1109/wfcs57264.2023.10144118","title":"Can Embedded Real-Time Linux System Effectively Support Multipath Transmission? An Experimental Study","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Multipath propagation; Transmission (telecommunications); Embedded system; Real-time computing; Operating system; Computer network; Telecommunications","score_opus":0.02036742241104333,"score_gpt":0.29509449932017956,"score_spread":0.2747270769091362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379616663","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98912024,0.0001739108,0.008852884,0.00005200707,0.00006644261,0.00008608807,0.00006686596,0.00048722562,0.0010944433],"genre_scores_gemma":[0.99559325,0.00009907531,0.0032937175,0.000015965274,0.000016334217,0.00005277781,0.00007902363,0.00003588499,0.00081399176],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992347,0.00016941848,0.000072040835,0.00014706759,0.00020175622,0.00017501773],"domain_scores_gemma":[0.9981888,0.0006186063,0.00023283977,0.00034531447,0.0004336891,0.0001806445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093309325,0.000475945,0.0004079478,0.00042907614,0.00033407885,0.0005269849,0.00070423144,0.00047726344,0.00236337],"category_scores_gemma":[0.002808701,0.00014897108,0.0003009088,0.00023569404,0.00045061656,0.0014093192,0.0004579142,0.00060205796,0.0005277578],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013740167,0.010206908,0.03407664,0.002302537,0.0002866301,0.0021965576,0.002794588,0.062092494,0.66850865,0.0069897287,0.004769248,0.19203576],"study_design_scores_gemma":[0.00097051664,0.04153565,0.038557995,0.00011617729,0.00034570202,0.00129357,0.0016802562,0.3509904,0.55025905,0.0016011891,0.012452649,0.00019688043],"about_ca_topic_score_codex":0.00045320188,"about_ca_topic_score_gemma":0.00021194053,"teacher_disagreement_score":0.00236337,"about_ca_system_score_codex":0.00020623973,"about_ca_system_score_gemma":0.00025805068,"threshold_uncertainty_score":0.007906318},"labels":[],"label_agreement":null},{"id":"W4380482358","doi":"10.1007/s10617-023-09276-6","title":"Hardware-accelerated service-oriented communication for AUTOSAR platforms","year":2023,"lang":"en","type":"article","venue":"Design Automation for Embedded Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"AUTOSAR; Computer science; Embedded system; Software; Scalability; Automotive industry; Ethernet; Hardware architecture; Operating system; Engineering","score_opus":0.08981248112808683,"score_gpt":0.31221280999855433,"score_spread":0.2224003288704675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380482358","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3039838,0.00048243385,0.6573098,0.0003228804,0.00023578233,0.00010778627,0.00018206472,0.016965328,0.020410039],"genre_scores_gemma":[0.9366004,0.00008513036,0.059098147,0.00006736441,0.00003350972,0.000033791162,0.00016036541,0.00023184415,0.0036893648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995597,0.000081882856,0.00002206097,0.00006197262,0.00014396703,0.00013049849],"domain_scores_gemma":[0.99939036,0.0000898236,0.00006486395,0.00019363931,0.00020635653,0.000055046905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048304422,0.00046041317,0.00023314895,0.0004111526,0.00036548165,0.00058076804,0.00055549183,0.00023134449,0.0039939317],"category_scores_gemma":[0.0007440162,0.00016450106,0.00024226657,0.00031037015,0.0002629398,0.00048149133,0.000381321,0.0006824648,0.0009512337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024790782,0.0005409119,0.005855431,0.0003719378,0.000084458225,0.00063793804,0.000652732,0.19545144,0.26521617,0.05775761,0.018252572,0.45269972],"study_design_scores_gemma":[0.00015398915,0.0009316398,0.0022776937,0.0000343458,0.00005308908,0.00034894672,0.00014381071,0.8060746,0.15362442,0.0101495795,0.026167188,0.000040695886],"about_ca_topic_score_codex":0.0016904708,"about_ca_topic_score_gemma":0.002970794,"teacher_disagreement_score":0.0039939317,"about_ca_system_score_codex":0.00036074148,"about_ca_system_score_gemma":0.0011924123,"threshold_uncertainty_score":0.013361037},"labels":[],"label_agreement":null},{"id":"W4384910496","doi":"10.1504/ijwmc.2023.132429","title":"Analysis of discrete voltage level energy efficient scheduling for fixed priority framework","year":2023,"lang":"en","type":"article","venue":"International Journal of Wireless and Mobile Computing","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Horizon College and Seminary","funders":"","keywords":"Computer science; Scheduling (production processes); Voltage; Real-time computing; Distributed computing; Mathematical optimization; Electrical engineering","score_opus":0.021822104768529308,"score_gpt":0.30948428796623695,"score_spread":0.28766218319770764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384910496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14529802,0.0012787273,0.83686155,0.00043320074,0.000096462616,0.00010073434,0.00015657906,0.00027702012,0.015497675],"genre_scores_gemma":[0.9615874,0.00034467765,0.03522501,0.000056110126,0.000028151857,0.00004761728,0.000063163185,0.00005531819,0.0025925324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952114,0.00008762637,0.000011944397,0.000040239745,0.00020025307,0.0001388387],"domain_scores_gemma":[0.9991744,0.000505133,0.000094373194,0.00003489708,0.00014106103,0.000050125047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008692494,0.00040851173,0.0004072009,0.00056559907,0.0003156493,0.0008486705,0.00074638845,0.00033932703,0.00300213],"category_scores_gemma":[0.002226964,0.00023471517,0.00046582145,0.00047114474,0.00043488952,0.0005216331,0.0002693271,0.0005042956,0.00017089803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007727309,0.0000326322,0.00041465872,0.00009126129,0.000019795565,0.000058673584,0.000036155914,0.96109354,0.0032913669,0.026981471,0.0004847149,0.007418568],"study_design_scores_gemma":[0.0000035637788,0.000013494606,0.000103776496,0.00000253443,0.0000028799157,0.0000067108936,0.000005951343,0.9975332,0.00018048473,0.0019899886,0.00015588563,0.0000015146622],"about_ca_topic_score_codex":0.008203033,"about_ca_topic_score_gemma":0.006479923,"teacher_disagreement_score":0.008203033,"about_ca_system_score_codex":0.0016252797,"about_ca_system_score_gemma":0.0015157287,"threshold_uncertainty_score":0.016310573},"labels":[],"label_agreement":null},{"id":"W4385485417","doi":"10.1109/isorc58943.2023.00013","title":"A Robust Scheduling Algorithm for Overload-Tolerant Real-Time Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Context switch; Uniprocessor system; Computer science; Multiprocessing; Workload; Scheduling (production processes); Least slack time scheduling; Earliest deadline first scheduling; Distributed computing; Schedule; Algorithm; Dynamic priority scheduling; Parallel computing; Multiprocessor scheduling; Rate-monotonic scheduling; Real-time computing; Embedded system; Mathematical optimization; Operating system","score_opus":0.03607972710610283,"score_gpt":0.25719037360906666,"score_spread":0.22111064650296383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385485417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077066803,0.00026100146,0.9903685,0.00007202918,0.000052892326,0.00004628316,0.000029108138,0.0008148894,0.000648613],"genre_scores_gemma":[0.31032267,0.00033952369,0.68671,0.00009503793,0.00012092763,0.00017476217,0.00022204863,0.0002070244,0.001807977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990575,0.0001801343,0.000095678726,0.00019336815,0.00038150963,0.00009188066],"domain_scores_gemma":[0.9990258,0.00027950096,0.00019943836,0.00013552776,0.00029514768,0.00006453338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011714319,0.0009516417,0.00096784276,0.00097230164,0.0005971643,0.00095479033,0.0013237515,0.0008262994,0.0014886113],"category_scores_gemma":[0.0034063708,0.00039701437,0.0005084467,0.0007151197,0.000507452,0.0011730029,0.00079479854,0.00088269595,0.00058081094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002888068,0.00007983301,0.00034453225,0.00014936148,0.000064042484,0.00012023653,0.00010067584,0.75182086,0.027646778,0.018115524,0.0024943985,0.19877505],"study_design_scores_gemma":[0.000023007018,0.000049753013,0.000054491247,0.000005559008,0.000007516698,0.000038332873,0.0000050485473,0.9932065,0.002742939,0.0025645706,0.001292812,0.000009454271],"about_ca_topic_score_codex":0.0017112789,"about_ca_topic_score_gemma":0.001104099,"teacher_disagreement_score":0.0017112789,"about_ca_system_score_codex":0.0008858121,"about_ca_system_score_gemma":0.0012926421,"threshold_uncertainty_score":0.0064270496},"labels":[],"label_agreement":null},{"id":"W4386191524","doi":"10.1145/3617176","title":"Probabilistic Safe WCET Estimation for Weakly Hard Real-time Systems at Design Stages","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Software Engineering and Methodology","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; European Commission; Université du Luxembourg","keywords":"Computer science; Leverage (statistics); Probabilistic logic; Worst-case execution time; Scheduling (production processes); Reliability engineering; Execution time; Distributed computing; Mathematical optimization; Machine learning; Artificial intelligence","score_opus":0.11398602655715183,"score_gpt":0.31539242308225535,"score_spread":0.2014063965251035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386191524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06271837,0.00033400848,0.93501365,0.00022872238,0.000011193448,0.000039048482,0.00010436739,0.00064499566,0.000905634],"genre_scores_gemma":[0.89095664,0.00019121556,0.107070595,0.00009482997,0.00003217808,0.000097628246,0.00028830042,0.00016520088,0.0011033803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977956,0.00089395285,0.00010909129,0.00049146096,0.00052370084,0.00018618495],"domain_scores_gemma":[0.98967934,0.007600859,0.0012641258,0.00066097354,0.00057511276,0.00021953013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027074984,0.001202572,0.00095945754,0.0015165197,0.00036419908,0.0011448271,0.0013609119,0.0009967497,0.0011115851],"category_scores_gemma":[0.016344452,0.00067248486,0.0008444014,0.00083305925,0.0011230583,0.0014380608,0.0012590446,0.0017019794,0.000297059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081252336,0.00002204115,0.0022170339,0.0000517404,0.000022190961,0.0000640482,0.000045921934,0.97659814,0.002155515,0.0020031822,0.00017987686,0.016559014],"study_design_scores_gemma":[0.0000035453406,0.000013739649,0.00040437395,0.000005381124,0.0000039299525,0.000012743456,0.000008360632,0.9951035,0.00081452174,0.00349794,0.00012783948,0.000004285152],"about_ca_topic_score_codex":0.0050542857,"about_ca_topic_score_gemma":0.004923653,"teacher_disagreement_score":0.0050542857,"about_ca_system_score_codex":0.0010862764,"about_ca_system_score_gemma":0.0013948512,"threshold_uncertainty_score":0.014318764},"labels":[],"label_agreement":null},{"id":"W4386568575","doi":"10.1145/3609102","title":"Predictable GPU Wavefront Splitting for Safety-Critical Systems","year":2023,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wavefront; Compiler; CUDA; Avionics; Graphics processing unit; General-purpose computing on graphics processing units; Parallel computing; Graphics; Embedded system; Computer graphics (images); Optics; Operating system; Aerospace engineering","score_opus":0.03016093248518597,"score_gpt":0.2965681727434844,"score_spread":0.26640724025829843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386568575","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20997599,0.001028334,0.7735427,0.00044157275,0.00015850144,0.00009771102,0.00013531682,0.0031058849,0.011514095],"genre_scores_gemma":[0.89190876,0.0002498008,0.10488241,0.00011128387,0.000029299761,0.000049498904,0.00014433666,0.000355112,0.002269379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996158,0.000050520455,0.000016140346,0.00004348889,0.00019714153,0.00007700276],"domain_scores_gemma":[0.9993475,0.00018909632,0.00008160154,0.00017129646,0.00017648656,0.000034108543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026756927,0.0005300597,0.00025032274,0.0006137763,0.0005358288,0.00054369296,0.00074280694,0.00026329854,0.0024700065],"category_scores_gemma":[0.0012027589,0.00027725988,0.0002937109,0.0005376183,0.0005476322,0.00078357727,0.00056939124,0.00085830333,0.00037104962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005862402,0.0001593427,0.006299539,0.0002948138,0.00006180789,0.00045160574,0.00032561275,0.4821626,0.21054457,0.053252473,0.008292941,0.23756847],"study_design_scores_gemma":[0.000025112406,0.00014803362,0.00074226403,0.000015215736,0.000018383827,0.00008452803,0.00003108984,0.93836755,0.04408005,0.009550882,0.0069224793,0.00001446129],"about_ca_topic_score_codex":0.0042361184,"about_ca_topic_score_gemma":0.0065554897,"teacher_disagreement_score":0.0042361184,"about_ca_system_score_codex":0.00077156926,"about_ca_system_score_gemma":0.0012611883,"threshold_uncertainty_score":0.008422971},"labels":[],"label_agreement":null},{"id":"W4388199659","doi":"10.1007/978-3-031-40534-1_5","title":"Connections Between Minimum-Work Protocols and Transition Paths","year":2023,"lang":"en","type":"book-chapter","venue":"Springer theses","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Ising model; Computer science; Statistical physics; Code (set theory); Square-lattice Ising model; Inversion (geology); Transition (genetics); Work (physics); Mechanism (biology); Physics; Quantum mechanics; Chemistry; Programming language; Biology","score_opus":0.06399744529096783,"score_gpt":0.277652221605783,"score_spread":0.21365477631481516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388199659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008555183,0.022635018,0.79047513,0.0096579855,0.0037146695,0.00011033752,0.00033373715,0.00091707014,0.16360085],"genre_scores_gemma":[0.3406086,0.054554373,0.40628856,0.005031927,0.010009705,0.0012363838,0.0011318526,0.002173301,0.17896532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989754,0.0002852032,0.00005241966,0.00025372065,0.00033670943,0.00009667176],"domain_scores_gemma":[0.99714017,0.002030571,0.000121015786,0.00046249467,0.00014195673,0.00010380389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015397934,0.0012284771,0.0008438801,0.0014363807,0.0015295255,0.0040390366,0.0025254858,0.0020320022,0.019877197],"category_scores_gemma":[0.006763851,0.0010944789,0.00088006473,0.0043350053,0.003503432,0.013165518,0.0032771635,0.0061235675,0.0034527867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032449767,0.000016903718,0.00003323507,0.00009965555,0.0000069974244,0.000029704459,0.000112574206,0.0032118855,0.00025976717,0.94814545,0.009520234,0.038531084],"study_design_scores_gemma":[0.0000051167267,0.0000065620484,0.000020511554,0.000024303501,0.0000032345447,0.0000304119,0.000015871141,0.004205721,0.00010740432,0.9737993,0.021777298,0.0000041757844],"about_ca_topic_score_codex":0.00056368933,"about_ca_topic_score_gemma":0.00054404314,"teacher_disagreement_score":0.019877197,"about_ca_system_score_codex":0.001581348,"about_ca_system_score_gemma":0.00081911683,"threshold_uncertainty_score":0.066495836},"labels":[],"label_agreement":null},{"id":"W4388709126","doi":"10.1007/978-3-031-41969-0","title":"Scheduling and Reconfiguration of Real-Time Systems","year":2023,"lang":"en","type":"book","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Shaanxi University of Science and Technology; Fundamental Research Funds for the Central Universities; University of Toronto; Guizhou University; National Natural Science Foundation of China; Friedrich-Alexander-Universität Erlangen-Nürnberg; Alexander von Humboldt-Stiftung","keywords":"Control reconfiguration; Computer science; Scheduling (production processes); Distributed computing; Real-time Control System; Real-time computing; Fixed-priority pre-emptive scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Embedded system; Control (management); Engineering; Schedule; Operating system; Operations management; Artificial intelligence","score_opus":0.020575276162355854,"score_gpt":0.23938014275219668,"score_spread":0.21880486658984083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388709126","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004368603,0.07230778,0.4334128,0.0019364198,0.0072106635,0.00016314184,0.00041165052,0.0032509097,0.4769382],"genre_scores_gemma":[0.053945933,0.063454114,0.17639494,0.0009326676,0.0026651006,0.00034968363,0.0012439649,0.0011574477,0.69985616],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977404,0.00002853336,0.000010069787,0.000042166837,0.00012826703,0.000016985356],"domain_scores_gemma":[0.99981946,0.00007240557,0.000010825154,0.00004049262,0.000039184637,0.000017554594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019699523,0.0008198118,0.00051030144,0.00061398663,0.0004446217,0.0012543662,0.0007043348,0.00041004308,0.019689562],"category_scores_gemma":[0.0005507444,0.00037882873,0.00050485204,0.0011198187,0.0005313952,0.001165903,0.00046022228,0.0012476197,0.008513637],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006951795,0.00006171985,0.00007755947,0.00074272585,0.000034239885,0.00011403167,0.00021693522,0.02940825,0.00911369,0.22277825,0.15924945,0.57813364],"study_design_scores_gemma":[0.00002076776,0.000063353466,0.00027744775,0.00016031064,0.000013453839,0.00017097998,0.000044783003,0.023622828,0.0024975669,0.089667715,0.88344306,0.00001788982],"about_ca_topic_score_codex":0.001075658,"about_ca_topic_score_gemma":0.0016520473,"teacher_disagreement_score":0.019689562,"about_ca_system_score_codex":0.0006341203,"about_ca_system_score_gemma":0.0006326012,"threshold_uncertainty_score":0.06586814},"labels":[],"label_agreement":null},{"id":"W4391583850","doi":"10.1109/rtss59052.2023.00028","title":"Co-Optimizing Cache Partitioning and Multi-Core Task Scheduling: Exploit Cache Sensitivity or Not?","year":2023,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cache; Parallel computing; Cache-oblivious algorithm; Cache algorithms; Cache pollution; Cache coloring; Cache invalidation; Distributed computing; Smart Cache; Worst-case execution time; CPU cache; Execution time","score_opus":0.10920153243313363,"score_gpt":0.3201999718754768,"score_spread":0.21099843944234314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391583850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24270637,0.004516912,0.7477846,0.0006129426,0.000055059085,0.00007874022,0.000036286652,0.000944819,0.003264242],"genre_scores_gemma":[0.8520778,0.00045578752,0.14649439,0.00010894144,0.000026694242,0.000048309656,0.000044388627,0.00007436703,0.0006693978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999315,0.00022513614,0.00003295127,0.000089705376,0.0001868765,0.0001501771],"domain_scores_gemma":[0.9990497,0.0005723886,0.00011619998,0.00012682904,0.00009511593,0.00003967681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010382299,0.00084117544,0.00065038184,0.000532138,0.0003286535,0.00064113433,0.0008093956,0.0006262121,0.00046571647],"category_scores_gemma":[0.002106941,0.00038672885,0.0006566459,0.00059499947,0.00035326008,0.0012746474,0.0005767401,0.00055120286,0.00011780165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002678377,0.00030437158,0.0059831557,0.00030562305,0.00021651923,0.00023590674,0.00022411374,0.6520628,0.06454667,0.0066292584,0.0010839205,0.2681399],"study_design_scores_gemma":[0.000019545188,0.00010844979,0.0007643619,0.000017539569,0.000057028916,0.00008676992,0.00003787539,0.9860437,0.009965366,0.0018962363,0.0009892345,0.000013851183],"about_ca_topic_score_codex":0.0025993576,"about_ca_topic_score_gemma":0.0047786427,"teacher_disagreement_score":0.0025993576,"about_ca_system_score_codex":0.00047946858,"about_ca_system_score_gemma":0.0015835395,"threshold_uncertainty_score":0.0054907203},"labels":[],"label_agreement":null},{"id":"W4393494309","doi":"10.5281/zenodo.6532251","title":"Performance results of different scheduling algorithms used in the simulation of a modern game engine","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Game engine; Algorithm; Parallel computing; Mathematical optimization; Mathematics; Multimedia","score_opus":0.04213844975844137,"score_gpt":0.2620387335029309,"score_spread":0.21990028374448953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393494309","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82286423,0.0017966671,0.058984026,0.0015502092,0.0011571803,0.000496149,0.012902812,0.016600156,0.083648585],"genre_scores_gemma":[0.94565827,0.00033155366,0.035547305,0.00033238914,0.00003950949,0.00019563382,0.011703715,0.0010598643,0.0051318184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99860686,0.00032431068,0.000115484334,0.00025296994,0.00040853122,0.00029182545],"domain_scores_gemma":[0.99397814,0.0034308708,0.00020536411,0.00045128344,0.0013592645,0.000575168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017469309,0.001873678,0.0007944639,0.0011777865,0.00067708996,0.001115529,0.001339727,0.0009904027,0.009120844],"category_scores_gemma":[0.0072000637,0.00039341615,0.0011775717,0.0013093705,0.0005782957,0.00097098574,0.00090845156,0.0014668636,0.0015966682],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018132895,0.00059256895,0.005878553,0.00058522535,0.0002764471,0.000096984055,0.00011623388,0.9198964,0.0070429607,0.0038294485,0.024600986,0.035270922],"study_design_scores_gemma":[0.00018227767,0.0005006031,0.003629684,0.000046218218,0.000071641814,0.000031876352,0.00016298039,0.98114496,0.007949362,0.00216441,0.004074096,0.000041903833],"about_ca_topic_score_codex":0.027216319,"about_ca_topic_score_gemma":0.020180302,"teacher_disagreement_score":0.027216319,"about_ca_system_score_codex":0.0016373782,"about_ca_system_score_gemma":0.0023796142,"threshold_uncertainty_score":0.054115772},"labels":[],"label_agreement":null},{"id":"W4393698120","doi":"10.5281/zenodo.3267175","title":"UBE2K Purification","year":2019,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chemistry; Computer science","score_opus":0.04561690055064948,"score_gpt":0.260086767300009,"score_spread":0.21446986674935953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393698120","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020178214,0.0008490373,0.00061688916,0.000115732604,0.00009847544,0.000040347117,0.9929316,0.0019980636,0.0013319654],"genre_scores_gemma":[0.0011898282,0.00014040248,0.0007249269,0.00004428869,0.0000057188163,0.00008020341,0.9972506,0.0001018313,0.00046209132],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848866,0.00020693247,0.00016019533,0.00065339834,0.00027483387,0.00021590934],"domain_scores_gemma":[0.9990914,0.00018097658,0.00009503965,0.00035622114,0.00019108721,0.00008532642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014336018,0.0043629496,0.0022285285,0.002668058,0.0011990537,0.0024673704,0.0026451817,0.002478064,0.015308324],"category_scores_gemma":[0.0033840486,0.00070368836,0.002286169,0.0053375848,0.00055910577,0.0010491941,0.001466064,0.0021511805,0.047659628],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010460166,0.00016403291,0.0032020744,0.0032090936,0.000246925,0.00015472904,0.0000389625,0.0030504738,0.003464524,0.0010034521,0.9739024,0.0105172815],"study_design_scores_gemma":[0.001098048,0.00017147193,0.012784938,0.00042625685,0.00028334666,0.00042081942,0.000102760925,0.0055005113,0.007600913,0.0043983157,0.9671116,0.00010115329],"about_ca_topic_score_codex":0.012317152,"about_ca_topic_score_gemma":0.017763002,"teacher_disagreement_score":0.015308324,"about_ca_system_score_codex":0.0016047431,"about_ca_system_score_gemma":0.0020235635,"threshold_uncertainty_score":0.051211417},"labels":[],"label_agreement":null},{"id":"W4393704675","doi":"10.5281/zenodo.6532252","title":"Performance results of different scheduling algorithms used in the simulation of a modern game engine","year":2022,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ubisoft (Canada)","funders":"","keywords":"Computer science; Scheduling (production processes); Game engine; Algorithm; Mathematical optimization; Mathematics; Multimedia","score_opus":0.04213844975844137,"score_gpt":0.2620387335029309,"score_spread":0.21990028374448953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393704675","genre_codex":"empirical","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82286423,0.0017966671,0.058984026,0.0015502092,0.0011571803,0.000496149,0.012902812,0.016600156,0.083648585],"genre_scores_gemma":[0.94565827,0.00033155366,0.035547305,0.00033238914,0.00003950949,0.00019563382,0.011703715,0.0010598643,0.0051318184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860686,0.00032431068,0.000115484334,0.00025296994,0.00040853122,0.00029182545],"domain_scores_gemma":[0.99397814,0.0034308708,0.00020536411,0.00045128344,0.0013592645,0.000575168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017469309,0.001873678,0.0007944639,0.0011777865,0.00067708996,0.001115529,0.001339727,0.0009904027,0.009120844],"category_scores_gemma":[0.0072000637,0.00039341615,0.0011775717,0.0013093705,0.0005782957,0.00097098574,0.00090845156,0.0014668636,0.0015966682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018132895,0.00059256895,0.005878553,0.00058522535,0.0002764471,0.000096984055,0.00011623388,0.9198964,0.0070429607,0.0038294485,0.024600986,0.035270922],"study_design_scores_gemma":[0.00018227767,0.0005006031,0.003629684,0.000046218218,0.000071641814,0.000031876352,0.00016298039,0.98114496,0.007949362,0.00216441,0.004074096,0.000041903833],"about_ca_topic_score_codex":0.027216319,"about_ca_topic_score_gemma":0.020180302,"teacher_disagreement_score":0.027216319,"about_ca_system_score_codex":0.0016373782,"about_ca_system_score_gemma":0.0023796142,"threshold_uncertainty_score":0.054115772},"labels":[],"label_agreement":null},{"id":"W4393876898","doi":"10.5281/zenodo.3267176","title":"UBE2K Purification","year":2019,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Chemistry; Computer science","score_opus":0.04561690055064948,"score_gpt":0.260086767300009,"score_spread":0.21446986674935953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393876898","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020178214,0.0008490373,0.00061688916,0.000115732604,0.00009847544,0.000040347117,0.9929316,0.0019980636,0.0013319654],"genre_scores_gemma":[0.0011898282,0.00014040248,0.0007249269,0.00004428869,0.0000057188163,0.00008020341,0.9972506,0.0001018313,0.00046209132],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848866,0.00020693247,0.00016019533,0.00065339834,0.00027483387,0.00021590934],"domain_scores_gemma":[0.9990914,0.00018097658,0.00009503965,0.00035622114,0.00019108721,0.00008532642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014336018,0.0043629496,0.0022285285,0.002668058,0.0011990537,0.0024673704,0.0026451817,0.002478064,0.015308324],"category_scores_gemma":[0.0033840486,0.00070368836,0.002286169,0.0053375848,0.00055910577,0.0010491941,0.001466064,0.0021511805,0.047659628],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010460166,0.00016403291,0.0032020744,0.0032090936,0.000246925,0.00015472904,0.0000389625,0.0030504738,0.003464524,0.0010034521,0.9739024,0.0105172815],"study_design_scores_gemma":[0.001098048,0.00017147193,0.012784938,0.00042625685,0.00028334666,0.00042081942,0.000102760925,0.0055005113,0.007600913,0.0043983157,0.9671116,0.00010115329],"about_ca_topic_score_codex":0.012317152,"about_ca_topic_score_gemma":0.017763002,"teacher_disagreement_score":0.015308324,"about_ca_system_score_codex":0.0016047431,"about_ca_system_score_gemma":0.0020235635,"threshold_uncertainty_score":0.051211417},"labels":[],"label_agreement":null},{"id":"W4399602444","doi":"10.1109/radarconf2458775.2024.10548118","title":"Model-Based DRL for Task Scheduling in Dynamic Environments for Cognitive Multifunction Radar","year":2024,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; University of Toronto","funders":"Defence Research and Development Canada","keywords":"Computer science; Scheduling (production processes); Radar; Task (project management); Real-time computing; Telecommunications; Engineering; Systems engineering","score_opus":0.020932406543022617,"score_gpt":0.2791588194944447,"score_spread":0.25822641295142207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399602444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028857924,0.00021239989,0.9672065,0.00028553655,0.000039815804,0.00004721138,0.000055409295,0.0005526842,0.0027423932],"genre_scores_gemma":[0.8718764,0.00011924707,0.124838054,0.0002013814,0.000027412205,0.00011175209,0.00013000387,0.00010087586,0.0025947415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99972516,0.00006688998,0.000012861248,0.00006788414,0.00005947695,0.000067741996],"domain_scores_gemma":[0.99940586,0.00030375845,0.000081761325,0.000055875505,0.000082784136,0.00006994103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064376753,0.00065249123,0.0008358076,0.0002908885,0.00033164964,0.0006067554,0.0010945679,0.00070997106,0.002814427],"category_scores_gemma":[0.0019444163,0.00040139953,0.00045840922,0.00023195343,0.00050156086,0.0009258611,0.0012032859,0.001549872,0.00036685527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053835873,0.00005217235,0.0004057179,0.000036214806,0.000013461728,0.000030904313,0.000038301234,0.960809,0.0010175962,0.004932043,0.0007646649,0.03184603],"study_design_scores_gemma":[0.000004763446,0.000011435952,0.000025502522,0.000001896737,0.0000014660258,0.0000031516274,0.000003242455,0.998035,0.00011201437,0.00169157,0.00010856516,0.0000014034027],"about_ca_topic_score_codex":0.007244102,"about_ca_topic_score_gemma":0.009634931,"teacher_disagreement_score":0.007244102,"about_ca_system_score_codex":0.0009822072,"about_ca_system_score_gemma":0.0016442892,"threshold_uncertainty_score":0.01440388},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07061011548589385,"score_gpt":0.32847407758195923,"score_spread":0.2578639620960654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400187704","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006075714,0.72098315,0.21675411,0.0042919163,0.0015436001,0.00016025573,0.00034207685,0.0004227805,0.049426354],"genre_scores_gemma":[0.06729001,0.86024916,0.05799007,0.001447022,0.0031087191,0.00017426081,0.00059099833,0.00017689247,0.008972951],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990246,0.00025837115,0.00009730606,0.00017986915,0.0003245992,0.00011518808],"domain_scores_gemma":[0.9987263,0.0008279813,0.00010854497,0.00008904864,0.00018713297,0.00006096584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015408597,0.0013694069,0.0011180664,0.0017231535,0.0006571556,0.002944278,0.001617834,0.0014074971,0.004773929],"category_scores_gemma":[0.0023412916,0.0006810981,0.0007664948,0.0062629567,0.0007420629,0.0043362346,0.0011681847,0.001636451,0.0016864432],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009837185,0.00020688082,0.0017867924,0.0052752267,0.00010475684,0.00017171005,0.00022590501,0.058971018,0.0015564029,0.17400528,0.038242195,0.7193554],"study_design_scores_gemma":[0.000017041622,0.0002568583,0.0020308732,0.002737535,0.0000927708,0.00059795653,0.00040238525,0.12063355,0.0017505008,0.10471852,0.7666666,0.00009542865],"about_ca_topic_score_codex":0.0033517214,"about_ca_topic_score_gemma":0.002391011,"teacher_disagreement_score":0.004773929,"about_ca_system_score_codex":0.0015057607,"about_ca_system_score_gemma":0.0017071294,"threshold_uncertainty_score":0.01597035},"labels":[],"label_agreement":null},{"id":"W4404578066","doi":"10.1287/opre.2024.0754","title":"Feature-Driven Priority Queuing","year":2024,"lang":"en","type":"preprint","venue":"Operations Research","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Feature (linguistics); Computer science; Queueing theory; Artificial intelligence; Computer network","score_opus":0.09063229164852378,"score_gpt":0.41722252697131945,"score_spread":0.3265902353227957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404578066","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056620367,0.00030686543,0.9312581,0.00037860926,0.00030631426,0.00018820287,0.00024047836,0.0021089306,0.008592189],"genre_scores_gemma":[0.8607236,0.00015799257,0.13186258,0.00013629114,0.00016617545,0.00009225711,0.0002864586,0.00014271942,0.0064318874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989617,0.000173484,0.0000425269,0.0001704621,0.00041248783,0.0002392753],"domain_scores_gemma":[0.9978461,0.0006329024,0.00017869903,0.0005192363,0.00061948365,0.00020359317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001434092,0.0004534169,0.0006419326,0.0005512572,0.00068598415,0.0015762451,0.0020810666,0.00064396294,0.0050394544],"category_scores_gemma":[0.004389095,0.000355233,0.0004415544,0.0009969415,0.00040285892,0.0013607776,0.00086501363,0.0011635466,0.0008892878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023785299,0.0007538856,0.005079169,0.00029178552,0.00015599575,0.00037841717,0.00027159194,0.28858414,0.05110255,0.20319536,0.019502897,0.42830575],"study_design_scores_gemma":[0.000090257796,0.00023873242,0.0006939177,0.000008418196,0.000026658101,0.000116316834,0.000021326785,0.94070935,0.0065781465,0.04685688,0.0046350756,0.000024898512],"about_ca_topic_score_codex":0.0019392789,"about_ca_topic_score_gemma":0.002722167,"teacher_disagreement_score":0.0050394544,"about_ca_system_score_codex":0.0010167869,"about_ca_system_score_gemma":0.0015023499,"threshold_uncertainty_score":0.016858637},"labels":[],"label_agreement":null},{"id":"W4405239726","doi":"10.48550/arxiv.2412.07294","title":"Loop torsors. Theory and applications","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Loop (graph theory); Computer science; Mathematics; Combinatorics","score_opus":0.03993822899213455,"score_gpt":0.18890816562225873,"score_spread":0.1489699366301242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405239726","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10071053,0.035867613,0.34779438,0.0069507756,0.0021426494,0.00011658401,0.0015715144,0.001733447,0.50311255],"genre_scores_gemma":[0.864684,0.0114457,0.035502642,0.00095524016,0.0028338213,0.00011111456,0.00068070664,0.00038980396,0.08339691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961686,0.00007198554,0.000019965066,0.00008283573,0.00014316075,0.00006512867],"domain_scores_gemma":[0.9995109,0.00018763359,0.00006923197,0.000059757207,0.000098793294,0.00007366753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004837197,0.00071649015,0.00051864295,0.0022086683,0.0011990109,0.0021196322,0.0006445782,0.00076514966,0.016451424],"category_scores_gemma":[0.0016195248,0.0002925988,0.000663001,0.0017795237,0.0030041859,0.0033895867,0.0019055887,0.0019726155,0.0032758461],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016220405,0.000010231134,0.00016071806,0.00007659006,0.0000041803814,0.000044271666,0.00017782216,0.0009179586,0.00028212467,0.9805227,0.0027289947,0.01505809],"study_design_scores_gemma":[0.0000072013554,0.000014916575,0.00017850344,0.000029884708,0.0000049565188,0.0001322638,0.00007465824,0.002463701,0.0003160911,0.9693096,0.027458897,0.000009292019],"about_ca_topic_score_codex":0.0009903861,"about_ca_topic_score_gemma":0.00043818884,"teacher_disagreement_score":0.016451424,"about_ca_system_score_codex":0.0012783617,"about_ca_system_score_gemma":0.0004582773,"threshold_uncertainty_score":0.055035472},"labels":[],"label_agreement":null},{"id":"W4406499781","doi":"10.1109/cascon62161.2024.10838116","title":"Worst-Case Execution Time Analysis of Real-Time Robotic Algorithms Using Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Algorithm; Real-time computing","score_opus":0.021134029549700756,"score_gpt":0.2763993803213698,"score_spread":0.255265350771669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406499781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2806301,0.00093446905,0.71332884,0.00042368754,0.00007313955,0.00010941227,0.00007411145,0.00050864427,0.003917578],"genre_scores_gemma":[0.96918386,0.00012299957,0.029994834,0.000030008567,0.000014956301,0.000049589744,0.000046398018,0.000052097985,0.00050532044],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773514,0.00089104014,0.00010540533,0.0003300824,0.0006520926,0.0002861713],"domain_scores_gemma":[0.98303103,0.013239131,0.00144152,0.00074490183,0.001221375,0.0003221215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004651689,0.0010265103,0.0006229862,0.0008110011,0.00035918955,0.0008322088,0.0010755899,0.0006115696,0.00091520255],"category_scores_gemma":[0.0223887,0.00035367606,0.00041582604,0.0004430594,0.0010752088,0.001137649,0.0006287993,0.0011131698,0.00012059696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077075114,0.00003076113,0.0007721615,0.000024587134,0.000014364778,0.000012812109,0.000011667126,0.9919689,0.0005598779,0.0011500194,0.0000637597,0.005313899],"study_design_scores_gemma":[0.000002252854,0.000023477762,0.00009923194,0.0000020817695,0.0000020259306,0.0000036448007,0.0000029934401,0.999091,0.00035239523,0.00039064168,0.000028631093,0.0000015954847],"about_ca_topic_score_codex":0.005322061,"about_ca_topic_score_gemma":0.0029319925,"teacher_disagreement_score":0.005322061,"about_ca_system_score_codex":0.001694,"about_ca_system_score_gemma":0.0016840438,"threshold_uncertainty_score":0.024600804},"labels":[],"label_agreement":null},{"id":"W4406560496","doi":"10.1016/j.adhoc.2024.103745","title":"Detection and Mitigation of Clock Deviation in the Verification & Validation of Drone-aided Lifting Operations","year":2025,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Drone; Computer science; Biology","score_opus":0.011777955000730042,"score_gpt":0.25493645470488585,"score_spread":0.24315849970415582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406560496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.741948,0.00023388934,0.2526854,0.00021953543,0.00013712756,0.00008422104,0.00016771731,0.0011225009,0.0034016746],"genre_scores_gemma":[0.98161846,0.00002372736,0.017757123,0.00002262192,0.000005061795,0.000011539246,0.000043444874,0.00001340927,0.0005047074],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990736,0.00016414745,0.000043099466,0.00014826616,0.0004158017,0.00015510326],"domain_scores_gemma":[0.9968106,0.0010981277,0.0006309307,0.00039816863,0.00091460213,0.00014746381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082729716,0.00045237795,0.0002956948,0.00079981715,0.0003246732,0.00045970164,0.0005488192,0.0004340258,0.0011563578],"category_scores_gemma":[0.005176611,0.00014788583,0.00012359806,0.00029653386,0.0004003276,0.00055319635,0.0006033318,0.00049866183,0.00029939902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004049835,0.00043879534,0.053918537,0.00031089378,0.00009851319,0.00064240134,0.0005384296,0.16639498,0.398717,0.005979733,0.001732884,0.36717805],"study_design_scores_gemma":[0.00007004884,0.0008908854,0.013764916,0.000042265947,0.000026672615,0.0003220409,0.000199452,0.7219005,0.2597252,0.0012824993,0.001743547,0.00003202656],"about_ca_topic_score_codex":0.0015632347,"about_ca_topic_score_gemma":0.0030068762,"teacher_disagreement_score":0.0015632347,"about_ca_system_score_codex":0.0003602056,"about_ca_system_score_gemma":0.0012578688,"threshold_uncertainty_score":0.0043752193},"labels":[],"label_agreement":null},{"id":"W4406643566","doi":"10.1016/b978-2-294-76306-9.50026-0","title":"10.1016/b978-2-294-76306-9.50026-0","year":2000,"lang":"en","type":"book-chapter","venue":"Time to knit","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Medicine","score_opus":0.010482188225132454,"score_gpt":0.17935503324109342,"score_spread":0.16887284501596098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406643566","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021331034,0.000369854,0.00143145,0.00026103895,0.00016444392,0.00005058121,0.0006452565,0.0010350219,0.99582905],"genre_scores_gemma":[0.0005044708,0.00021336206,0.00046172802,0.00010929972,0.000029408364,0.000032473832,0.00039864227,0.00022710886,0.9980235],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9995455,0.00002587662,0.000028300363,0.00016236992,0.0001515995,0.00008627942],"domain_scores_gemma":[0.9985336,0.00045000258,0.00009241461,0.00020297283,0.00027870625,0.00044238192],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00083507877,0.0022726788,0.0012047539,0.0019758078,0.0012456344,0.0043229964,0.002698267,0.0043100975,0.98001456],"category_scores_gemma":[0.0013697095,0.0008155979,0.000842334,0.0020323948,0.0010941952,0.0046314434,0.0029423316,0.0020922767,0.98869205],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012756616,0.00013841024,0.00037200793,0.0004330704,0.000017428987,0.00012105975,0.00008200949,0.0004954787,0.0025159533,0.0065610884,0.38422275,0.60491306],"study_design_scores_gemma":[0.000015004491,0.000045079436,0.00038034382,0.00023079097,0.0000074157715,0.00015002767,0.00006894716,0.00019749091,0.00036104224,0.0009526931,0.9975793,0.000011870298],"about_ca_topic_score_codex":0.0025964417,"about_ca_topic_score_gemma":0.0024656632,"teacher_disagreement_score":0.019985437,"about_ca_system_score_codex":0.0009229889,"about_ca_system_score_gemma":0.00072804245,"threshold_uncertainty_score":0.028506696},"labels":[],"label_agreement":null},{"id":"W4407614833","doi":"10.3389/ffutr.2025.1519390","title":"State-of-the-art virtualisation technologies for the centralised automotive E/E architecture","year":2025,"lang":"en","type":"article","venue":"Frontiers in Future Transportation","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; University of Warwick","keywords":"Automotive industry; Virtualization; Architecture; State (computer science); Computer science; Operating system; Engineering; History; Aerospace engineering; Cloud computing","score_opus":0.004471893729989497,"score_gpt":0.21426029611401493,"score_spread":0.20978840238402544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407614833","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0149456905,0.5526095,0.3636019,0.0014576497,0.0011413015,0.0002201106,0.00016555112,0.0013658132,0.064492516],"genre_scores_gemma":[0.21599306,0.601144,0.15884817,0.0011648984,0.0010619623,0.0003294402,0.0007365678,0.00047028728,0.020251626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985281,0.00027072302,0.0001364555,0.0002133826,0.000707491,0.00014380942],"domain_scores_gemma":[0.9987293,0.0005351606,0.00013066256,0.00018058124,0.0003741598,0.00005015311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011779437,0.00095648755,0.0005924098,0.0015550235,0.0004255443,0.002978909,0.0017871148,0.0010947979,0.005034895],"category_scores_gemma":[0.0023551187,0.0006230325,0.000637776,0.0016572982,0.0008610734,0.004699311,0.0012540467,0.0016915632,0.0018623503],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009342092,0.000072800074,0.0006072725,0.0043019815,0.0000522186,0.00016767626,0.0004651249,0.0112898825,0.015886372,0.10233221,0.009579571,0.85515153],"study_design_scores_gemma":[0.00002481167,0.00028102772,0.0013440792,0.0029509582,0.000121100325,0.001496291,0.00041255922,0.029236436,0.025666786,0.031249257,0.90709573,0.000120984776],"about_ca_topic_score_codex":0.0010615177,"about_ca_topic_score_gemma":0.0007049459,"teacher_disagreement_score":0.005034895,"about_ca_system_score_codex":0.0009764001,"about_ca_system_score_gemma":0.0011594102,"threshold_uncertainty_score":0.016843379},"labels":[],"label_agreement":null},{"id":"W4407891065","doi":"10.1007/978-981-96-1621-3_10","title":"A Framework for Standardized Partitioning Analysis in Integrated Modular Avionics Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Avionics; Integrated modular avionics; Computer science; Modular design; Software engineering; Programming language; Embedded system; Computer architecture; Systems engineering; Engineering; Software; Aerospace engineering","score_opus":0.017732115286621997,"score_gpt":0.2777757639394003,"score_spread":0.2600436486527783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407891065","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010185349,0.000112607435,0.99641454,0.000043266973,0.000021359632,0.00006395585,0.000053604675,0.00032481627,0.0019473],"genre_scores_gemma":[0.046908896,0.00041822137,0.9486731,0.000093077295,0.000079331134,0.00035629986,0.00045052572,0.00039796217,0.0026224668],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982918,0.0005587434,0.00013851422,0.00022895295,0.00059041294,0.00019161102],"domain_scores_gemma":[0.9984798,0.00063332694,0.000120236036,0.00034523304,0.00036444372,0.000057008256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027461003,0.0017146326,0.0011059479,0.0019218654,0.0011633215,0.0028463344,0.0027659263,0.0010232141,0.005960639],"category_scores_gemma":[0.0047059665,0.0010651153,0.0024421134,0.0028619152,0.0016399146,0.0028646935,0.0023528736,0.0030874573,0.0017328704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000447262,0.000100208934,0.00047308768,0.00022493684,0.000085754284,0.00022307635,0.00023534585,0.14578298,0.004388212,0.7184692,0.0052310056,0.1247414],"study_design_scores_gemma":[0.000023721619,0.000049613536,0.00025239302,0.000109527304,0.00006247329,0.00011521134,0.00008865521,0.47976953,0.002224114,0.49743643,0.019837396,0.000030873096],"about_ca_topic_score_codex":0.0050973897,"about_ca_topic_score_gemma":0.0055453503,"teacher_disagreement_score":0.005960639,"about_ca_system_score_codex":0.0013771803,"about_ca_system_score_gemma":0.0022464104,"threshold_uncertainty_score":0.019940317},"labels":[],"label_agreement":null},{"id":"W4408281823","doi":"10.1109/iecon55916.2024.10905918","title":"Real-time CAN Data Acquisition and Visualization: Synerging Physical-to-Virtual (P2V) Twinning of Automotive Battery Management Systems","year":2024,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Automotive industry; Visualization; Data visualization; Battery (electricity); Real-time computing; Embedded system; Engineering; Artificial intelligence; Power (physics)","score_opus":0.016515031661711976,"score_gpt":0.2823265710367542,"score_spread":0.2658115393750422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408281823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11293231,0.0006905987,0.82257175,0.0010736687,0.00025302774,0.00020158994,0.0013192404,0.031004993,0.029952709],"genre_scores_gemma":[0.6141707,0.00085915823,0.37085077,0.00024237762,0.000119603705,0.00019135013,0.0021324889,0.0020380472,0.00939547],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966025,0.00005437992,0.000015706077,0.000056362147,0.00016786718,0.000045311845],"domain_scores_gemma":[0.9997073,0.00005708585,0.000023531327,0.000059775448,0.00010873389,0.000043618023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047183663,0.0005176885,0.00029509046,0.001129931,0.00027085902,0.0012135514,0.00081504165,0.00032945158,0.005063509],"category_scores_gemma":[0.0009746068,0.00020134599,0.00029434724,0.00095816085,0.00029471173,0.0013608763,0.0013627568,0.0004014973,0.0008045301],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001306224,0.0002572147,0.0069291187,0.0005235678,0.000086677144,0.0012016688,0.0016467118,0.042522572,0.1969213,0.015436331,0.03843668,0.6947319],"study_design_scores_gemma":[0.00009814513,0.00020042315,0.0145072555,0.0001053066,0.00009344697,0.00094673136,0.00078403566,0.6282643,0.22174092,0.009781039,0.12334063,0.00013779874],"about_ca_topic_score_codex":0.0019462549,"about_ca_topic_score_gemma":0.0018994487,"teacher_disagreement_score":0.005063509,"about_ca_system_score_codex":0.00035244465,"about_ca_system_score_gemma":0.0005537708,"threshold_uncertainty_score":0.016939104},"labels":[],"label_agreement":null},{"id":"W4409017635","doi":"10.4271/2025-01-8072","title":"Synchronizing Real-Time Control in Centralized Automotive E/E Architectures","year":2025,"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":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Synchronizing; Automotive industry; Computer science; Control (management); Embedded system; Automotive engineering; Real-time computing; Engineering; Telecommunications; Artificial intelligence; Aerospace engineering","score_opus":0.007262349635780217,"score_gpt":0.24742256846484004,"score_spread":0.24016021882905983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409017635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34382296,0.00039119393,0.640448,0.00019324971,0.00012860593,0.00012753282,0.000040850166,0.0022018736,0.012645719],"genre_scores_gemma":[0.95365316,0.0000996649,0.04371568,0.000051500796,0.000030257226,0.00005398874,0.000038853716,0.000049371734,0.002307572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891305,0.000235439,0.00006774942,0.00027087622,0.0003196106,0.00019333097],"domain_scores_gemma":[0.99879277,0.00032750398,0.00016478411,0.00035192905,0.00027166208,0.000091319846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014628774,0.00038067176,0.00042320866,0.0003644448,0.00063850736,0.0011331599,0.0010358213,0.00055070926,0.0019086758],"category_scores_gemma":[0.0020156673,0.00023722599,0.00026515216,0.00046407478,0.0008147206,0.0013010299,0.0009103683,0.0007311689,0.00042045338],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00075836055,0.00048284986,0.0020174119,0.00010789322,0.000046588848,0.00029085256,0.00041905482,0.73536813,0.04604567,0.05181378,0.0023769673,0.16027254],"study_design_scores_gemma":[0.00008906398,0.0002668381,0.0007180611,0.000009689619,0.000019126,0.000050764065,0.00009299324,0.96552837,0.022781493,0.007807406,0.0026138418,0.000022360604],"about_ca_topic_score_codex":0.005131418,"about_ca_topic_score_gemma":0.005399128,"teacher_disagreement_score":0.005131418,"about_ca_system_score_codex":0.0010453017,"about_ca_system_score_gemma":0.0015936284,"threshold_uncertainty_score":0.010203123},"labels":[],"label_agreement":null},{"id":"W4410583251","doi":"10.23919/date64628.2025.10992758","title":"Criticality and Requirement Aware Heterogeneous Coherence for Mixed Criticality Systems","year":2025,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Criticality; Computer science; Coherence (philosophical gambling strategy); Physics","score_opus":0.03133587440104024,"score_gpt":0.3146690218477063,"score_spread":0.28333314744666604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410583251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08934007,0.0006868508,0.9024461,0.00039789442,0.00005239864,0.00011254312,0.00005762581,0.00073967996,0.0061668428],"genre_scores_gemma":[0.8234117,0.00019848808,0.17168483,0.00017155036,0.000059369107,0.00012226024,0.00014320467,0.00013099756,0.0040776175],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994931,0.00011281724,0.000031605377,0.00009371833,0.00017373462,0.00009500898],"domain_scores_gemma":[0.9993376,0.00014465116,0.00010385778,0.00015387217,0.00021058004,0.000049323287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048809923,0.00053325173,0.00031070944,0.00042035017,0.0005448382,0.00095851556,0.0010483678,0.00041946254,0.0014613131],"category_scores_gemma":[0.0010456862,0.00026164195,0.00028182575,0.00031989178,0.00035848413,0.00136874,0.0009923535,0.00054004864,0.0002896843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051560666,0.0003088609,0.0058776764,0.0006460378,0.00017005172,0.00075561565,0.001052946,0.21749237,0.26000217,0.14724872,0.008383435,0.3575465],"study_design_scores_gemma":[0.00006675689,0.00032919567,0.0010143428,0.00003083557,0.000091392234,0.00031046005,0.00018999683,0.91031873,0.043469977,0.026824197,0.01730572,0.000048396938],"about_ca_topic_score_codex":0.0011941667,"about_ca_topic_score_gemma":0.0029546772,"teacher_disagreement_score":0.0014613131,"about_ca_system_score_codex":0.00060026796,"about_ca_system_score_gemma":0.0008399256,"threshold_uncertainty_score":0.0048886538},"labels":[],"label_agreement":null},{"id":"W4410939566","doi":"10.23977/acss.2025.090211","title":"CPS-Based Operation Management System for Closed Test Ground of Intelligent Connected Vehicles","year":2025,"lang":"en","type":"article","venue":"Advances in Computer Signals and Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Test (biology); Common ground; Management system; Computer science; Engineering; Operations management; Geology; Psychology","score_opus":0.015576390959492533,"score_gpt":0.27591758776856856,"score_spread":0.260341196809076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410939566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079714224,0.00025739367,0.8736934,0.00066292135,0.00046202636,0.0003534215,0.0004701135,0.015344723,0.029041804],"genre_scores_gemma":[0.97543496,0.000096493706,0.020071436,0.00008915073,0.00004816665,0.00014477715,0.0003743316,0.00008474691,0.0036560183],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996246,0.00005430449,0.000035390298,0.00010954901,0.00010635224,0.000069874666],"domain_scores_gemma":[0.9995757,0.000054077907,0.0000627666,0.00006266636,0.00017894307,0.000065789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037324976,0.0005112667,0.00052584615,0.0008785082,0.0008740545,0.0013736704,0.0009984515,0.00046429466,0.005002289],"category_scores_gemma":[0.0008145405,0.00015641846,0.00031183235,0.00047270907,0.0004099927,0.0013074471,0.0012199078,0.00066123786,0.0009524045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014680662,0.0007700726,0.014509466,0.00049029663,0.00021169343,0.0019806253,0.0017310729,0.31061476,0.06839182,0.08907245,0.05457785,0.45618188],"study_design_scores_gemma":[0.00008771035,0.000205235,0.0020794212,0.000028975017,0.000065226996,0.00015269309,0.0002725714,0.9523531,0.012043831,0.009958354,0.022707136,0.000045728873],"about_ca_topic_score_codex":0.0052401912,"about_ca_topic_score_gemma":0.0031153075,"teacher_disagreement_score":0.0052401912,"about_ca_system_score_codex":0.00090254674,"about_ca_system_score_gemma":0.0012027582,"threshold_uncertainty_score":0.016734302},"labels":[],"label_agreement":null},{"id":"W4413696350","doi":"10.1145/3762647","title":"The Case for HW/SW Harmony in Real-Time Systems: Tightening Memory Latency of Streaming Applications","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Latency (audio); Harmony (color); Computer science; Live streaming; Real-time computing; Embedded system; Computer network; Art; Telecommunications; Visual arts","score_opus":0.01622354544256885,"score_gpt":0.28031857354751877,"score_spread":0.2640950281049499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413696350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44495195,0.0047339937,0.5318823,0.00088860927,0.00029861918,0.00014637025,0.00013318256,0.0060228785,0.010942135],"genre_scores_gemma":[0.93292505,0.00032969087,0.06312965,0.00039425728,0.000055392647,0.00007495347,0.00011121354,0.00038693985,0.0025928684],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989937,0.00013234439,0.00007253769,0.00023594375,0.00033368068,0.00023183388],"domain_scores_gemma":[0.9985845,0.0003182951,0.00022692967,0.00054149295,0.0002380653,0.00009072197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007522789,0.00092994963,0.00047655293,0.0004042284,0.0005163232,0.0009049075,0.0017532436,0.00045386248,0.0025966603],"category_scores_gemma":[0.0020491516,0.00028436852,0.00036924487,0.0004578053,0.0008898884,0.0020585977,0.0010778932,0.0010391754,0.00049151847],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015547569,0.00058230147,0.00798403,0.00072691333,0.00026491316,0.00072808587,0.0008887746,0.22508192,0.36395586,0.03579283,0.010481772,0.3519579],"study_design_scores_gemma":[0.00013933392,0.0023256307,0.0036233356,0.000074756674,0.00018777003,0.0006232959,0.0004705499,0.61591834,0.3288826,0.020961111,0.026710415,0.00008287255],"about_ca_topic_score_codex":0.0013375647,"about_ca_topic_score_gemma":0.0019901376,"teacher_disagreement_score":0.0025966603,"about_ca_system_score_codex":0.0007705127,"about_ca_system_score_gemma":0.0012027381,"threshold_uncertainty_score":0.008686662},"labels":[],"label_agreement":null},{"id":"W44137854","doi":"10.1007/978-3-540-68951-5_21","title":"Towards Framework-Based U×V Software Systems: An Applied Research Perspective","year":2007,"lang":"en","type":"book-chapter","venue":"Springer tracts in advanced robotics","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Scope (computer science); Craft; Plan (archaeology); Perspective (graphical); Autonomy; Systems engineering; Software; State (computer science); Engineering; Computer science; Engineering management; Operations research; Geography; Software engineering; Political science; Operating system; Archaeology; Programming language; Artificial intelligence","score_opus":0.09096187751472411,"score_gpt":0.3666906007375937,"score_spread":0.27572872322286957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W44137854","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071705445,0.0004888257,0.98772883,0.00023603893,0.000052552507,0.00004087446,0.000022251368,0.00051668606,0.003743468],"genre_scores_gemma":[0.3278012,0.001256106,0.6641146,0.00015901012,0.000092496084,0.0002127551,0.00015507828,0.00025691275,0.005951872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987953,0.0003667089,0.000064554246,0.0002380252,0.00035136435,0.00018407621],"domain_scores_gemma":[0.9987657,0.00047069966,0.000120968136,0.00027282775,0.00026804727,0.00010175499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023577386,0.00089385814,0.0009771264,0.0005724478,0.0008977293,0.0025905827,0.0028284222,0.0016521842,0.003793187],"category_scores_gemma":[0.00391572,0.00071251317,0.0011087434,0.0010623023,0.0021297643,0.0032059238,0.0025263242,0.0021608223,0.00078572286],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099725294,0.00009152128,0.0004153747,0.00031955948,0.000053298325,0.00019122502,0.00046631024,0.19405504,0.009528414,0.6582458,0.0032388123,0.13329501],"study_design_scores_gemma":[0.00004139322,0.0002562265,0.00018527854,0.000087636145,0.000030282774,0.00013780448,0.00019144196,0.6508295,0.0058998563,0.32165587,0.02065048,0.000034213746],"about_ca_topic_score_codex":0.007155928,"about_ca_topic_score_gemma":0.005478768,"teacher_disagreement_score":0.007155928,"about_ca_system_score_codex":0.0011109854,"about_ca_system_score_gemma":0.0021496161,"threshold_uncertainty_score":0.014228523},"labels":[],"label_agreement":null},{"id":"W4414655330","doi":"10.3390/math13193130","title":"Joint Scheduling and Placement for Vehicular Intelligent Applications Under QoS Constraints: A PPO-Based Precedence-Preserving Approach","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Scheduling (production processes); Partially observable Markov decision process; Quality of service; Markov process; Energy consumption; Heuristic; Curse of dimensionality; Task (project management); Process (computing)","score_opus":0.04223766267882838,"score_gpt":0.2887897794718987,"score_spread":0.24655211679307032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414655330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016967019,0.0002242703,0.9801272,0.00024897433,0.000053771513,0.000064626445,0.00004999682,0.00027580038,0.0019882922],"genre_scores_gemma":[0.7709042,0.00032681783,0.22491981,0.00020366612,0.000089752466,0.00016876706,0.00017856868,0.0001523483,0.0030559667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992893,0.00019083054,0.000036143665,0.00014203425,0.00018935092,0.00015235247],"domain_scores_gemma":[0.99863726,0.0007047775,0.0001663531,0.00012285625,0.00017005122,0.00019884111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012986326,0.000957949,0.0010021209,0.0006315281,0.000550112,0.0007728721,0.0014562052,0.00082560594,0.0020794116],"category_scores_gemma":[0.0030420606,0.00076101866,0.00065299385,0.0006836766,0.0008249804,0.0009307039,0.0013382726,0.001311599,0.00033723481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052080035,0.00003481442,0.00028251106,0.00003275197,0.00000936995,0.000040690888,0.00003640939,0.97486603,0.0011720847,0.0046825414,0.00047475274,0.018316044],"study_design_scores_gemma":[0.0000039833244,0.000014323381,0.000026504047,0.000001836138,0.0000017152811,0.0000054023126,0.0000047426643,0.9971409,0.000187679,0.0024433702,0.00016799867,0.000001620723],"about_ca_topic_score_codex":0.0066092354,"about_ca_topic_score_gemma":0.0071758116,"teacher_disagreement_score":0.0066092354,"about_ca_system_score_codex":0.0010055002,"about_ca_system_score_gemma":0.0031555656,"threshold_uncertainty_score":0.013141513},"labels":[],"label_agreement":null},{"id":"W4416924323","doi":"10.1109/dasc66011.2025.11257192","title":"Interrupt Related Interference Bounding in Aerospace Multicore Systems","year":2025,"lang":"","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Cégep de Saint-Laurent; Polytechnique Montréal","funders":"","keywords":"Interrupt; Interrupt handler; Multi-core processor; Bounding overwatch; Overhead (engineering); Interference (communication)","score_opus":0.019467324537885435,"score_gpt":0.2870419965346339,"score_spread":0.2675746719967485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416924323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32847118,0.0050724945,0.65104926,0.00038497624,0.00011417052,0.00012969396,0.00008075707,0.0062416494,0.0084558185],"genre_scores_gemma":[0.94299763,0.00023849476,0.055993382,0.000053250045,0.000025231888,0.000024239158,0.000029444509,0.0000793092,0.0005591507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875927,0.0002764701,0.000076893215,0.00015623271,0.00059108046,0.00013997147],"domain_scores_gemma":[0.9982823,0.0005930743,0.0005261162,0.00023581015,0.0002583274,0.000104406965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094488455,0.0005056168,0.0004124353,0.00061495,0.000534326,0.00084105844,0.00088812056,0.00027243473,0.0007933793],"category_scores_gemma":[0.0029848022,0.00022777038,0.00017578111,0.00047250092,0.00040975472,0.0005970291,0.0005709757,0.0005289395,0.00014025658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006833603,0.00031309258,0.01578626,0.00038952334,0.0001096757,0.00034654836,0.00068165234,0.4579959,0.20979886,0.016004754,0.00308629,0.29480416],"study_design_scores_gemma":[0.000022605775,0.00029439054,0.0037231848,0.000024633226,0.00004016471,0.00014799033,0.000055976998,0.92231095,0.0655072,0.0027763713,0.00506692,0.000029709345],"about_ca_topic_score_codex":0.0030231217,"about_ca_topic_score_gemma":0.0034272939,"teacher_disagreement_score":0.0030231217,"about_ca_system_score_codex":0.0010733365,"about_ca_system_score_gemma":0.0012719574,"threshold_uncertainty_score":0.0077875853},"labels":[],"label_agreement":null},{"id":"W4416924593","doi":"10.1109/dasc66011.2025.11257253","title":"Integration of Software-Defined Radios for Avionics into a Multi-Core IMA Architecture","year":2025,"lang":"","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Avionics; Robustness (evolution); Software; Fault detection and isolation; Architecture; Aviation; Reliability (semiconductor); Systems architecture","score_opus":0.029114971270532267,"score_gpt":0.3044491743353401,"score_spread":0.2753342030648078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416924593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2334699,0.0015695541,0.73659605,0.00036255273,0.0003125442,0.0003038645,0.000065548695,0.0020163355,0.025303666],"genre_scores_gemma":[0.75467867,0.00038088317,0.23803805,0.00017272588,0.00006836267,0.00007798399,0.000117043724,0.00012940496,0.0063368743],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996481,0.00007296031,0.000023433102,0.00006114934,0.00012863305,0.0000657819],"domain_scores_gemma":[0.9995958,0.0000475447,0.000037040707,0.00009741185,0.0001781085,0.00004398072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004030179,0.0004786854,0.00022762688,0.0004016219,0.00024127237,0.00080479955,0.0008120648,0.00032330546,0.0018368529],"category_scores_gemma":[0.0007152454,0.00019032838,0.00032138292,0.00022410354,0.00022410013,0.00073617,0.00044581192,0.00066174887,0.000788551],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050197815,0.00042356635,0.005379742,0.0005974388,0.00023330821,0.0005374788,0.00038424518,0.09487913,0.42853332,0.0399455,0.0024319112,0.42615244],"study_design_scores_gemma":[0.00008356768,0.0035572124,0.007204307,0.00015652704,0.0003293043,0.0013887347,0.00020650814,0.5715296,0.3121819,0.008411699,0.09488384,0.00006679945],"about_ca_topic_score_codex":0.0006510423,"about_ca_topic_score_gemma":0.0012043167,"teacher_disagreement_score":0.0018368529,"about_ca_system_score_codex":0.00041036826,"about_ca_system_score_gemma":0.0006694583,"threshold_uncertainty_score":0.006144941},"labels":[],"label_agreement":null},{"id":"W587014285","doi":"","title":"Automated runnable to task mapping","year":2013,"lang":"en","type":"preprint","venue":"LillOA (Université de Lille (University Of Lille))","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Computer science; Task (project management); Computer graphics (images); Engineering; Systems engineering","score_opus":0.011720769059412115,"score_gpt":0.18570940716218057,"score_spread":0.17398863810276846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W587014285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020495754,0.00021251972,0.9717187,0.00008369359,0.00007083521,0.000092033275,0.00009458435,0.005863178,0.0013686058],"genre_scores_gemma":[0.20710242,0.00018243553,0.78672713,0.00008205748,0.00004381276,0.00018956207,0.00056796364,0.0013246022,0.003780062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986513,0.0003848737,0.00007549048,0.00036674805,0.0003917166,0.00012999141],"domain_scores_gemma":[0.99691606,0.0012632201,0.00025732667,0.0010975528,0.00033618486,0.00012966299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680745,0.0010494866,0.00077192776,0.0009632637,0.0006121942,0.0012140145,0.0015739737,0.0008124131,0.0035879181],"category_scores_gemma":[0.0054064333,0.0006188048,0.0006977661,0.0005029675,0.0007489674,0.0015188985,0.0015873241,0.0012091922,0.0013321673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009672944,0.00033368933,0.002773235,0.0006137372,0.00010359577,0.00063896005,0.00086940924,0.08913497,0.14196484,0.026052197,0.008603278,0.72794473],"study_design_scores_gemma":[0.00012884132,0.0002486458,0.0018952198,0.00007152215,0.000047309695,0.00059572444,0.00023275836,0.7310565,0.16264978,0.05695305,0.046026096,0.00009461474],"about_ca_topic_score_codex":0.001085129,"about_ca_topic_score_gemma":0.0013696972,"teacher_disagreement_score":0.0035879181,"about_ca_system_score_codex":0.00044802637,"about_ca_system_score_gemma":0.0014033534,"threshold_uncertainty_score":0.012002826},"labels":[],"label_agreement":null},{"id":"W58702280","doi":"10.5555/2048476.2048488","title":"I-DEVS: imprecise real-time and embedded DEVS modeling","year":2011,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"DEVS; Computer science; Computation; Formalism (music); Discrete event simulation; Distributed computing; Theoretical computer science; Modeling and simulation; Programming language; Simulation","score_opus":0.03354631946692142,"score_gpt":0.23165812849921613,"score_spread":0.1981118090322947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W58702280","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037435766,0.00022565966,0.9925264,0.0001977337,0.00006149326,0.000041573756,0.00018351407,0.0005880837,0.0024319272],"genre_scores_gemma":[0.2667253,0.0013730724,0.7242582,0.00025996706,0.000120234654,0.00026491008,0.0011854491,0.0004900923,0.005322912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975182,0.0006913214,0.00030270455,0.00030372848,0.000988801,0.00019528237],"domain_scores_gemma":[0.9969253,0.0012875056,0.00030869414,0.00096856174,0.00041435362,0.000095483825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029089001,0.00080908986,0.0006938884,0.00073818053,0.0004619466,0.0029770772,0.0024629391,0.0010632662,0.0021595727],"category_scores_gemma":[0.0062328475,0.00083250774,0.0015122044,0.0007978905,0.0019404634,0.0038897162,0.0020839393,0.00328641,0.00055584114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013382173,0.000041360076,0.0013249059,0.00041690553,0.00006535473,0.0005012291,0.0007151456,0.35411796,0.00907945,0.58280474,0.0027409378,0.048058216],"study_design_scores_gemma":[0.000040664418,0.00009599137,0.0004089506,0.00019489902,0.00007627007,0.00039321452,0.00012766647,0.6953338,0.021587856,0.1925627,0.08909876,0.000079282465],"about_ca_topic_score_codex":0.0025282803,"about_ca_topic_score_gemma":0.002614644,"teacher_disagreement_score":0.0029770772,"about_ca_system_score_codex":0.0010848235,"about_ca_system_score_gemma":0.0015864061,"threshold_uncertainty_score":0.015383899},"labels":[],"label_agreement":null},{"id":"W621821632","doi":"","title":"Minimizing the cardinality of a real-time task set by automated task clustering","year":2013,"lang":"en","type":"preprint","venue":"LillOA (Université de Lille (University Of Lille))","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Emera (Canada)","funders":"","keywords":"Computer science; Cluster analysis; Task (project management); Sketch; Cardinality (data modeling); Set (abstract data type); Process (computing); Execution time; Feature (linguistics); Parallel computing; Data mining; Programming language; Machine learning; Algorithm","score_opus":0.011054901345564503,"score_gpt":0.1999957558182453,"score_spread":0.1889408544726808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W621821632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08975341,0.0004092741,0.90583706,0.000431366,0.000055434408,0.00015675926,0.00018272181,0.0004571573,0.002716912],"genre_scores_gemma":[0.5386398,0.00034826013,0.45622116,0.00012831393,0.00009837232,0.0003333652,0.00049446954,0.0004937236,0.0032425232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742174,0.0010557002,0.00015928296,0.00048343,0.0005608621,0.0003189056],"domain_scores_gemma":[0.9930305,0.003632364,0.0009111398,0.0014759192,0.00054521376,0.00040487593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024514487,0.0013963705,0.0017578405,0.0010795122,0.00091544626,0.001470646,0.0022364822,0.0010725923,0.0017666364],"category_scores_gemma":[0.009804446,0.00084583194,0.0010405742,0.001499338,0.0010809884,0.0026187892,0.0019390141,0.001423986,0.00044442824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039223558,0.00015315815,0.0011847302,0.00029479215,0.00008377949,0.000093123796,0.00019607824,0.89936477,0.011575946,0.01950969,0.0029095816,0.06424217],"study_design_scores_gemma":[0.000032322292,0.00010491426,0.0005105041,0.000025184752,0.000021477617,0.0000838566,0.00007655966,0.9641092,0.0047332733,0.02863727,0.0016463253,0.00001918855],"about_ca_topic_score_codex":0.0016937952,"about_ca_topic_score_gemma":0.00229927,"teacher_disagreement_score":0.0024514487,"about_ca_system_score_codex":0.0013826742,"about_ca_system_score_gemma":0.002248048,"threshold_uncertainty_score":0.012964666},"labels":[],"label_agreement":null},{"id":"W6891549005","doi":"10.4230/lipics.ecrts.2025.2","title":"Multi-Objective Memory Bandwidth Regulation and Cache Partitioning for Multicore Real-Time Systems","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Bundesministerium für Bildung und Forschung","keywords":"Cache; Scheduling (production processes); Knapsack problem; Heuristic; Bandwidth (computing); Benchmarking; Multi-core processor; Memory bandwidth; Task (project management); Linear programming","score_opus":0.014450534183901556,"score_gpt":0.26341798192404414,"score_spread":0.2489674477401426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6891549005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10857521,0.0017544407,0.8780533,0.0005294452,0.00007022415,0.00019667072,0.0002096136,0.0011371074,0.009473912],"genre_scores_gemma":[0.7207441,0.0005622774,0.2716533,0.00018972528,0.000045579076,0.00048581016,0.00031052882,0.00025407426,0.0057546413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949574,0.00020371788,0.000016947073,0.00007831473,0.00012010555,0.00008520438],"domain_scores_gemma":[0.99926144,0.00049257465,0.0001055703,0.000028102413,0.00007927099,0.00003312499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009075548,0.001173108,0.0005844357,0.00056401826,0.0003382415,0.00084852974,0.00076688454,0.0008092923,0.0021003906],"category_scores_gemma":[0.0019311099,0.00043159202,0.00047585927,0.0005559577,0.0005102582,0.00058976084,0.0007184549,0.0007306673,0.00024631998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002582453,0.000026392985,0.00016063279,0.0000504182,0.000009593089,0.000020841964,0.000014175232,0.9868771,0.00096794585,0.0013834502,0.00033751558,0.010126086],"study_design_scores_gemma":[0.000007022327,0.00001812337,0.000055342553,0.0000054398847,0.0000030821586,0.0000047479384,0.0000057292978,0.9985145,0.00044118954,0.00065750215,0.00028514993,0.0000021331357],"about_ca_topic_score_codex":0.006611646,"about_ca_topic_score_gemma":0.005317272,"teacher_disagreement_score":0.006611646,"about_ca_system_score_codex":0.00094052433,"about_ca_system_score_gemma":0.0014816858,"threshold_uncertainty_score":0.013146341},"labels":[],"label_agreement":null},{"id":"W6894195301","doi":"10.5281/zenodo.7627562","title":"10 Principles of Psychology You Can Use to Improve Your videos in english for kids","year":2023,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"HERO; Personality; Channel (broadcasting); Join (topology)","score_opus":0.08047754480748888,"score_gpt":0.29882535898118584,"score_spread":0.21834781417369697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894195301","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029496234,0.0019983747,0.16806231,0.022887938,0.0025659127,0.0015988058,0.0011593557,0.015412291,0.78336537],"genre_scores_gemma":[0.050650463,0.0058653415,0.2948501,0.01122727,0.0010583337,0.004970996,0.001383392,0.0042766724,0.6257174],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981792,0.000594749,0.0001103807,0.0002664066,0.0006179058,0.00023131946],"domain_scores_gemma":[0.9955434,0.0013266228,0.00017402152,0.0007044972,0.0013670906,0.0008843974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029362345,0.00090481096,0.0004097551,0.0016388117,0.0016389858,0.006516458,0.0018587852,0.002534799,0.19052254],"category_scores_gemma":[0.01025226,0.00072321534,0.00083413196,0.0008061708,0.0035911975,0.005686039,0.0041615283,0.002950341,0.14330035],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012324298,0.0004686416,0.0007320811,0.000607268,0.000018694844,0.00017830342,0.002191566,0.00029699304,0.0039006157,0.10761324,0.49045873,0.39341056],"study_design_scores_gemma":[0.00004299926,0.00006769917,0.0012774986,0.00036705515,0.000010092318,0.00028645067,0.0007186015,0.00076143624,0.0012131798,0.037773654,0.95744497,0.000036405232],"about_ca_topic_score_codex":0.0027324506,"about_ca_topic_score_gemma":0.0057182163,"teacher_disagreement_score":0.19052254,"about_ca_system_score_codex":0.0013955475,"about_ca_system_score_gemma":0.0031627647,"threshold_uncertainty_score":0.6373614},"labels":[],"label_agreement":null},{"id":"W6904813953","doi":"10.14279/tuj.eceasst.72.1026","title":"Model-based WCET Analysis with Invariants","year":2024,"lang":"en","type":"article","venue":"Technische Universität Berlin – Universitätsbibliothek","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Correctness; Probabilistic logic; State (computer science); Markov chain; Automaton; Worst-case execution time; Process (computing); Code (set theory); Markov decision process","score_opus":0.012789823508134698,"score_gpt":0.22336560645446246,"score_spread":0.21057578294632776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6904813953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053727017,0.000045232995,0.9923517,0.000023373654,0.000015792015,0.000036842895,0.000083966195,0.0009929725,0.0010774643],"genre_scores_gemma":[0.45479968,0.00026399962,0.54047126,0.00008298807,0.00004752238,0.00040424502,0.00066669396,0.0008147803,0.002448767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978308,0.00047944355,0.0001675504,0.00031542237,0.00094497175,0.00026179102],"domain_scores_gemma":[0.99660563,0.0017681181,0.000482335,0.00067033246,0.00042774386,0.000045931523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019029467,0.001332878,0.0008334674,0.0024529032,0.00041928244,0.0016146601,0.0013322415,0.00066417037,0.0030022499],"category_scores_gemma":[0.0067380676,0.0007534936,0.0025169798,0.0011567716,0.0012006093,0.002110475,0.00100297,0.0015111616,0.00053071894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000077178185,0.00006388735,0.0010488144,0.00009845705,0.000057132536,0.0000854459,0.000037563103,0.91123235,0.005752117,0.056150958,0.0005238016,0.024872368],"study_design_scores_gemma":[0.00000774275,0.000030817704,0.00010786195,0.000013513864,0.00002998774,0.000025572934,0.000004511876,0.97448236,0.006169225,0.018179657,0.0009366835,0.000012032003],"about_ca_topic_score_codex":0.005157,"about_ca_topic_score_gemma":0.0027769885,"teacher_disagreement_score":0.005157,"about_ca_system_score_codex":0.0013983193,"about_ca_system_score_gemma":0.0021158534,"threshold_uncertainty_score":0.010253966},"labels":[],"label_agreement":null},{"id":"W6924971462","doi":"10.15468/dl.xmxyys","title":"Occurrence Download","year":2023,"lang":"en","type":"dataset","venue":"Global Biodiversity Information Facility","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Download; Matching (statistics); Range (aeronautics); Data set; Statistical analysis","score_opus":0.01945229432125668,"score_gpt":0.22886141072780578,"score_spread":0.2094091164065491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924971462","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000065447275,0.000037344726,0.000043931814,0.00003704252,0.000013474727,0.000006726094,0.998689,0.00048312717,0.00062396476],"genre_scores_gemma":[0.0001974791,0.00003598221,0.00017088484,0.000042281357,0.000003444553,0.000033042095,0.9990715,0.00010865873,0.00033663312],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905616,0.000117310075,0.00013053877,0.00031203608,0.00022191972,0.0001620776],"domain_scores_gemma":[0.99793696,0.00049074396,0.00019515785,0.00056286046,0.000560541,0.00025375822],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008340855,0.0021076077,0.0015152949,0.004453438,0.0009256212,0.0022059598,0.0027548359,0.0020541747,0.099532075],"category_scores_gemma":[0.004984468,0.00081773446,0.0012582971,0.009121929,0.00041017664,0.0018918935,0.002036302,0.0018774619,0.1549211],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043765765,0.000016989336,0.00041732422,0.0005683837,0.00001796296,0.000016178901,0.00001892848,0.0002164837,0.00015673497,0.0003650622,0.9965563,0.0016059077],"study_design_scores_gemma":[0.0001142426,0.000012687098,0.0023558324,0.00018935523,0.000017051352,0.00004244957,0.000059585822,0.00031520418,0.000294297,0.0008214218,0.99575883,0.000019053638],"about_ca_topic_score_codex":0.02450385,"about_ca_topic_score_gemma":0.039656095,"teacher_disagreement_score":0.90046793,"about_ca_system_score_codex":0.0017738534,"about_ca_system_score_gemma":0.0023739247,"threshold_uncertainty_score":0.33296794},"labels":[],"label_agreement":null},{"id":"W6929073864","doi":"10.4230/lipics.ecrts.2025.9","title":"DAMA: A Dual Arbitration Mechanism for Mixed-Criticality Applications","year":2025,"lang":"en","type":"article","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Latency (audio); Arbitration; Scheduling (production processes); Upper and lower bounds; Overhead (engineering); Preemption; Processor scheduling","score_opus":0.012993861564221025,"score_gpt":0.2810580026251762,"score_spread":0.2680641410609552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929073864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08392538,0.0017535251,0.8969,0.00042476892,0.00030485608,0.0002580635,0.00013877697,0.011581535,0.00471307],"genre_scores_gemma":[0.7471132,0.0004346485,0.2428565,0.00040213135,0.00017351792,0.00036725443,0.00021351539,0.00041488497,0.008024355],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866116,0.00023165306,0.00016686314,0.00025059827,0.0004721024,0.00021750153],"domain_scores_gemma":[0.9983236,0.0003695039,0.00028975654,0.0005916893,0.00022585338,0.00019945923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021242504,0.0008025993,0.0005290431,0.00095426384,0.0005885322,0.0014438542,0.0034145974,0.0008471055,0.0045548035],"category_scores_gemma":[0.002864288,0.0005356567,0.0004047301,0.00045733055,0.00077563897,0.002074473,0.0029554584,0.0014072942,0.0010675006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00226413,0.0005827663,0.005109142,0.0008159477,0.00021993107,0.0010994007,0.0007254698,0.05048693,0.3593642,0.10107778,0.014287945,0.46396634],"study_design_scores_gemma":[0.000301895,0.0009632075,0.0015814917,0.00007200011,0.00014003037,0.0009641083,0.00006158038,0.754958,0.14102416,0.03586193,0.063905746,0.00016587078],"about_ca_topic_score_codex":0.0005910103,"about_ca_topic_score_gemma":0.0007354684,"teacher_disagreement_score":0.0045548035,"about_ca_system_score_codex":0.0007289585,"about_ca_system_score_gemma":0.0011021019,"threshold_uncertainty_score":0.015237331},"labels":[],"label_agreement":null},{"id":"W6957861625","doi":"10.6084/m9.figshare.19418203.v1","title":"Additional file 8 of Sorting and packaging of RNA into extracellular vesicles shape intracellular transcript levels","year":2022,"lang":"en","type":"dataset","venue":"Figshare","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Health Network","funders":"","keywords":"RNA; Extracellular; Intracellular; Sorting; Extracellular vesicles; Gene expression; Gene; Messenger RNA","score_opus":0.0310628784108791,"score_gpt":0.23698997482314252,"score_spread":0.20592709641226342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957861625","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004932337,0.000017548842,0.000045340475,0.000022606366,0.000008669033,0.000010199577,0.9996014,0.00011511573,0.00012976278],"genre_scores_gemma":[0.0009028304,0.000052092546,0.0006274099,0.00013137632,0.000014863643,0.000321428,0.99672675,0.0002113897,0.0010119802],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988501,0.00017219056,0.0001598278,0.00040239046,0.00023129709,0.000184224],"domain_scores_gemma":[0.9894052,0.007418292,0.00059991935,0.0009195224,0.0012725207,0.0003846029],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018551977,0.0021941618,0.002499395,0.002758223,0.0010888615,0.0028603165,0.002655521,0.0025761325,0.5286732],"category_scores_gemma":[0.015215147,0.00097184186,0.0019776376,0.004274475,0.00046682026,0.0015197839,0.0013688684,0.0018107763,0.15341954],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029371085,0.000070169524,0.0020802962,0.004331878,0.0001223069,0.00005361722,0.000040365474,0.00061761524,0.00036946413,0.00041496393,0.9882609,0.0033446366],"study_design_scores_gemma":[0.0053900275,0.00024275453,0.021626491,0.0026378578,0.00042064395,0.00033341558,0.00019791236,0.0016657034,0.0016985127,0.007549363,0.9580792,0.00015803857],"about_ca_topic_score_codex":0.009023404,"about_ca_topic_score_gemma":0.016760828,"teacher_disagreement_score":0.5286732,"about_ca_system_score_codex":0.0012067851,"about_ca_system_score_gemma":0.0024746116,"threshold_uncertainty_score":0.6722905},"labels":[],"label_agreement":null},{"id":"W6957935378","doi":"10.6068/dp14ba877c09178","title":"Trend 2006 - 2012. Statistics Canada. CANSIM: Children and Youth - Crime and Justice | Country: Canada | Table: Survey of Maintenance Enforcement Programs (SMEP), enrolled cases by age of payor, arrears status and amount of regular payment due in March | Variable: 15 to 24 years old, Greater than $0 to $100, Arrears owing, end of fiscal year | Units: #, 2006-2012. Data-Planet™ Statistical Ready Reference by Conquest Systems, Inc. Dataset-ID: 075-001-025.","year":2015,"lang":"en","type":"other","venue":"Data Planet","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Arrears; Census; Economic Justice; Official statistics; Payment; Law enforcement; Population; Economic statistics; Enforcement","score_opus":0.02376656651069162,"score_gpt":0.24155024315184256,"score_spread":0.21778367664115095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6957935378","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007275259,0.000055232194,0.000026423877,0.00015763761,0.00003694873,0.000026687921,0.99858785,0.00006823604,0.0009682064],"genre_scores_gemma":[0.0011636018,0.00040846787,0.00052301964,0.00026005157,0.000028963228,0.00022457217,0.99194217,0.0001456633,0.005303519],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99481344,0.0003536842,0.00063726393,0.00060658075,0.0023948879,0.0011940463],"domain_scores_gemma":[0.95494354,0.0013784278,0.001382548,0.0011184624,0.038759213,0.0024178417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027135166,0.0027607805,0.0032524,0.009031167,0.0036314721,0.004849308,0.0061642374,0.0015524065,0.09282456],"category_scores_gemma":[0.021056805,0.0024349159,0.0025966428,0.041305132,0.0006798361,0.0027361156,0.002512093,0.003484381,0.04631428],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030718882,0.000009136356,0.0014165572,0.0002632706,0.000024665289,0.0000059650174,0.000025642954,0.000091238486,0.00000848557,0.0003073865,0.9961467,0.0016701998],"study_design_scores_gemma":[0.00031032565,0.000026495823,0.049433738,0.0014948071,0.00013072172,0.000040895207,0.0008249186,0.0006406031,0.00023488744,0.00075283,0.9459798,0.00012999208],"about_ca_topic_score_codex":0.9962447,"about_ca_topic_score_gemma":0.9947635,"teacher_disagreement_score":0.09282456,"about_ca_system_score_codex":0.06671784,"about_ca_system_score_gemma":0.17418888,"threshold_uncertainty_score":0.48407406},"labels":[],"label_agreement":null},{"id":"W6958806362","doi":"10.6084/m9.figshare.c.7591297.v1","title":"The generic version of China Health Related Outcomes Measures (CHROME-G): psychometric testing and comparative performance with the EQ-5D-5L and SF-6Dv2 among the Chinese general population","year":2024,"lang":"en","type":"other","venue":"Figshare","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Intraclass correlation; Convergent validity; Spearman's rank correlation coefficient; Psychometrics; Reliability (semiconductor); Rank correlation; Ceiling effect; Population; Test (biology)","score_opus":0.05372114206064594,"score_gpt":0.2816122192546703,"score_spread":0.22789107719402435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958806362","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99586934,0.00045136336,0.00055428705,0.000095500916,0.000023574019,0.00021542511,0.0014303372,0.00001423051,0.0013459423],"genre_scores_gemma":[0.99508,0.0002403492,0.0014808135,0.00008340871,0.000019438054,0.00026857678,0.0024189341,0.000005679662,0.00040281596],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99827254,0.00053715624,0.00024712452,0.00019583771,0.0006283078,0.00011898077],"domain_scores_gemma":[0.99772245,0.00048557745,0.00068785803,0.00023735856,0.0006499529,0.00021681849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004595368,0.00052664446,0.0006020559,0.0017512937,0.00042170053,0.0006113074,0.00053863367,0.000464098,0.0018430013],"category_scores_gemma":[0.00636008,0.0002091258,0.0012334895,0.0023717585,0.0004655198,0.000605739,0.0009109075,0.00053756783,0.00018687555],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007958675,0.00045889712,0.9440339,0.00032026102,0.0006775,0.000081287326,0.00039425644,0.0006402005,0.00087426545,0.0002893753,0.0013193073,0.05011487],"study_design_scores_gemma":[0.00007462474,0.0003343495,0.9978194,0.000020726355,0.00008838199,0.000070513335,0.00013353417,0.00076753745,0.0001560854,0.00006535513,0.0004561808,0.000013238707],"about_ca_topic_score_codex":0.007890712,"about_ca_topic_score_gemma":0.012839502,"teacher_disagreement_score":0.007890712,"about_ca_system_score_codex":0.0008814873,"about_ca_system_score_gemma":0.0010526694,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6968790405","doi":"10.5281/zenodo.3789004","title":"Sesiini","year":2010,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Canadian Food Inspection Agency; Royal Alberta Museum; Calgary Laboratory Services; Natural Resources Canada","funders":"","keywords":"Term (time); Crown (dentistry); Selection (genetic algorithm); Head (geology)","score_opus":0.025312605447122247,"score_gpt":0.23981582242360783,"score_spread":0.21450321697648558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6968790405","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12707326,0.0031481453,0.008197729,0.00070926826,0.0012493732,0.0002327457,0.0059888302,0.0010029713,0.85239774],"genre_scores_gemma":[0.43937737,0.0024091078,0.010014726,0.0011964664,0.00021462818,0.00017730813,0.022035483,0.00057334045,0.5240015],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998356,0.000007214519,0.000013521574,0.000058042235,0.0000562658,0.00002939233],"domain_scores_gemma":[0.9998696,0.00000544971,0.000019811776,0.000016064858,0.00006117811,0.000027922728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103149425,0.00055926753,0.00039926844,0.00086451427,0.0010359935,0.0006881669,0.00041132703,0.00030258053,0.044111386],"category_scores_gemma":[0.00020494749,0.00021462052,0.00031664423,0.0006574656,0.00029537303,0.0004797454,0.0011976811,0.0007368877,0.02513535],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008706834,0.00018860276,0.026660291,0.00079016405,0.00008632393,0.0022114264,0.0015256754,0.0011884596,0.20718049,0.02397152,0.09596631,0.63936013],"study_design_scores_gemma":[0.000028640712,0.0001565687,0.03496771,0.00007876193,0.000026349757,0.0013147906,0.00046144731,0.00021417413,0.006734675,0.00085575413,0.9551433,0.000017745171],"about_ca_topic_score_codex":0.008819458,"about_ca_topic_score_gemma":0.020734215,"teacher_disagreement_score":0.044111386,"about_ca_system_score_codex":0.00088116986,"about_ca_system_score_gemma":0.00059267355,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6975860027","doi":"10.60510/awfwi03450","title":"IGSN AWFWI03450 (EN22040-TG06): Individual Sample (Biology, leaf for DNA analyses) of sample EN22040-T06 from Ogilvie Mountains (Nahoni Range), Yukon, CA","year":2024,"lang":"en","type":"other","venue":"GFZ IGSN Sample Catalogue","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Sample (material); DNA","score_opus":0.06678584560943426,"score_gpt":0.3304699592395422,"score_spread":0.2636841136301079,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6975860027","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006823104,0.00006920716,0.003221339,0.00005716999,0.00005063966,0.00013292383,0.9552677,0.002981659,0.031396296],"genre_scores_gemma":[0.005021938,0.000052351883,0.00508973,0.000052357926,0.000012751108,0.00020405473,0.97382087,0.0022069342,0.01353887],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991399,0.00003389874,0.000057080993,0.00029100105,0.00027321384,0.00020487177],"domain_scores_gemma":[0.99808335,0.0000996356,0.00013503923,0.0005858591,0.0008773978,0.00021871463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007297463,0.0014620788,0.001096096,0.005070526,0.0017357524,0.001218296,0.0021560714,0.0010585816,0.17871465],"category_scores_gemma":[0.0016564344,0.00076564605,0.0005377224,0.0100924065,0.00044547673,0.00074053206,0.0012744992,0.00060688664,0.16589515],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004389652,0.000080360915,0.010308405,0.0007210541,0.000039658466,0.000096888485,0.0005407583,0.0005921587,0.01375498,0.0022860244,0.9159879,0.05515296],"study_design_scores_gemma":[0.000054116263,0.000037940204,0.04007871,0.00007309289,0.00003832078,0.00010278192,0.0002434532,0.00034798507,0.004749541,0.00077499636,0.95346934,0.0000296276],"about_ca_topic_score_codex":0.17598873,"about_ca_topic_score_gemma":0.30080894,"teacher_disagreement_score":0.82401127,"about_ca_system_score_codex":0.0025499808,"about_ca_system_score_gemma":0.004362902,"threshold_uncertainty_score":0.5978601},"labels":[],"label_agreement":null},{"id":"W6991910066","doi":"","title":"From information to action: Exploring health information use among older adults with diabetes in Canada","year":2025,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"McGill University","keywords":"Diabetes mellitus; Health information; Information system; MEDLINE; Population; Public health","score_opus":0.01827391336046085,"score_gpt":0.21959808453746418,"score_spread":0.20132417117700332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6991910066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9904054,0.0008107079,0.00007565119,0.0025588456,0.000029462635,0.00014401478,0.0014434821,0.0000051710476,0.0045272545],"genre_scores_gemma":[0.9917441,0.0018423045,0.00045003323,0.0014083363,0.000016484686,0.000104538856,0.0008500501,0.000011596557,0.0035724936],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.99789137,0.00024437788,0.0001830138,0.0001814833,0.0008834669,0.000616335],"domain_scores_gemma":[0.99243623,0.0012150203,0.0011121065,0.00010504971,0.003160147,0.0019714572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018607937,0.00030800694,0.00068516185,0.0016064377,0.0065319985,0.004289475,0.0016977361,0.0012688157,0.0032023326],"category_scores_gemma":[0.009289211,0.00055564806,0.00086044346,0.0057094116,0.0013552152,0.0015842693,0.002541047,0.0028253428,0.00035785825],"study_design_candidate":"qualitative","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000865222,0.00032902433,0.91552645,0.00014269169,0.000069626985,0.0001257446,0.06311554,0.000089567184,0.00013290666,0.0002334665,0.0038114947,0.016336983],"study_design_scores_gemma":[0.0000142585795,0.000066223336,0.8849409,0.00023006169,0.00006489999,0.000040229086,0.10953587,0.0003018402,0.00007059334,0.00007926697,0.0046181194,0.000037740654],"about_ca_topic_score_codex":0.99428105,"about_ca_topic_score_gemma":0.9974655,"teacher_disagreement_score":0.04245797,"about_ca_system_score_codex":0.04245797,"about_ca_system_score_gemma":0.07148419,"threshold_uncertainty_score":0.30805558},"labels":[],"label_agreement":null},{"id":"W7000350239","doi":"","title":"Extending UML-RT for Control System Modelling","year":2004,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Unified Modeling Language; Scheduling (production processes); Key (lock); Visualization; Control system; Jitter; Control (management); Object (grammar); Systems modeling","score_opus":0.0957254216965272,"score_gpt":0.30080543060930925,"score_spread":0.20508000891278205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000350239","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014554643,0.00020427561,0.9899193,0.00014254196,0.00006968107,0.00010103546,0.00021507866,0.0031477346,0.004744847],"genre_scores_gemma":[0.06508941,0.0010043689,0.9238376,0.00013081994,0.00011739289,0.00053020235,0.0010576103,0.0011062472,0.0071263807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771994,0.00082113285,0.00031170374,0.000278835,0.00072262035,0.00014566926],"domain_scores_gemma":[0.9972548,0.0013908551,0.00034698134,0.0005156264,0.00043720144,0.000054440723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031009451,0.0015433846,0.0005812351,0.0015255808,0.00045206648,0.0021072177,0.0019332258,0.0013184601,0.006243158],"category_scores_gemma":[0.0056221634,0.00084311585,0.0026439317,0.00075845176,0.00081614486,0.0024733972,0.0012309157,0.0018908234,0.0029153521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013000875,0.00012240394,0.0012906352,0.0007192909,0.00009863989,0.0014985801,0.00209238,0.33903533,0.019989822,0.4951868,0.007995316,0.13184085],"study_design_scores_gemma":[0.000048822236,0.000067863424,0.00023047316,0.00021545612,0.0000804479,0.00041161152,0.00008536881,0.73249924,0.008043579,0.08047504,0.17778914,0.000052959458],"about_ca_topic_score_codex":0.0067241425,"about_ca_topic_score_gemma":0.004463048,"teacher_disagreement_score":0.0067241425,"about_ca_system_score_codex":0.0012023945,"about_ca_system_score_gemma":0.0015312721,"threshold_uncertainty_score":0.020885468},"labels":[],"label_agreement":null},{"id":"W7000781121","doi":"","title":"High Performance Real-Time Scheduling Framework for Multiprocessor Systems","year":2023,"lang":"en","type":"dissertation","venue":"White Rose eTheses Online (University of Leeds, The University of Sheffield, University of York)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Nucleofection; Hyporeflexia; TSG101; Gestational period; Articular cartilage damage; Lafora disease","score_opus":0.01998242855070388,"score_gpt":0.22505563529366643,"score_spread":0.20507320674296256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7000781121","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015068983,0.0017089666,0.986477,0.0004283634,0.0002618041,0.00011205624,0.00016151679,0.0008899082,0.008453587],"genre_scores_gemma":[0.15062876,0.004182254,0.8232639,0.00036759215,0.0007196542,0.0009685797,0.0009293947,0.0006259731,0.018313939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99844885,0.00054235215,0.00010240463,0.0001744525,0.0005854653,0.00014645903],"domain_scores_gemma":[0.9993886,0.0002218543,0.00005923462,0.00011065987,0.00014517472,0.00007443771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020293603,0.0015438322,0.00084257853,0.0007489399,0.00062916405,0.002551239,0.0025998089,0.0010487839,0.0056197913],"category_scores_gemma":[0.0019022289,0.0005430932,0.0011626713,0.0009841148,0.0008959967,0.0016294391,0.0016295003,0.0027901253,0.0026774576],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055725308,0.00005849767,0.00015709647,0.00031291414,0.00004873751,0.00023035839,0.00021533074,0.22965254,0.0052789864,0.71578526,0.0096026845,0.038601838],"study_design_scores_gemma":[0.0000378645,0.000064561216,0.00006899989,0.0000648953,0.00002043798,0.00009645792,0.00004651141,0.7987285,0.0012551334,0.11716645,0.08242879,0.000021375272],"about_ca_topic_score_codex":0.003338644,"about_ca_topic_score_gemma":0.00419208,"teacher_disagreement_score":0.0056197913,"about_ca_system_score_codex":0.0016063437,"about_ca_system_score_gemma":0.0021841782,"threshold_uncertainty_score":0.01880008},"labels":[],"label_agreement":null},{"id":"W7007798228","doi":"","title":"Aircraft wireless networks for safety-critical systems","year":2020,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University","funders":"","keywords":"Avionics; Reliability (semiconductor); Wireless; Inter-Access Point Protocol; Network packet; Wireless network; Packet loss","score_opus":0.017260068711375795,"score_gpt":0.2542436521459453,"score_spread":0.2369835834345695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7007798228","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008120803,0.18124576,0.22843759,0.077007905,0.033516586,0.0003822462,0.0012810985,0.0022113875,0.46779668],"genre_scores_gemma":[0.15308768,0.24553952,0.13938434,0.015176343,0.018473916,0.00069653697,0.0026113738,0.0007135253,0.4243168],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993185,0.00018567005,0.00003258084,0.00010165471,0.00030588527,0.000055803313],"domain_scores_gemma":[0.9991696,0.0001906751,0.000079844336,0.00014463594,0.00034627042,0.00006904523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006445632,0.00076763943,0.0003331765,0.00070066674,0.0006059013,0.0018336149,0.0007342061,0.0014273055,0.028959246],"category_scores_gemma":[0.0018763972,0.00022240002,0.0002234837,0.0012469573,0.0005668611,0.0035741394,0.0010900996,0.0022790376,0.011599368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004255017,0.00004207579,0.00046017952,0.0007009824,0.000018152852,0.00020510796,0.00021616757,0.0032865272,0.0054730363,0.35725582,0.2747542,0.3575452],"study_design_scores_gemma":[0.000005659103,0.000032617827,0.00022111756,0.00020332691,0.000007313959,0.00018314568,0.00006842858,0.0029323772,0.0005056978,0.039280534,0.9565481,0.000011679829],"about_ca_topic_score_codex":0.0010550644,"about_ca_topic_score_gemma":0.0009467514,"teacher_disagreement_score":0.028959246,"about_ca_system_score_codex":0.0010261509,"about_ca_system_score_gemma":0.00083306123,"threshold_uncertainty_score":0.09687835},"labels":[],"label_agreement":null},{"id":"W7022627668","doi":"","title":"Ottawa Meetings","year":2018,"lang":"en","type":"article","venue":"Project Muse (Johns Hopkins University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Dysgeusia; Liquation; Diafiltration; Emperipolesis; Triacetin; Durvalumab","score_opus":0.016613230613975787,"score_gpt":0.22352206778955588,"score_spread":0.2069088371755801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7022627668","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001128256,0.0036795465,0.00053238956,0.004775216,0.0058849086,0.00012121047,0.008139666,0.00078709767,0.9749518],"genre_scores_gemma":[0.0013064953,0.0006135055,0.00025139682,0.00014752848,0.00015967127,0.000019441351,0.0011716067,0.0001651705,0.99616516],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986137,0.000117627504,0.000057157184,0.000266442,0.0006626971,0.00028232258],"domain_scores_gemma":[0.9978155,0.00013119812,0.0000845909,0.0002924288,0.0008249943,0.0008512912],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009675865,0.0018336592,0.00085568416,0.0033393314,0.005801506,0.007354489,0.0023250887,0.002108376,0.77467847],"category_scores_gemma":[0.002574425,0.0008607092,0.0007609994,0.0034489825,0.00086348277,0.002488476,0.0032403728,0.0021225763,0.49084982],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009760214,0.00002867107,0.00015016664,0.000079147954,0.0000055457294,0.000057838002,0.000052619325,0.00010111678,0.00022105384,0.0029361595,0.9551604,0.041109774],"study_design_scores_gemma":[0.000007040715,0.0000073422107,0.0004219654,0.00003609657,0.0000023826215,0.000017875898,0.00009463433,0.000035215435,0.000086673295,0.00035667274,0.99892706,0.000006881731],"about_ca_topic_score_codex":0.13376325,"about_ca_topic_score_gemma":0.46727642,"teacher_disagreement_score":0.77467847,"about_ca_system_score_codex":0.0057520787,"about_ca_system_score_gemma":0.0099851675,"threshold_uncertainty_score":0.3213938},"labels":[],"label_agreement":null},{"id":"W7025044007","doi":"","title":"Strengthening Evidence-support Systems in a Challenged World","year":2023,"lang":"en","type":"dissertation","venue":"MacSphere (McMaster University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Taxonomy (biology); Delphi method; Delphi; Process (computing); Thematic analysis; CLARITY; Matching (statistics)","score_opus":0.03938177225488222,"score_gpt":0.2483131335018124,"score_spread":0.20893136124693018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025044007","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03148446,0.049507827,0.049159832,0.8277269,0.0038065717,0.0009969085,0.0002840298,0.00024023629,0.036793172],"genre_scores_gemma":[0.57932174,0.054070488,0.24767564,0.107548535,0.0032630707,0.0026706664,0.0006008865,0.00034981474,0.004499245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.5112514,0.39311317,0.030578356,0.0135301305,0.04294748,0.008579458],"domain_scores_gemma":[0.26812592,0.6014521,0.025602007,0.040864017,0.046066083,0.017889814],"candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.40940648,0.0015015518,0.004325799,0.012224427,0.01895128,0.06470126,0.010039191,0.024861112,0.005767898],"category_scores_gemma":[0.4336255,0.002812961,0.0033078417,0.0105523355,0.042129774,0.08499713,0.045983568,0.031994224,0.0023455424],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002922243,0.00061999663,0.0064340653,0.014613437,0.0008484344,0.0015224819,0.07434758,0.0048764604,0.0020593149,0.55632544,0.041353237,0.2967072],"study_design_scores_gemma":[0.00015851103,0.00035987192,0.0023660809,0.031517524,0.00017924247,0.0006438152,0.060807522,0.0025927522,0.0014744998,0.609489,0.29014736,0.000263881],"about_ca_topic_score_codex":0.0033580146,"about_ca_topic_score_gemma":0.004754331,"teacher_disagreement_score":0.5905935,"about_ca_system_score_codex":0.030699924,"about_ca_system_score_gemma":0.10358167,"threshold_uncertainty_score":0.728307},"labels":[],"label_agreement":null},{"id":"W7030855854","doi":"","title":"20170927 lazyboy","year":2017,"lang":"en","type":"other","venue":"Bulletin of Miscellaneous Information (Royal Gardens Kew)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Football; Natural (archaeology); Theme (computing); Subject (documents); Line (geometry)","score_opus":0.007917205054446163,"score_gpt":0.19805691193084324,"score_spread":0.19013970687639709,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7030855854","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051540864,0.0005576865,0.0019463715,0.0016790271,0.0011667552,0.000053381103,0.0032973823,0.005221288,0.9855627],"genre_scores_gemma":[0.0014172918,0.0003353806,0.00041710402,0.00021929933,0.00009141407,0.00001852456,0.0017543603,0.0008074996,0.9949391],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99953604,0.00003627945,0.000024911991,0.0001221617,0.00018435385,0.00009629949],"domain_scores_gemma":[0.99851197,0.000105644045,0.000049880255,0.00019324766,0.0005600131,0.0005792519],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00068971247,0.000879186,0.00071577897,0.0014271459,0.0022664021,0.0051455977,0.0012762533,0.0015598038,0.90531206],"category_scores_gemma":[0.0023304194,0.0003841813,0.00052099576,0.001348833,0.0005641822,0.0025703788,0.0028141928,0.0012336746,0.8830385],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010324906,0.000041571868,0.00018610123,0.000097764125,0.000002892788,0.00005667291,0.000047985337,0.00010418825,0.00062836846,0.0058679488,0.8686505,0.12421288],"study_design_scores_gemma":[0.0000075309076,0.000010206065,0.00013719329,0.000033735738,0.0000014163387,0.000024625611,0.000029867124,0.00007650367,0.00012903944,0.0005903731,0.99895585,0.0000035529615],"about_ca_topic_score_codex":0.009596074,"about_ca_topic_score_gemma":0.017333932,"teacher_disagreement_score":0.09468794,"about_ca_system_score_codex":0.0019116183,"about_ca_system_score_gemma":0.002319186,"threshold_uncertainty_score":0.13506079},"labels":[],"label_agreement":null},{"id":"W7033064370","doi":"","title":"PENGARUH DUKUNGAN SOSIAL TERHADAP QUARTER LIFE CRISIS PADA MASA EMERGING ADULTHOOD DI PROVINSI DAERAH ISTIMEWA YOGYAKARTA","year":2022,"lang":"id","type":"other","venue":"ePrints - UNY (Yogyakarta State University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Quarter (Canadian coin); Nursing science; Life style","score_opus":0.010631412960553987,"score_gpt":0.20500015771584293,"score_spread":0.19436874475528895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033064370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9512878,0.0019789352,0.0007979738,0.0054911287,0.00018219341,0.00029627164,0.0029723954,0.00008798375,0.036905218],"genre_scores_gemma":[0.94739956,0.0024834415,0.0012714722,0.00094118965,0.00007626636,0.00043505582,0.0017208301,0.00003188449,0.045640357],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9995838,0.00010493644,0.000029323006,0.000059402224,0.00008467812,0.00013783773],"domain_scores_gemma":[0.99919707,0.00012187897,0.00014827868,0.00006455953,0.00018322724,0.00028499129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081641244,0.0002520067,0.00032214797,0.0005834236,0.0017482734,0.0011937988,0.00035751588,0.00033909112,0.020628333],"category_scores_gemma":[0.001487096,0.0002483776,0.00029377252,0.00078580447,0.0003970751,0.000697217,0.0014905994,0.0008707772,0.0019632687],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039075565,0.0003015704,0.73055714,0.00059845456,0.00006794153,0.0011212021,0.04531268,0.000088832625,0.0036259408,0.0022596319,0.034094002,0.18158181],"study_design_scores_gemma":[0.000019329782,0.00012848523,0.9281634,0.00016015641,0.000031387845,0.00018423855,0.034428235,0.0000784401,0.0004823173,0.00024051934,0.036067866,0.000015791531],"about_ca_topic_score_codex":0.041761648,"about_ca_topic_score_gemma":0.09382683,"teacher_disagreement_score":0.041761648,"about_ca_system_score_codex":0.0015022433,"about_ca_system_score_gemma":0.002936413,"threshold_uncertainty_score":0.08303714},"labels":[],"label_agreement":null},{"id":"W7044128187","doi":"","title":"Virtual Single-Core for Multicore Real-Time Computing","year":2020,"lang":"en","type":"article","venue":"IDEALS (University of Illinois Urbana-Champaign)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Multi-core processor; Certification; Avionics; Software; Aviation; Core (optical fiber)","score_opus":0.03786719580384094,"score_gpt":0.21816622869106683,"score_spread":0.1802990328872259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7044128187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007489272,0.0086784735,0.93432,0.0010066206,0.00176808,0.00023697846,0.00018692446,0.0068973745,0.039416365],"genre_scores_gemma":[0.22528896,0.0061938404,0.73057747,0.0016342564,0.0006866174,0.00070416066,0.00092676416,0.0013900707,0.032597903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999131,0.00014604411,0.00006546776,0.00013900558,0.00041740292,0.000101096026],"domain_scores_gemma":[0.9993955,0.000111954614,0.00004301827,0.00018682098,0.00017837467,0.00008432084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006649129,0.0006002689,0.0003861755,0.00037929884,0.0005423121,0.0013453312,0.001798298,0.0006026286,0.007452449],"category_scores_gemma":[0.0016092294,0.00027112206,0.00043476143,0.00060845626,0.00073543895,0.0013179327,0.0014579417,0.0017223023,0.0023848938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034963945,0.00013437093,0.00068640325,0.0010681109,0.0001097684,0.00033474903,0.0003651337,0.05560745,0.039107718,0.42303234,0.06858035,0.410624],"study_design_scores_gemma":[0.00007283626,0.0002846177,0.00043632122,0.00020866493,0.000052604315,0.00044737488,0.00006470207,0.3611376,0.020457065,0.08342053,0.53334266,0.00007498332],"about_ca_topic_score_codex":0.0013651302,"about_ca_topic_score_gemma":0.0022690909,"teacher_disagreement_score":0.007452449,"about_ca_system_score_codex":0.0008125439,"about_ca_system_score_gemma":0.0013225783,"threshold_uncertainty_score":0.024930954},"labels":[],"label_agreement":null},{"id":"W7096455778","doi":"","title":"Relational Specification of Interface Modules for Real-time Systems By","year":2006,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Interface (matter); Constant (computer programming); Relational database; Natural (archaeology); Relation (database); User interface","score_opus":0.019908424624856435,"score_gpt":0.23738469361571427,"score_spread":0.21747626899085784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096455778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043271966,0.0009945228,0.9357369,0.00052970264,0.00030680717,0.00013728374,0.0013961304,0.0055323076,0.051039238],"genre_scores_gemma":[0.1649197,0.0022465023,0.6714616,0.0005287455,0.0001563695,0.00055185345,0.006243293,0.0025257224,0.15136617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990096,0.00019661749,0.00014745447,0.00018164022,0.00031652828,0.00014814868],"domain_scores_gemma":[0.99934286,0.00013309474,0.00005131631,0.00023003553,0.00020049498,0.000042109485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001255011,0.0006481206,0.0003837049,0.0008474358,0.0005765763,0.0024643745,0.0010956529,0.0005833421,0.017511673],"category_scores_gemma":[0.0016923059,0.0005893416,0.00073307945,0.0010490149,0.00085466314,0.0031730912,0.0014329903,0.0015951245,0.005802513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008810298,0.00004137534,0.00058168435,0.00022301376,0.000025407118,0.00030448227,0.0007370847,0.0048214635,0.009421638,0.8350593,0.03272674,0.11596966],"study_design_scores_gemma":[0.00006232819,0.0000554278,0.0010371243,0.00024281503,0.00006956555,0.00046410327,0.00017919876,0.038902424,0.012135955,0.11812649,0.82866174,0.00006291686],"about_ca_topic_score_codex":0.039721332,"about_ca_topic_score_gemma":0.050171014,"teacher_disagreement_score":0.039721332,"about_ca_system_score_codex":0.0031374015,"about_ca_system_score_gemma":0.0025346857,"threshold_uncertainty_score":0.07898027},"labels":[],"label_agreement":null},{"id":"W7097346588","doi":"","title":"Although this program should run on Windows NT and 2000, these operating systems may have real time issues which have not been explored to this author's satisfaction.","year":2007,"lang":"en","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Windows NT; Sample (material); Code (set theory); Software; Program code; Graphics; Microsoft Windows","score_opus":0.1229501560136145,"score_gpt":0.3782498952868001,"score_spread":0.2552997392731856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7097346588","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004850797,0.00037553252,0.42436072,0.0027174652,0.0020971354,0.0020771942,0.011569499,0.40887904,0.14307263],"genre_scores_gemma":[0.028715739,0.001366994,0.4943525,0.0017454731,0.0006899968,0.0031621766,0.016855173,0.097963005,0.355149],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991431,0.00014187621,0.00009448497,0.0001708215,0.00035071524,0.000098966906],"domain_scores_gemma":[0.9961534,0.0012188265,0.00025166804,0.00086847384,0.0010770826,0.00043051632],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0025654119,0.0013614694,0.0011284229,0.0011801792,0.0006370121,0.0022246165,0.0015093525,0.0009489006,0.30276084],"category_scores_gemma":[0.008513154,0.0006660793,0.0005829836,0.00079443894,0.0006331076,0.0024089795,0.0013570744,0.0015921519,0.24353647],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006570357,0.00016703746,0.0010157888,0.0004999627,0.00002473014,0.00023185945,0.0003102773,0.0005473546,0.007712362,0.009541751,0.5825771,0.39671478],"study_design_scores_gemma":[0.00020794511,0.00017223529,0.0031466328,0.00029776624,0.000029011784,0.00046820863,0.00010517463,0.009716319,0.012868723,0.008681,0.9642049,0.00010203718],"about_ca_topic_score_codex":0.0016401283,"about_ca_topic_score_gemma":0.0017885196,"teacher_disagreement_score":0.69723916,"about_ca_system_score_codex":0.00057925493,"about_ca_system_score_gemma":0.00125059,"threshold_uncertainty_score":0.99452704},"labels":[],"label_agreement":null},{"id":"W7106206875","doi":"","title":"Resolving Availability and Run-time Integrity Conflicts in Real-Time Embedded Systems","year":2025,"lang":"","type":"article","venue":"arXiv (Cornell University)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Interrupt; Overhead (engineering); Task (project management); Fault tolerance; Microcontroller; Focus (optics); Identification (biology)","score_opus":0.04801666607649548,"score_gpt":0.20741492020164207,"score_spread":0.15939825412514658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7106206875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12507221,0.0028040693,0.8625705,0.0012601014,0.00026596215,0.00009670441,0.000054140826,0.0016247857,0.0062514436],"genre_scores_gemma":[0.90000254,0.00040436714,0.09698852,0.00022114132,0.0001689121,0.00006497055,0.00005687417,0.00018601306,0.0019067565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934877,0.0020602096,0.0005939912,0.0009741324,0.002187827,0.0006962099],"domain_scores_gemma":[0.98353654,0.0071421396,0.0030812419,0.003673229,0.0017734063,0.000793428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004798199,0.0005995036,0.0007453543,0.0007772749,0.0011783134,0.0028040174,0.002187884,0.0011009695,0.0019846126],"category_scores_gemma":[0.017713303,0.00078131317,0.00041730065,0.00058869267,0.0017131316,0.005234393,0.0032940626,0.0021842665,0.0005842728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020739958,0.00048275726,0.015036153,0.00088990974,0.00026057035,0.0017119099,0.0030261474,0.33266276,0.08650666,0.1790892,0.0063487813,0.37191102],"study_design_scores_gemma":[0.00012520971,0.0006626677,0.0031640138,0.000102466925,0.000117497846,0.0013223704,0.0007633564,0.8127004,0.06274754,0.092777625,0.025400875,0.00011600653],"about_ca_topic_score_codex":0.0009199861,"about_ca_topic_score_gemma":0.0010857865,"teacher_disagreement_score":0.004798199,"about_ca_system_score_codex":0.0008017072,"about_ca_system_score_gemma":0.0016884668,"threshold_uncertainty_score":0.025375605},"labels":[],"label_agreement":null},{"id":"W7117664449","doi":"10.1109/rtss66672.2025.00018","title":"Faster, Exact, More General Response-Time Analysis for NVIDIA Holoscan Applications","year":2025,"lang":"","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Dataflow; Scalability; Correctness; Scheduling (production processes); Latency (audio); Directed acyclic graph; Mutual exclusion; Liveness; Semantics (computer science)","score_opus":0.016312193341596934,"score_gpt":0.29889517829450585,"score_spread":0.2825829849529089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117664449","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07228954,0.00016897505,0.91221404,0.00015332695,0.000062721796,0.000078603334,0.00053777674,0.009022981,0.0054721273],"genre_scores_gemma":[0.67826676,0.00014506896,0.31626678,0.00016730269,0.000029942985,0.0001915197,0.0010061152,0.0012499414,0.0026765375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991749,0.00010907699,0.000034243934,0.00016776296,0.000371509,0.00014259423],"domain_scores_gemma":[0.99845004,0.0006203416,0.00012261902,0.00035903644,0.00038065822,0.000067280605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084725604,0.0011838756,0.0004241218,0.0007512709,0.00055569864,0.0009849975,0.0013709213,0.00039850417,0.0033489398],"category_scores_gemma":[0.004394483,0.00035178036,0.0005571117,0.0006051009,0.0006033979,0.001284904,0.0007148038,0.0009998493,0.00058410625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022231416,0.000117315096,0.0035153814,0.00016743521,0.00004927645,0.0001234166,0.00016737294,0.87184614,0.020467978,0.029493101,0.004916867,0.06891333],"study_design_scores_gemma":[0.0000073287615,0.000011690416,0.0002217126,0.000004283308,0.0000043703017,0.000009280631,0.000013132499,0.98987097,0.0036900777,0.005250801,0.00091118494,0.000005266555],"about_ca_topic_score_codex":0.016248869,"about_ca_topic_score_gemma":0.019475369,"teacher_disagreement_score":0.016248869,"about_ca_system_score_codex":0.0017614914,"about_ca_system_score_gemma":0.002871161,"threshold_uncertainty_score":0.03230858},"labels":[],"label_agreement":null},{"id":"W7117730664","doi":"10.1109/mcsoc67473.2025.00012","title":"Enhancing Static Task Scheduling for Pipelined Cyclic Executions on Heterogeneous Architectures","year":2025,"lang":"","type":"article","venue":"","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Infineon Technologies (Canada)","funders":"","keywords":"Software pipelining; Scheduling (production processes); Software; Graph; Multiprocessor scheduling; Processor scheduling; Execution time; Computational complexity theory; Schedule","score_opus":0.015670930573135154,"score_gpt":0.2894739385398298,"score_spread":0.2738030079666946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117730664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102923445,0.00013802928,0.8927204,0.000104277235,0.000040773913,0.000048719026,0.00005068166,0.0013233603,0.0026503338],"genre_scores_gemma":[0.6626535,0.000104379535,0.33574745,0.000037555674,0.000018343015,0.000051422237,0.00012821551,0.00021098481,0.001048146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99963856,0.0000799867,0.000014606808,0.000058284815,0.00015048354,0.00005796475],"domain_scores_gemma":[0.9993512,0.00023785647,0.00009688407,0.0001456937,0.00013031981,0.000038055256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065162615,0.00051510805,0.0003637962,0.0006710363,0.0005395596,0.00053736166,0.0008820515,0.00034986858,0.0013169799],"category_scores_gemma":[0.0019693887,0.0003069677,0.00056215585,0.0006536695,0.00045465253,0.0008434782,0.0005429436,0.00060476933,0.00019405913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008543968,0.00007510157,0.0012565942,0.00005459927,0.000018579833,0.00006854752,0.00006739102,0.9147898,0.015242525,0.012760815,0.0007704594,0.05481011],"study_design_scores_gemma":[0.0000034504249,0.000023032479,0.000089764544,0.0000018850507,0.000003192074,0.0000074982454,0.0000059591334,0.9951015,0.0019457003,0.002466377,0.0003495162,0.0000022005102],"about_ca_topic_score_codex":0.009592068,"about_ca_topic_score_gemma":0.0152363395,"teacher_disagreement_score":0.009592068,"about_ca_system_score_codex":0.0012266203,"about_ca_system_score_gemma":0.00265628,"threshold_uncertainty_score":0.019072473},"labels":[],"label_agreement":null},{"id":"W7119582404","doi":"10.1145/3784987.3784989","title":"Safe UAV Continuous-Control Architecture Design","year":2025,"lang":"en","type":"article","venue":"ACM SIGAda Ada Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Process (computing); Formal verification; Model checking; Functional verification; Runtime verification; Formal methods; Architecture; Software; Software verification; Design process","score_opus":0.008503720724271744,"score_gpt":0.22231882235773187,"score_spread":0.21381510163346013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7119582404","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029897286,0.00034861633,0.95322424,0.0002585597,0.00009130743,0.00021553262,0.00010743952,0.001957585,0.013899465],"genre_scores_gemma":[0.55230176,0.00036128977,0.4357632,0.00016315927,0.00003065172,0.0003228167,0.00022301698,0.00024977335,0.010584337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992205,0.00013426578,0.000039547016,0.00011512961,0.00039515784,0.00009540612],"domain_scores_gemma":[0.99939156,0.000115074436,0.000057837908,0.00013991549,0.00026336708,0.000032237236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007189661,0.0004885531,0.00019747572,0.0004693893,0.00039711216,0.0011288702,0.00093760574,0.0006773369,0.0027879954],"category_scores_gemma":[0.0011316701,0.00030502363,0.00039059605,0.0001749861,0.0007167069,0.000597511,0.00072908425,0.00073862594,0.00074132497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033494105,0.00012409258,0.0023513616,0.0006545007,0.000088276225,0.0008321332,0.0007172718,0.456627,0.11167221,0.21198948,0.004757998,0.20985073],"study_design_scores_gemma":[0.00009610019,0.00038666933,0.0008461605,0.000116457704,0.00006960987,0.0002980818,0.000104437415,0.8281197,0.08053419,0.033526693,0.055867508,0.00003440317],"about_ca_topic_score_codex":0.0033595755,"about_ca_topic_score_gemma":0.004227673,"teacher_disagreement_score":0.0033595755,"about_ca_system_score_codex":0.00082504994,"about_ca_system_score_gemma":0.0017427406,"threshold_uncertainty_score":0.009326816},"labels":[],"label_agreement":null},{"id":"W7139479429","doi":"","title":"CESCA Newsletter","year":2014,"lang":"en","type":"article","venue":"VTechWorks (Virginia Tech)","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Automotive industry; Controller (irrigation); Center (category theory); Systems design","score_opus":0.004832240450917579,"score_gpt":0.20031563018151016,"score_spread":0.1954833897305926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139479429","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000876192,0.01481163,0.000977333,0.037888158,0.06057915,0.00018107334,0.0056304643,0.0015088344,0.8775472],"genre_scores_gemma":[0.0021587557,0.0062830118,0.0005233444,0.006320079,0.008335756,0.000075133314,0.0033378163,0.00040882383,0.97255725],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991585,0.000064625776,0.000049974093,0.00012232095,0.0004976025,0.00010686231],"domain_scores_gemma":[0.9972855,0.0003058207,0.00011827051,0.00021897248,0.0014000265,0.0006714931],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010271785,0.0009416344,0.0007561028,0.0026806465,0.0014888162,0.0062063253,0.0015278689,0.0029980722,0.59016305],"category_scores_gemma":[0.0037188316,0.0004004053,0.0006196839,0.002793945,0.00041392824,0.0023257677,0.0017005622,0.002759992,0.4270179],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002507789,0.00002018641,0.000052227002,0.00006586924,0.0000019029001,0.000038698934,0.000011152916,0.000022531016,0.000103983344,0.0013803631,0.9605771,0.03770095],"study_design_scores_gemma":[0.0000029719606,0.0000040651184,0.00013008235,0.000029772755,8.288188e-7,0.000026874442,0.000013212979,0.000012268117,0.00002893912,0.00014861101,0.9996007,0.0000016474277],"about_ca_topic_score_codex":0.004786553,"about_ca_topic_score_gemma":0.009168886,"teacher_disagreement_score":0.59016305,"about_ca_system_score_codex":0.0018317053,"about_ca_system_score_gemma":0.0031140356,"threshold_uncertainty_score":0.5845827},"labels":[],"label_agreement":null},{"id":"W892034677","doi":"10.1016/j.sysarc.2015.05.003","title":"Compositional power-aware real-time scheduling with discrete frequency levels","year":2015,"lang":"en","type":"article","venue":"Journal of Systems Architecture","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Ministry of Science, ICT and Future Planning; National Research Foundation of Korea; Ministry of Education","keywords":"Computer science; Scheduling (production processes); Power (physics); Real-time computing; Distributed computing; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.01793644010566905,"score_gpt":0.2475372817204978,"score_spread":0.22960084161482874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W892034677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04001666,0.000204543,0.95378244,0.000119118784,0.000078975536,0.00004391272,0.00004441383,0.0008633678,0.0048465454],"genre_scores_gemma":[0.7549873,0.00016195881,0.24169655,0.00009268168,0.00005193842,0.00007413474,0.00008359799,0.00026575825,0.002586148],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929357,0.00015316982,0.000041256248,0.00011865272,0.00026085772,0.00013252065],"domain_scores_gemma":[0.99894935,0.00033366712,0.00008129063,0.0003349079,0.00020594664,0.00009486713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000793759,0.0005500973,0.0006612489,0.00060945767,0.00071305904,0.0014245551,0.0013947908,0.0004458842,0.0032043653],"category_scores_gemma":[0.00237066,0.0004671877,0.00070774957,0.00051899214,0.0008469797,0.0016557864,0.0012755971,0.0011828402,0.0005613137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076801114,0.00031857126,0.0012754826,0.0003139264,0.00010737173,0.00022068637,0.00045323462,0.57193,0.09499449,0.19020858,0.0019995668,0.13740996],"study_design_scores_gemma":[0.00004003567,0.00009612112,0.0001931028,0.00001834423,0.000048567363,0.000060013946,0.000056126977,0.9300454,0.014307896,0.051713835,0.0033989367,0.000021556982],"about_ca_topic_score_codex":0.0013405847,"about_ca_topic_score_gemma":0.0029589648,"teacher_disagreement_score":0.0032043653,"about_ca_system_score_codex":0.00077780423,"about_ca_system_score_gemma":0.0012260157,"threshold_uncertainty_score":0.010719717},"labels":[],"label_agreement":null}]}