{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000057358426,0.00037729953,0.9899711,0.00034934914,0.0047185994,0.0006712137,0.000010225658,0.00032196348,0.0035228638],"genre_scores_gemma":[0.095544666,0.000022969036,0.90088946,0.00046026072,0.0015123575,0.00006971801,0.00001135836,0.000081349586,0.0014078871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936103,0.00006966361,0.0010415694,0.0029939807,0.001122556,0.0011618837],"domain_scores_gemma":[0.994812,0.00082995975,0.00056583947,0.0028427783,0.0006219432,0.00032743905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019464229,0.0008194181,0.00093291164,0.0008806332,0.0004224324,0.00076809834,0.004508735,0.0006031219,0.000020722835],"category_scores_gemma":[0.00020270908,0.00076374586,0.00034347663,0.00063759525,0.0006221289,0.0011978529,0.0017519742,0.00073569233,0.00003188291],"study_design_candidate":"design_other","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.000011439363,0.00004495438,0.000017688957,0.0001388017,0.000023124832,0.00006187217,0.0012842322,0.039517887,0.000175755,0.031126365,0.000052560776,0.9275453],"study_design_scores_gemma":[0.00035618135,0.0003440356,0.000035064866,0.00076666864,0.0000138695,0.00019316305,3.9309666e-7,0.8296997,0.003280618,0.1619806,0.002162845,0.0011668423],"about_ca_topic_score_codex":0.00035079807,"about_ca_topic_score_gemma":0.000042478852,"teacher_disagreement_score":0.9263785,"about_ca_system_score_codex":0.00054811506,"about_ca_system_score_gemma":0.0009949323,"threshold_uncertainty_score":0.9994814},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000707777,0.0018757293,0.9896945,0.00029657278,0.0044982173,0.0007746734,0.0000042327715,0.0004620414,0.0016862922],"genre_scores_gemma":[0.1705754,0.000037833182,0.8273263,0.0004453395,0.0011494174,0.000013926752,0.0000048386505,0.00006636371,0.00038061308],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931302,0.00007885405,0.001068382,0.0024857554,0.0016972848,0.0015395245],"domain_scores_gemma":[0.99472225,0.00061739545,0.0006832507,0.0030086546,0.00045365476,0.0005147908],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.00267455,0.0009756993,0.0010308031,0.001069933,0.00049074786,0.0010799133,0.005538015,0.000740578,0.000033113727],"category_scores_gemma":[0.0002849169,0.0009132486,0.00029441243,0.00094045413,0.0007106054,0.0018745118,0.0028166068,0.001745828,0.0003498295],"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.000010953677,0.00014891097,0.0017547478,0.00028870872,0.00005801035,0.00024090253,0.0035162922,0.05831704,0.0047799246,0.02346115,0.000013204829,0.90741014],"study_design_scores_gemma":[0.00062663393,0.00011333619,0.0010892901,0.001062776,0.000020155332,0.00020374822,5.934627e-7,0.9740937,0.0023768065,0.017408475,0.0013393746,0.0016651438],"about_ca_topic_score_codex":0.00008309219,"about_ca_topic_score_gemma":0.00007483305,"teacher_disagreement_score":0.9157766,"about_ca_system_score_codex":0.000643508,"about_ca_system_score_gemma":0.0009721324,"threshold_uncertainty_score":0.9999571},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44394785,0.00011905329,0.5314074,0.00017420472,0.00026182117,0.0001590771,2.2565942e-7,0.00022705652,0.023703257],"genre_scores_gemma":[0.93486816,0.000002258888,0.06447724,0.00014072491,0.000062327505,0.0000014397625,2.3601329e-7,0.00000449802,0.00044312718],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9989552,0.000031554933,0.00020854476,0.00036058621,0.0001934613,0.00025064696],"domain_scores_gemma":[0.999166,0.000082732164,0.00004352993,0.00049521454,0.000065023596,0.00014751058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009842548,0.000093304596,0.0001185001,0.000057500292,0.00008450708,0.0002203565,0.00038022074,0.00005191745,0.00002779017],"category_scores_gemma":[0.000050778144,0.000076322685,0.000029204308,0.0002283088,0.000025525098,0.0006025761,0.00020472004,0.00007799574,0.00006902995],"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.000023634497,0.00019554053,0.58256245,0.0001553834,0.000057383008,0.00014698398,0.0032090375,0.000040680065,0.014037644,0.18798491,0.004836352,0.20674998],"study_design_scores_gemma":[0.0016032453,0.00022538869,0.87427104,0.00008015332,0.000010668447,0.00025937235,0.0007342101,0.027713118,0.07423178,0.007326095,0.012340503,0.0012044557],"about_ca_topic_score_codex":0.00009774715,"about_ca_topic_score_gemma":0.00004888847,"teacher_disagreement_score":0.49092028,"about_ca_system_score_codex":0.00004332864,"about_ca_system_score_gemma":0.000033014523,"threshold_uncertainty_score":0.31123486},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9142288,0.0004528816,0.06312266,0.000008390146,0.0006501835,0.0006054481,0.000011981923,0.00020003246,0.02071965],"genre_scores_gemma":[0.9845535,0.00017614613,0.0028426573,7.042942e-7,0.00018639107,0.0000019196032,0.00008530601,0.000058907714,0.01209444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99438447,0.0009091689,0.0007748209,0.0013356126,0.001634006,0.0009619112],"domain_scores_gemma":[0.99610615,0.00046267494,0.0005386196,0.0014546161,0.0009953395,0.00044257648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021061439,0.00043367854,0.0012108352,0.0067680427,0.0007091933,0.00050562073,0.0017443362,0.0005985802,0.000006516848],"category_scores_gemma":[0.00011884564,0.0005077933,0.0004122207,0.0060462165,0.00016038828,0.00095009356,0.00044793746,0.0008872361,0.00000848464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0019281845,0.00074462424,0.108472824,0.007590892,0.025027065,0.011467609,0.013573171,0.47152892,0.31293353,0.040917892,0.00022529138,0.0055899792],"study_design_scores_gemma":[0.000313114,0.00014117075,0.0048812567,0.0005115403,0.00067986123,0.00003713244,0.0017322093,0.98805255,0.0029823976,0.00005794912,0.00004946295,0.0005613869],"about_ca_topic_score_codex":0.08119125,"about_ca_topic_score_gemma":0.0029282272,"teacher_disagreement_score":0.5165236,"about_ca_system_score_codex":0.0009788412,"about_ca_system_score_gemma":0.0012769796,"threshold_uncertainty_score":0.9997374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05912909,0.00016040484,0.5356411,0.0030950522,0.000091131915,0.00045004804,2.2788662e-7,0.000354323,0.40107864],"genre_scores_gemma":[0.96108276,0.0000033780339,0.036058776,0.00010450497,0.00003746866,0.0000144403,2.7309997e-7,0.0000047971275,0.0026935854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992928,0.000057063833,0.00010465442,0.00027447965,0.00014506193,0.00012592506],"domain_scores_gemma":[0.9994919,0.000068711495,0.000051097613,0.00028714078,0.000044000437,0.00005720747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017162036,0.000069117654,0.000076356504,0.000051349456,0.00006410531,0.00011938936,0.00019791759,0.000035272747,0.000013884292],"category_scores_gemma":[0.000035646735,0.000058639394,0.000013960147,0.00016666757,0.000020018479,0.00065690017,0.00008473839,0.00006524611,0.00009682595],"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.000015231876,0.00029366906,0.0015109929,0.000051658324,0.00017381416,0.00003592208,0.036145967,0.0002127738,0.034359116,0.40179133,0.011014105,0.5143954],"study_design_scores_gemma":[0.0007977525,0.00022602522,0.011184057,0.000057021567,0.000013900434,0.0002323841,0.0013660989,0.9156773,0.048611727,0.0030883595,0.018107822,0.0006375247],"about_ca_topic_score_codex":0.000060593964,"about_ca_topic_score_gemma":0.0000027613894,"teacher_disagreement_score":0.9154646,"about_ca_system_score_codex":0.000032273645,"about_ca_system_score_gemma":0.000006363871,"threshold_uncertainty_score":0.2391245},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053227076,0.0016802234,0.9864865,0.000061542945,0.0041471636,0.00057587394,0.0000046708024,0.00018127091,0.006330479],"genre_scores_gemma":[0.5820809,0.00005145701,0.41457692,0.000054507967,0.0020166948,0.000012036782,0.0000031348345,0.00008025167,0.0011241237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951531,0.00009100115,0.000944047,0.0013851451,0.001524889,0.0009018119],"domain_scores_gemma":[0.99580777,0.0007236266,0.0007762921,0.0018975621,0.0005383435,0.00025643437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019185209,0.00063637417,0.0010198117,0.0009950453,0.00018211093,0.0005006407,0.0031791455,0.0004380398,0.000008638647],"category_scores_gemma":[0.00009501509,0.00059261895,0.00019209736,0.00068844756,0.00052422285,0.0011731443,0.0014742482,0.00073698815,0.00027051498],"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.00002331382,0.00014805878,0.002214746,0.00081851176,0.00021049677,0.0003642372,0.0072673066,0.26132342,0.021808313,0.038206227,0.00004001059,0.66757536],"study_design_scores_gemma":[0.0005785552,0.00033238032,0.0010444564,0.005450898,0.000051188563,0.00045642036,0.0000023944542,0.9473701,0.032668542,0.009016339,0.000711556,0.0023171846],"about_ca_topic_score_codex":0.00010173677,"about_ca_topic_score_gemma":0.0000020561329,"teacher_disagreement_score":0.68604666,"about_ca_system_score_codex":0.00039519064,"about_ca_system_score_gemma":0.00045667583,"threshold_uncertainty_score":0.9996525},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011623115,0.00003355423,0.98609555,0.00008723957,0.00060897646,0.0010285452,0.000010101138,0.00033511987,0.00017777542],"genre_scores_gemma":[0.51437354,6.956696e-7,0.48528618,0.00006798243,0.00017890427,0.000019124427,0.000012445848,0.000023830906,0.000037339527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964384,0.00019544645,0.0010390858,0.0009219773,0.0007322349,0.00067286333],"domain_scores_gemma":[0.99607897,0.0011537772,0.0005260781,0.00091238244,0.0011098428,0.00021892537],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015504264,0.00043256953,0.0005980051,0.0004237448,0.00023350613,0.00032973493,0.001048552,0.00019817638,0.0000147437],"category_scores_gemma":[0.000120141536,0.00040974,0.00019679267,0.0005078736,0.00011098977,0.00067553634,0.00017978906,0.00019053102,0.000047932102],"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.00006473614,0.00013777836,0.000076784614,0.00009223507,0.000040846196,0.000008862863,0.00045265746,0.7805852,0.0050198454,0.0011079966,0.00001649116,0.21239652],"study_design_scores_gemma":[0.0011578916,0.00041379436,0.0003538562,0.00032896732,0.000019297258,0.000003214662,0.00001927436,0.98584074,0.01122398,0.0001249735,0.00006106387,0.0004529599],"about_ca_topic_score_codex":0.000070014,"about_ca_topic_score_gemma":0.0000017705623,"teacher_disagreement_score":0.5027504,"about_ca_system_score_codex":0.00010151507,"about_ca_system_score_gemma":0.00033238338,"threshold_uncertainty_score":0.99983543},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5477724,0.000039585848,0.22705486,0.0010094079,0.0010963641,0.0005894329,0.0000015180277,0.0017656977,0.22067073],"genre_scores_gemma":[0.56637347,0.0000033632136,0.42817616,0.00023004127,0.00021980435,0.000020503627,0.000003099271,0.000027906748,0.004945662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99774414,0.000056131856,0.00040834997,0.0006159356,0.0006620661,0.00051338604],"domain_scores_gemma":[0.99800134,0.00015753483,0.00013652115,0.0010869077,0.00018712129,0.00043060776],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009264413,0.00024854598,0.00030851064,0.00017939527,0.00010612716,0.00039347756,0.0010856505,0.00012627312,0.000037788905],"category_scores_gemma":[0.00021739461,0.00020371257,0.00009768682,0.00039533534,0.000031633306,0.0010748556,0.00030164947,0.00019155463,0.005237451],"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.00027234343,0.0010584315,0.005358708,0.00020083901,0.00038287195,0.00069332373,0.016922493,0.061817113,0.13855019,0.6414692,0.029311739,0.10396277],"study_design_scores_gemma":[0.0012870338,0.0002933566,0.0012623317,0.00012814571,0.000007448227,0.00008173603,0.00026918994,0.98535043,0.007335492,0.0022795412,0.0011429775,0.00056231447],"about_ca_topic_score_codex":0.00031846238,"about_ca_topic_score_gemma":0.0000049662035,"teacher_disagreement_score":0.9235333,"about_ca_system_score_codex":0.00016526527,"about_ca_system_score_gemma":0.0001932219,"threshold_uncertainty_score":0.9955371},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021288332,0.000008248837,0.9064037,0.0011547278,0.000224374,0.00034962257,6.5564393e-7,0.00027477223,0.07029555],"genre_scores_gemma":[0.83134496,1.9888257e-7,0.16760115,0.00023688088,0.00006094183,0.00002488593,0.000002991797,0.00000626672,0.0007216986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987419,0.00009167567,0.00024385047,0.00031329278,0.00038020592,0.00022905254],"domain_scores_gemma":[0.9990901,0.000059665497,0.00006222276,0.00046699407,0.00015166026,0.00016940323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075032254,0.00009303749,0.00011982025,0.000074396485,0.00004222199,0.00022537078,0.00041980098,0.00003225306,0.00007417192],"category_scores_gemma":[0.00009531807,0.00007299929,0.000035250167,0.00032892308,0.000013024191,0.00041739352,0.00010429589,0.00006002125,0.00074172823],"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.000020593174,0.0002329865,0.00544639,0.000039422357,0.00009759986,0.000038524235,0.0025226376,0.008007462,0.0021629084,0.8880584,0.03130773,0.062065348],"study_design_scores_gemma":[0.0037581453,0.0017569514,0.0065468038,0.00007322271,0.000064081425,0.00009940032,0.0020606387,0.8667658,0.028414601,0.06889555,0.020214668,0.0013501177],"about_ca_topic_score_codex":0.00042986017,"about_ca_topic_score_gemma":0.00009852153,"teacher_disagreement_score":0.85875833,"about_ca_system_score_codex":0.00011559169,"about_ca_system_score_gemma":0.000156883,"threshold_uncertainty_score":0.9533663},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002402426,0.00006857017,0.99529815,0.00004478545,0.000032802353,0.00028544737,9.613105e-7,0.00007394048,0.0017928939],"genre_scores_gemma":[0.5180348,0.0000062512468,0.48169303,0.000010573034,0.000022774593,0.000009351164,0.000002641889,0.000005618687,0.00021493515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982332,0.00018879672,0.0006909517,0.00035420628,0.00026782387,0.00026503007],"domain_scores_gemma":[0.9971954,0.001619493,0.0003774838,0.00051963713,0.00022111087,0.00006683801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087476044,0.00012355782,0.00056977785,0.0004563151,0.000043731085,0.000036193793,0.00043095797,0.00009240091,0.000049610488],"category_scores_gemma":[0.0001918577,0.0001116062,0.00027855329,0.0022804944,0.000014880392,0.00019479751,0.000064704,0.00005815251,0.000005131279],"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.000005406541,0.000041311367,0.0003226644,0.000017790744,0.00029928077,6.2450016e-7,0.00018415308,0.9852423,0.0019070006,0.0032025774,0.00007514955,0.008701762],"study_design_scores_gemma":[0.00021361824,0.00006459433,0.0010360049,0.000012558916,0.00015751613,0.0000010721589,0.0000049393157,0.997987,0.00015571911,0.00023780802,0.000019332167,0.00010984255],"about_ca_topic_score_codex":0.00013519175,"about_ca_topic_score_gemma":0.0000031938646,"teacher_disagreement_score":0.5156324,"about_ca_system_score_codex":0.000034302808,"about_ca_system_score_gemma":0.00001449279,"threshold_uncertainty_score":0.45511687},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008163748,0.0012814525,0.98854977,0.0014462085,0.0022715395,0.00040634573,0.0000032394676,0.00025199456,0.005707804],"genre_scores_gemma":[0.106291056,0.000046174402,0.8911157,0.0010679174,0.0010524268,0.000013073112,0.000002863636,0.000051705145,0.00035907357],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941299,0.00008184305,0.0010643518,0.0021711506,0.001410355,0.0011423876],"domain_scores_gemma":[0.99612176,0.0014929634,0.00025648274,0.0016406978,0.00023430369,0.00025378985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016962971,0.0006848083,0.00088439556,0.0011965305,0.00027202017,0.0008944903,0.004408757,0.00047720262,0.000040961153],"category_scores_gemma":[0.0004365176,0.00066042534,0.00016699698,0.0009033407,0.00073311746,0.0015802118,0.0014615149,0.0013109914,0.00014511777],"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.0000070776127,0.000031907228,0.0002643829,0.000094207346,0.000006345158,0.0002899028,0.0010955356,0.11147433,0.00005915632,0.020510608,0.00000923655,0.8661573],"study_design_scores_gemma":[0.0005611919,0.00017270732,0.00065489503,0.003219557,0.000008569302,0.00030534354,7.6990403e-7,0.90830463,0.0005975418,0.08069646,0.0037219885,0.0017563198],"about_ca_topic_score_codex":0.000057614918,"about_ca_topic_score_gemma":0.00021322464,"teacher_disagreement_score":0.864401,"about_ca_system_score_codex":0.0006285797,"about_ca_system_score_gemma":0.0007320678,"threshold_uncertainty_score":0.9995847},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4403514e-7,0.000063017505,0.50433177,0.00013267194,0.00015345686,0.009513183,0.0000022087802,0.00031263966,0.4854908],"genre_scores_gemma":[0.003956864,0.0000012896415,0.08516402,0.00026829707,0.000666703,0.0053177224,0.0000055097908,0.00011488923,0.9045047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720025,0.000038489234,0.00069391675,0.0008225708,0.0008482089,0.0003965595],"domain_scores_gemma":[0.9974217,0.00004634333,0.00024952713,0.0015201209,0.00048732254,0.000274985],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008983786,0.00045748753,0.00069228985,0.00018620706,0.00007385015,0.00038732964,0.0016883315,0.00042332508,0.00013497465],"category_scores_gemma":[0.000035498022,0.00038583702,0.00020475138,0.000036670823,0.00002774324,0.0005521998,0.00032179584,0.00041417102,0.0016779248],"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.000009882195,0.000011339297,9.142487e-7,0.00008327975,0.00008091816,0.00005032008,0.00010855586,0.021714639,0.000037445097,0.96992284,0.0035250054,0.0044548623],"study_design_scores_gemma":[0.00061354734,0.00007378145,6.984219e-8,0.0003591867,0.00001176966,0.000042633495,0.0000033877209,0.90529436,0.0000072620637,0.038225457,0.054872267,0.00049625646],"about_ca_topic_score_codex":0.000063009116,"about_ca_topic_score_gemma":0.0000127117455,"teacher_disagreement_score":0.93169737,"about_ca_system_score_codex":0.00015852333,"about_ca_system_score_gemma":0.00045240935,"threshold_uncertainty_score":0.99985933},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018923792,0.0007773524,0.022750704,0.00039472088,0.0010879019,0.0012194988,0.00001766105,0.0006254407,0.97293746],"genre_scores_gemma":[0.08655431,0.000028874467,0.011819962,0.0012739851,0.0012341259,0.00010147644,0.000010735338,0.0002754443,0.8987011],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99564886,0.000097611985,0.0012094746,0.0013548206,0.00086743175,0.00082180474],"domain_scores_gemma":[0.99663746,0.00020501274,0.00060309126,0.0020750556,0.00017835316,0.00030103765],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008322958,0.0008360119,0.0010982173,0.00072577724,0.000110592715,0.00035480704,0.002132235,0.00088320446,0.00012225681],"category_scores_gemma":[0.000033788787,0.00084606884,0.0003662961,0.00005391296,0.00012519392,0.0003530197,0.00042269862,0.0010187175,0.0019868196],"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.00003715675,0.000036954458,0.00007346428,0.0001071211,0.00014669541,0.0007035376,0.0007808918,0.00014069425,0.0004413851,0.92794925,0.001979,0.06760383],"study_design_scores_gemma":[0.004009992,0.00024597888,0.00025540873,0.0015997846,0.00008897498,0.0003506563,0.000017067621,0.0075261374,0.0006297065,0.030598272,0.9518244,0.002853601],"about_ca_topic_score_codex":0.00016476528,"about_ca_topic_score_gemma":0.00030688167,"teacher_disagreement_score":0.94984543,"about_ca_system_score_codex":0.0003740093,"about_ca_system_score_gemma":0.00045952588,"threshold_uncertainty_score":0.999399},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034676306,0.0001769749,0.9908352,0.00010970843,0.0017635426,0.00078402256,0.000025526435,0.000487799,0.002349621],"genre_scores_gemma":[0.34870043,0.000013071624,0.6498404,0.00011599466,0.00074039504,0.000013607604,0.00006486504,0.00011237889,0.0003988298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99177015,0.00010896389,0.0014859942,0.0028773278,0.0022381824,0.0015193983],"domain_scores_gemma":[0.99544823,0.0001804884,0.00075646106,0.0026933742,0.00057257805,0.00034886517],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016501987,0.0010786008,0.0011417937,0.0011642792,0.0005712566,0.001484376,0.004828251,0.0006459923,0.000022940352],"category_scores_gemma":[0.000053967382,0.0010814829,0.00030811338,0.0011089806,0.00051065895,0.0018709768,0.0022459554,0.0009850145,0.00008642827],"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.000009906146,0.000102244856,0.000075962605,0.00006414129,0.00002363956,0.00035358634,0.00032123778,0.92813134,0.007116985,0.0022205133,0.000026997972,0.061553452],"study_design_scores_gemma":[0.0003673493,0.00012471044,0.00003251717,0.0007941672,0.000028062566,0.0001225118,2.3536381e-7,0.97912467,0.00088878203,0.017386332,0.0000369005,0.0010937671],"about_ca_topic_score_codex":0.00070351164,"about_ca_topic_score_gemma":0.000048677768,"teacher_disagreement_score":0.34523278,"about_ca_system_score_codex":0.0013802098,"about_ca_system_score_gemma":0.0009841858,"threshold_uncertainty_score":0.9995522},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010822394,0.000021807746,0.99515545,0.0001463962,0.00004179594,0.00089125114,0.000016967406,0.00011259647,0.00253148],"genre_scores_gemma":[0.1574702,0.0000051746892,0.8417721,0.000021158374,0.000029500841,0.00012898573,0.00002974797,0.000008230275,0.0005349134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99892324,0.000037247282,0.0002870128,0.00041253227,0.00019053165,0.0001494097],"domain_scores_gemma":[0.9987784,0.00012195577,0.00014228775,0.00062667945,0.00022125492,0.00010938975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070522353,0.00009137348,0.00016370555,0.00006445665,0.00006861886,0.00006460415,0.0005408736,0.00004582317,0.000005166757],"category_scores_gemma":[0.000048047386,0.000081571714,0.000017439364,0.00017785806,0.000024081754,0.00049103657,0.00030885206,0.000029620904,0.000019166251],"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.0000470448,0.00033816218,0.00026147396,0.0002806873,0.00016088186,0.0000010556487,0.0014858817,0.00071238325,0.42813087,0.52908266,0.009650612,0.02984831],"study_design_scores_gemma":[0.0008370531,0.00018724351,0.000061177925,0.000020999096,0.000025341922,0.00002639771,0.00027023244,0.98160446,0.00989772,0.0056602694,0.0012323925,0.00017673615],"about_ca_topic_score_codex":0.00015929967,"about_ca_topic_score_gemma":0.000018085098,"teacher_disagreement_score":0.98089206,"about_ca_system_score_codex":0.0000329655,"about_ca_system_score_gemma":0.00013097671,"threshold_uncertainty_score":0.33263978},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016086015,0.0058088573,0.9772846,0.0019068869,0.0043866644,0.0015467928,0.0000074138434,0.00086274266,0.006587401],"genre_scores_gemma":[0.29343727,0.00023482816,0.7012896,0.0016004415,0.0025473165,0.000041804306,0.000008129565,0.00016972744,0.0006708998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9870286,0.00018333456,0.0022133936,0.004841929,0.0030648094,0.002667938],"domain_scores_gemma":[0.9918569,0.0010311755,0.0013510482,0.004442456,0.0007037903,0.0006146856],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0029585294,0.0019062198,0.0019266261,0.0015947017,0.001019918,0.0027536831,0.009856697,0.0012096431,0.00007013939],"category_scores_gemma":[0.00033528102,0.0018847313,0.00066662,0.0019574957,0.0011578082,0.0037004715,0.0037967984,0.0035313088,0.0007226314],"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.00002038976,0.00010800237,0.00013353796,0.00024710072,0.000119657634,0.0004239419,0.0024900506,0.71892655,0.0028332316,0.017722424,0.000022460974,0.25695264],"study_design_scores_gemma":[0.0012872926,0.00027325103,0.00009063214,0.0030277553,0.000056170084,0.00065682497,0.0000025676839,0.93865615,0.010399803,0.038843207,0.0038585109,0.002847856],"about_ca_topic_score_codex":0.0001147061,"about_ca_topic_score_gemma":0.00009556158,"teacher_disagreement_score":0.29182866,"about_ca_system_score_codex":0.0014610727,"about_ca_system_score_gemma":0.0024365769,"threshold_uncertainty_score":0.9993682},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.414354e-8,0.00002780088,0.16109967,0.000092262075,0.00041962287,0.009042972,0.0000028317281,0.0004294518,0.8288853],"genre_scores_gemma":[0.00008360824,0.0000021691908,0.08358028,0.00015394013,0.00032892966,0.0024735779,0.00000258556,0.000056940822,0.913318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977714,0.000022899998,0.00053957134,0.0008050098,0.00051191106,0.00034922373],"domain_scores_gemma":[0.99747944,0.000047120368,0.00034639522,0.0017871292,0.00016335469,0.00017653374],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032615266,0.00043322792,0.00049447577,0.0001678354,0.00007082172,0.0002648385,0.0020904448,0.00044274362,0.001775112],"category_scores_gemma":[0.00000687908,0.00036154033,0.00019938167,0.00003880992,0.00004533774,0.00045123376,0.0006018293,0.00035319565,0.0062401183],"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.0000015039019,0.00000744128,0.0000021202281,0.00005267217,0.000031918793,0.0000322072,0.00004862354,4.820609e-7,0.000026579659,0.98107725,0.0069085415,0.011810674],"study_design_scores_gemma":[0.00023526851,0.000105154824,0.000054121385,0.0005004432,0.000008733103,0.000044652676,5.2437963e-7,0.0001511356,0.0003408678,0.13094231,0.86688274,0.00073401834],"about_ca_topic_score_codex":0.00007443762,"about_ca_topic_score_gemma":0.0000074270565,"teacher_disagreement_score":0.8599742,"about_ca_system_score_codex":0.00007594459,"about_ca_system_score_gemma":0.00018765182,"threshold_uncertainty_score":0.99988365},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001883137,0.00019954873,0.98324996,0.0006982044,0.0005353138,0.0010089354,0.0000068819013,0.00069455075,0.011723464],"genre_scores_gemma":[0.18740758,0.000006450959,0.80651635,0.00016013335,0.0011295631,0.00015712406,0.000004104817,0.000033586788,0.0045851283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766314,0.000103817176,0.0005919066,0.00062626385,0.0003915322,0.0006233446],"domain_scores_gemma":[0.99826175,0.00032833673,0.0001981078,0.00074698596,0.0002459079,0.00021890673],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010931254,0.00025065092,0.00044019782,0.00013341106,0.00017973768,0.000609722,0.00097170484,0.00014150422,0.000022815622],"category_scores_gemma":[0.000046824232,0.00021943041,0.00016143433,0.0002659779,0.000026860796,0.0010418174,0.00010844362,0.000113810194,0.0011949943],"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.000040383482,0.00035867476,0.00013619133,0.00023787584,0.0005079995,0.00003481097,0.0012691797,0.10658194,0.0378585,0.13333543,0.0100569865,0.70958203],"study_design_scores_gemma":[0.0012980029,0.00007991594,0.000024544619,0.000051064773,0.000011469393,0.000058884587,0.000039393446,0.99368036,0.0006649533,0.00008205522,0.0037260617,0.00028331907],"about_ca_topic_score_codex":0.00018674303,"about_ca_topic_score_gemma":0.0000035730577,"teacher_disagreement_score":0.8870984,"about_ca_system_score_codex":0.00013804124,"about_ca_system_score_gemma":0.00012536107,"threshold_uncertainty_score":0.9995827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035270985,0.0014568098,0.9583966,0.000034997018,0.0034463217,0.00061439455,0.0000021509982,0.0006037279,0.00017396982],"genre_scores_gemma":[0.45573366,0.00004864032,0.54340357,0.000011165071,0.0006065499,0.00010679504,0.000004661809,0.000044082226,0.000040889998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975886,0.000049484883,0.0006854886,0.0006820831,0.00034587714,0.0006484766],"domain_scores_gemma":[0.998379,0.00037330008,0.00016098467,0.00068688736,0.00016773597,0.00023209435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007729939,0.00033373488,0.0005149084,0.00028683618,0.000051429903,0.00035682446,0.00096983975,0.000116924995,5.3679537e-7],"category_scores_gemma":[0.00008705935,0.00034202353,0.00009991536,0.000465233,0.000015845646,0.002633179,0.00021663297,0.00019911428,0.000045188295],"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.000004807411,0.000024585972,0.00017802788,0.0002506843,0.000012288771,0.000031097035,0.0006540446,0.98705477,0.0010633998,0.0015283577,0.00003380001,0.009164131],"study_design_scores_gemma":[0.00075331004,0.00008881673,0.00015888277,0.00061376154,0.0000039890692,0.000053879572,0.000021141801,0.9965129,0.00048072083,0.00013358421,0.00078004954,0.00039899256],"about_ca_topic_score_codex":0.000044521505,"about_ca_topic_score_gemma":0.0000023586779,"teacher_disagreement_score":0.42046267,"about_ca_system_score_codex":0.0002224651,"about_ca_system_score_gemma":0.00006854458,"threshold_uncertainty_score":0.9999032},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068509705,0.000024816427,0.92024153,0.000118853,0.00026636588,0.00092697446,0.0000021899189,0.00028173495,0.009627825],"genre_scores_gemma":[0.49916673,0.000003609353,0.4941259,0.00006934241,0.000093980634,0.00028940957,0.000019018591,0.000017314685,0.006214698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00010085695,0.00066439866,0.00024740477,0.00033803508,0.00035718508],"domain_scores_gemma":[0.99887836,0.000058978454,0.00023320038,0.0004877289,0.00020918463,0.00013257716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019051448,0.00014795556,0.00027862954,0.0002103552,0.000051555493,0.00048055884,0.0005730472,0.00009026612,0.000001486314],"category_scores_gemma":[0.00012938808,0.00013359774,0.000066412395,0.0002835172,0.000008318671,0.0032014684,0.00015717112,0.0000637381,0.00014875324],"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.000033656022,0.000054761556,0.00038332999,0.00030843038,0.00003139548,0.0000034326624,0.008601054,0.8500636,0.0063150525,0.12243523,0.008554124,0.0032159118],"study_design_scores_gemma":[0.00094931404,0.000025336738,0.000033383978,0.000059785216,0.0000027648084,0.000009919855,0.00010369943,0.9973715,0.00023840515,0.0007599153,0.00027845727,0.00016749396],"about_ca_topic_score_codex":0.0007878547,"about_ca_topic_score_gemma":0.000015801603,"teacher_disagreement_score":0.43065703,"about_ca_system_score_codex":0.0001525681,"about_ca_system_score_gemma":0.00019524553,"threshold_uncertainty_score":0.54479575},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0159225e-8,0.0000051925463,0.35502356,0.000097484015,0.00006832626,0.30870238,0.00000897637,0.00037819747,0.33571586],"genre_scores_gemma":[0.0002848367,9.571936e-7,0.008722431,0.00029738204,0.00032562178,0.68270105,0.0000055476085,0.00011805467,0.3075441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946688,0.00012319471,0.0017290023,0.0015518989,0.0011267808,0.00080031966],"domain_scores_gemma":[0.99614817,0.00012108416,0.00082188915,0.0020001854,0.000359778,0.0005488729],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011512534,0.0010370514,0.0015105638,0.00027380398,0.00018623378,0.000214201,0.0023281707,0.0009502681,0.0025186487],"category_scores_gemma":[0.000009755548,0.0008121943,0.0007077661,0.0000727462,0.000119175005,0.0007935609,0.000048093007,0.0007939602,0.0009136435],"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.0008348198,0.00033102694,0.00009584697,0.0019365862,0.0006793104,0.00056587,0.0006362126,0.00008629463,0.0007572665,0.8631809,0.0059532025,0.124942675],"study_design_scores_gemma":[0.006553656,0.00060001935,0.000028325885,0.0018357604,0.000067876936,0.000079509904,0.0000011706612,0.0028206257,0.00045228156,0.012355159,0.9739757,0.0012298753],"about_ca_topic_score_codex":0.00005004175,"about_ca_topic_score_gemma":0.000008432762,"teacher_disagreement_score":0.9680225,"about_ca_system_score_codex":0.00010530337,"about_ca_system_score_gemma":0.0005946015,"threshold_uncertainty_score":0.9998643},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046992153,0.0005697724,0.98742306,0.000790407,0.0032632612,0.0017609849,0.000012297277,0.0007350142,0.0007460069],"genre_scores_gemma":[0.25027505,0.000001172734,0.7475877,0.00014785142,0.00070014095,0.0005713018,0.0000060473963,0.000048237205,0.0006625159],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675965,0.0001125479,0.00076267077,0.0009487933,0.0005373561,0.0008789726],"domain_scores_gemma":[0.99470514,0.0024454186,0.00019253274,0.0010824018,0.0010343548,0.0005401755],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001897632,0.000365305,0.000637553,0.00018546336,0.00027565422,0.0012121996,0.0015677533,0.00035338674,0.000006275098],"category_scores_gemma":[0.0055077206,0.00031805513,0.000236519,0.00042239076,0.00009671743,0.0014373568,0.00036006488,0.00022396125,0.00020309171],"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.00008691646,0.00042979512,0.00019064019,0.0014939499,0.00018183487,0.00002433079,0.0019805753,0.0133325895,0.0023295665,0.9678664,0.005788697,0.0062946905],"study_design_scores_gemma":[0.0010049525,0.00019197109,0.0000107553815,0.00033997497,0.00003055407,0.000049900027,0.0007483517,0.980319,0.0029760508,0.012623565,0.0012088951,0.0004960024],"about_ca_topic_score_codex":0.00010936484,"about_ca_topic_score_gemma":0.000006124864,"teacher_disagreement_score":0.9669864,"about_ca_system_score_codex":0.00013287374,"about_ca_system_score_gemma":0.0003798641,"threshold_uncertainty_score":0.99992716},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03953574,0.000045452456,0.9497101,0.0024155756,0.00013516155,0.00043969994,5.212884e-7,0.00027671753,0.0074410643],"genre_scores_gemma":[0.65013105,0.0000015666552,0.3482622,0.000059071892,0.00016979038,0.00002858673,0.0000012008725,0.0000060618195,0.0013405003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898094,0.000020794394,0.00015922262,0.00034201008,0.00023193676,0.0002651059],"domain_scores_gemma":[0.99924034,0.000043792963,0.00007892025,0.00046750234,0.00009777353,0.00007167866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039631038,0.00010939571,0.00011854228,0.000053662483,0.00012043355,0.00016403986,0.00035726055,0.000060224098,0.000009910926],"category_scores_gemma":[0.000014777779,0.00008494602,0.000044025954,0.00015928318,0.000017650284,0.0010876295,0.000075870834,0.000066674016,0.00008713942],"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.00013627553,0.00039221754,0.01375211,0.00024148857,0.00011432569,0.0000072568364,0.002911897,0.024731178,0.046558503,0.78474844,0.019182652,0.107223675],"study_design_scores_gemma":[0.00080569123,0.00021759338,0.0038082784,0.000047156875,0.000008866767,0.00003536621,0.000031589796,0.96858746,0.017910305,0.001000681,0.00725077,0.00029622242],"about_ca_topic_score_codex":0.00007802985,"about_ca_topic_score_gemma":0.00021679724,"teacher_disagreement_score":0.9438563,"about_ca_system_score_codex":0.0000842823,"about_ca_system_score_gemma":0.00005847071,"threshold_uncertainty_score":0.3463998},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82788676,0.00073646207,0.04711743,0.00025746148,0.0008609501,0.0005577533,0.0000010097278,0.0004860303,0.122096136],"genre_scores_gemma":[0.9808519,0.000010904125,0.017179249,0.00003918399,0.00006433805,0.000020338939,6.694616e-7,0.000016858921,0.0018165709],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793845,0.00022726887,0.00047463665,0.000547128,0.00040081533,0.0004117024],"domain_scores_gemma":[0.9987727,0.000132743,0.00012165906,0.00061600655,0.00009478911,0.00026210732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001480448,0.00019815259,0.00038117563,0.00017847301,0.000047448222,0.00040585065,0.000585012,0.000104948005,0.000008782832],"category_scores_gemma":[0.000077767385,0.00017428136,0.000035899644,0.00045563473,0.00003312844,0.0010456686,0.00014980664,0.00012847227,0.0001620533],"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.00025139662,0.0010915134,0.037605144,0.0010604091,0.00036290227,0.0021836674,0.14866482,0.08966661,0.22593626,0.3991406,0.059800133,0.034236547],"study_design_scores_gemma":[0.00079536875,0.0000657728,0.00084566517,0.00015625855,0.0000022242455,0.000153766,0.0006274737,0.9956879,0.00048912567,0.0002759006,0.0005850526,0.00031550537],"about_ca_topic_score_codex":0.00063597586,"about_ca_topic_score_gemma":0.0000146588945,"teacher_disagreement_score":0.9060213,"about_ca_system_score_codex":0.00010346829,"about_ca_system_score_gemma":0.00010111277,"threshold_uncertainty_score":0.7106987},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6010295,0.00044122047,0.3886482,0.00050082913,0.00031565747,0.0017037909,0.0000018917345,0.00014952137,0.0072093634],"genre_scores_gemma":[0.99660844,0.0000069299354,0.002704233,0.000019103654,0.000012076593,0.000048011058,4.4834596e-7,0.000009374579,0.0005914139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986071,0.0001232796,0.00043523812,0.00031474742,0.00026037046,0.00025923763],"domain_scores_gemma":[0.99900186,0.00021940499,0.00013025325,0.00042978433,0.000121662655,0.00009704242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063259894,0.00012518629,0.00024163863,0.00008422305,0.00006348322,0.000425966,0.00038788762,0.0000485193,9.4182633e-7],"category_scores_gemma":[0.00018301906,0.000087079294,0.000027882434,0.00030843943,0.000032069434,0.0004059575,0.000046498768,0.000048072445,0.000035884845],"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.00007494857,0.00027601916,0.017411228,0.00050150487,0.00020843506,0.000052504467,0.004458885,0.80378515,0.054953303,0.105714686,0.00041872152,0.012144622],"study_design_scores_gemma":[0.0013401479,0.00035842715,0.0034894408,0.0002639865,0.000013696169,0.00027959576,0.00036661528,0.98648393,0.005990028,0.0005551702,0.00034200476,0.00051697687],"about_ca_topic_score_codex":0.00017088611,"about_ca_topic_score_gemma":0.000018070243,"teacher_disagreement_score":0.3955789,"about_ca_system_score_codex":0.000045068486,"about_ca_system_score_gemma":0.00006949512,"threshold_uncertainty_score":0.41076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23632097,0.00018245385,0.76068705,0.00003197057,0.0007928912,0.0003140327,5.0355345e-7,0.0002119671,0.0014581352],"genre_scores_gemma":[0.71970725,4.8375364e-7,0.28000936,0.000020669606,0.000035725792,0.000009512718,0.0000013627945,0.000011346925,0.00020428177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804443,0.00008913031,0.00051483547,0.00047655654,0.00048308392,0.00039197304],"domain_scores_gemma":[0.9986693,0.00008368353,0.00019922346,0.0006712427,0.00019396184,0.00018255452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010377406,0.00018204123,0.00027158245,0.0002075048,0.0000660471,0.00034632935,0.00067366514,0.000103794606,0.000002594907],"category_scores_gemma":[0.00023849512,0.0001663397,0.000038292885,0.0006383346,0.000036762685,0.0013626032,0.00025795778,0.00012461861,0.00013041185],"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.000011797915,0.00032531362,0.017042087,0.00026582606,0.00002153167,0.00015220756,0.005052527,0.8869228,0.04891595,0.034894604,0.0003159837,0.006079409],"study_design_scores_gemma":[0.00047079264,0.00004594723,0.00040158702,0.00024031202,0.0000026240725,0.0000991112,0.0003065498,0.99720556,0.0007441746,0.00025354893,0.00002381215,0.00020597577],"about_ca_topic_score_codex":0.0019002602,"about_ca_topic_score_gemma":0.00005244839,"teacher_disagreement_score":0.48338628,"about_ca_system_score_codex":0.00035671899,"about_ca_system_score_gemma":0.00018399622,"threshold_uncertainty_score":0.6783136},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000067570254,0.00016768204,0.993592,0.00048278828,0.0029438068,0.0016890726,0.000039417442,0.0006463712,0.00037124462],"genre_scores_gemma":[0.010290219,0.000028479932,0.9875506,0.00029123484,0.0009402761,0.00008373511,0.00003839587,0.00008289564,0.00069415686],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99313504,0.0000960891,0.0010753479,0.002886948,0.0014694262,0.0013371827],"domain_scores_gemma":[0.99184716,0.0032250201,0.0008619716,0.0028840376,0.0007958312,0.000385983],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.002618701,0.0009929105,0.0011355637,0.00091799407,0.00062130543,0.0016902416,0.0073160287,0.00089685776,0.000033702694],"category_scores_gemma":[0.00064744154,0.00091784575,0.00023513126,0.0008821262,0.0008937484,0.0015429024,0.0014343673,0.001203077,0.00016864922],"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.00011015696,0.00019459562,0.00013628931,0.00074149447,0.00017978661,0.00045211308,0.0021739567,0.20380843,0.049334683,0.09805696,0.00033920805,0.6444723],"study_design_scores_gemma":[0.0009406051,0.0006011251,0.00021520392,0.0014067937,0.00004283764,0.00019060221,2.3136843e-7,0.5516502,0.029651208,0.411463,0.0013105059,0.0025276549],"about_ca_topic_score_codex":0.00015969719,"about_ca_topic_score_gemma":0.00005590171,"teacher_disagreement_score":0.64194465,"about_ca_system_score_codex":0.0003906722,"about_ca_system_score_gemma":0.0013241317,"threshold_uncertainty_score":0.9993461},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047852233,0.0003333294,0.9453556,0.00011159568,0.00016855492,0.00047865484,0.0000028056036,0.00008762363,0.0056095826],"genre_scores_gemma":[0.678714,0.0000066684042,0.32101312,0.000076796496,0.000080345315,0.0000064279625,0.0000014341558,0.000024294239,0.000076909004],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960248,0.000036084264,0.0006813379,0.0015753306,0.0010562363,0.00062621565],"domain_scores_gemma":[0.99714077,0.00064638216,0.00053004635,0.0009514525,0.0004974799,0.00023385127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012699782,0.0005597179,0.00078629446,0.00034986387,0.00024980132,0.00072467915,0.0010118405,0.00027952605,0.000010925383],"category_scores_gemma":[0.00007442217,0.0004197101,0.000043036915,0.00066492375,0.0017423948,0.0010171924,0.0006270818,0.00069549994,0.0000039146385],"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.00020819523,0.00047531456,0.45976147,0.0018461202,0.00015022651,0.00031863284,0.0077766683,0.08101157,0.00048839976,0.05281416,0.000008497744,0.39514074],"study_design_scores_gemma":[0.002260969,0.003259222,0.03597511,0.0062713437,0.00009350612,0.001739992,0.000017424753,0.8784878,0.004683965,0.06361322,0.00033370548,0.0032637333],"about_ca_topic_score_codex":0.000086341555,"about_ca_topic_score_gemma":0.00022759468,"teacher_disagreement_score":0.79747623,"about_ca_system_score_codex":0.00012237077,"about_ca_system_score_gemma":0.0005851888,"threshold_uncertainty_score":0.9998255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41434816,0.00035099912,0.5295918,0.00021830821,0.0007298302,0.001138412,0.000009813404,0.0005633177,0.053049333],"genre_scores_gemma":[0.976148,0.0000038798967,0.022740552,0.000024536828,0.00010496427,0.000033000288,0.000004821791,0.000029841009,0.0009104186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99645114,0.00036493206,0.0012228584,0.0006874576,0.0006290054,0.0006445949],"domain_scores_gemma":[0.9976985,0.00036271889,0.0004468962,0.0011050501,0.00025928847,0.00012758846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015253365,0.0003172547,0.00077067176,0.0003656315,0.00006761621,0.00026125944,0.0011392912,0.00020770867,0.000046010766],"category_scores_gemma":[0.000069046975,0.0002900986,0.00014858438,0.0008343528,0.00005778006,0.00078934344,0.00016801435,0.00019746246,0.00030336741],"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.000114650735,0.00089158927,0.030441953,0.00079302094,0.00022331819,0.0003488829,0.0024736512,0.39066288,0.38904837,0.18012916,0.0032685732,0.0016039589],"study_design_scores_gemma":[0.0024710768,0.0001405457,0.008370176,0.00045894313,0.000012669925,0.00007479112,0.00038295382,0.9821434,0.004782848,0.0004829261,0.000069460344,0.0006101786],"about_ca_topic_score_codex":0.0055661243,"about_ca_topic_score_gemma":0.00005615767,"teacher_disagreement_score":0.59148055,"about_ca_system_score_codex":0.00013603114,"about_ca_system_score_gemma":0.00017331255,"threshold_uncertainty_score":0.9999551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005331441,0.0000945693,0.97708094,0.0010550614,0.00074185984,0.0010452212,0.0000046758546,0.0006473494,0.013998896],"genre_scores_gemma":[0.88519114,0.000006008786,0.11189789,0.00016592539,0.00022948392,0.00015124858,0.000002574201,0.000022924884,0.002332814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982431,0.00006406393,0.00043329544,0.00050436874,0.0002944713,0.00046071527],"domain_scores_gemma":[0.99831724,0.00023179421,0.00013572571,0.0008820482,0.00024137482,0.00019179303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065133447,0.000182721,0.00035046722,0.00010704816,0.0001870619,0.00032210618,0.00072263967,0.00009821959,0.000009803646],"category_scores_gemma":[0.00009846445,0.00014850913,0.00013468333,0.00024291966,0.00002619438,0.0005498324,0.000083647545,0.00006901844,0.00064950495],"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.000018424711,0.00013395202,0.000051376544,0.00009603436,0.000102687525,0.000044601813,0.00044598282,0.05118986,0.09236619,0.84777623,0.005340759,0.002433906],"study_design_scores_gemma":[0.004558024,0.00036798487,0.0004433597,0.00023615318,0.0000345899,0.0002848982,0.00010983897,0.9818098,0.002782111,0.00571971,0.0029301024,0.00072344585],"about_ca_topic_score_codex":0.0007039792,"about_ca_topic_score_gemma":0.000006638477,"teacher_disagreement_score":0.9306199,"about_ca_system_score_codex":0.0001013993,"about_ca_system_score_gemma":0.00016068388,"threshold_uncertainty_score":0.8348289},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19731702,0.0033578433,0.7813631,0.0012604328,0.0014298212,0.0133115295,0.0003102142,0.0002511827,0.0013988335],"genre_scores_gemma":[0.8861737,0.00011995944,0.11241955,0.000010669861,0.000026753412,0.00078843464,0.0000012267836,0.000019629204,0.00044003953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975205,0.00044009142,0.00042243753,0.0006060051,0.0004903149,0.0005206707],"domain_scores_gemma":[0.99165446,0.0014033717,0.0002274313,0.00067494204,0.005944509,0.00009527849],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016210433,0.0002149852,0.00048344774,0.00013022978,0.000573816,0.00009859023,0.00082983536,0.000063665946,8.191985e-7],"category_scores_gemma":[0.002055918,0.0001472185,0.00008496083,0.0006583838,0.00024475568,0.0003893191,0.0005165859,0.00017956174,0.0000024318122],"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.0017725341,0.0004261789,0.00030887625,0.005060016,0.0010496522,0.0000090728445,0.17516258,0.039840657,0.018966515,0.73083186,0.00096267374,0.025609396],"study_design_scores_gemma":[0.0040342114,0.0021149428,0.000033763536,0.0035630327,0.000044640514,0.000005760718,0.26641297,0.57144475,0.13280377,0.017666403,0.0011105831,0.0007651471],"about_ca_topic_score_codex":0.000007166349,"about_ca_topic_score_gemma":0.00003166262,"teacher_disagreement_score":0.71316546,"about_ca_system_score_codex":0.0001692859,"about_ca_system_score_gemma":0.00037937638,"threshold_uncertainty_score":0.6003396},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012747543,0.0007977438,0.99704903,0.00017269174,0.0007160532,0.000956459,0.000011547137,0.0000844812,0.00008450612],"genre_scores_gemma":[0.21604997,0.000020047448,0.78361225,0.00006447643,0.0001401624,0.000026090833,0.000021952706,0.000031363732,0.000033715645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970812,0.00004511569,0.00068473094,0.0011330179,0.0006411429,0.00041477857],"domain_scores_gemma":[0.997015,0.0006212286,0.00064693193,0.00081928854,0.00077517075,0.00012236222],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010124376,0.00041792335,0.0006091767,0.00048855226,0.00019152566,0.0005026266,0.0010654234,0.00025087583,7.567462e-7],"category_scores_gemma":[0.0002330997,0.0003574036,0.000056799458,0.00052073254,0.00036967776,0.0005984639,0.0002296837,0.00025243114,9.203745e-7],"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.000007239229,0.000011092385,0.00007501694,0.00026692526,0.0000136068875,0.0000045565293,0.00014928897,0.9823264,0.00006742547,0.0080181435,0.0000014619526,0.009058852],"study_design_scores_gemma":[0.0003460653,0.00018168103,0.000018973602,0.0010096455,0.00001843838,0.00007721101,8.1833144e-7,0.99381137,0.00026086954,0.0038397533,0.0000472137,0.0003879877],"about_ca_topic_score_codex":0.000027415623,"about_ca_topic_score_gemma":0.0000114220275,"teacher_disagreement_score":0.21592249,"about_ca_system_score_codex":0.00015751476,"about_ca_system_score_gemma":0.0003874508,"threshold_uncertainty_score":0.99988776},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3571155,0.00012967295,0.44692907,0.00028345158,0.0006925555,0.00029107032,0.0000025071895,0.00046843576,0.19408771],"genre_scores_gemma":[0.7765485,0.000001361531,0.22278214,0.000036721824,0.00008472135,0.000005423537,0.000001295641,0.000009376269,0.000530449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977018,0.0001392357,0.00053267286,0.00048868096,0.00072849117,0.0004091089],"domain_scores_gemma":[0.998073,0.00007579362,0.00021939649,0.0009915966,0.00031998463,0.00032026574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013132117,0.00019185187,0.00034962906,0.000087478475,0.000051808925,0.000120001714,0.0011323076,0.000100395715,0.000026939442],"category_scores_gemma":[0.00016020158,0.00016609968,0.000105838044,0.00067856704,0.00006148396,0.00032148827,0.00047232065,0.000085822,0.00067629386],"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.00009877497,0.0009771383,0.0031932506,0.0002890817,0.00029977574,0.00021333917,0.0059966184,0.62373054,0.07319118,0.22720897,0.008544838,0.056256503],"study_design_scores_gemma":[0.0011052483,0.00017361408,0.0008507081,0.000108838736,0.000015333751,0.0001155878,0.00042919896,0.96691644,0.028250666,0.0013970517,0.00016513676,0.0004721757],"about_ca_topic_score_codex":0.0007790512,"about_ca_topic_score_gemma":0.000005270299,"teacher_disagreement_score":0.419433,"about_ca_system_score_codex":0.00016887425,"about_ca_system_score_gemma":0.00034091313,"threshold_uncertainty_score":0.8692615},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047342353,0.00008337423,0.53672165,0.00032112203,0.0021529722,0.0013491245,0.00001145267,0.00059237407,0.45872062],"genre_scores_gemma":[0.019840552,0.000004994881,0.3615077,0.001180861,0.0027296897,0.00055338343,0.00023346905,0.00022692699,0.6137224],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9916797,0.00015623235,0.0011722889,0.0027850065,0.002788643,0.0014180928],"domain_scores_gemma":[0.99349767,0.00022578602,0.0012634505,0.0030815762,0.0012842255,0.0006472981],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0036983392,0.0008590871,0.00076196337,0.0018910099,0.0008188149,0.006803202,0.0077380952,0.000724806,0.00006173896],"category_scores_gemma":[0.0004092511,0.0008261432,0.00023299927,0.0013336197,0.0011776694,0.005272791,0.0013258444,0.0014272133,0.00039183412],"study_design_candidate":"design_other","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.000020057978,0.00013432553,0.000039885694,0.00023665802,0.00009174828,0.00006527765,0.006976408,0.0023610645,0.004637809,0.051029254,0.03855126,0.89585626],"study_design_scores_gemma":[0.0015845218,0.00023563419,0.00025498235,0.00054355315,0.000076854165,0.00051189715,0.00032641526,0.2030204,0.00064605504,0.01650969,0.7733004,0.0029896246],"about_ca_topic_score_codex":0.0007589491,"about_ca_topic_score_gemma":0.00039206704,"teacher_disagreement_score":0.8928666,"about_ca_system_score_codex":0.0013551285,"about_ca_system_score_gemma":0.005427967,"threshold_uncertainty_score":0.9994189},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016499493,0.0060882573,0.97151965,0.00070943957,0.0028317806,0.0015805077,0.000025165393,0.0004754019,0.0002702885],"genre_scores_gemma":[0.9951616,0.00017270278,0.0019492197,0.000042283646,0.00020284201,0.0005211172,0.000004824758,0.00007077944,0.0018746603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957734,0.00038710065,0.00073702476,0.0010527283,0.0007028274,0.0013469188],"domain_scores_gemma":[0.9973782,0.00052110275,0.00021274244,0.0009438044,0.00037725517,0.00056693214],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018162121,0.0005092438,0.00080263236,0.00035490814,0.0007198813,0.001041875,0.0006777882,0.00033477065,0.0000031271975],"category_scores_gemma":[0.000049702394,0.00048630984,0.00025286654,0.0007464657,0.00013116788,0.0007506571,0.000007571499,0.0005670606,0.00017192615],"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.0014892933,0.0015948779,0.00012964888,0.003221054,0.0020601202,0.00010119934,0.008476875,0.57525665,0.08407491,0.305386,0.005357202,0.012852177],"study_design_scores_gemma":[0.0039503896,0.001886608,0.000007458213,0.0008153567,0.00019148673,0.001033456,0.0014366424,0.9772083,0.002193498,0.0005226285,0.009419224,0.0013349376],"about_ca_topic_score_codex":0.00033659922,"about_ca_topic_score_gemma":0.000028864331,"teacher_disagreement_score":0.9786621,"about_ca_system_score_codex":0.0006144118,"about_ca_system_score_gemma":0.00073445076,"threshold_uncertainty_score":0.9999951},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07567664,0.000008493215,0.89601,0.00016686627,0.00027182398,0.0006173721,0.000010203637,0.0014376426,0.025800982],"genre_scores_gemma":[0.7091194,4.0358157e-7,0.2904568,0.00005422815,0.00013604702,0.000051807274,0.000010578244,0.00003409336,0.00013667639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969458,0.00013346272,0.00056476914,0.000990319,0.00060186273,0.0007637693],"domain_scores_gemma":[0.9975297,0.00012735509,0.000095368065,0.0014378512,0.00010295805,0.0007067839],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006504763,0.00037164197,0.00045143435,0.00036937447,0.0001826781,0.00067885214,0.001411585,0.000118582124,0.000022714543],"category_scores_gemma":[0.000043210668,0.00034868412,0.00009970213,0.0011224216,0.000009177932,0.0006536071,0.00024260594,0.00017322837,0.0011233761],"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.00002203232,0.0005740254,0.00017655501,0.00029724633,0.00013656316,0.00014413828,0.0048172507,0.73581684,0.13725097,0.100729935,0.0023949775,0.017639441],"study_design_scores_gemma":[0.00019870364,0.00020596341,0.0003706536,0.00015545303,0.000007444112,0.00014129729,0.00007672838,0.9948627,0.003239169,0.000003856564,0.00032288852,0.00041517435],"about_ca_topic_score_codex":0.00025483523,"about_ca_topic_score_gemma":0.0000032788287,"teacher_disagreement_score":0.6334427,"about_ca_system_score_codex":0.00039852108,"about_ca_system_score_gemma":0.000022849206,"threshold_uncertainty_score":0.9998965},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004572902,0.00026292948,0.619783,0.00012865264,0.0014960361,0.001414979,0.00001013245,0.0016957992,0.37520394],"genre_scores_gemma":[0.0010728232,0.00009928681,0.4374675,0.00015568557,0.0019360126,0.0001398218,0.00007577217,0.0004008966,0.5586522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513954,0.000044709752,0.0014349702,0.0014969957,0.001044611,0.0008392018],"domain_scores_gemma":[0.99508464,0.000888324,0.0010338622,0.0017656751,0.000898648,0.00032885885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015617869,0.0008505588,0.0011098433,0.0007683016,0.00031493994,0.00077647076,0.0017309085,0.0010346767,0.000039293045],"category_scores_gemma":[0.000098641875,0.00080377195,0.00043894805,0.00018705774,0.00007120467,0.0013375416,0.00034727497,0.0005310494,0.00046167785],"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.000011123944,0.000015978749,0.0000020555615,0.00034597583,0.0002133861,0.000017512179,0.000108193126,0.0014516416,0.00017704834,0.98373574,0.0017302859,0.012191079],"study_design_scores_gemma":[0.0018416115,0.00037227935,0.000018527331,0.0034208486,0.00016547281,0.00021383476,0.0002267309,0.78374237,0.002113587,0.016413264,0.18800269,0.0034687885],"about_ca_topic_score_codex":0.00049835956,"about_ca_topic_score_gemma":0.000011550527,"teacher_disagreement_score":0.96732247,"about_ca_system_score_codex":0.0004083619,"about_ca_system_score_gemma":0.000420896,"threshold_uncertainty_score":0.9994413},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019334736,0.00068954675,0.9912138,0.0005142022,0.0017391146,0.00044053106,0.0000026961416,0.00022786309,0.0032387539],"genre_scores_gemma":[0.6559134,0.0000732614,0.34203887,0.00075781904,0.00086229015,0.000008510083,0.0000047765084,0.000051151233,0.0002898898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957525,0.00007270091,0.00071682956,0.001808095,0.00082665804,0.00082318776],"domain_scores_gemma":[0.996603,0.00061325385,0.0004597582,0.0017233208,0.00033866012,0.00026197665],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018212706,0.00071931817,0.0007951518,0.0009468511,0.00053357176,0.0017456394,0.0028958581,0.00047530376,0.000005288694],"category_scores_gemma":[0.00018876677,0.0006166403,0.00013392416,0.00070894137,0.0008118997,0.0009063396,0.0018681103,0.00083184964,0.00003188663],"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.0000062530785,0.00002546916,0.0008755331,0.00026100656,0.000032523574,0.000027631995,0.0055261296,0.05048202,0.0016642171,0.06610239,0.000013858135,0.87498295],"study_design_scores_gemma":[0.0002521846,0.00012866751,0.00065356673,0.00073334516,0.000006630733,0.00010165684,0.0000012123162,0.94319826,0.0022364138,0.050681584,0.0011913514,0.0008151125],"about_ca_topic_score_codex":0.000116852236,"about_ca_topic_score_gemma":0.00010183911,"teacher_disagreement_score":0.8927162,"about_ca_system_score_codex":0.0002753642,"about_ca_system_score_gemma":0.00054706034,"threshold_uncertainty_score":0.9996285},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007039127,0.0006684501,0.989992,0.0007605245,0.0032557326,0.00052883883,0.000007434164,0.000092497365,0.0046241083],"genre_scores_gemma":[0.14533408,0.00005806321,0.851519,0.00065503485,0.0008457894,0.000011166706,0.000001602497,0.0000495225,0.0015257467],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518585,0.000078479316,0.0008831095,0.0015001805,0.001646692,0.00070570107],"domain_scores_gemma":[0.99564844,0.00042460606,0.00070566725,0.002731532,0.00032414205,0.00016558431],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.001265362,0.0005609898,0.00068081776,0.0004481898,0.00024572658,0.00035269235,0.007484824,0.00032810695,0.000032734417],"category_scores_gemma":[0.00010250887,0.00040230015,0.000274201,0.00089788187,0.0011252841,0.00081848627,0.002559134,0.000847334,0.000059492653],"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.0000020493915,0.000020679787,0.00017962289,0.00006627916,0.00002290456,0.000030891355,0.0010465387,0.039831035,0.00043459667,0.023484958,0.000025161753,0.9348553],"study_design_scores_gemma":[0.00025585716,0.00010205693,0.000539466,0.001012447,0.000012705157,0.00012379745,3.728975e-7,0.94297093,0.008331734,0.043584485,0.002245203,0.0008209688],"about_ca_topic_score_codex":0.0000639131,"about_ca_topic_score_gemma":0.000042787375,"teacher_disagreement_score":0.9340343,"about_ca_system_score_codex":0.00026681816,"about_ca_system_score_gemma":0.0007843324,"threshold_uncertainty_score":0.9998429},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028628813,0.00004496051,0.9690522,0.00023271755,0.00021986979,0.0005240451,0.00002486225,0.00017333464,0.0010991951],"genre_scores_gemma":[0.5044183,1.8333041e-7,0.49543276,0.000025674553,0.000024412982,0.000029836845,0.000009401903,0.000005739125,0.000053698343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977274,0.00014002089,0.0006573907,0.00060897437,0.00050856284,0.00035766332],"domain_scores_gemma":[0.99673235,0.001022589,0.00021184402,0.0012323598,0.00049602153,0.0003048238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018811655,0.00016912605,0.000602092,0.0002706079,0.00004821628,0.000121214915,0.0008069076,0.00012982497,0.000050705577],"category_scores_gemma":[0.002502762,0.00014236459,0.00017094251,0.0018292558,0.00012624358,0.00032674888,0.00016433204,0.00012536679,0.0000265665],"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.000019061561,0.00012837833,0.0055634426,0.00008426377,0.00024757386,0.0000018289805,0.00034102832,0.008554283,0.000049056245,0.9827057,0.00019752633,0.0021078475],"study_design_scores_gemma":[0.00029898083,0.00019382531,0.006677159,0.000024376612,0.0002687792,0.000002728689,0.00012089667,0.70426834,0.0006413929,0.2871084,0.00016016579,0.00023496718],"about_ca_topic_score_codex":0.0002858728,"about_ca_topic_score_gemma":0.000024262052,"teacher_disagreement_score":0.69571406,"about_ca_system_score_codex":0.000118741824,"about_ca_system_score_gemma":0.00034060766,"threshold_uncertainty_score":0.58054596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7960232,0.00006372518,0.19219927,0.00003623698,0.00015377173,0.000057319347,8.0045e-8,0.000092992705,0.011373408],"genre_scores_gemma":[0.8092075,0.000005328731,0.19024502,0.000020630183,0.000038315422,0.0000010433358,5.4609973e-8,0.0000053752933,0.0004767557],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999096,0.000021668406,0.00023865605,0.00020462384,0.00022240223,0.00021664679],"domain_scores_gemma":[0.99939525,0.000024192932,0.000082778766,0.00039396717,0.00005405589,0.000049765484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016842512,0.000092797665,0.00014882431,0.00007456303,0.00006379184,0.000062623454,0.00047118,0.000036165053,0.00007894217],"category_scores_gemma":[0.000012074124,0.000082394916,0.000042963464,0.0002553832,0.000020507936,0.0008610762,0.00017448667,0.0000639278,0.00006028638],"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.000020309719,0.00043376276,0.12507077,0.0013558513,0.00026079448,0.00006471408,0.009290189,0.16297118,0.5101669,0.058705375,0.0012011084,0.13045909],"study_design_scores_gemma":[0.00010735802,0.000023177,0.0008029694,0.000048055434,0.0000015226811,0.000033666296,0.000013054319,0.9753308,0.023389705,0.000009130259,0.0001374702,0.0001030848],"about_ca_topic_score_codex":0.00006164019,"about_ca_topic_score_gemma":7.0856953e-7,"teacher_disagreement_score":0.81235963,"about_ca_system_score_codex":0.000034277735,"about_ca_system_score_gemma":0.000013137163,"threshold_uncertainty_score":0.33599672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046102513,0.00015916157,0.9024957,0.00064318394,0.0005858287,0.0001434329,1.6653033e-7,0.00041941708,0.049450606],"genre_scores_gemma":[0.62130815,0.000004444226,0.37773818,0.00014741298,0.00006566106,0.000007041145,4.095527e-7,0.000012321896,0.00071640627],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982357,0.00009808922,0.00037144398,0.0004988183,0.00034231783,0.000453646],"domain_scores_gemma":[0.9986859,0.00020003988,0.00009833814,0.0007610592,0.00008672723,0.00016793667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085782935,0.00018939076,0.00021571609,0.00011540263,0.0002781897,0.00043683138,0.00075821154,0.00008056411,0.00007237324],"category_scores_gemma":[0.0002618949,0.0001687341,0.00008339518,0.00045725334,0.000022972052,0.00095674465,0.00015396878,0.00019181968,0.0007014705],"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.0000021304788,0.00008612075,0.007378407,0.00006183349,0.000041306877,0.000060696962,0.0011632809,0.01709861,0.0027219497,0.96619195,0.00031168855,0.004882016],"study_design_scores_gemma":[0.002339243,0.00021858305,0.0041478733,0.0004299329,0.000025924122,0.0007701116,0.0009280264,0.8592951,0.03635072,0.02254777,0.07065791,0.0022887655],"about_ca_topic_score_codex":0.00015460775,"about_ca_topic_score_gemma":0.000053198062,"teacher_disagreement_score":0.94364417,"about_ca_system_score_codex":0.00005608803,"about_ca_system_score_gemma":0.00009346989,"threshold_uncertainty_score":0.90162176},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024046147,0.00029509867,0.96543777,0.0008064809,0.0009284221,0.0013284782,0.000046306875,0.0011425011,0.0059687668],"genre_scores_gemma":[0.87594247,0.00002225888,0.11127118,0.000076027034,0.00017244501,0.000322693,0.000050685532,0.000060274055,0.012081951],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968786,0.00013826693,0.00074132765,0.00088951003,0.000524204,0.0008280808],"domain_scores_gemma":[0.99762326,0.00025935945,0.00024485055,0.0012948054,0.00028910738,0.00028861206],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061867584,0.00037493155,0.0005753985,0.00017099564,0.00025745243,0.0007828258,0.0013643035,0.00018979254,0.00012933442],"category_scores_gemma":[0.000090821406,0.00031889547,0.00022918756,0.00058430375,0.000046816294,0.00091365183,0.00021089248,0.00014761886,0.0016989654],"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.00014478169,0.0036609767,0.0016819559,0.0029882817,0.0020296357,0.00046081963,0.005726652,0.13217779,0.22879721,0.40740684,0.17232597,0.042599093],"study_design_scores_gemma":[0.00083241286,0.00010719063,0.00022720812,0.000101098114,0.000015434298,0.000090092166,0.000054446064,0.99448454,0.0003056274,0.000118996504,0.0032295792,0.00043336887],"about_ca_topic_score_codex":0.00026432957,"about_ca_topic_score_gemma":0.0000071558293,"teacher_disagreement_score":0.8623068,"about_ca_system_score_codex":0.00019978744,"about_ca_system_score_gemma":0.000048686095,"threshold_uncertainty_score":0.9999263},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1465283,0.000054984986,0.83730394,0.00015127771,0.00016867688,0.00043394804,0.000024680145,0.0006089971,0.014725172],"genre_scores_gemma":[0.6141153,0.000009278702,0.38552585,0.000016826227,0.000019678924,0.000040264265,0.0000035843916,0.000013591079,0.00025559086],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782324,0.00017980885,0.00073126954,0.000468583,0.00044228812,0.0003547866],"domain_scores_gemma":[0.997923,0.0006329964,0.0003040434,0.0008975136,0.0001250994,0.00011733953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003384104,0.00019658645,0.00036810344,0.00020111252,0.00013644123,0.000116676674,0.00073105015,0.00006495538,0.00086855807],"category_scores_gemma":[0.000099748475,0.00018213202,0.00012250664,0.0005388804,0.000032672306,0.0010415546,0.00021172254,0.00007000571,0.00033356762],"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.000012883679,0.002437231,0.0044186786,0.00052547595,0.0017072632,0.00012075367,0.061949756,0.048915487,0.39931747,0.10722579,0.008956084,0.36441314],"study_design_scores_gemma":[0.00028875648,0.000018006835,0.0005489358,0.00008921317,0.000022388023,0.000004891871,0.00024760625,0.98281455,0.015325956,0.00044134364,0.000011264918,0.00018711494],"about_ca_topic_score_codex":0.0028733867,"about_ca_topic_score_gemma":0.0000520345,"teacher_disagreement_score":0.93389904,"about_ca_system_score_codex":0.000078052355,"about_ca_system_score_gemma":0.000034822046,"threshold_uncertainty_score":0.9510102},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033083457,0.00016736939,0.9647894,0.00023255032,0.00024635394,0.00020839018,0.00001122862,0.00014111953,0.0011201634],"genre_scores_gemma":[0.46519807,0.000011867166,0.5345543,0.000042684856,0.000036840247,0.000012819723,0.0000034504305,0.0000061976098,0.00013376655],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984436,0.000065879845,0.0005041548,0.0003824454,0.00034589862,0.00025799923],"domain_scores_gemma":[0.99878955,0.00023659022,0.00022051623,0.00049982994,0.00016492601,0.000088578454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001902558,0.00013620353,0.00018957595,0.000092353344,0.00013843646,0.00015921396,0.00071426225,0.000046240566,0.00010777237],"category_scores_gemma":[0.00008211445,0.00012487282,0.00006365282,0.00046173122,0.000029707004,0.00073274167,0.00016425415,0.00007961525,0.00005276263],"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.0000035068833,0.0006680623,0.026410608,0.00022937522,0.0003689683,0.000030339723,0.0246751,0.3132952,0.38683227,0.06015939,0.0039572422,0.18336996],"study_design_scores_gemma":[0.00025798113,0.00003268626,0.00051256374,0.000031416985,0.000007687021,0.000005010054,0.0002238155,0.98201185,0.01606557,0.0006727352,0.000020263702,0.00015844374],"about_ca_topic_score_codex":0.00082712615,"about_ca_topic_score_gemma":0.00014000789,"teacher_disagreement_score":0.66871667,"about_ca_system_score_codex":0.000022244098,"about_ca_system_score_gemma":0.00002879556,"threshold_uncertainty_score":0.50921655},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4824718,0.00018388848,0.5160307,0.00012317624,0.00010288371,0.00006163723,1.17558024e-7,0.000040343974,0.0009854321],"genre_scores_gemma":[0.6435875,0.0000024713754,0.35635772,0.0000121632265,0.0000181393,0.0000014536687,0.0000016046771,0.0000027110893,0.000016206724],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991291,0.00015303813,0.00027668168,0.00013962007,0.00021120082,0.000090336966],"domain_scores_gemma":[0.99897367,0.00003011339,0.00015214182,0.0005938557,0.00019603586,0.000054188986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940458,0.000066798246,0.00012083887,0.000071324605,0.00004364651,0.00010151269,0.00056151993,0.00003350958,0.0000034955112],"category_scores_gemma":[0.00003389122,0.00005858833,0.000021192192,0.00014974717,0.000030403307,0.0006647001,0.00024911956,0.0000466327,0.000020144493],"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.0000066098887,0.00014642846,0.002789216,0.000032466633,0.000048933085,0.0000011542497,0.0036048482,0.07391211,0.63792443,0.27194563,0.00041283455,0.009175322],"study_design_scores_gemma":[0.00013414973,0.000020264588,0.00012791324,0.000028321721,0.0000021798921,0.000006296197,0.00017995042,0.83752894,0.16135661,0.00050724554,0.000043434855,0.00006470559],"about_ca_topic_score_codex":0.0004940966,"about_ca_topic_score_gemma":0.000024321582,"teacher_disagreement_score":0.7636168,"about_ca_system_score_codex":0.000053510976,"about_ca_system_score_gemma":0.00006036956,"threshold_uncertainty_score":0.2389163},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18973365,0.000010182595,0.8095835,0.00004746007,0.000052989457,0.00033629785,2.608282e-7,0.00010135938,0.00013431984],"genre_scores_gemma":[0.75463647,3.7907938e-8,0.24529308,0.00003465667,0.00001036732,0.000014172926,6.5672606e-7,0.0000042061397,0.000006356644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990585,0.00012938172,0.00028539516,0.00022343734,0.00016862559,0.00013470069],"domain_scores_gemma":[0.9994101,0.000048817088,0.00012857342,0.0002745188,0.00006964689,0.00006835707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005399,0.00008384753,0.0001542441,0.000077327306,0.000023519986,0.0000987813,0.00026096863,0.00002960573,0.000005480915],"category_scores_gemma":[0.000004556939,0.00007115871,0.000021524078,0.000105925305,0.000014833432,0.0004343489,0.00002517689,0.000028234716,0.000008092411],"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.00014786734,0.00032069758,0.00321553,0.0010579897,0.00027979817,0.00011284165,0.0182635,0.1547204,0.16897549,0.5476431,0.000114180104,0.10514857],"study_design_scores_gemma":[0.0030067547,0.0004428701,0.0010422328,0.000071302595,0.00000990669,0.000028731296,0.00080497045,0.8007665,0.19345924,0.00023977333,0.0000023078285,0.000125355],"about_ca_topic_score_codex":0.0007348078,"about_ca_topic_score_gemma":0.000036757596,"teacher_disagreement_score":0.64604616,"about_ca_system_score_codex":0.00005737194,"about_ca_system_score_gemma":0.00009018359,"threshold_uncertainty_score":0.2901768},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45037255,0.00009989477,0.48768297,0.00025821675,0.00032633916,0.00034715148,1.9961952e-7,0.00043029577,0.06048237],"genre_scores_gemma":[0.96751857,0.000018815868,0.03072986,0.00009074975,0.000048619728,0.000016088363,9.595249e-7,0.000020391839,0.0015559376],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979927,0.0002701768,0.00042515175,0.0005277808,0.0002336349,0.0005505722],"domain_scores_gemma":[0.999022,0.00012306878,0.000029349745,0.00063212746,0.000041820775,0.0001516519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008985752,0.00019865402,0.00028621234,0.00014716135,0.000063105545,0.0002570864,0.00062230515,0.00014572329,0.00013385792],"category_scores_gemma":[0.000024488643,0.00017966407,0.00009019582,0.00079166726,0.000023705094,0.0006978169,0.000027709772,0.00019646726,0.00033806925],"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.000040781604,0.0006685338,0.0024348083,0.00008002671,0.000100618934,0.0004587895,0.008015053,0.4274046,0.030928629,0.45310423,0.003919365,0.07284456],"study_design_scores_gemma":[0.0011831063,0.00015062153,0.0028863274,0.00007805569,0.0000063217226,0.0000990535,0.00007209605,0.9904944,0.0029191303,0.00045613002,0.0010117494,0.000643049],"about_ca_topic_score_codex":0.00026411106,"about_ca_topic_score_gemma":0.000087214896,"teacher_disagreement_score":0.5630897,"about_ca_system_score_codex":0.000067492685,"about_ca_system_score_gemma":0.000081597704,"threshold_uncertainty_score":0.7326488},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56563145,0.06783693,0.34318247,0.011237675,0.0048203915,0.0021726287,0.000010437165,0.0011419753,0.00396602],"genre_scores_gemma":[0.99151915,0.00054346543,0.0017939135,0.00006797453,0.0023724765,0.000071231436,0.000008639584,0.000045608464,0.003577552],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731904,0.0002336392,0.00040638077,0.00073443167,0.0004631831,0.0008432952],"domain_scores_gemma":[0.9983311,0.000050213865,0.00020767734,0.0007724759,0.00024789426,0.00039059433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009654743,0.00036264243,0.0004959533,0.00012839353,0.0001410318,0.0006204412,0.0004957436,0.00020324194,0.0000013690625],"category_scores_gemma":[0.000012502509,0.00030249014,0.00005173785,0.0005422318,0.0000632014,0.0008640765,0.00014619931,0.00038886972,0.000067877765],"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.00045697365,0.0008678189,0.020204633,0.0020797788,0.0017863619,0.00070486363,0.016615191,0.012135354,0.11545956,0.19315335,0.55043,0.08610614],"study_design_scores_gemma":[0.0032612907,0.0010175274,0.0009483627,0.00025765583,0.00006865355,0.0019565155,0.0008708002,0.4022951,0.0010903405,0.0012511624,0.5857688,0.0012137676],"about_ca_topic_score_codex":0.0003180244,"about_ca_topic_score_gemma":0.000039272043,"teacher_disagreement_score":0.42588767,"about_ca_system_score_codex":0.00019069173,"about_ca_system_score_gemma":0.0002732986,"threshold_uncertainty_score":0.9999427},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21027696,0.000006018353,0.7830375,0.00034221704,0.00016941829,0.00022731685,1.6236703e-7,0.000119445045,0.0058209966],"genre_scores_gemma":[0.7259057,6.624226e-8,0.27393818,0.000049033806,0.000008087778,0.00000969098,0.000002136639,0.0000029926891,0.00008409765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914426,0.000059116417,0.00022122524,0.00014890124,0.0003049594,0.00012152658],"domain_scores_gemma":[0.99937344,0.000025488493,0.000105479536,0.0002908925,0.00012266373,0.00008206405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003605544,0.000060095306,0.000098550576,0.00005941495,0.000013129798,0.00007486053,0.00029863656,0.000021349246,0.0000050033696],"category_scores_gemma":[0.000027355993,0.000049768274,0.000024018673,0.00026961544,0.000020364221,0.00041224627,0.000041497926,0.000027968368,0.00005961754],"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.000045390836,0.00079922954,0.060581632,0.0004612509,0.00009520926,0.000025852067,0.0108526135,0.01158125,0.011565575,0.18986185,0.0033192122,0.71081096],"study_design_scores_gemma":[0.001604234,0.00053833524,0.0011629432,0.00007957781,0.0000067093265,0.000008477347,0.00067246536,0.9406842,0.050960552,0.0035060805,0.00054242346,0.000234025],"about_ca_topic_score_codex":0.00017520563,"about_ca_topic_score_gemma":0.000011173944,"teacher_disagreement_score":0.92910296,"about_ca_system_score_codex":0.000035241614,"about_ca_system_score_gemma":0.0001508988,"threshold_uncertainty_score":0.20294914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5235418,0.00019177853,0.38693053,0.00037617452,0.00037340322,0.0006977089,0.0000010386734,0.00053749053,0.0873501],"genre_scores_gemma":[0.9772115,6.1353023e-7,0.019174695,0.000028580202,0.00020097164,0.000035044053,0.0000020547004,0.000013274299,0.0033332724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976248,0.00019717969,0.0005496332,0.00070622674,0.00043915075,0.00048296998],"domain_scores_gemma":[0.9987246,0.00019732132,0.00011419725,0.0008130611,0.000049563576,0.00010129916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335037,0.00018076264,0.00029825312,0.00019773803,0.00009163862,0.00043932398,0.0011375158,0.000121995276,0.0000061841915],"category_scores_gemma":[0.000057912657,0.00016192031,0.00006380641,0.0005650843,0.00003635014,0.000580287,0.0005191043,0.00030923274,0.000076047734],"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.00003817213,0.00030359766,0.12229213,0.00024116687,0.000033348788,0.00023746856,0.003214059,0.03342942,0.0054402016,0.82959735,0.001892541,0.0032805258],"study_design_scores_gemma":[0.0008369844,0.000072198156,0.12874211,0.00027652094,0.0000036739673,0.00008899109,0.00013854764,0.86185855,0.0010979656,0.0030224281,0.003336052,0.0005259782],"about_ca_topic_score_codex":0.0044696503,"about_ca_topic_score_gemma":0.00016857802,"teacher_disagreement_score":0.8284291,"about_ca_system_score_codex":0.00016275267,"about_ca_system_score_gemma":0.000063825486,"threshold_uncertainty_score":0.6756804},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8230973,0.000023115752,0.0377186,0.0015142603,0.00045620865,0.0021220706,5.1464383e-7,0.0024356768,0.13263226],"genre_scores_gemma":[0.77884096,0.000004123737,0.21106368,0.00022955841,0.00020382108,0.0003095378,0.000002574501,0.00003927483,0.009306459],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978035,0.000049093578,0.00039011487,0.0006685018,0.0004980974,0.00059067615],"domain_scores_gemma":[0.99844706,0.00008717607,0.000154436,0.00086821953,0.0002061593,0.00023696349],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033137004,0.000254923,0.00026524055,0.00014668982,0.00015898727,0.0009166372,0.0012411447,0.00010923139,0.0002765617],"category_scores_gemma":[0.000053772976,0.00019790078,0.000078700854,0.000560162,0.000030867122,0.0014366817,0.0002335809,0.00015867327,0.006837872],"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.000024873616,0.00089083635,0.0049668797,0.0005616503,0.00020336194,0.00014466167,0.0058973464,0.0004934175,0.17531767,0.233972,0.03887705,0.5386503],"study_design_scores_gemma":[0.0028611773,0.0018619552,0.020834176,0.00093351543,0.0000378186,0.0002640337,0.0010297594,0.8212708,0.12049523,0.009292252,0.016898697,0.0042205453],"about_ca_topic_score_codex":0.00041826928,"about_ca_topic_score_gemma":0.0000028504785,"teacher_disagreement_score":0.8207774,"about_ca_system_score_codex":0.00007108484,"about_ca_system_score_gemma":0.00009293213,"threshold_uncertainty_score":0.9939354},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30317098,0.00014806911,0.69420975,0.00047122504,0.0002081654,0.00044527795,4.4128402e-7,0.00037794208,0.0009681184],"genre_scores_gemma":[0.73728484,0.000015267558,0.2624276,0.00008906081,0.000072106566,0.00004780247,0.0000038274575,0.000016892896,0.000042641812],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976363,0.000462258,0.0006697666,0.000554318,0.00032454001,0.00035280184],"domain_scores_gemma":[0.99776375,0.0009729381,0.0001658447,0.0005150984,0.00044067515,0.0001417045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015445119,0.00023234198,0.00025741666,0.00020542147,0.00023527675,0.00086021924,0.0005077378,0.000101747086,0.0000182702],"category_scores_gemma":[0.0022661646,0.00020978406,0.000031901836,0.00083629193,0.000079297104,0.0022213245,0.0001681895,0.00022893302,0.00020589291],"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.000012757721,0.00094224524,0.32519248,0.0010912571,0.000074720774,0.00010232672,0.020705448,0.009705152,0.121834405,0.28749436,0.0013785915,0.23146625],"study_design_scores_gemma":[0.00030444225,0.00009654256,0.12861644,0.0002563633,0.0000055379583,0.000052685078,0.00013244584,0.85888684,0.0022627478,0.008989057,0.00008118273,0.0003157448],"about_ca_topic_score_codex":0.00038046646,"about_ca_topic_score_gemma":0.000026882695,"teacher_disagreement_score":0.84918165,"about_ca_system_score_codex":0.00006220473,"about_ca_system_score_gemma":0.00010209101,"threshold_uncertainty_score":0.85547453},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16641311,0.001739966,0.8293416,0.0001151731,0.0018116361,0.00026098636,0.000002222831,0.00010039487,0.00021490705],"genre_scores_gemma":[0.71294224,0.000020960118,0.2850299,0.000040904764,0.0018687471,0.0000053259078,0.000001158607,0.000037742833,0.000053054147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960526,0.0005710754,0.0013420187,0.00026522935,0.00082011055,0.00094896636],"domain_scores_gemma":[0.99590266,0.0015271369,0.000917145,0.0005985174,0.00072262523,0.00033192936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00915401,0.00033397146,0.0006435365,0.00027007874,0.00054735487,0.00036109512,0.0017983221,0.0001360831,0.0000033909648],"category_scores_gemma":[0.00021797388,0.0002280151,0.00027383858,0.00052803406,0.000060993225,0.0010686277,0.00033244287,0.0003555006,0.000026073523],"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.0000628973,0.0005851513,0.00033648981,0.000331516,0.0005551122,0.000032167703,0.025818463,0.64695936,0.11743461,0.006044589,0.0006829745,0.20115665],"study_design_scores_gemma":[0.00066345686,0.00009652046,0.00005194001,0.00037042372,0.000056786044,0.0010263241,0.0014521183,0.99161595,0.004136242,0.000046563575,0.0002061716,0.0002774986],"about_ca_topic_score_codex":0.00013033708,"about_ca_topic_score_gemma":3.2406308e-7,"teacher_disagreement_score":0.5465291,"about_ca_system_score_codex":0.00018338299,"about_ca_system_score_gemma":0.00017594689,"threshold_uncertainty_score":0.9298186},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.955173,0.0012606842,0.00077419315,0.0031892837,0.0010948051,0.0035902814,0.000053391155,0.0054062004,0.029458148],"genre_scores_gemma":[0.80707514,0.000017540942,0.19179717,0.0005284024,0.00021929179,0.00011458293,0.000007964311,0.00010380274,0.0001361215],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9932912,0.00032627227,0.0020620972,0.0017158937,0.0012941416,0.0013103804],"domain_scores_gemma":[0.99411523,0.0011084875,0.00082680647,0.0025754683,0.00062371173,0.00075031945],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016542027,0.00094392436,0.0015891356,0.00036666595,0.00031536722,0.0002751425,0.0028193868,0.0008879376,0.000044750785],"category_scores_gemma":[0.0034904368,0.00080719526,0.00051740016,0.0015966898,0.00091800134,0.0012717868,0.0014127102,0.0012570212,0.000059222057],"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.00015890179,0.0003098405,0.00017474256,0.00006661083,0.00005337856,0.000055809956,0.0000877225,0.0002964215,0.9878755,0.0030571823,0.00018661247,0.0076772333],"study_design_scores_gemma":[0.00851808,0.0061033666,0.9531413,0.0018705797,0.0003035423,0.0012652461,0.0004262496,0.0005531927,0.008915292,0.006832443,0.008450858,0.003619885],"about_ca_topic_score_codex":0.00036640503,"about_ca_topic_score_gemma":0.00931395,"teacher_disagreement_score":0.9789603,"about_ca_system_score_codex":0.0004705925,"about_ca_system_score_gemma":0.00050952786,"threshold_uncertainty_score":0.99943787},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056774467,0.0005415236,0.7615368,0.003801976,0.0007962112,0.0012584039,0.000009328417,0.0038394816,0.17144185],"genre_scores_gemma":[0.4691071,0.000069985974,0.5293167,0.000073993506,0.00023235766,0.00006676656,0.000019854431,0.0000275484,0.0010856625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972632,0.00073345675,0.00071324385,0.0005253886,0.00034303594,0.0004216581],"domain_scores_gemma":[0.9936334,0.00032239247,0.0001664032,0.0055174734,0.00018114831,0.00017919252],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007292867,0.00024255252,0.00034205313,0.00015153993,0.00086753274,0.0009741799,0.0056286626,0.00010320547,0.00008210606],"category_scores_gemma":[0.000013041726,0.0002493732,0.00013576559,0.0006385935,0.00009924446,0.0010304347,0.001427192,0.00027552852,0.002758038],"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.000021266515,0.00092488824,0.00076498464,0.00038948678,0.0005750893,0.00016683062,0.019253798,0.02975305,0.034342952,0.5307772,0.03266924,0.35036117],"study_design_scores_gemma":[0.00033962264,0.0000456044,0.00093019305,0.00025396224,0.00001264201,0.0001826602,0.000042165644,0.99296135,0.00024749793,0.0001548094,0.004487991,0.00034151043],"about_ca_topic_score_codex":0.0004922808,"about_ca_topic_score_gemma":0.000014210003,"teacher_disagreement_score":0.9632083,"about_ca_system_score_codex":0.0001529702,"about_ca_system_score_gemma":0.00014167906,"threshold_uncertainty_score":0.9999958},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10194162,0.02100188,0.8732649,0.00010792779,0.001828723,0.0014205178,0.000008846317,0.00011225541,0.00031330757],"genre_scores_gemma":[0.99736464,0.00010557641,0.001885696,0.000061438215,0.00034402954,0.0001113528,0.0000019564254,0.000034219374,0.00009106996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539834,0.00037340343,0.0019502043,0.00078433275,0.00067701645,0.0008167219],"domain_scores_gemma":[0.99675995,0.0011630545,0.0006176556,0.00081695995,0.00032753582,0.00031487268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004067666,0.0004220011,0.00115218,0.0004542535,0.00011766999,0.00033036974,0.00094082823,0.00033386183,0.0000029263479],"category_scores_gemma":[0.0004237201,0.0003569446,0.00017606768,0.00053674926,0.00010180126,0.0006232759,0.00011402927,0.0004204237,0.0000336746],"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.0007762082,0.0008476467,0.19725408,0.00591705,0.00095665915,0.00031323082,0.012032001,0.36491236,0.03619865,0.3579955,0.000049671202,0.022746935],"study_design_scores_gemma":[0.0019554337,0.000206146,0.0031385133,0.0022944235,0.00003283382,0.000077817174,0.0026910114,0.9872656,0.00092930184,0.00025254558,0.0006222442,0.00053414283],"about_ca_topic_score_codex":0.0010906768,"about_ca_topic_score_gemma":0.00002773851,"teacher_disagreement_score":0.89542305,"about_ca_system_score_codex":0.00013850517,"about_ca_system_score_gemma":0.00008976978,"threshold_uncertainty_score":0.99988824},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98913914,0.00030763814,0.0035218014,0.00016518567,0.00016729302,0.002114931,0.000010361696,0.00014384903,0.0044297967],"genre_scores_gemma":[0.9916369,0.00006726561,0.007824453,0.0000056123004,0.00008413546,0.00028985433,0.0000184469,0.000018942865,0.000054414984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960892,0.0008309733,0.0010552893,0.0006703407,0.0008994552,0.0004547161],"domain_scores_gemma":[0.9980332,0.00016960656,0.00054747507,0.0005755891,0.00048397933,0.0001901306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031496214,0.0002725846,0.00055550307,0.00018363031,0.00010899398,0.00038001544,0.00029687857,0.00014924713,0.00007340889],"category_scores_gemma":[0.0000781791,0.0002698919,0.000052449683,0.0006169274,0.0000638905,0.0014196448,0.00017397532,0.00008193761,0.00016080044],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00006438231,0.000381817,0.17207922,0.0017717199,0.00044084125,0.000028234843,0.006586601,0.024167428,0.6898836,0.039829474,0.0014825743,0.06328409],"study_design_scores_gemma":[0.0020765169,0.00014629212,0.11105522,0.00046066628,0.000053791344,0.00010571259,0.0007587025,0.8826782,0.0009278903,0.0013260837,0.000011292807,0.00039961524],"about_ca_topic_score_codex":0.015141729,"about_ca_topic_score_gemma":0.00010129802,"teacher_disagreement_score":0.8585108,"about_ca_system_score_codex":0.0003178429,"about_ca_system_score_gemma":0.00022122925,"threshold_uncertainty_score":0.9999753},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12405926,0.00015988563,0.7802406,0.0013659851,0.0013639154,0.0024628183,0.00003085493,0.0037327565,0.086583905],"genre_scores_gemma":[0.9489965,0.0000018710225,0.046155117,0.00002451927,0.00035374798,0.00015464806,0.00015521268,0.000034891433,0.004123497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964359,0.00025101285,0.00094097585,0.0009107908,0.0007817901,0.00067952013],"domain_scores_gemma":[0.9970737,0.00026131584,0.00045299449,0.0018107373,0.00021606464,0.0001851965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012461562,0.00034448082,0.00047222394,0.00014338669,0.0002771776,0.0007496771,0.0010863785,0.00017084341,0.000009939085],"category_scores_gemma":[0.00008026606,0.00029675782,0.00015455724,0.0005868038,0.00005771524,0.0007189858,0.00036237008,0.0002181492,0.00042599154],"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.00033992904,0.004798976,0.026211051,0.0014498879,0.00047958034,0.020972814,0.0010236881,0.05652654,0.01802671,0.58917433,0.25468546,0.026311034],"study_design_scores_gemma":[0.0025139083,0.0026411412,0.036079414,0.0015809931,0.000111809044,0.014486185,0.00033532878,0.87509084,0.0066010454,0.002312051,0.054779585,0.0034676974],"about_ca_topic_score_codex":0.0046353275,"about_ca_topic_score_gemma":0.00001530996,"teacher_disagreement_score":0.8249372,"about_ca_system_score_codex":0.00024574398,"about_ca_system_score_gemma":0.00012588549,"threshold_uncertainty_score":0.99994844},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1303513,0.00003139126,0.86534345,0.0011641248,0.00041103456,0.000868418,3.8660008e-7,0.00018599273,0.0016438757],"genre_scores_gemma":[0.5720695,9.4755836e-7,0.42657226,0.00021155301,0.0000658688,0.00037998988,0.0000017781011,0.000008269059,0.0006898094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987727,0.00005345794,0.0003060163,0.00031525074,0.0002929859,0.000259591],"domain_scores_gemma":[0.9991086,0.00016577281,0.00010286517,0.00036910907,0.00017624472,0.000077405355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002260803,0.000121398014,0.00012623366,0.0000832802,0.00014999979,0.00057879416,0.00043147214,0.00006179209,0.00015394135],"category_scores_gemma":[0.00015798623,0.00009429957,0.00004937405,0.00019434384,0.000020950552,0.0022687302,0.00013078852,0.000084983476,0.00019570264],"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.000030575928,0.00021632169,0.0045085466,0.00075037644,0.00016972603,0.0000018711886,0.0074680503,0.006192747,0.03624152,0.79822737,0.0089016175,0.1372913],"study_design_scores_gemma":[0.00054819754,0.00014711889,0.005864508,0.00022183586,0.000007250377,0.000015938014,0.0009475814,0.89133674,0.011402322,0.08865501,0.000509786,0.00034372424],"about_ca_topic_score_codex":0.00027681072,"about_ca_topic_score_gemma":0.0000083035975,"teacher_disagreement_score":0.885144,"about_ca_system_score_codex":0.000056864556,"about_ca_system_score_gemma":0.00008386123,"threshold_uncertainty_score":0.5581325},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5279639,0.00015100057,0.46912745,0.000063232466,0.0002537066,0.0003714495,9.2676765e-7,0.000110119516,0.0019582605],"genre_scores_gemma":[0.9476269,0.0000018688221,0.0514721,0.000013817705,0.000014990183,0.000043583223,0.0000011327396,0.0000071571053,0.0008184547],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832016,0.00013365367,0.0006400745,0.0003840736,0.00024036343,0.0002816626],"domain_scores_gemma":[0.9985823,0.00012387543,0.0001965472,0.0008132643,0.0001694978,0.00011453187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468043,0.00013921031,0.000450538,0.000682158,0.00003532435,0.00018682932,0.00056776864,0.00008511165,0.000048990656],"category_scores_gemma":[0.00005286882,0.000112815396,0.0001185818,0.0020757192,0.000024699819,0.0008062214,0.00013619383,0.00009363629,0.00018225604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.000012867352,0.0017787366,0.52692044,0.00089377654,0.0035178065,0.005645412,0.022580031,0.21164781,0.023963092,0.1816016,0.0011397578,0.020298667],"study_design_scores_gemma":[0.00018941604,0.000019274305,0.011827695,0.000037004516,0.000036274327,0.00009083722,0.00026604664,0.9871486,0.00019241137,0.000029417102,0.000012354639,0.00015066289],"about_ca_topic_score_codex":0.05296575,"about_ca_topic_score_gemma":0.0010788809,"teacher_disagreement_score":0.7755008,"about_ca_system_score_codex":0.00007613845,"about_ca_system_score_gemma":0.000043298947,"threshold_uncertainty_score":0.95334065},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.717221,0.00004956722,0.25431997,0.0004399874,0.00031998113,0.00018665634,0.0000037573443,0.00011018424,0.027348913],"genre_scores_gemma":[0.975354,0.0000021500086,0.02249008,0.00002759668,0.000046330817,0.000001068106,9.258671e-7,0.000003599494,0.0020742612],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992561,0.000034304696,0.00026077966,0.00012504542,0.0002272749,0.00009652067],"domain_scores_gemma":[0.99927056,0.000034664736,0.00014187758,0.0004563018,0.00007443081,0.000022180615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025219316,0.00005174257,0.00010887135,0.000040878705,0.000028700875,0.000012975489,0.00050142955,0.000032964123,0.000041727613],"category_scores_gemma":[0.00002676546,0.000033266482,0.00005070304,0.0003260796,0.000025228257,0.00020701035,0.00014543506,0.000052165884,0.000013982879],"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.00002391041,0.000890734,0.1599167,0.00018912785,0.00019304254,0.000011248145,0.0060092127,0.022649474,0.72076327,0.03989509,0.0062463107,0.04321187],"study_design_scores_gemma":[0.00037328489,0.000096011725,0.10505337,0.00016341441,0.000010063446,0.000058389538,0.00009634716,0.85247767,0.04026108,0.00039653786,0.00091382576,0.00009998986],"about_ca_topic_score_codex":0.00012524534,"about_ca_topic_score_gemma":0.000003887455,"teacher_disagreement_score":0.8298282,"about_ca_system_score_codex":0.000012287256,"about_ca_system_score_gemma":0.000034230186,"threshold_uncertainty_score":0.13565677},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7071075,0.00004481944,0.25742117,0.029529583,0.004069098,0.0008295623,0.0000048542624,0.00044795193,0.0005455022],"genre_scores_gemma":[0.7809214,7.745277e-7,0.21096025,0.007067344,0.0006435928,0.00012616473,0.0000055103646,0.000038677437,0.00023629982],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.997742,0.000066785935,0.00040555073,0.00067127805,0.0004888659,0.00062552455],"domain_scores_gemma":[0.9967599,0.00070487475,0.00019372687,0.0020440978,0.00009147047,0.00020593518],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006230882,0.00026642546,0.00029858036,0.00013024798,0.00020120702,0.00031491762,0.0027556638,0.00012369813,0.000029786384],"category_scores_gemma":[0.00064226077,0.00025381372,0.00016753962,0.00028545203,0.0000731753,0.00084135693,0.00044287558,0.00037716297,0.00014501656],"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.000014927837,0.00003595011,0.00034831147,0.00007700664,0.0000671677,0.000068627494,0.00079313153,0.00030309008,0.92779016,0.0024016823,0.049814794,0.018285157],"study_design_scores_gemma":[0.008195132,0.0005229335,0.008604145,0.00042280555,0.00015100009,0.00077431434,0.00065409264,0.101687655,0.66072905,0.0077955984,0.20528033,0.0051829726],"about_ca_topic_score_codex":0.0002694151,"about_ca_topic_score_gemma":0.00007365178,"teacher_disagreement_score":0.26706114,"about_ca_system_score_codex":0.00005004996,"about_ca_system_score_gemma":0.000111203655,"threshold_uncertainty_score":0.9999914},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71894515,0.00008600609,0.25752276,0.00023342943,0.0002592849,0.00052498834,0.0000146394195,0.0006996176,0.021714153],"genre_scores_gemma":[0.8960915,0.0000099935705,0.10332744,0.000045207675,0.000016117208,0.000027012078,0.000009192882,0.000024760096,0.00044873735],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996967,0.0003130207,0.00079337426,0.0007827213,0.00041310408,0.00073076336],"domain_scores_gemma":[0.99812335,0.00020187747,0.00021932022,0.0011479057,0.000103358565,0.00020421276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083159684,0.00032021853,0.00044947656,0.00035220178,0.00012220282,0.00018819426,0.0013405888,0.00010600382,0.0000776041],"category_scores_gemma":[0.00011727212,0.00027252524,0.00011429188,0.0007710606,0.000078155914,0.00041770865,0.0004907204,0.00029249856,0.00024248358],"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.0009805597,0.0034162388,0.122797735,0.0012640621,0.0010087093,0.00863649,0.16616485,0.053813163,0.30441752,0.07029823,0.0031111846,0.26409125],"study_design_scores_gemma":[0.0011485369,0.00018312424,0.12241477,0.00031607915,0.000010226637,0.00020026138,0.00023659538,0.857257,0.0031416852,0.014073425,0.00008099506,0.00093729905],"about_ca_topic_score_codex":0.0055612135,"about_ca_topic_score_gemma":0.0011570741,"teacher_disagreement_score":0.80344385,"about_ca_system_score_codex":0.00016134142,"about_ca_system_score_gemma":0.00015303325,"threshold_uncertainty_score":0.9999727},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03500843,0.00008601274,0.9231708,0.026228596,0.000106457956,0.0005023571,1.6792141e-7,0.000070900096,0.014826275],"genre_scores_gemma":[0.9507902,0.0000014069486,0.04714719,0.00040897072,0.000059987877,0.000023203263,1.3625748e-7,0.0000044947406,0.0015643795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878937,0.00019985203,0.0002142949,0.00020933198,0.00036792847,0.00021921247],"domain_scores_gemma":[0.99832827,0.0005474171,0.00018701288,0.00073508034,0.00016124008,0.000041003634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057455915,0.0000964586,0.00025651735,0.00003975108,0.00013429811,0.00023283127,0.0006955559,0.000033786833,0.00011173773],"category_scores_gemma":[0.00006392298,0.000036467307,0.00011683717,0.0011298247,0.000067799716,0.0003828139,0.00018501154,0.00010894053,0.00003835828],"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.000046233217,0.00023067003,0.08509733,0.000031587115,0.009090597,0.00001256544,0.006867979,0.40571755,0.002364999,0.3185635,0.16293761,0.00903939],"study_design_scores_gemma":[0.0001433496,0.000024367233,0.019507857,0.000015224535,0.00019925492,0.000006891302,0.00023615091,0.9785836,0.00018456443,0.00020791791,0.0008046478,0.0000861706],"about_ca_topic_score_codex":0.0006949407,"about_ca_topic_score_gemma":0.00009729376,"teacher_disagreement_score":0.9157818,"about_ca_system_score_codex":0.000011796773,"about_ca_system_score_gemma":0.00003745375,"threshold_uncertainty_score":0.22451973},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075838484,0.014170872,0.8967763,0.0009933398,0.00025062502,0.008269116,0.000009254237,0.0008133057,0.0028786983],"genre_scores_gemma":[0.9621008,0.00029910268,0.028052345,0.0000063795064,0.0004826507,0.008547934,0.000009134503,0.000057631147,0.00044400862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595076,0.0004332355,0.00094481744,0.0012380396,0.0007189243,0.00071420387],"domain_scores_gemma":[0.99694055,0.00046556816,0.0003342622,0.001404139,0.0005018631,0.0003536136],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011275974,0.00038736587,0.0005767872,0.00047571515,0.00037211098,0.0012910465,0.0011394604,0.00014640846,0.000016439539],"category_scores_gemma":[0.000088352775,0.00032724923,0.000056152654,0.0012048957,0.0002224591,0.0013001886,0.0003049359,0.00035457604,0.0009212728],"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.000091138456,0.0016325387,0.0024958046,0.0015103144,0.0003275697,0.00003208944,0.07523486,0.040796302,0.115001455,0.70748836,0.0016522615,0.05373731],"study_design_scores_gemma":[0.00021777618,0.00014757625,0.0009018466,0.0010700815,0.000008535089,0.00013919486,0.011870937,0.98179615,0.0007392717,0.0011224535,0.0011600938,0.0008260915],"about_ca_topic_score_codex":0.0045678774,"about_ca_topic_score_gemma":0.000019451925,"teacher_disagreement_score":0.94099987,"about_ca_system_score_codex":0.0003266927,"about_ca_system_score_gemma":0.00024998296,"threshold_uncertainty_score":0.999918},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038821356,0.00027993025,0.9947267,0.00009248739,0.0004937136,0.0010784487,0.0000015275853,0.0002911751,0.0029971648],"genre_scores_gemma":[0.38578397,0.0000011614823,0.61372054,0.00015160252,0.00022751113,0.000013591532,0.000001188443,0.000028947423,0.00007150795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539506,0.00009448684,0.0006629564,0.002007618,0.0011287043,0.0007111805],"domain_scores_gemma":[0.99685395,0.00091236347,0.00029278782,0.0013679796,0.00026365873,0.00030924584],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020434237,0.000576401,0.00063962763,0.0010629888,0.00031905487,0.0011541722,0.002185799,0.00034895015,0.0000015378287],"category_scores_gemma":[0.000055764875,0.00054267404,0.000087434375,0.0006816055,0.00015132508,0.0008899639,0.0006946131,0.0005195727,0.000034868437],"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.0000054822444,0.000010912565,0.0000032057078,0.00008928995,0.0000046625705,0.000015249034,0.0003607418,0.9516798,0.000028815943,0.0039062067,8.043725e-7,0.043894827],"study_design_scores_gemma":[0.00020298967,0.000076927,0.0000015456151,0.0006285852,0.000007498377,0.000039266513,3.694517e-7,0.99571913,0.00031029969,0.002333004,0.00010748117,0.0005729264],"about_ca_topic_score_codex":0.00005640459,"about_ca_topic_score_gemma":0.000004284715,"teacher_disagreement_score":0.38574514,"about_ca_system_score_codex":0.0005450017,"about_ca_system_score_gemma":0.0005273091,"threshold_uncertainty_score":0.9998827},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014839617,0.0022009679,0.9819023,0.000054586566,0.00065239455,0.00013771227,9.5330125e-7,0.0001277851,0.000083665735],"genre_scores_gemma":[0.4719836,0.00006631155,0.52741766,0.0000022628587,0.00041990128,0.000013252969,0.0000018681682,0.000023299754,0.00007180788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986847,0.000024531833,0.00063739374,0.0001972404,0.0002334682,0.00022268428],"domain_scores_gemma":[0.9986437,0.0004993377,0.0002015418,0.0001932256,0.00032427537,0.00013793046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009273074,0.00018927811,0.00030847316,0.0005941022,0.000026591508,0.00035417962,0.0009585218,0.00008611746,0.0000012903215],"category_scores_gemma":[0.00040651517,0.00019477437,0.00008184542,0.0002190304,0.000006309808,0.0012085653,0.00014034359,0.00025012073,0.000005225466],"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.000020211635,0.00005746309,0.00032420107,0.00021013271,0.00015041658,0.000009584367,0.0031062097,0.9615001,0.0057966625,0.0034157503,0.0002036197,0.02520563],"study_design_scores_gemma":[0.00072350603,0.000030817904,0.00036267043,0.0009797147,0.000008489064,0.00031299205,0.000050341016,0.99554044,0.00056903146,0.000016534814,0.0011964114,0.00020902175],"about_ca_topic_score_codex":0.000018389717,"about_ca_topic_score_gemma":9.296014e-7,"teacher_disagreement_score":0.457144,"about_ca_system_score_codex":0.0002500648,"about_ca_system_score_gemma":0.00011588571,"threshold_uncertainty_score":0.7942668},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11087497,0.000016434693,0.88484204,0.0024936185,0.000009489312,0.00053461234,0.0000033558854,0.00031745114,0.00090801215],"genre_scores_gemma":[0.60240626,2.1177588e-7,0.3945569,0.00032929287,0.000010663009,0.0001175131,0.00003848571,0.000011348932,0.0025292942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979471,0.0005514592,0.00046940646,0.0004538107,0.00029403518,0.00028420426],"domain_scores_gemma":[0.9962818,0.00063773716,0.00019605117,0.0023819967,0.0003334388,0.00016895712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020493036,0.00015849863,0.00029085818,0.0003808991,0.00020013459,0.00038286843,0.0014839539,0.00009818623,0.00003850184],"category_scores_gemma":[0.00018507375,0.00013893218,0.00017536555,0.00093249953,0.000032699518,0.0008541206,0.0001442434,0.000087119224,0.00017223516],"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.0003384326,0.00031746953,0.00050365523,0.000025732492,0.00028062912,0.0000012300817,0.0015719704,0.93070096,0.0427146,0.006142475,0.0103555415,0.007047328],"study_design_scores_gemma":[0.00037847896,0.00006524679,0.00049488427,0.000008706296,0.000044121025,8.034631e-7,0.000048479305,0.9967674,0.0011368992,0.000549478,0.000324045,0.00018143744],"about_ca_topic_score_codex":0.0003889477,"about_ca_topic_score_gemma":0.000054788117,"teacher_disagreement_score":0.4915313,"about_ca_system_score_codex":0.00006510579,"about_ca_system_score_gemma":0.00014115797,"threshold_uncertainty_score":0.566549},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92932314,0.000008247948,0.011053637,0.049216043,0.0044175144,0.00031939737,0.0000064016895,0.00016302345,0.0054925894],"genre_scores_gemma":[0.94726604,0.0000042136253,0.050179575,0.0017069136,0.0004046278,0.000017023443,0.0000038626144,0.000022278811,0.00039545275],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790597,0.00011661418,0.000447695,0.00043525014,0.00076086976,0.000333578],"domain_scores_gemma":[0.9967062,0.0007191184,0.0003159099,0.0020272841,0.00012146883,0.00011002511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048974017,0.00019822267,0.00023857225,0.000098058445,0.0001908879,0.00015750091,0.0045919837,0.00010097644,0.000118296164],"category_scores_gemma":[0.0006312628,0.00014898139,0.00016311825,0.00041775292,0.00015861489,0.0005466299,0.0018260318,0.00043306372,0.00009027577],"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.0000057018115,0.00003477386,0.002153589,0.000009339718,0.000060341637,0.000025583477,0.0008339973,0.00041765175,0.9669107,0.00287577,0.023702506,0.0029699975],"study_design_scores_gemma":[0.008053772,0.0002920192,0.114247344,0.002088997,0.00026282793,0.0015309649,0.0015273232,0.16620876,0.47089586,0.007841158,0.22118314,0.005867826],"about_ca_topic_score_codex":0.00043968405,"about_ca_topic_score_gemma":0.000055883844,"teacher_disagreement_score":0.4960149,"about_ca_system_score_codex":0.000051866027,"about_ca_system_score_gemma":0.00012494945,"threshold_uncertainty_score":0.85331243},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11950623,0.0000813641,0.8758851,0.00019148803,0.0006269669,0.0023693813,0.000040345694,0.0008414723,0.00045760156],"genre_scores_gemma":[0.77604145,0.0000019625857,0.22331204,0.000012878691,0.00012829858,0.00035564453,0.00002964584,0.000034317196,0.00008375248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99421376,0.0008555107,0.00209118,0.0011523325,0.0009806072,0.00070661324],"domain_scores_gemma":[0.99308676,0.0023238573,0.0008929777,0.0024465455,0.0009587406,0.00029110417],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017627942,0.00049705536,0.0016117446,0.0009482546,0.0005347415,0.0006264201,0.002055589,0.00033309037,0.000017793302],"category_scores_gemma":[0.00010097756,0.00048099094,0.00069147727,0.0019454691,0.00016125152,0.000619,0.00006663035,0.00043536132,0.000073434305],"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.00011419739,0.0022660978,0.0026173762,0.0016802172,0.0038958213,0.0000050962894,0.004314547,0.8759891,0.06923272,0.021880269,0.0005690165,0.01743556],"study_design_scores_gemma":[0.0004659336,0.0003752804,0.00071757234,0.0003386322,0.00022881884,0.000032024476,0.00045819613,0.99146646,0.0050426447,0.0003518358,0.000051231164,0.0004713385],"about_ca_topic_score_codex":0.001401274,"about_ca_topic_score_gemma":0.0000044244816,"teacher_disagreement_score":0.6565352,"about_ca_system_score_codex":0.0003028022,"about_ca_system_score_gemma":0.00016623485,"threshold_uncertainty_score":0.9997642},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52716726,0.0011925752,0.17814533,0.0006049721,0.006137816,0.002076826,4.933293e-7,0.013077778,0.27159694],"genre_scores_gemma":[0.6301401,0.000002020107,0.36801437,0.000011464832,0.0004864815,0.000038666883,2.8536496e-7,0.000010474186,0.0012961439],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861854,0.00006841417,0.00022399327,0.00024311013,0.00030440625,0.0005415591],"domain_scores_gemma":[0.9990019,0.000065603635,0.00007071396,0.00058314076,0.00005955678,0.00021905325],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005661653,0.00013270919,0.00015249624,0.00007477302,0.00009280412,0.00023553174,0.0006501073,0.00006691345,0.00003082199],"category_scores_gemma":[0.000022868004,0.00011039276,0.00006242681,0.0003634543,0.000012768112,0.0013722099,0.0002145232,0.000096742966,0.0024380982],"study_design_candidate":"design_other","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.000009958804,0.0025192462,0.13383475,0.00026103045,0.00039743778,0.000043992753,0.01279064,0.00014991232,0.038797133,0.05524586,0.0078287,0.7481213],"study_design_scores_gemma":[0.0031905903,0.00083106774,0.095026106,0.00041749855,0.00010055118,0.00074826344,0.0007282341,0.38802573,0.2538616,0.0008730124,0.251872,0.0043253307],"about_ca_topic_score_codex":0.000021460794,"about_ca_topic_score_gemma":1.2732067e-7,"teacher_disagreement_score":0.743796,"about_ca_system_score_codex":0.000060907725,"about_ca_system_score_gemma":0.00003687238,"threshold_uncertainty_score":0.99833864},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38077217,0.00014710215,0.6072587,0.00015050842,0.0005125275,0.00097231776,0.0000052035803,0.0003552454,0.009826257],"genre_scores_gemma":[0.9430256,0.000011247229,0.0552109,0.000011909943,0.000027558575,0.00010887618,0.000052588177,0.000016667767,0.0015346467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669,0.000313951,0.0011248452,0.001003517,0.00056529517,0.0003024074],"domain_scores_gemma":[0.99608856,0.00017845885,0.0008472587,0.0023029007,0.00045775445,0.00012508394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010330718,0.0003167308,0.0008619826,0.0007475572,0.000046772944,0.00023113328,0.001685803,0.00049495074,0.00018785283],"category_scores_gemma":[0.00018007211,0.00027068067,0.00046159176,0.0013921595,0.0000548013,0.0003485328,0.0014863771,0.0004788154,0.00012913368],"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.000004548129,0.00016715657,0.005724658,0.0005956276,0.0038801066,0.000007005913,0.0031033263,0.93289095,0.0012649099,0.047044385,0.00027895693,0.0050383667],"study_design_scores_gemma":[0.00008603394,0.000024685714,0.016297985,0.00010784783,0.0006170465,0.0000039739875,0.000014920508,0.9768466,0.00018897647,0.005513616,0.000011814866,0.0002865278],"about_ca_topic_score_codex":0.0033467198,"about_ca_topic_score_gemma":0.00008796424,"teacher_disagreement_score":0.5622534,"about_ca_system_score_codex":0.00017683057,"about_ca_system_score_gemma":0.00021017397,"threshold_uncertainty_score":0.99997455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23072673,0.0002498099,0.7393595,0.0014152086,0.0005370591,0.00046595134,9.45035e-8,0.00048068725,0.026764968],"genre_scores_gemma":[0.9467843,0.0000087097815,0.051570453,0.00070760044,0.00013888461,0.00006285027,6.977696e-7,0.000019236782,0.0007072491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979112,0.00013073179,0.00042513618,0.0005905296,0.0003518036,0.00059059996],"domain_scores_gemma":[0.99861556,0.00024011389,0.00010121682,0.0008002578,0.00007501229,0.0001678133],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00053714507,0.0002234171,0.0002760043,0.0001746407,0.00013248921,0.0006808799,0.0010067942,0.00013701699,0.00018972132],"category_scores_gemma":[0.000068680754,0.00018739911,0.00007696693,0.00057705643,0.00003952008,0.0011646238,0.00025773153,0.00031321042,0.0011939339],"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.000015890892,0.00039602898,0.0264287,0.0000962339,0.00008283067,0.00011074095,0.002073386,0.5766754,0.03047475,0.114541546,0.0030577672,0.24604669],"study_design_scores_gemma":[0.00035822464,0.000059608912,0.009010577,0.00010150472,0.0000015514586,0.00001013213,0.000097050055,0.9869862,0.0021212166,0.000723187,0.0002302837,0.00030041463],"about_ca_topic_score_codex":0.00045292728,"about_ca_topic_score_gemma":0.000025689926,"teacher_disagreement_score":0.7160576,"about_ca_system_score_codex":0.00007032585,"about_ca_system_score_gemma":0.00005571028,"threshold_uncertainty_score":0.9995838},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26015952,0.0002255584,0.68483865,0.00015469444,0.0017719613,0.0010749139,0.0000024182689,0.00094095746,0.050831325],"genre_scores_gemma":[0.91459924,0.0000018483242,0.08211475,0.00012304173,0.00031090822,0.00007491726,0.0000038859616,0.000030048359,0.002741376],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969328,0.00019968666,0.0007164007,0.0005906622,0.0005920753,0.00096836983],"domain_scores_gemma":[0.9979058,0.00017655794,0.00023243007,0.0011764062,0.00016213357,0.0003466656],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019293237,0.00031377663,0.00037723666,0.00015671251,0.00025763147,0.00066555094,0.0011337522,0.0001151238,0.000076325516],"category_scores_gemma":[0.00006551012,0.00025815255,0.00011668739,0.00046014055,0.000030936575,0.0011720405,0.00031497175,0.00014181832,0.001215199],"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.0000024161634,0.00022736104,0.0011308383,0.00011486354,0.000029889356,0.0000072912308,0.0011225848,0.005496406,0.9785514,0.010585807,0.0011922059,0.0015389217],"study_design_scores_gemma":[0.0006073484,0.00012738256,0.0004500587,0.000103118946,0.00001036655,0.000032797972,0.00026426354,0.9317868,0.065790325,0.00000664492,0.00029555536,0.00052534905],"about_ca_topic_score_codex":0.000781036,"about_ca_topic_score_gemma":0.0000014103839,"teacher_disagreement_score":0.9262904,"about_ca_system_score_codex":0.00018338513,"about_ca_system_score_gemma":0.00015880135,"threshold_uncertainty_score":0.99998707},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018230908,0.0022511375,0.9737942,0.00010623849,0.0015403213,0.0025582772,0.001147693,0.00029420436,0.000076993616],"genre_scores_gemma":[0.99726164,0.00020518583,0.00095265696,0.000017719007,0.00013925557,0.001106372,0.00019354596,0.000033855526,0.00008975519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641657,0.0006459217,0.0010250125,0.0007271453,0.00033498817,0.0008503351],"domain_scores_gemma":[0.9978331,0.00056719955,0.00035376576,0.0006201166,0.00019444877,0.0004313936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013751531,0.00047321952,0.00083255663,0.00024165913,0.00034829977,0.00039353085,0.0003213056,0.0003000704,0.0000040948357],"category_scores_gemma":[0.000029609058,0.0004358297,0.00011515706,0.000520846,0.000077135344,0.0010816198,0.0000061246683,0.00020589333,0.000028474664],"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.0004324302,0.0014093859,0.0016282739,0.0017776954,0.00065707054,0.000037139016,0.0017739552,0.9562772,0.015250894,0.016974047,0.001074689,0.0027072472],"study_design_scores_gemma":[0.003975242,0.0002890271,0.0022740792,0.00038471931,0.00010811719,0.00016297736,0.0005396887,0.99123216,0.000117473035,0.00007924152,0.00019952067,0.00063777104],"about_ca_topic_score_codex":0.0009384877,"about_ca_topic_score_gemma":0.00002400629,"teacher_disagreement_score":0.9790307,"about_ca_system_score_codex":0.0003306269,"about_ca_system_score_gemma":0.00010449729,"threshold_uncertainty_score":0.9998093},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032238826,0.0002320066,0.96273035,0.00023085627,0.0014040866,0.00093651685,0.000008373535,0.00068571104,0.0015332942],"genre_scores_gemma":[0.88907486,0.00001673588,0.110302955,0.00011238284,0.0001530028,0.00007139216,0.000004291155,0.00003658108,0.00022777078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997458,0.00022413871,0.00066393334,0.0007551661,0.00034353213,0.00055525237],"domain_scores_gemma":[0.9974024,0.0004733927,0.00029079788,0.001401481,0.0002264472,0.00020542709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077240774,0.00032996284,0.00043745394,0.00037333302,0.0008766915,0.0004680925,0.0010395033,0.00019660383,0.0000026044945],"category_scores_gemma":[0.000069151465,0.00033610492,0.00016379986,0.0006701406,0.000089204856,0.0007160944,0.00004001009,0.00026273052,0.000018608582],"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.0003358883,0.0022115998,0.003716241,0.0033400059,0.001413717,0.00006636931,0.12301838,0.04463824,0.0069057583,0.75599426,0.0024607084,0.055898834],"study_design_scores_gemma":[0.002418664,0.0008006216,0.0026921295,0.0010430904,0.00013256591,0.0006171434,0.0041295206,0.96501434,0.004710445,0.015491,0.0015376298,0.0014128387],"about_ca_topic_score_codex":0.0007348833,"about_ca_topic_score_gemma":0.000030034662,"teacher_disagreement_score":0.9203761,"about_ca_system_score_codex":0.00011680068,"about_ca_system_score_gemma":0.00014089636,"threshold_uncertainty_score":0.9999091},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011866394,0.00066564686,0.9925696,0.0004287577,0.00025464912,0.00053830695,3.5625425e-7,0.00031978847,0.004036204],"genre_scores_gemma":[0.3032549,0.0000113423375,0.68789697,0.00008819587,0.00013975277,0.00007644048,4.955356e-7,0.000011770642,0.008520116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896187,0.00004963086,0.00023226147,0.00031868607,0.00015691505,0.00028062644],"domain_scores_gemma":[0.9991939,0.00017671596,0.000061721694,0.00038244508,0.000084517815,0.000100683064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080045214,0.00010427586,0.00015929717,0.00006320786,0.00013066687,0.00045769263,0.0003668896,0.000061079896,0.0000048474394],"category_scores_gemma":[0.000024344878,0.00008747318,0.000027126034,0.00015491495,0.000014589441,0.00073494023,0.00009252807,0.000044391974,0.00009344255],"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.000023141265,0.0001314634,0.00032075238,0.0003495531,0.000073798605,0.0000057163343,0.0011245885,0.19446819,0.012026872,0.7029533,0.03331854,0.055204112],"study_design_scores_gemma":[0.0002893921,0.000058375124,0.000018056366,0.00003053053,0.0000034193129,0.00004409694,0.00003124847,0.98295367,0.005992756,0.0004997671,0.009940462,0.00013823618],"about_ca_topic_score_codex":0.000056374243,"about_ca_topic_score_gemma":0.0000022557813,"teacher_disagreement_score":0.78848547,"about_ca_system_score_codex":0.000044374356,"about_ca_system_score_gemma":0.00006310252,"threshold_uncertainty_score":0.44135407},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9007481,0.00089314504,0.023649571,0.008226851,0.00088777754,0.004453889,0.000031747677,0.008739081,0.05236989],"genre_scores_gemma":[0.8244056,0.000027645146,0.17399028,0.000829549,0.0001128133,0.00034141252,0.000016767004,0.000060861046,0.00021503857],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9945216,0.00024188124,0.001386404,0.0018130122,0.000929258,0.0011078145],"domain_scores_gemma":[0.9959457,0.0013030128,0.00039867742,0.0016672848,0.00017540588,0.000509924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020844536,0.0007437953,0.0012948517,0.00046823302,0.0007089851,0.00045735738,0.0017149659,0.00061839615,0.000049342634],"category_scores_gemma":[0.0010261978,0.000653496,0.0005109641,0.0014875652,0.0005033086,0.00097369397,0.0007254266,0.0006779176,0.00004839908],"study_design_candidate":"observational","study_design_consensus":null,"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.000061686056,0.00013171729,0.00039003915,0.00009704435,0.00021455603,0.0000127537405,0.0002050874,0.00012849309,0.93063104,0.028807605,0.0002792709,0.03904068],"study_design_scores_gemma":[0.00081449654,0.00066631805,0.97297704,0.0002542422,0.00021948821,0.00007280714,0.00009415032,0.000025028072,0.0009815352,0.0018159344,0.021059696,0.0010192378],"about_ca_topic_score_codex":0.00003673214,"about_ca_topic_score_gemma":0.019560684,"teacher_disagreement_score":0.97258705,"about_ca_system_score_codex":0.00026549966,"about_ca_system_score_gemma":0.00013543328,"threshold_uncertainty_score":0.99959165},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01972387,0.0020116451,0.97395605,0.000010981054,0.00095979066,0.0024471146,0.000005296578,0.0008547611,0.00003046926],"genre_scores_gemma":[0.77185374,0.0000018152214,0.2276047,0.000012930146,0.00023842354,0.00018097945,0.0000066096886,0.000063292384,0.000037486334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960662,0.00017570282,0.0011562204,0.0010160749,0.0007129509,0.00087285467],"domain_scores_gemma":[0.996354,0.0014685888,0.0004179953,0.00072649616,0.0007539818,0.00027894598],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0047472683,0.00041068438,0.0006000063,0.00036839172,0.00051703287,0.0008876143,0.00065118325,0.00027426568,3.0576658e-7],"category_scores_gemma":[0.00027504622,0.00040175344,0.000107798034,0.00046280792,0.000019999112,0.0014115178,0.00007790824,0.00019698581,0.0000072481603],"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.00003414356,0.000019604327,0.000107232554,0.00087495026,0.000023580627,0.000008659715,0.0005396959,0.99720424,0.000087358014,0.0006130341,0.0000025091135,0.00048496402],"study_design_scores_gemma":[0.0006712145,0.00007142139,3.1545218e-7,0.0007744662,0.000024762194,0.00003075729,0.00037787284,0.99693626,0.00012339873,0.0004903819,0.000034032135,0.00046512284],"about_ca_topic_score_codex":0.00057322386,"about_ca_topic_score_gemma":0.0000029448859,"teacher_disagreement_score":0.7521299,"about_ca_system_score_codex":0.00019949026,"about_ca_system_score_gemma":0.00026270753,"threshold_uncertainty_score":0.9998434},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005620598,0.000027616905,0.9869574,0.00042617484,0.0005746848,0.00069907034,0.0000036092235,0.0010166651,0.0046742163],"genre_scores_gemma":[0.63860476,3.6722005e-7,0.36034602,0.00015775519,0.00012642979,0.00010534687,0.0000018164125,0.000018888253,0.0006385899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983529,0.00004713362,0.00031517883,0.0005476049,0.0003260411,0.0004111587],"domain_scores_gemma":[0.99867135,0.00016366281,0.00010690819,0.00079414534,0.00011116354,0.00015276957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046370685,0.0001959399,0.00024764938,0.00011075752,0.00016919943,0.00028501818,0.0009120466,0.00008988497,0.0000042791876],"category_scores_gemma":[0.00008039203,0.0001604516,0.00014021873,0.00024949232,0.000014986211,0.000398002,0.00010022315,0.000087201246,0.0004445926],"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.00002940166,0.0001333416,0.00027667443,0.0004513966,0.00009198607,0.000058695146,0.0011668777,0.013439697,0.0021856301,0.9729964,0.0012940067,0.007875859],"study_design_scores_gemma":[0.028891146,0.0073376684,0.011783854,0.0091205165,0.00024978444,0.002243471,0.0027876534,0.4637564,0.37183803,0.08014473,0.013188332,0.008658379],"about_ca_topic_score_codex":0.00012333655,"about_ca_topic_score_gemma":0.000006929533,"teacher_disagreement_score":0.8928517,"about_ca_system_score_codex":0.00024364381,"about_ca_system_score_gemma":0.0001504746,"threshold_uncertainty_score":0.6543026},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14632636,0.00038618007,0.84273916,0.00012760359,0.0016925754,0.0014555915,0.000016765482,0.00054832594,0.0067074555],"genre_scores_gemma":[0.8172721,0.000005110034,0.18142398,0.000020081363,0.00025128832,0.00008384746,0.000008465592,0.00003268414,0.0009024041],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974228,0.00013942379,0.00074960274,0.00046944513,0.0004693658,0.0007493233],"domain_scores_gemma":[0.99746513,0.00045533976,0.00038781692,0.0010669616,0.0003298716,0.00029490597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014667241,0.00027486484,0.00055127754,0.0001784385,0.00013418322,0.00015320265,0.0009856,0.00017059116,0.000018940831],"category_scores_gemma":[0.0001423156,0.00023556458,0.00018013819,0.00034770064,0.000042888703,0.001255146,0.0002587999,0.00010681977,0.0002172038],"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.00014542016,0.0015684938,0.014692842,0.0066326843,0.0010702519,0.000033123622,0.02085899,0.05295924,0.7039138,0.14817125,0.010496282,0.039457586],"study_design_scores_gemma":[0.00090066466,0.000100153775,0.0005979841,0.00027824743,0.000031904623,0.00006738997,0.00066122913,0.9741197,0.022298519,0.00008811175,0.00035449635,0.0005015807],"about_ca_topic_score_codex":0.0004944967,"about_ca_topic_score_gemma":0.0000027122685,"teacher_disagreement_score":0.92116046,"about_ca_system_score_codex":0.00008565185,"about_ca_system_score_gemma":0.0001015339,"threshold_uncertainty_score":0.9606045},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6197742,0.000017285129,0.37071064,0.0003926797,0.00043340406,0.00050552643,5.993516e-7,0.000048023794,0.008117612],"genre_scores_gemma":[0.9565549,0.0000021299186,0.043273665,0.00008047035,0.000033185075,0.00003331428,4.942941e-7,0.000004921159,0.00001690079],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841195,0.00005270328,0.00032735337,0.00034506756,0.00052926794,0.0003336662],"domain_scores_gemma":[0.9980815,0.000080223006,0.0002309324,0.0014486766,0.00010593694,0.000052734165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002247342,0.00009343503,0.00012175334,0.0000706513,0.00026789916,0.0001708139,0.0029154602,0.000048491613,0.000007356568],"category_scores_gemma":[0.00002528815,0.00007223632,0.00002772091,0.0012063418,0.00035842272,0.00050922274,0.0007193169,0.00027405206,0.000020699963],"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.00000561252,0.00005169581,0.04307283,0.000017464343,0.000003962462,5.599825e-7,0.0053349664,0.007898999,0.67279476,0.22752158,0.00012232277,0.043175224],"study_design_scores_gemma":[0.0004736319,0.000014643829,0.16880904,0.00004460062,0.0000027835245,0.000006091274,0.00020674367,0.76224846,0.029723614,0.038064115,0.00015674453,0.00024954035],"about_ca_topic_score_codex":0.0001967021,"about_ca_topic_score_gemma":0.00055044633,"teacher_disagreement_score":0.75434947,"about_ca_system_score_codex":0.000046732846,"about_ca_system_score_gemma":0.0002025072,"threshold_uncertainty_score":0.54176986},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42697525,0.00000215968,0.5726032,0.00006058116,0.00002412406,0.00018933468,1.5139386e-7,0.000037945927,0.000107208594],"genre_scores_gemma":[0.52060777,6.7704e-8,0.47933048,0.000027099999,0.0000057056013,0.000012121618,0.0000014718809,0.0000032348828,0.000012015724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990289,0.000042979405,0.00030271316,0.00020620738,0.00025053992,0.00016863612],"domain_scores_gemma":[0.99944717,0.000019591616,0.00013121704,0.00024255361,0.00010888787,0.000050573944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016032672,0.00008957578,0.000109427085,0.00012199279,0.00005209573,0.000074216776,0.00026845024,0.000032171563,0.00006282746],"category_scores_gemma":[0.0000028383074,0.000076171105,0.000032282333,0.00016415026,0.000009125299,0.00041365667,0.000069498514,0.00004197638,0.000026555917],"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.000002052625,0.00003963896,0.0055442527,0.000090291476,0.000027441494,7.81429e-7,0.0041516237,0.636149,0.25952014,0.0032657383,0.000058119145,0.091150954],"study_design_scores_gemma":[0.00019941138,0.000010214626,0.0036204907,0.000019747213,0.0000018405304,0.0000022204429,0.000085370775,0.9256393,0.07009976,0.0002229739,0.00000918483,0.000089488996],"about_ca_topic_score_codex":0.0005443857,"about_ca_topic_score_gemma":0.00006785993,"teacher_disagreement_score":0.28949034,"about_ca_system_score_codex":0.000066713124,"about_ca_system_score_gemma":0.00017529723,"threshold_uncertainty_score":0.31061676},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003876095,0.000097759854,0.9912448,0.00027933726,0.0011540031,0.0015238193,0.000062042185,0.0013546787,0.00040747586],"genre_scores_gemma":[0.07659566,0.000009238338,0.9219427,0.000035086738,0.00027456816,0.00026460012,0.000107515596,0.000053006937,0.00071760087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637383,0.00011676138,0.00090475555,0.0010808179,0.0005648831,0.000958923],"domain_scores_gemma":[0.99736536,0.00021174579,0.00035043736,0.0011927863,0.0004997242,0.0003799549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097120804,0.0004370027,0.000622588,0.00021654289,0.0003634334,0.0005994567,0.001211712,0.00022875407,0.0000055179726],"category_scores_gemma":[0.00016378758,0.000395803,0.00023880183,0.00092129584,0.000059101687,0.001069384,0.0003098674,0.0001927109,0.0003651002],"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.00006329017,0.00183874,0.00037883795,0.0007438825,0.0009244791,0.00033243975,0.0030803825,0.4768476,0.27812278,0.20197406,0.0013318518,0.03436166],"study_design_scores_gemma":[0.0027746288,0.00013957552,0.00016730471,0.00020932958,0.000021110724,0.00010821921,0.00017620303,0.9920714,0.0030168141,0.00019077837,0.0005723716,0.0005522945],"about_ca_topic_score_codex":0.0013440405,"about_ca_topic_score_gemma":0.000009660819,"teacher_disagreement_score":0.5152238,"about_ca_system_score_codex":0.00040958988,"about_ca_system_score_gemma":0.0003085849,"threshold_uncertainty_score":0.9998494},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68703216,0.00045336215,0.19559631,0.026247917,0.003368293,0.013543852,0.00013690148,0.009272028,0.064349204],"genre_scores_gemma":[0.97651,0.000027215961,0.020523524,0.0016927369,0.00020619427,0.0007084977,0.00005421584,0.00008913523,0.00018850165],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9942729,0.00040062107,0.0015428207,0.0016923217,0.001146382,0.0009449669],"domain_scores_gemma":[0.9960542,0.0014729922,0.00041151565,0.0015482,0.00021252458,0.0003005767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020794505,0.0007406873,0.0009586261,0.00050392083,0.00047155152,0.00026803405,0.001347141,0.0007204536,0.000035274934],"category_scores_gemma":[0.0014961784,0.0006272026,0.0004765818,0.0009641559,0.00035340688,0.000493923,0.00031469134,0.0008456299,0.00009690691],"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.0005643718,0.00033773217,0.000017359906,0.000027701713,0.000020800722,0.0000047632752,0.00008016108,0.013992415,0.8028254,0.17227419,0.00032773844,0.009527364],"study_design_scores_gemma":[0.0048159044,0.002983171,0.9616181,0.00076048815,0.00005293662,0.00007250569,0.0000984624,0.002374429,0.0005248757,0.01427177,0.0110580325,0.001369291],"about_ca_topic_score_codex":0.0000367221,"about_ca_topic_score_gemma":0.016897893,"teacher_disagreement_score":0.9616008,"about_ca_system_score_codex":0.0007783047,"about_ca_system_score_gemma":0.0001495264,"threshold_uncertainty_score":0.99961793},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083815604,0.00023657875,0.7877287,0.00022980034,0.0003014807,0.00069117144,0.0000027895612,0.0014976797,0.12549613],"genre_scores_gemma":[0.40650848,0.0000033678493,0.5906052,0.000024858015,0.00038563638,0.00003055977,0.0000011354373,0.000025779582,0.0024150154],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977556,0.00011072205,0.00043741235,0.000622881,0.00054426404,0.0005291143],"domain_scores_gemma":[0.9983206,0.00021121671,0.00018645392,0.00086422364,0.00021125625,0.00020629818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003655634,0.00024425169,0.00029569844,0.00012111966,0.00014362823,0.00058674696,0.00097237586,0.00007605483,0.000018889836],"category_scores_gemma":[0.000033456992,0.00018457664,0.000036783495,0.0005901564,0.00003513666,0.0007163018,0.00018683505,0.00011674733,0.0006794466],"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.000019098117,0.00048815025,0.028639331,0.0005146785,0.0003322659,0.00066076167,0.002369636,0.6227346,0.05524131,0.022835152,0.002842785,0.26332223],"study_design_scores_gemma":[0.0002979645,0.00011355164,0.0023372038,0.00017485644,0.000007911322,0.0003384959,0.00006209157,0.9942822,0.0018165157,0.000021316328,0.00021351087,0.00033438922],"about_ca_topic_score_codex":0.0012191992,"about_ca_topic_score_gemma":0.000019973366,"teacher_disagreement_score":0.37154758,"about_ca_system_score_codex":0.0000930522,"about_ca_system_score_gemma":0.00012448942,"threshold_uncertainty_score":0.87331384},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019726852,0.000009251052,0.9676105,0.00040390252,0.00024482547,0.00065502326,7.86321e-7,0.00038586775,0.010963043],"genre_scores_gemma":[0.7856618,3.8819067e-7,0.21364114,0.000048261245,0.00007225699,0.00016070232,0.000015675967,0.000004967429,0.00039479902],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993322,0.000022973203,0.00017859433,0.00010356882,0.0001404953,0.00022217399],"domain_scores_gemma":[0.9996518,0.000023912027,0.000050750255,0.0001583117,0.000048322046,0.00006688757],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031149207,0.00006734961,0.000070964474,0.00006896172,0.000070019974,0.00013056876,0.00018811873,0.000037091093,0.000025445277],"category_scores_gemma":[0.0000049713562,0.000057362817,0.000043278742,0.0001810171,0.0000059165336,0.002447356,0.000015093251,0.000025498886,0.00018481628],"study_design_candidate":"design_other","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.000003145704,0.00007723789,0.00030764643,0.000041851363,0.000010984742,4.597591e-8,0.002189763,0.00003806666,0.0013450871,0.032265007,0.00064785994,0.9630733],"study_design_scores_gemma":[0.001098032,0.0002832334,0.0039188103,0.000032559718,0.000013388116,0.000027783424,0.000302908,0.93925035,0.03575811,0.0007089391,0.01821769,0.00038821026],"about_ca_topic_score_codex":0.000012673829,"about_ca_topic_score_gemma":0.0000011256334,"teacher_disagreement_score":0.9626851,"about_ca_system_score_codex":0.00003414448,"about_ca_system_score_gemma":0.000014529765,"threshold_uncertainty_score":0.23755011},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44613367,0.00004053575,0.55092895,0.0013664719,0.000052640655,0.00008908033,3.0718073e-7,0.000052826024,0.0013355362],"genre_scores_gemma":[0.9088888,0.0000063878006,0.09093029,0.00007802653,0.000034259978,0.000002501745,8.798398e-7,0.0000027920653,0.000056030418],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932957,0.000030105279,0.00014729657,0.00020657602,0.000118263895,0.00016816646],"domain_scores_gemma":[0.9996738,0.000054036464,0.000028662205,0.00016436508,0.00002548673,0.00005364934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045684562,0.00006394956,0.000085652806,0.00012808855,0.00005379408,0.00009338732,0.0001142456,0.00004539064,0.0000020224213],"category_scores_gemma":[0.000011853219,0.000060558417,0.0000127830635,0.00023641413,0.000013819352,0.00039463837,0.00002336904,0.00005830162,0.000004198131],"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.000029559134,0.00027654562,0.02304023,0.00018737976,0.000028763907,0.00011876042,0.06804574,0.0013283337,0.59118265,0.093349054,0.00021230445,0.22220068],"study_design_scores_gemma":[0.0009933384,0.00011344029,0.10437123,0.0001673557,0.000008297743,0.000118410586,0.0014580255,0.83244306,0.055599194,0.0034615905,0.0007215107,0.00054456637],"about_ca_topic_score_codex":0.0007738432,"about_ca_topic_score_gemma":0.0125094615,"teacher_disagreement_score":0.8311147,"about_ca_system_score_codex":0.000028578515,"about_ca_system_score_gemma":0.000018238876,"threshold_uncertainty_score":0.6980573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7857379,0.0025381027,0.00052830507,0.008233144,0.0008621986,0.008212439,0.000037034064,0.009520164,0.18433076],"genre_scores_gemma":[0.9304603,0.00023853073,0.06712943,0.00086389296,0.000069327914,0.00090411585,0.000018016935,0.00009309756,0.00022333219],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99439776,0.00037591183,0.0015660728,0.0014795677,0.00093076983,0.0012499467],"domain_scores_gemma":[0.99507296,0.00071420614,0.00045629736,0.0032245682,0.00019219764,0.00033977497],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020017154,0.0007016491,0.00093736936,0.00045916493,0.00043955448,0.00022230814,0.004049565,0.0007455734,0.00006912161],"category_scores_gemma":[0.00084357266,0.000647133,0.00041896728,0.0015760255,0.00041378645,0.001641527,0.00092447613,0.0010164949,0.00013689532],"study_design_candidate":"observational","study_design_consensus":null,"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.00015718864,0.00046972188,0.0004814354,0.000051260235,0.00003036005,0.00001843444,0.00010433968,0.0000065441604,0.89831215,0.0909004,0.0008213636,0.0086467825],"study_design_scores_gemma":[0.0010758914,0.0011860393,0.97080034,0.00033366928,0.00003188711,0.000062313695,0.00005173437,0.000003796971,0.0013267094,0.018029153,0.006329972,0.0007685103],"about_ca_topic_score_codex":0.0001924515,"about_ca_topic_score_gemma":0.027599022,"teacher_disagreement_score":0.9703189,"about_ca_system_score_codex":0.00050558295,"about_ca_system_score_gemma":0.00017203533,"threshold_uncertainty_score":0.99959797},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883241,0.00015784199,0.0027405224,0.0014113783,0.000256549,0.00044491916,0.000017818315,0.00008624614,0.006560591],"genre_scores_gemma":[0.96007144,0.000035364897,0.039394572,0.000045955545,0.00021678148,0.00005559678,0.0000058291257,0.000018785973,0.00015565149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985549,1.03910374e-7,0.00045014167,0.0002563901,0.0005221319,0.00021634101],"domain_scores_gemma":[0.9989537,0.00015934622,0.00023076986,0.000068487476,0.00051787583,0.00006982684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009599456,0.00016196504,0.00023511527,0.00005784711,0.000051674782,0.00013914856,0.0007086256,0.00012148589,0.0000083545365],"category_scores_gemma":[0.00035263778,0.000116656665,0.00017717143,0.0002732652,0.000061937484,0.00041065965,0.00008608202,0.000170898,0.000009148798],"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.000030777825,0.00006316691,0.0004156518,0.00038464356,0.000112585076,4.162392e-7,0.00048004804,0.00015867152,0.08290011,0.9114826,0.0025788266,0.0013925111],"study_design_scores_gemma":[0.0016882507,0.00013955955,0.006517132,0.000599955,0.00006887664,0.00005300588,0.001303237,0.9715205,0.0035969955,0.0009395743,0.0131452205,0.00042772782],"about_ca_topic_score_codex":0.000012231003,"about_ca_topic_score_gemma":3.1809657e-7,"teacher_disagreement_score":0.9713618,"about_ca_system_score_codex":0.00011369049,"about_ca_system_score_gemma":0.000026905887,"threshold_uncertainty_score":0.4757121},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7577,0.000035942536,0.23978697,0.00015644493,0.00020629582,0.0016970601,0.000015250331,0.00011445287,0.00028756383],"genre_scores_gemma":[0.9386021,5.924425e-7,0.060741313,0.00003326721,0.0002209078,0.00009247243,0.0000014470936,0.000022515143,0.00028539292],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976791,0.00033387885,0.00065309857,0.000612222,0.00032434554,0.00039732657],"domain_scores_gemma":[0.9983658,0.00029855967,0.0001708155,0.0007407066,0.00024953898,0.00017456588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002155747,0.00022102341,0.00047827145,0.0001294888,0.0001637964,0.00015814883,0.00034243567,0.00006488086,0.0000022873535],"category_scores_gemma":[0.00009630065,0.00020657387,0.000107448555,0.00033010085,0.000016116117,0.00040719833,0.00012861939,0.00008853555,0.00006178856],"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.00005521497,0.001226589,0.001523119,0.00038196685,0.00023989088,0.0025117875,0.07171568,0.10560337,0.79452693,0.00061572756,0.0014158947,0.020183818],"study_design_scores_gemma":[0.0020771513,0.0007391499,0.00070188794,0.0003115388,0.00004499032,0.0038807192,0.006916492,0.96432143,0.019622194,0.0000029932353,0.00074933853,0.0006320967],"about_ca_topic_score_codex":0.004832556,"about_ca_topic_score_gemma":0.0003418827,"teacher_disagreement_score":0.8587181,"about_ca_system_score_codex":0.000111221125,"about_ca_system_score_gemma":0.0000879877,"threshold_uncertainty_score":0.8423838},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35298523,0.0014689645,0.64424443,0.00017750828,0.0004492974,0.0005316022,0.0000024474048,0.000058847076,0.00008167466],"genre_scores_gemma":[0.97829396,0.0002098843,0.020849496,0.000029068713,0.00048797278,0.0000333726,0.00000681387,0.000034506815,0.000054958742],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99698794,0.0002912949,0.00096866454,0.00049109914,0.00066253677,0.00059844414],"domain_scores_gemma":[0.99784267,0.0002802913,0.00070063875,0.00026060262,0.00068503706,0.00023074113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001720647,0.00029350046,0.0005948515,0.00048019455,0.00015262782,0.00051886303,0.0006917028,0.0001880667,4.7892416e-7],"category_scores_gemma":[0.000062633946,0.00025728202,0.00014504995,0.00023551543,0.000027955926,0.0007680293,0.000085980086,0.00036562147,0.0000023493012],"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.0005846248,0.00038289803,0.000802765,0.00066655845,0.0031837013,0.00008331504,0.0012212249,0.08088313,0.6766602,0.15195157,0.00013067192,0.08344937],"study_design_scores_gemma":[0.0019150777,0.00041529717,0.00036656682,0.00026186358,0.00009895543,0.0008676099,0.00008060824,0.994799,0.00022963126,0.00041655096,0.0003161713,0.00023262901],"about_ca_topic_score_codex":0.0001383113,"about_ca_topic_score_gemma":0.000009846596,"teacher_disagreement_score":0.91391593,"about_ca_system_score_codex":0.00083262316,"about_ca_system_score_gemma":0.00016234939,"threshold_uncertainty_score":0.99998796},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3094477,0.00004760323,0.6499107,0.0000885673,0.0004330731,0.00015524848,7.380821e-7,0.00030365237,0.039612696],"genre_scores_gemma":[0.8725232,9.032761e-7,0.12701212,0.000068520436,0.00031509728,0.000001599088,0.0000019520278,0.000021170434,0.000055460674],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736047,0.00016512889,0.0007580929,0.0004768989,0.0005319547,0.00070747605],"domain_scores_gemma":[0.997763,0.0005907481,0.00055329705,0.0007695894,0.00016697399,0.00015643603],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017668742,0.00025916382,0.00050801225,0.0002303177,0.0003042338,0.00033033537,0.0012458133,0.00010056993,0.000013716855],"category_scores_gemma":[0.00035719655,0.0002525215,0.00019221182,0.00044024468,0.000054248165,0.0016658057,0.00061096775,0.00021928601,0.00023316915],"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.000053014715,0.00037164983,0.0001965974,0.0004088313,0.00018422175,0.00005035753,0.0025389292,0.02354966,0.03876322,0.4116099,0.0003197566,0.5219539],"study_design_scores_gemma":[0.00075368537,0.00037925324,0.00027673424,0.00034116395,0.000011547194,0.000103657614,0.000046135472,0.9631885,0.026319942,0.007611281,0.00059020094,0.00037784866],"about_ca_topic_score_codex":0.000055266595,"about_ca_topic_score_gemma":0.0000019939237,"teacher_disagreement_score":0.9396389,"about_ca_system_score_codex":0.00007385118,"about_ca_system_score_gemma":0.00009883136,"threshold_uncertainty_score":0.9999927},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44051468,0.00002557228,0.5588467,0.000060996612,0.00006248145,0.00033064044,2.264174e-7,0.00003558208,0.00012314323],"genre_scores_gemma":[0.90455484,0.0000029358573,0.095048524,0.00011953721,0.000020877607,0.000024918336,0.0000018472452,0.0000075671537,0.00021896715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840724,0.00018646684,0.00050394813,0.00033548466,0.00035703642,0.00020980729],"domain_scores_gemma":[0.99882233,0.00021021003,0.00015739248,0.0007113465,0.000033764925,0.00006493717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007273185,0.00013134726,0.00016353495,0.000097855394,0.000039787774,0.0001601588,0.0007764434,0.000057308316,0.000058247715],"category_scores_gemma":[0.000034478882,0.00009316384,0.000048241072,0.00019248287,0.00004219409,0.00077383587,0.00012637331,0.00009757688,0.000322432],"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.00000736957,0.0002985546,0.0012698292,0.000025153977,0.000017244447,0.000008693368,0.013571807,0.8775328,0.01888203,0.0066967467,0.000018018301,0.08167177],"study_design_scores_gemma":[0.00017189665,0.00019775951,0.0022593075,0.000026125941,0.0000027258309,0.000011143599,0.0004844808,0.9770308,0.01816561,0.0013745526,0.00011364872,0.00016191791],"about_ca_topic_score_codex":0.00046610815,"about_ca_topic_score_gemma":0.0000151317245,"teacher_disagreement_score":0.46404016,"about_ca_system_score_codex":0.00004686917,"about_ca_system_score_gemma":0.000026112713,"threshold_uncertainty_score":0.41443187},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68486625,0.0018366665,0.3123686,0.000012785693,0.0000861645,0.0006432186,0.000007334232,0.00013920107,0.000039793405],"genre_scores_gemma":[0.51128966,0.0000064889164,0.48847634,0.0000014872521,0.000095438416,0.00007430858,0.000005165313,0.00001693565,0.00003419056],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99712545,0.00019113658,0.00073316396,0.0009573211,0.0002945148,0.000698389],"domain_scores_gemma":[0.99849963,0.00031110458,0.00025979948,0.00058235176,0.00019728905,0.00014982172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000912618,0.00033464053,0.00060749624,0.00042812515,0.00030216,0.0009937151,0.00037738166,0.00013292726,8.305894e-7],"category_scores_gemma":[0.00010262871,0.00031586064,0.000087890745,0.0014708543,0.0000965476,0.0002786838,0.00022269369,0.00011635025,0.0000013549839],"study_design_candidate":"observational","study_design_consensus":null,"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.000006188417,0.00007350641,0.85746694,0.0003487201,0.00009176331,0.000014329339,0.00020467264,0.07323102,0.0024952025,0.00006353463,0.0000012268716,0.06600292],"study_design_scores_gemma":[0.00032540777,0.00007588173,0.25444776,0.00008751349,0.00010841177,0.00003375014,0.000028919067,0.74417967,0.00007658686,0.00036066346,0.0000069645453,0.00026848135],"about_ca_topic_score_codex":0.031397372,"about_ca_topic_score_gemma":0.00021102502,"teacher_disagreement_score":0.6709486,"about_ca_system_score_codex":0.00006697785,"about_ca_system_score_gemma":0.0000701125,"threshold_uncertainty_score":0.99992937},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14504774,0.00024928193,0.85158765,0.000014601648,0.00010873091,0.0017477992,0.000016877284,0.000109357374,0.0011179359],"genre_scores_gemma":[0.6415503,0.000018197452,0.35812306,0.0000052059017,0.000015344183,0.00014834428,0.0000015138662,0.000013632097,0.00012437739],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980705,0.0000873418,0.0007786424,0.0004923936,0.00021145034,0.00035970082],"domain_scores_gemma":[0.9976,0.001320218,0.00037014845,0.00032279608,0.00029373725,0.00009310828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009613708,0.00021901276,0.0005685634,0.00016683439,0.000061363295,0.00009921638,0.00040642824,0.00010319536,0.000008681661],"category_scores_gemma":[0.0003788828,0.00016917314,0.000058452522,0.00018473291,0.000061197374,0.00029422835,0.00010396171,0.000052639007,0.0000013160796],"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.00079578685,0.0010332173,0.039606143,0.027219621,0.0010409702,0.00020881975,0.084887154,0.0024627,0.40450305,0.37210363,0.00022057645,0.065918334],"study_design_scores_gemma":[0.0014803262,0.00048940105,0.0011749116,0.00063763343,0.00004432542,0.00021301149,0.002204061,0.95098466,0.03816097,0.0040767724,0.000013629223,0.00052030146],"about_ca_topic_score_codex":0.0006517445,"about_ca_topic_score_gemma":0.00020078752,"teacher_disagreement_score":0.948522,"about_ca_system_score_codex":0.000035163546,"about_ca_system_score_gemma":0.00015567931,"threshold_uncertainty_score":0.6898681},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070141573,0.00009483214,0.98551273,0.0008307401,0.00004281793,0.0014631891,0.0000032583962,0.000075327895,0.0049629277],"genre_scores_gemma":[0.9049398,0.0000022842296,0.09415007,0.000036503363,0.00007064427,0.00058716873,0.000012661232,0.0000054923585,0.000195396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887806,0.00005923987,0.0003243654,0.00024809808,0.00030493326,0.00018531465],"domain_scores_gemma":[0.9988243,0.00013477192,0.00015789912,0.00039322398,0.00044114506,0.00004864155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010335713,0.00009096916,0.00018176841,0.00006912891,0.00009831567,0.00004942479,0.00039678288,0.00004687668,0.00002533484],"category_scores_gemma":[0.000061729785,0.00007534138,0.00006343574,0.0002494715,0.000017105504,0.00029118516,0.000019186897,0.000053136755,0.00003133841],"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.000009582665,0.000054548847,0.00009419541,0.00004045116,0.00003207947,1.4467677e-8,0.00016788328,0.72476965,0.006070971,0.008436291,0.00040264535,0.25992167],"study_design_scores_gemma":[0.00083958294,0.00003586146,0.0006007942,0.00001788441,0.000020850723,0.0000050236263,0.000012712418,0.98931015,0.006489656,0.0006988011,0.00187942,0.00008928474],"about_ca_topic_score_codex":0.000011297146,"about_ca_topic_score_gemma":0.000011395373,"teacher_disagreement_score":0.8979256,"about_ca_system_score_codex":0.00006719461,"about_ca_system_score_gemma":0.000104556246,"threshold_uncertainty_score":0.3072332},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017683083,0.000039058046,0.8933901,0.00040052793,0.00055104843,0.00017686447,2.4074208e-7,0.00068633346,0.08707275],"genre_scores_gemma":[0.7047868,2.0013902e-8,0.29468337,0.0001283011,0.00008481826,0.000015975127,4.939258e-7,0.0000073453903,0.0002928699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855757,0.000119013,0.0002948636,0.0003301487,0.0004244656,0.00027391833],"domain_scores_gemma":[0.99884355,0.000032191347,0.00007011615,0.00061827776,0.00020757466,0.0002282755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235833,0.00012702025,0.00018406291,0.00007794936,0.00007580085,0.00046631842,0.0007912355,0.00005504689,0.0000051832376],"category_scores_gemma":[0.00009507577,0.0001001725,0.00004736048,0.00033225282,0.000011957619,0.0005411591,0.00017132566,0.00007570963,0.00043706293],"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.000010065528,0.00013301134,0.0046617673,0.00048287344,0.0000815097,0.00035372807,0.006916789,0.03930024,0.0050930893,0.8724333,0.0066024237,0.063931204],"study_design_scores_gemma":[0.00040278203,0.00007109998,0.000114120005,0.000079413476,0.000002213294,0.000055436034,0.0003996551,0.9931581,0.0049008094,0.000055172623,0.0005963681,0.0001648104],"about_ca_topic_score_codex":0.00051357434,"about_ca_topic_score_gemma":0.000016554328,"teacher_disagreement_score":0.9538579,"about_ca_system_score_codex":0.00016201641,"about_ca_system_score_gemma":0.0004466599,"threshold_uncertainty_score":0.56177056},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29951614,0.00029351332,0.69538933,0.000052489857,0.002940828,0.0005009756,0.000004141166,0.0003636402,0.00093891507],"genre_scores_gemma":[0.9793345,0.000003285431,0.020083014,0.000008945337,0.00036857574,0.000024374198,0.0000010943066,0.000043721644,0.00013251399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637663,0.000466227,0.0009097045,0.0008014648,0.00087679597,0.0005691504],"domain_scores_gemma":[0.9965824,0.00079395826,0.00047526724,0.0014224912,0.00036290262,0.00036297573],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013325202,0.00040504982,0.00082536193,0.00035763506,0.00028788362,0.00046009637,0.0011176938,0.00018038129,8.8296986e-7],"category_scores_gemma":[0.00007680258,0.00039965592,0.00014908107,0.00061539176,0.00017591569,0.0005911121,0.000075247044,0.00041673155,0.000047786347],"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.000027188375,0.00032440448,0.00042341364,0.00057228736,0.00046045674,0.0000452659,0.015118231,0.9484011,0.005974669,0.0063497163,0.000053243013,0.022250019],"study_design_scores_gemma":[0.0017828502,0.0003135508,0.00029980706,0.0018293414,0.000089273264,0.0006790534,0.01567008,0.9736325,0.0046168314,0.00028067388,0.000031016818,0.0007749833],"about_ca_topic_score_codex":0.00043135695,"about_ca_topic_score_gemma":8.009334e-7,"teacher_disagreement_score":0.67981833,"about_ca_system_score_codex":0.0002124368,"about_ca_system_score_gemma":0.00019451442,"threshold_uncertainty_score":0.9998455},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033969823,0.000035786376,0.5524555,0.00035069,0.0009822833,0.00039064419,0.000001788883,0.0009569867,0.41085652],"genre_scores_gemma":[0.9111118,0.00000793137,0.08693441,0.00012072483,0.00028523194,0.000025612608,0.0000030015053,0.000022886821,0.0014884355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714,0.00038781716,0.0005681997,0.00074535224,0.00056359294,0.00059503486],"domain_scores_gemma":[0.9977475,0.00027813058,0.00021005442,0.0013655087,0.00019169941,0.00020711965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013360698,0.00028300728,0.00045410605,0.00008218796,0.00016790295,0.00058875186,0.001252332,0.00017564939,0.00015965807],"category_scores_gemma":[0.00012549026,0.00024171722,0.00011515574,0.00038161385,0.00014918605,0.0012629585,0.00031932455,0.0001926638,0.003372116],"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.0000025643676,0.000060029462,0.0003195854,0.00008629565,0.000049717,0.000014450636,0.00090879475,0.0003313832,0.008334097,0.9844886,0.0037960722,0.0016084309],"study_design_scores_gemma":[0.001336155,0.00019165508,0.0006188648,0.00029576194,0.000021573323,0.00043861684,0.0003226701,0.96075755,0.006346381,0.01587,0.012548927,0.0012518221],"about_ca_topic_score_codex":0.0007026727,"about_ca_topic_score_gemma":0.0000038051733,"teacher_disagreement_score":0.9686186,"about_ca_system_score_codex":0.000074516116,"about_ca_system_score_gemma":0.00010827499,"threshold_uncertainty_score":0.99740386},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43832725,0.011404916,0.40877396,0.0005415745,0.030677672,0.02308287,0.00032663686,0.009694889,0.07717023],"genre_scores_gemma":[0.9082565,0.00023504933,0.06314315,0.00003550016,0.0057881474,0.0014996778,0.00014293508,0.00043350024,0.020465566],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893615,0.0011522989,0.0025926766,0.0019087342,0.0017996618,0.0031851153],"domain_scores_gemma":[0.991261,0.0014511942,0.0016084552,0.00335571,0.0008828788,0.0014407362],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0056548906,0.0012425372,0.002210167,0.0008566672,0.00079119095,0.0016610001,0.0028233936,0.0007768833,0.000057003163],"category_scores_gemma":[0.00052231795,0.0011662983,0.00069133757,0.001577866,0.00012885193,0.0030201059,0.0006025049,0.00046875712,0.00542563],"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.0003442861,0.0021257612,0.007285749,0.010853491,0.0026050513,0.000273214,0.01117165,0.1006312,0.75395596,0.059161916,0.043765426,0.007826285],"study_design_scores_gemma":[0.0029549,0.0002819564,0.00084234815,0.0016318132,0.00021576633,0.0008691946,0.00080145325,0.9792756,0.0031980833,0.000035928424,0.007629708,0.0022632608],"about_ca_topic_score_codex":0.0031682556,"about_ca_topic_score_gemma":0.0000024720632,"teacher_disagreement_score":0.8786444,"about_ca_system_score_codex":0.00096728565,"about_ca_system_score_gemma":0.00044250634,"threshold_uncertainty_score":0.99937534},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37387517,0.00004188475,0.61902356,0.00009869746,0.0008046775,0.00024539136,0.0000016813019,0.0001991529,0.0057097822],"genre_scores_gemma":[0.94900805,0.0000012120038,0.05065311,0.00004533683,0.000103699305,0.000033662054,0.0000033302704,0.000012385177,0.00013920943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976692,0.000087120876,0.0006869379,0.00046644546,0.000696463,0.00039381045],"domain_scores_gemma":[0.9979439,0.0002533966,0.00018145291,0.0008838135,0.00042118147,0.00031625025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012036702,0.00019175536,0.0003920358,0.000112809474,0.00007200169,0.0001680425,0.0006620683,0.00011925466,0.0000069442535],"category_scores_gemma":[0.0005125087,0.00015158713,0.00008843102,0.00033683897,0.000065116714,0.00079699676,0.00016224945,0.00015238977,0.00027419333],"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.000057268066,0.00040330004,0.000813686,0.00031404308,0.00007384245,0.00002276757,0.0014362645,0.053196695,0.02251425,0.918379,0.00027057034,0.0025182837],"study_design_scores_gemma":[0.0015016262,0.0003587594,0.000800369,0.0004382401,0.000012985397,0.000028812534,0.001282857,0.7968634,0.19211386,0.00602568,0.000073785995,0.0004996605],"about_ca_topic_score_codex":0.00020198362,"about_ca_topic_score_gemma":0.000007784969,"teacher_disagreement_score":0.91235334,"about_ca_system_score_codex":0.00009842672,"about_ca_system_score_gemma":0.0001323656,"threshold_uncertainty_score":0.61815435},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3561916,0.000039558356,0.6250882,0.00016240677,0.00018440043,0.00009792967,0.0000021768506,0.00019589026,0.018037822],"genre_scores_gemma":[0.7476352,7.3709907e-7,0.25218514,0.000060688904,0.00004236378,0.0000054691677,0.0000021771752,0.0000047687686,0.000063504325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973506,0.000251569,0.0006894979,0.0006808064,0.00061064627,0.00041692617],"domain_scores_gemma":[0.997287,0.00020248318,0.00026269307,0.0017569794,0.0002936631,0.00019722953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002044069,0.00019887488,0.0006340952,0.00018351885,0.00009533051,0.00015770465,0.0014115565,0.00011723779,0.000089823945],"category_scores_gemma":[0.0004912959,0.000175765,0.00031172668,0.0034352997,0.00007950092,0.00074486993,0.00044954903,0.00010875817,0.00006179212],"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.0000147664305,0.00027292606,0.33679023,0.0001425824,0.0017366825,0.0000036574643,0.00038818832,0.20662807,0.00611148,0.42673108,0.000096703465,0.021083614],"study_design_scores_gemma":[0.0002425904,0.000042656524,0.03691613,0.000015861395,0.00017038028,0.0000031697216,0.00006196043,0.9577358,0.0026289357,0.0019468223,0.000046442467,0.00018929632],"about_ca_topic_score_codex":0.00088638585,"about_ca_topic_score_gemma":0.000113264505,"teacher_disagreement_score":0.7511077,"about_ca_system_score_codex":0.000116569405,"about_ca_system_score_gemma":0.00011578581,"threshold_uncertainty_score":0.7167489},"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":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035025716,0.48800325,0.46084735,0.0020419245,0.0026685363,0.009188783,0.000007296641,0.0005307419,0.0016864076],"genre_scores_gemma":[0.72790265,0.088117376,0.17918342,0.0015890633,0.00085258484,0.0019505619,0.0001693906,0.00007365367,0.0001613072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957432,0.00027697755,0.0011278238,0.0006011096,0.0015056027,0.0007452487],"domain_scores_gemma":[0.9957564,0.00048113955,0.0007657021,0.0017379341,0.0010277164,0.00023114227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.014576851,0.0003240012,0.0005426026,0.0005438758,0.00034868173,0.00021741215,0.0015687095,0.00012635064,0.00007521335],"category_scores_gemma":[0.005054066,0.00029284813,0.00017782606,0.003271319,0.000026724578,0.005337048,0.00034842573,0.00020684066,0.00037081458],"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.0000048708425,0.00017074074,0.010156285,0.0072587067,0.00006163726,2.0405578e-7,0.0003549123,0.0050699483,0.0002738269,0.012357297,0.0022373125,0.96205425],"study_design_scores_gemma":[0.0008630287,0.00017511265,0.0050574266,0.0038027235,0.0001956722,0.000034560875,0.000010935353,0.96630687,0.0010248987,0.000999182,0.020855179,0.0006744027],"about_ca_topic_score_codex":0.0000055596815,"about_ca_topic_score_gemma":3.9714845e-7,"teacher_disagreement_score":0.9613798,"about_ca_system_score_codex":0.0003092607,"about_ca_system_score_gemma":0.00029722962,"threshold_uncertainty_score":0.9999524},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019456227,0.0016681355,0.9530848,0.04002189,0.00022453198,0.0024153613,0.0000011110338,0.00035652416,0.00028198236],"genre_scores_gemma":[0.24754745,0.000010711388,0.74457705,0.0052908626,0.00035069408,0.0020218508,0.0000033826652,0.000053494066,0.00014453525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663633,0.00021254765,0.000763888,0.0008762427,0.0006142441,0.00089672656],"domain_scores_gemma":[0.99740225,0.0007805929,0.00048822397,0.0010411241,0.00017591019,0.00011186904],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028697818,0.00041547685,0.00037287766,0.000082901344,0.0013266101,0.0015042162,0.0025703192,0.00010444262,0.0000036520735],"category_scores_gemma":[0.000117920456,0.00025442033,0.00020767671,0.0006307531,0.00012378154,0.0012500633,0.00031056063,0.00045086135,0.000054776745],"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.000012958678,0.00005324617,0.00016473397,0.00017992241,0.000104638246,0.000005386979,0.0021749302,0.5962647,0.020179618,0.0010680096,0.0018119068,0.3779799],"study_design_scores_gemma":[0.0004745109,0.000015983449,0.00014494931,0.00019335441,0.00005265134,0.00009568164,0.00021737225,0.9921405,0.00028503285,0.00039451968,0.0056030895,0.00038239447],"about_ca_topic_score_codex":0.000050929306,"about_ca_topic_score_gemma":0.000015129799,"teacher_disagreement_score":0.39587572,"about_ca_system_score_codex":0.00015043234,"about_ca_system_score_gemma":0.00019375,"threshold_uncertainty_score":0.9999908},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8998053,0.000061177794,0.022800526,0.07103992,0.0030355768,0.0004886958,0.0000059738773,0.0006343033,0.0021285273],"genre_scores_gemma":[0.8693323,0.000004059682,0.11386805,0.015532656,0.00077545084,0.00004262603,0.000014145539,0.000058216032,0.00037249696],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967495,0.00013253232,0.00057185994,0.000844678,0.0007343064,0.00096711796],"domain_scores_gemma":[0.99580747,0.00048927654,0.00027389426,0.0029366,0.00009023889,0.00040254163],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006970435,0.00038323933,0.00039521148,0.00020736559,0.00025112476,0.0005206787,0.0035275726,0.00017365125,0.000105886706],"category_scores_gemma":[0.00040919275,0.00036539245,0.00016627215,0.00046487962,0.00011253623,0.0013140258,0.00063245004,0.0006980103,0.00084424316],"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.000017562084,0.000060260416,0.0010089407,0.00003924414,0.00007648388,0.00022046345,0.0010362435,0.00028614266,0.9035988,0.004288259,0.08333225,0.0060353684],"study_design_scores_gemma":[0.008905045,0.00078721327,0.04334097,0.0007870721,0.0002100936,0.0028333995,0.0013800159,0.06744458,0.32312688,0.005084104,0.5363299,0.00977069],"about_ca_topic_score_codex":0.0028987422,"about_ca_topic_score_gemma":0.00030364064,"teacher_disagreement_score":0.5804719,"about_ca_system_score_codex":0.000078467194,"about_ca_system_score_gemma":0.00017056074,"threshold_uncertainty_score":0.9999337},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18983772,0.000041801206,0.8083567,0.00031899894,0.00079759146,0.00036667506,6.488042e-7,0.00012541404,0.00015441874],"genre_scores_gemma":[0.8997923,0.000006794055,0.0998353,0.00003783525,0.00015031964,0.00009536367,3.8564175e-7,0.000019189523,0.000062497114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772686,0.00027565588,0.00059861835,0.0006703714,0.00024939553,0.00047909413],"domain_scores_gemma":[0.99825734,0.0009364863,0.00012896261,0.00049008924,0.00009271524,0.00009440717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009721763,0.00022991798,0.00038370563,0.0003184516,0.00021686706,0.00026225613,0.00043244398,0.000117181684,0.0000013477146],"category_scores_gemma":[0.000034708133,0.00024256425,0.00008157304,0.00046859102,0.00004402566,0.00050391204,0.000009694285,0.00034523784,0.0000052966516],"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.0000047878025,0.0001066441,0.0001640412,0.00007911777,0.00001083717,0.000003131907,0.0012126116,0.953137,0.0006071531,0.0034691307,0.000008930823,0.041196648],"study_design_scores_gemma":[0.00047344834,0.00006607334,0.00022747557,0.00022296593,0.000003709979,0.00000919342,0.0001575897,0.99539125,0.0017506421,0.0013862093,0.000072684816,0.00023876036],"about_ca_topic_score_codex":0.0011979298,"about_ca_topic_score_gemma":0.000024393132,"teacher_disagreement_score":0.7099546,"about_ca_system_score_codex":0.00018200604,"about_ca_system_score_gemma":0.00006091439,"threshold_uncertainty_score":0.98914826},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08618063,0.0017970692,0.9077182,0.00015365244,0.00028496643,0.0005181837,0.000003343348,0.00018704476,0.0031569495],"genre_scores_gemma":[0.99463624,0.0000056709737,0.004635536,0.00003628645,0.00019652658,0.00007102998,0.0000048695497,0.0000127373305,0.00040110585],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974726,0.00028012105,0.00073142024,0.00069584115,0.0004127417,0.00040731457],"domain_scores_gemma":[0.9982796,0.00020885623,0.00030014422,0.00079104694,0.0002760774,0.0001443116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011476958,0.00028154752,0.00066887436,0.00027069185,0.00018341438,0.00073559344,0.0005150055,0.000099067765,0.0000065225886],"category_scores_gemma":[0.000058034795,0.00019504428,0.00015525593,0.0009094869,0.000080329584,0.00052148517,0.00007256566,0.00017140122,0.000037432896],"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.00011728659,0.00039489803,0.50682783,0.000543304,0.002825334,0.00009450773,0.0015715061,0.07666031,0.008157086,0.38033834,0.00038758293,0.022082034],"study_design_scores_gemma":[0.00051220524,0.00014188123,0.009690686,0.00012213104,0.00019591648,0.00005263252,0.00034893738,0.9867276,0.00049294636,0.00028074274,0.0010499409,0.00038440095],"about_ca_topic_score_codex":0.0035281603,"about_ca_topic_score_gemma":0.00021075162,"teacher_disagreement_score":0.91006726,"about_ca_system_score_codex":0.00008970956,"about_ca_system_score_gemma":0.00005898568,"threshold_uncertainty_score":0.7953675},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35864562,0.00047512984,0.6375459,0.000634537,0.0000644079,0.0020509278,0.00002684473,0.000078403136,0.00047826426],"genre_scores_gemma":[0.9854607,0.0007979335,0.012087824,0.00001895875,0.00008591836,0.0005984335,0.000010563803,0.000024539713,0.0009151237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997857,0.00017444558,0.0005666917,0.00072685827,0.00033416552,0.00034087003],"domain_scores_gemma":[0.9978125,0.00065646967,0.0005223933,0.00039446406,0.0003835079,0.00023064346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007656493,0.0003440414,0.00050479884,0.00017728364,0.0006641856,0.00094121415,0.00040433934,0.0001522546,0.000021741835],"category_scores_gemma":[0.000067140376,0.0002512157,0.0000380499,0.00010882966,0.00034673596,0.0008729915,0.00019004715,0.0002005292,0.0000071924155],"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.0009327242,0.0004526621,0.001139479,0.0032715227,0.001706802,0.0000031254283,0.013107057,0.046804707,0.04490665,0.8605946,0.00039665395,0.026684022],"study_design_scores_gemma":[0.001403912,0.00018714815,0.0005256757,0.0007136474,0.00008741134,0.00006815707,0.00086656475,0.9791921,0.0009248733,0.01560493,0.000064075706,0.00036153977],"about_ca_topic_score_codex":0.001111546,"about_ca_topic_score_gemma":0.000025490934,"teacher_disagreement_score":0.93238735,"about_ca_system_score_codex":0.00003622312,"about_ca_system_score_gemma":0.00031227723,"threshold_uncertainty_score":0.999994},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5483337,0.00014850262,0.44964758,0.000047970367,0.00011836669,0.00012118971,0.000006562566,0.0000970121,0.0014791351],"genre_scores_gemma":[0.9042443,0.000002742429,0.09554876,0.000034586228,0.000039306025,0.000011077225,0.00000781597,0.000008423485,0.0001030045],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976444,0.00020726406,0.00070786866,0.0003943939,0.00039551672,0.0006505305],"domain_scores_gemma":[0.9980497,0.0002603198,0.00032311396,0.0010456111,0.0001489126,0.00017233733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021137279,0.00018961419,0.00048097823,0.0003944945,0.00014697415,0.0001601536,0.0007183473,0.00004434292,0.00028324884],"category_scores_gemma":[0.00014752909,0.00015879022,0.00025084885,0.0016427991,0.000054860004,0.0010297543,0.00048533172,0.00010630735,0.000048176116],"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.0000050711515,0.000206857,0.9298042,0.00013220544,0.001221176,0.000004529566,0.005338603,0.008553312,0.0044516716,0.0063512097,0.000029772313,0.04390138],"study_design_scores_gemma":[0.00024486348,0.000043213193,0.22909826,0.000015744923,0.0002488939,0.00000810654,0.00019817888,0.7661625,0.0031654167,0.0001723091,0.0002941391,0.0003483648],"about_ca_topic_score_codex":0.0014481503,"about_ca_topic_score_gemma":0.00012455469,"teacher_disagreement_score":0.7576092,"about_ca_system_score_codex":0.000066056644,"about_ca_system_score_gemma":0.00007206152,"threshold_uncertainty_score":0.6475277},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18430659,0.000352808,0.5936694,0.0001219346,0.0016023144,0.0007345068,0.0000022565791,0.00073045393,0.21847974],"genre_scores_gemma":[0.9538578,0.0000065883846,0.04309536,0.00000828281,0.00015205295,0.000018937784,0.0000031107254,0.000012294517,0.002845603],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984066,0.00018028961,0.0004627148,0.0002472161,0.00036382917,0.00033937825],"domain_scores_gemma":[0.99839723,0.000116832445,0.00025057822,0.00096235174,0.00013601096,0.00013698595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001274838,0.00012941772,0.00026144338,0.00011462873,0.00005120243,0.000095331445,0.000658747,0.000083017716,0.000051909996],"category_scores_gemma":[0.0000479245,0.00011192633,0.000064083964,0.0003707315,0.000025183102,0.0011478984,0.00011690117,0.000054508073,0.0012529871],"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.000008464807,0.00024581258,0.0036358295,0.00020677071,0.00008858382,0.0000020458149,0.0035225523,0.00067735236,0.6385299,0.34476474,0.0049833395,0.003334596],"study_design_scores_gemma":[0.0010702609,0.0001857301,0.02622841,0.00028470292,0.00005100868,0.00016796973,0.0007575924,0.8170971,0.14842702,0.00033731796,0.00418256,0.0012102693],"about_ca_topic_score_codex":0.00035996013,"about_ca_topic_score_gemma":3.3680956e-7,"teacher_disagreement_score":0.8164198,"about_ca_system_score_codex":0.000046631234,"about_ca_system_score_gemma":0.0000461433,"threshold_uncertainty_score":0.99952465},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10829819,0.00022105883,0.88530356,0.00007161121,0.00021128713,0.0009693992,0.0000012883261,0.00024635816,0.004677247],"genre_scores_gemma":[0.42446613,0.000022477514,0.5747706,0.000028786164,0.000062034815,0.0001188865,0.0000017866197,0.000020485348,0.00050877256],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975056,0.00029358207,0.00063833187,0.00069667015,0.0003351387,0.00053067016],"domain_scores_gemma":[0.9985935,0.00042576037,0.00019844297,0.00054900587,0.000088156405,0.00014511497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018478995,0.00023529027,0.0004843333,0.0002606938,0.00027504447,0.0002751828,0.00046927904,0.00010901982,0.000008625045],"category_scores_gemma":[0.00010365721,0.0002220569,0.000064033346,0.0003467899,0.000038679813,0.0008591785,0.00021150989,0.000096894735,0.000037147205],"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.00017035512,0.0005383394,0.036270484,0.0030707533,0.00056141755,0.0010155488,0.08392191,0.021377234,0.60218173,0.06708535,0.0034538931,0.18035297],"study_design_scores_gemma":[0.0009997366,0.000109337125,0.0017780991,0.00020871082,0.000007746547,0.00041195517,0.00029675072,0.99442345,0.001164356,0.00014405194,0.000104091676,0.00035174412],"about_ca_topic_score_codex":0.0015117994,"about_ca_topic_score_gemma":0.000023739685,"teacher_disagreement_score":0.9730462,"about_ca_system_score_codex":0.00017655693,"about_ca_system_score_gemma":0.00015302197,"threshold_uncertainty_score":0.90552175},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9165644,0.00024639317,0.052730836,0.0022588565,0.00016085307,0.0007610389,0.0000010604288,0.00011038161,0.027166193],"genre_scores_gemma":[0.9575207,0.00006972912,0.038513985,0.000015517759,0.00011530049,0.00012075985,0.0000029324476,0.0000101900205,0.0036308384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724513,0.0006704762,0.00033474382,0.00055694644,0.0006811958,0.00051147625],"domain_scores_gemma":[0.99826485,0.00021009696,0.000015884449,0.000901437,0.00048812057,0.00011960876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033592826,0.00009910662,0.00014745526,0.00045467142,0.0004531345,0.00074347813,0.00086309854,0.00008115262,0.000041523188],"category_scores_gemma":[0.00064664526,0.00009307167,0.000033087144,0.0016579423,0.00007327105,0.0013879912,0.00039384578,0.00049874105,0.00029280703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.000095421194,0.0013870365,0.05148638,0.00013734955,0.00011636748,0.0016973075,0.07004808,0.31134745,0.14436239,0.28294313,0.0058350298,0.13054405],"study_design_scores_gemma":[0.0004754983,0.0001697727,0.010688783,0.00019771753,0.0000013683564,0.00016490428,0.0008158123,0.977368,0.006492789,0.0006606997,0.0026635334,0.0003011175],"about_ca_topic_score_codex":0.007050264,"about_ca_topic_score_gemma":0.0029727668,"teacher_disagreement_score":0.6660205,"about_ca_system_score_codex":0.00029099968,"about_ca_system_score_gemma":0.0004298321,"threshold_uncertainty_score":0.99956185},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17187847,0.13817282,0.5697299,0.026352657,0.0142424125,0.0014190729,0.00006684444,0.0015303,0.07660753],"genre_scores_gemma":[0.7841342,0.0018529781,0.18505661,0.0011888857,0.0028250916,0.000020225421,0.000005807716,0.00015371465,0.024762506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9921887,0.0021364777,0.0019196526,0.0006954502,0.0015301446,0.0015295856],"domain_scores_gemma":[0.995891,0.0004181927,0.001414127,0.0009501481,0.00058204884,0.00074451516],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0041566966,0.0007302881,0.0009183678,0.00047169297,0.0009973217,0.0037778292,0.0019633903,0.00030577352,0.0005910578],"category_scores_gemma":[0.0004522332,0.0006803695,0.00047778076,0.0007829669,0.0002801831,0.007708414,0.00066863064,0.0012460194,0.0030249686],"study_design_candidate":"design_other","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.000010857392,0.00029033172,0.0012801862,0.00074642943,0.00047160036,0.0010390382,0.0066709537,0.006463524,0.00079431076,0.074260265,0.033815052,0.8741574],"study_design_scores_gemma":[0.0029663525,0.0008019822,0.24593014,0.0071076485,0.0003293163,0.039805695,0.0008107204,0.49842495,0.0011839209,0.012656599,0.187934,0.002048702],"about_ca_topic_score_codex":0.00025175654,"about_ca_topic_score_gemma":0.00007075249,"teacher_disagreement_score":0.87210876,"about_ca_system_score_codex":0.00092196505,"about_ca_system_score_gemma":0.0008418366,"threshold_uncertainty_score":0.99956477},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62893176,0.0015008961,0.24614035,0.037750214,0.001884199,0.018733174,0.0004058809,0.03736956,0.027283976],"genre_scores_gemma":[0.785754,0.00002569656,0.21163802,0.0013319404,0.000062044,0.0006343332,0.00008027265,0.00012829195,0.00034538857],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9927806,0.00056548626,0.0016341632,0.0020875062,0.0014755544,0.0014566733],"domain_scores_gemma":[0.994167,0.0009604369,0.00040698008,0.0032789188,0.00044120918,0.00074548885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008834152,0.0011081529,0.0011897577,0.00039000693,0.00068862876,0.000713761,0.0034861888,0.0011290926,0.0004072174],"category_scores_gemma":[0.0008761011,0.000954869,0.00056747464,0.0017715377,0.0007509366,0.0021239829,0.00066464726,0.0016105556,0.0005708271],"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.000040307885,0.00034352182,0.000041292173,0.000024859142,0.000038800623,0.000017072782,0.000031156957,0.08291206,0.90516335,0.003471051,0.0050025773,0.0029139575],"study_design_scores_gemma":[0.006094818,0.005551697,0.7421254,0.0018684801,0.0003497223,0.00025628318,0.00015461653,0.17731465,0.004667108,0.036642008,0.017261919,0.0077133067],"about_ca_topic_score_codex":0.00012886948,"about_ca_topic_score_gemma":0.0040659863,"teacher_disagreement_score":0.90049624,"about_ca_system_score_codex":0.00063351344,"about_ca_system_score_gemma":0.0004363054,"threshold_uncertainty_score":0.99929017},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012726242,0.00006965825,0.9817913,0.00010630119,0.00039185327,0.000651788,0.0000070125,0.0003238264,0.003932028],"genre_scores_gemma":[0.19511642,0.0000011149414,0.80376685,0.00009215168,0.00023354027,0.000024271492,0.000007956902,0.000028928118,0.00072875776],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973624,0.00005977053,0.00073968567,0.00072997296,0.00037879776,0.0007294206],"domain_scores_gemma":[0.9975748,0.0003051991,0.00030631217,0.0011145099,0.00041254415,0.0002866308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027948378,0.00027256543,0.00045148944,0.00022028883,0.00029751798,0.0002896028,0.0013582469,0.00018936592,0.000060845116],"category_scores_gemma":[0.000120294295,0.00025819655,0.00013338482,0.0006326084,0.0000675732,0.0012764826,0.00020202462,0.00017627032,0.00007689069],"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.00012648177,0.0010591018,0.00085713196,0.00068246305,0.00031384733,0.000024563564,0.004696465,0.0074670278,0.7378256,0.06434648,0.0003757002,0.18222518],"study_design_scores_gemma":[0.00075978687,0.00031976338,0.00022316173,0.000053856245,0.00001468566,0.000036940834,0.00018388745,0.97318244,0.023334185,0.0004470453,0.0010977458,0.00034652455],"about_ca_topic_score_codex":0.0008672812,"about_ca_topic_score_gemma":0.0000325406,"teacher_disagreement_score":0.9657154,"about_ca_system_score_codex":0.000088783825,"about_ca_system_score_gemma":0.00021623938,"threshold_uncertainty_score":0.999987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028114546,0.00028434966,0.9673068,0.000049415252,0.0020318564,0.00087838655,0.0000068565582,0.0011102046,0.000217616],"genre_scores_gemma":[0.7715825,0.000002614327,0.22735365,0.00005881916,0.0006358058,0.00013976546,0.000014695475,0.000059331873,0.00015285649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964223,0.0001894777,0.0008944478,0.0008675658,0.0005982236,0.0010279673],"domain_scores_gemma":[0.9972033,0.0002109031,0.00029345814,0.0015433455,0.00044485237,0.0003041709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002562623,0.0003683774,0.00060005684,0.00019884568,0.00052956335,0.00096755434,0.0014785008,0.00022333987,0.0000011570099],"category_scores_gemma":[0.00021530512,0.00035280065,0.00017847883,0.00029780559,0.000020137617,0.0028017398,0.00022045677,0.00019633399,0.000053698048],"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.00000988733,0.000045163208,0.000746293,0.00054181187,0.00003485861,0.0000034592447,0.0010040841,0.9646148,0.00086461625,0.024522368,0.00015706696,0.0074555855],"study_design_scores_gemma":[0.00047532018,0.00014258621,0.000004693805,0.0002825375,0.00001739942,0.00006993103,0.0001984968,0.9960626,0.00012214528,0.0013314455,0.00084211404,0.00045077028],"about_ca_topic_score_codex":0.0005718943,"about_ca_topic_score_gemma":0.000015037102,"teacher_disagreement_score":0.7434679,"about_ca_system_score_codex":0.00011457826,"about_ca_system_score_gemma":0.00014530306,"threshold_uncertainty_score":0.9998924},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8381244,0.00040799202,0.00018120422,0.00952119,0.002159406,0.0022285844,0.00002299865,0.0067710034,0.1405832],"genre_scores_gemma":[0.9721398,0.00007722448,0.025350835,0.00094860385,0.00040796638,0.00031166882,0.00001924832,0.00012189879,0.000622787],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.992992,0.00021495824,0.0015560027,0.0020734803,0.0017795359,0.0013840495],"domain_scores_gemma":[0.9948744,0.00045470844,0.0005345708,0.002846745,0.0003170098,0.00097253564],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014288238,0.000986216,0.0012066629,0.00038144435,0.000771593,0.00045356946,0.0028448603,0.001051435,0.00014306004],"category_scores_gemma":[0.001051516,0.00087796646,0.0005382494,0.001577653,0.00078818935,0.0022045583,0.0017124069,0.001393478,0.0008018921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.00022682923,0.0002441954,0.0004903975,0.00007968077,0.000058342976,0.0001647297,0.00029612266,0.00028311517,0.96767414,0.019346135,0.0054605617,0.0056757787],"study_design_scores_gemma":[0.0019652832,0.001682944,0.94493675,0.0005202687,0.000056118013,0.0011889408,0.00025744908,0.000006857133,0.0009603675,0.004414579,0.042543393,0.0014670603],"about_ca_topic_score_codex":0.00015516738,"about_ca_topic_score_gemma":0.047632605,"teacher_disagreement_score":0.9667137,"about_ca_system_score_codex":0.0013343565,"about_ca_system_score_gemma":0.00026987074,"threshold_uncertainty_score":0.9999761},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01246858,0.000051579213,0.9296872,0.00046293755,0.0001262457,0.0007088888,0.0000030275048,0.00046168038,0.05602985],"genre_scores_gemma":[0.45298868,0.000054953336,0.54125077,0.000079961275,0.000065446635,0.00012821487,0.000026646147,0.000015058659,0.0053902706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988403,0.00010244627,0.0002908762,0.00032029234,0.00021808322,0.00022805289],"domain_scores_gemma":[0.99838626,0.00018753628,0.0001328111,0.0009491739,0.000271392,0.00007282645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036846686,0.00012663125,0.0001793068,0.00007570688,0.00038402018,0.00013984265,0.0008305127,0.0000764983,0.000038367205],"category_scores_gemma":[0.000049264596,0.00011944675,0.00006717321,0.00024716725,0.000033485747,0.0013931079,0.00015181696,0.00006985388,0.00025561775],"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.00018947785,0.0005175613,0.0011242814,0.000136442,0.0002660201,0.000026859085,0.012706108,0.012692789,0.12472067,0.649537,0.1640975,0.03398525],"study_design_scores_gemma":[0.00082245126,0.00020610838,0.002093327,0.0000517127,0.000007690581,0.00006105928,0.00011559787,0.9703748,0.019312061,0.0019488368,0.004595769,0.0004105536],"about_ca_topic_score_codex":0.00033903858,"about_ca_topic_score_gemma":0.000011044244,"teacher_disagreement_score":0.957682,"about_ca_system_score_codex":0.00008103174,"about_ca_system_score_gemma":0.00011442993,"threshold_uncertainty_score":0.4870897},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33491203,0.00011176059,0.6481402,0.00015892155,0.00028954403,0.00030395872,0.0000038426842,0.0007640569,0.01531567],"genre_scores_gemma":[0.5990116,0.0000032136836,0.39937556,0.000025951842,0.00012439449,0.000010479108,0.0000066108123,0.000024652834,0.0014175266],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968544,0.00012978587,0.0009433963,0.00074452243,0.00070316857,0.0006246789],"domain_scores_gemma":[0.9977315,0.00026695273,0.0003944522,0.001176962,0.00028945834,0.00014068326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077315257,0.00031981515,0.0005401027,0.00024264783,0.00017661478,0.00018703617,0.001303878,0.00017277234,0.000064372965],"category_scores_gemma":[0.0001098766,0.00028906812,0.00019602894,0.00064315536,0.000066893466,0.0009983629,0.0003924888,0.00019308037,0.0003177094],"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.00005161473,0.00076249323,0.023946524,0.00066743355,0.00020751258,0.0003174415,0.0026207312,0.18038023,0.67088544,0.0742135,0.0032250292,0.042722072],"study_design_scores_gemma":[0.0015924904,0.00017231746,0.012565028,0.0006860286,0.000035665314,0.00018350346,0.00020100425,0.89356124,0.086020194,0.0031090577,0.00056979974,0.0013036664],"about_ca_topic_score_codex":0.0033119735,"about_ca_topic_score_gemma":0.00004268388,"teacher_disagreement_score":0.713181,"about_ca_system_score_codex":0.000086188826,"about_ca_system_score_gemma":0.00014759328,"threshold_uncertainty_score":0.99995613},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6262158,0.00006811949,0.3355816,0.00024069987,0.00012339008,0.00036787518,0.0000029706641,0.0004484201,0.036951136],"genre_scores_gemma":[0.98382103,0.0000020090472,0.01402211,0.000015590767,0.00011744184,0.000020599682,0.000012860389,0.000012412484,0.0019759543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980775,0.0001859279,0.00047584405,0.00058694836,0.00036680512,0.00030694075],"domain_scores_gemma":[0.99865746,0.00017290845,0.0001999717,0.0007431718,0.00011666329,0.00010984318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007798301,0.00019845655,0.0003581574,0.00034965487,0.00018948985,0.00088326324,0.00039042646,0.00008887774,0.00002044732],"category_scores_gemma":[0.000034137163,0.00015065166,0.00011935499,0.0010600482,0.000023056013,0.0006312735,0.00007777476,0.00008582013,0.00016084407],"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.000018790446,0.00031252415,0.10498904,0.00013391573,0.0010570431,0.000047214595,0.0010348209,0.47716096,0.24972962,0.15360759,0.0044862684,0.007422202],"study_design_scores_gemma":[0.00012735547,0.000053898835,0.06850857,0.000021124411,0.00004042793,0.00001359783,0.00005783214,0.93070185,0.00023589455,0.000040343042,0.00002027755,0.0001788054],"about_ca_topic_score_codex":0.005262762,"about_ca_topic_score_gemma":0.00003696541,"teacher_disagreement_score":0.4535409,"about_ca_system_score_codex":0.00012646163,"about_ca_system_score_gemma":0.000053909924,"threshold_uncertainty_score":0.8517328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06329054,0.00059892226,0.85769796,0.0006298931,0.00044946163,0.0013429394,0.0000074900604,0.0009410078,0.07504181],"genre_scores_gemma":[0.7343969,0.000032315522,0.26315105,0.000093400624,0.0003337705,0.000068273905,0.0000079411975,0.000024379098,0.0018919698],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831903,0.00012988866,0.0003872706,0.0005360892,0.0002902762,0.00033746014],"domain_scores_gemma":[0.99865615,0.00012684258,0.00015833741,0.0008562332,0.0000739259,0.00012853609],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023016377,0.00017575656,0.00022922264,0.000107983644,0.00015752461,0.0003160927,0.0007639879,0.000069880676,0.0009597299],"category_scores_gemma":[0.00004467242,0.00015570696,0.000080417274,0.00040926243,0.00003540646,0.00044715693,0.00017876328,0.00012214962,0.0019248399],"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.000006163248,0.00054337125,0.0010330522,0.00010079359,0.00018844169,0.00020274772,0.019221207,0.0016695167,0.61359,0.21185079,0.0063165925,0.1452773],"study_design_scores_gemma":[0.00029570417,0.00002340522,0.0004704893,0.000102662336,0.000009052826,0.00002757405,0.00018051988,0.99294513,0.004264895,0.00066261465,0.00069202116,0.00032595245],"about_ca_topic_score_codex":0.0006190497,"about_ca_topic_score_gemma":0.000005887375,"teacher_disagreement_score":0.9912756,"about_ca_system_score_codex":0.00010638851,"about_ca_system_score_gemma":0.000028774923,"threshold_uncertainty_score":0.9999535},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6792707,0.000018798899,0.28161803,0.0009279629,0.00059479935,0.0021515375,0.0000080238815,0.00084800547,0.034562152],"genre_scores_gemma":[0.96190137,5.6382476e-7,0.035555705,0.000065876324,0.000119215954,0.00006687012,0.000005927589,0.000009696345,0.0022747593],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978107,0.00013096546,0.0005887323,0.00062794413,0.00029959506,0.00054202136],"domain_scores_gemma":[0.9986693,0.00014443646,0.00010177429,0.00085407746,0.00008742341,0.00014296222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001126031,0.00020360957,0.00036706933,0.00016465534,0.00005784653,0.00023909014,0.0007842664,0.0000972146,0.000024528716],"category_scores_gemma":[0.00006157773,0.0001599869,0.000106431115,0.000286997,0.000026063753,0.0005119467,0.00008340535,0.00010189181,0.000098527205],"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.0009782877,0.002080515,0.2560705,0.0023905446,0.00038409236,0.0006389132,0.032989636,0.053714916,0.20609729,0.24244411,0.024567137,0.17764406],"study_design_scores_gemma":[0.0020059291,0.0010800138,0.16723241,0.00014364191,0.000011844497,0.00037318154,0.00008181611,0.82088023,0.0037056794,0.0031299011,0.00051985617,0.00083549815],"about_ca_topic_score_codex":0.00040987786,"about_ca_topic_score_gemma":0.000013889835,"teacher_disagreement_score":0.7671653,"about_ca_system_score_codex":0.00011186136,"about_ca_system_score_gemma":0.00009120076,"threshold_uncertainty_score":0.65240765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022741955,0.000039933933,0.974369,0.0006155248,0.0002560804,0.0002851737,0.000009644487,0.0004369398,0.0012457675],"genre_scores_gemma":[0.8387116,8.8517176e-8,0.16113342,0.000079040066,0.000037248974,0.000020771271,0.0000014625065,0.0000070511555,0.000009301493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857676,0.00008229746,0.00041390784,0.00030425278,0.00035137203,0.0002714044],"domain_scores_gemma":[0.99861705,0.00016279116,0.0001829765,0.00077877083,0.00014444448,0.000113969625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040395287,0.00013571416,0.0003158369,0.000083710955,0.000051384504,0.00009652185,0.000739217,0.000109310036,0.0000071888994],"category_scores_gemma":[0.000100756,0.00011084439,0.00011185202,0.0005238071,0.000032146643,0.000208291,0.000054872347,0.00011378815,0.000091078036],"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.000016904223,0.000117396645,0.0016161967,0.0002578258,0.000060299484,0.000052469095,0.00021336897,0.03755716,0.0043502916,0.95504457,0.00007866409,0.0006348777],"study_design_scores_gemma":[0.006496301,0.0003655798,0.0032330262,0.0015380712,0.00003323602,0.00007298662,0.00020201658,0.96532816,0.016769119,0.0051455908,0.0002850923,0.0005308154],"about_ca_topic_score_codex":0.00017632221,"about_ca_topic_score_gemma":0.000007916907,"teacher_disagreement_score":0.94989896,"about_ca_system_score_codex":0.00012990019,"about_ca_system_score_gemma":0.00026346862,"threshold_uncertainty_score":0.4520103},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053899966,0.00028009719,0.9415827,0.0020680146,0.00027968103,0.0005128564,0.0000012569715,0.00010272988,0.0012727028],"genre_scores_gemma":[0.98244435,0.00007662027,0.0138846645,0.00017318374,0.00067638373,0.000079035555,0.0000018902625,0.000038812625,0.0026250915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963804,0.00013079889,0.00048035334,0.00047583555,0.00044174943,0.0020908471],"domain_scores_gemma":[0.99873686,0.00013195448,0.00023811992,0.00047136456,0.00022898884,0.00019270854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026643674,0.00022244439,0.00024846784,0.00016302036,0.00026759852,0.00028538922,0.0010930899,0.00010475513,0.0000056136973],"category_scores_gemma":[0.00013439528,0.00016009345,0.00014239132,0.00021781276,0.000022990129,0.0010520923,0.0001414211,0.0004514106,0.00030764792],"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.0001967468,0.00041504277,0.0007858795,0.00009414379,0.0005734833,0.0000105748295,0.0023517404,0.008720291,0.032572232,0.3472984,0.0019891674,0.6049923],"study_design_scores_gemma":[0.016237715,0.00660143,0.0016992008,0.0018125981,0.00024682042,0.010573452,0.002709194,0.54316497,0.021960685,0.3703847,0.019043088,0.005566155],"about_ca_topic_score_codex":0.00004211644,"about_ca_topic_score_gemma":0.0001079899,"teacher_disagreement_score":0.92854434,"about_ca_system_score_codex":0.0010749296,"about_ca_system_score_gemma":0.0013051679,"threshold_uncertainty_score":0.6528421},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029759686,0.00014512289,0.99227494,0.00018481982,0.0004192552,0.00060418976,4.1428333e-7,0.0025004535,0.0008948238],"genre_scores_gemma":[0.6372229,0.000001062414,0.36255592,0.00007881134,0.000046364905,0.00002585653,2.2728508e-7,0.000012963273,0.00005586937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975635,0.00036901748,0.0006480583,0.000583791,0.00031138744,0.0005242628],"domain_scores_gemma":[0.99884266,0.00016173568,0.000109807144,0.0006798426,0.0000617779,0.00014419365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007967581,0.0002370658,0.00041179807,0.00025099414,0.00008974618,0.00034230977,0.0008992171,0.0001221139,0.000010963334],"category_scores_gemma":[0.000013806582,0.0002085294,0.00007516262,0.00047994682,0.000014367047,0.00076513464,0.000105306084,0.00015325601,0.00059288903],"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.0000024596907,0.00006527157,0.000118315744,0.000038522132,0.00002032863,0.00008613024,0.00051439775,0.9903914,0.00026190467,0.0066381083,0.0002545138,0.001608701],"study_design_scores_gemma":[0.0014443422,0.00003380779,0.00006177408,0.00012422216,0.0000033130848,0.00009061043,0.000024025525,0.99787635,0.00006848196,0.000018571996,0.000007556892,0.00024697193],"about_ca_topic_score_codex":0.00026448065,"about_ca_topic_score_gemma":0.000008860463,"teacher_disagreement_score":0.63424695,"about_ca_system_score_codex":0.00018108734,"about_ca_system_score_gemma":0.000027031108,"threshold_uncertainty_score":0.8503582},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18967332,0.00058022904,0.77918243,0.0029596759,0.014011618,0.009198465,0.0000265993,0.0008475803,0.003520066],"genre_scores_gemma":[0.8290728,0.0000022293104,0.17017105,0.000016312875,0.000119821925,0.00029503324,0.0000016282489,0.000021471413,0.00029970362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872667,0.000023009414,0.00041192584,0.00019557761,0.0003272072,0.00031561317],"domain_scores_gemma":[0.9975963,0.00019520367,0.0007755998,0.0002395427,0.001047104,0.00014624164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017067229,0.0001233713,0.0001641533,0.00016665192,0.00025458867,0.0002916501,0.00090563373,0.00012972571,0.0000010891048],"category_scores_gemma":[0.001826288,0.00010014954,0.000068738416,0.0005554775,0.000014644187,0.00064795325,0.000026152815,0.00012234705,0.0000021504993],"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.0000072231437,0.0001135555,0.0049389424,0.0005991177,0.0001842169,4.122868e-8,0.010956889,0.0071562086,0.0028569293,0.96431744,0.002811993,0.0060574636],"study_design_scores_gemma":[0.00027523522,0.00014466271,0.0185927,0.0005671526,0.00006699634,0.000008101383,0.0015976221,0.9481136,0.013031434,0.014201966,0.0029494667,0.0004510146],"about_ca_topic_score_codex":0.004189215,"about_ca_topic_score_gemma":0.00032019382,"teacher_disagreement_score":0.95011544,"about_ca_system_score_codex":0.000864633,"about_ca_system_score_gemma":0.0007700821,"threshold_uncertainty_score":0.6332868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010306892,0.000035362886,0.94872713,0.00013421665,0.00010657777,0.00020728295,8.659554e-7,0.00026920447,0.04021244],"genre_scores_gemma":[0.6408622,0.0000034210277,0.3526705,0.000025695888,0.000070222246,0.000008122794,0.0000021029687,0.000013485632,0.006344219],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984851,0.00015207917,0.0004120425,0.00033566792,0.00034668884,0.0002684557],"domain_scores_gemma":[0.99885714,0.000196119,0.00014955709,0.00065189536,0.00008332143,0.0000619636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006344456,0.00014492492,0.00025545937,0.00012202839,0.00004869716,0.00007900512,0.0007524143,0.000064096326,0.00009723393],"category_scores_gemma":[0.000020944852,0.00012062993,0.00006271034,0.00036695402,0.00003435975,0.00040252478,0.00016576034,0.00006385432,0.00038382073],"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.000026826672,0.00026023563,0.00063817034,0.00003457711,0.000049142454,0.00005779034,0.00041216647,0.039497424,0.7196568,0.22055982,0.009519061,0.009287959],"study_design_scores_gemma":[0.0005362287,0.00024111422,0.0009883804,0.00003449421,0.000007204711,0.00005604667,0.000012050746,0.9410035,0.054098945,0.0025414175,0.00018112829,0.00029948843],"about_ca_topic_score_codex":0.0018396123,"about_ca_topic_score_gemma":0.000007637518,"teacher_disagreement_score":0.90150607,"about_ca_system_score_codex":0.000031305866,"about_ca_system_score_gemma":0.000075339725,"threshold_uncertainty_score":0.4933367},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5568168,0.000916454,0.43693525,0.00006663163,0.00027037066,0.0009688033,0.0000056322124,0.00039223276,0.0036277922],"genre_scores_gemma":[0.92996824,0.000014028977,0.06932514,0.000015010779,0.00022013181,0.00016675505,0.000029954997,0.000046267745,0.00021446537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949962,0.0009283152,0.0008107295,0.0008580608,0.0014881222,0.0009186005],"domain_scores_gemma":[0.9965855,0.0003639027,0.0006045959,0.0014189627,0.00050328794,0.000523781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048935357,0.00045919718,0.0008488075,0.00084256486,0.00027401588,0.0007376667,0.0006387119,0.00016940731,0.000028968614],"category_scores_gemma":[0.00009970053,0.00037545542,0.00016566759,0.0023440016,0.00008643944,0.0017206141,0.00012726692,0.00019624658,0.00023924191],"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.00017665367,0.00073643844,0.3835388,0.0013172863,0.0051956372,0.000055902787,0.0056826854,0.5050999,0.0527458,0.014974352,0.00015007461,0.030326463],"study_design_scores_gemma":[0.0010058958,0.00011382066,0.02109079,0.00023029663,0.0005078567,0.000041970503,0.00021672112,0.97470677,0.0014295445,0.000028320434,0.00007157256,0.00055641594],"about_ca_topic_score_codex":0.0014336999,"about_ca_topic_score_gemma":0.00004663868,"teacher_disagreement_score":0.4696069,"about_ca_system_score_codex":0.00029746475,"about_ca_system_score_gemma":0.00032621276,"threshold_uncertainty_score":0.99986976},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10937423,0.00002625435,0.884523,0.0006000856,0.00014012592,0.0007714698,0.0000030290078,0.00034079445,0.004221057],"genre_scores_gemma":[0.34566316,0.000009547765,0.6508047,0.00024043716,0.0002554828,0.00015069862,0.0000053255644,0.000022246708,0.0028483742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998213,0.00004407115,0.00044340754,0.00061033224,0.00018382927,0.00050537195],"domain_scores_gemma":[0.9984459,0.0004690377,0.0001436922,0.00065953674,0.00012492598,0.00015684984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001142648,0.00018094335,0.00027070707,0.00016352914,0.00024143198,0.00020304928,0.00059136696,0.0001334702,0.0000243278],"category_scores_gemma":[0.00007388379,0.00016791014,0.00007104552,0.00030767804,0.000078006226,0.00046229843,0.0002281002,0.00009228277,0.0000809171],"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.000033388733,0.00007176634,0.00041124606,0.00004532617,0.00006221465,0.000010669146,0.0009244846,0.00011676111,0.26445827,0.6587049,0.0019024713,0.073258564],"study_design_scores_gemma":[0.0074127857,0.001637663,0.010681239,0.00025155264,0.00014837294,0.0017020808,0.0012748755,0.55535746,0.31216985,0.043153,0.062179737,0.0040314104],"about_ca_topic_score_codex":0.00011767856,"about_ca_topic_score_gemma":0.000017229017,"teacher_disagreement_score":0.6155518,"about_ca_system_score_codex":0.00005870635,"about_ca_system_score_gemma":0.00006967297,"threshold_uncertainty_score":0.68471766},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018844241,0.000058185225,0.93438405,0.0006475042,0.00019218118,0.0010395441,0.0000012504275,0.00057998224,0.061212882],"genre_scores_gemma":[0.20235862,0.0000024693925,0.78599155,0.00018566084,0.00027721399,0.00018294154,0.0000030153838,0.000025322664,0.010973196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786174,0.00014947202,0.0004843149,0.0006148423,0.00031118593,0.000578438],"domain_scores_gemma":[0.9984327,0.00046669162,0.00016295192,0.00062055787,0.00020765942,0.000109445886],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010898226,0.00024357472,0.00039082678,0.00013556845,0.00016105824,0.00035811274,0.0008429929,0.00013544704,0.000052816056],"category_scores_gemma":[0.00007419399,0.00019267964,0.00016888976,0.00031190773,0.00003686873,0.00058808125,0.0001160215,0.00007809201,0.00089199434],"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.00006205341,0.00012752536,0.00007892888,0.000034690253,0.00006533519,0.000018178227,0.00008621253,0.016160019,0.12696151,0.8245916,0.02946048,0.0023534894],"study_design_scores_gemma":[0.0027816661,0.0002637909,0.0004552186,0.000033657547,0.00002055226,0.00004956468,0.000017523098,0.8789634,0.01015454,0.10476202,0.0018803106,0.0006177383],"about_ca_topic_score_codex":0.00034343568,"about_ca_topic_score_gemma":0.0000037800903,"teacher_disagreement_score":0.8628034,"about_ca_system_score_codex":0.000097961565,"about_ca_system_score_gemma":0.00013470982,"threshold_uncertainty_score":0.9998859},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7624238,0.00043269288,0.19583175,0.0003553016,0.0015637738,0.0003140763,0.000002175417,0.0008169248,0.03825952],"genre_scores_gemma":[0.6736229,0.0000032143075,0.3259805,0.00013954494,0.00012240506,0.000009353673,0.0000016846577,0.00001429884,0.00010610257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998078,0.00011090054,0.00038488198,0.00055683055,0.0003754954,0.000493898],"domain_scores_gemma":[0.9976686,0.0002889667,0.00022328901,0.0015401564,0.000098110264,0.00018083288],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00058674056,0.00022130534,0.00025255315,0.00014928346,0.00019971708,0.00034630098,0.00277712,0.000115470866,0.0000806584],"category_scores_gemma":[0.00033780624,0.00020051873,0.00008188079,0.00036575948,0.000055061802,0.0013934736,0.00058307697,0.00020060982,0.0010460756],"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.00017877932,0.00094399607,0.103357546,0.0007069092,0.00092543213,0.0020464945,0.07027536,0.0027976322,0.028260468,0.68044895,0.0020425578,0.10801586],"study_design_scores_gemma":[0.0064501,0.0018548102,0.099315286,0.0014714878,0.00037152594,0.001440012,0.004757797,0.5577734,0.14491735,0.15682629,0.016782083,0.008039826],"about_ca_topic_score_codex":0.0004657067,"about_ca_topic_score_gemma":0.00005098856,"teacher_disagreement_score":0.5549758,"about_ca_system_score_codex":0.000034749908,"about_ca_system_score_gemma":0.000086475826,"threshold_uncertainty_score":0.9997317},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2869814,0.0000019224567,0.7114226,0.00020610483,0.00010823535,0.00069574703,0.000007404658,0.0003802935,0.00019624607],"genre_scores_gemma":[0.9329196,2.981786e-7,0.06646058,0.00008330133,0.0002271801,0.00004228482,0.00020966887,0.000031610572,0.000025435003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717814,0.0003657581,0.00071801327,0.00079844403,0.000512471,0.000427148],"domain_scores_gemma":[0.9967677,0.001186601,0.00025212133,0.0012438192,0.00032554424,0.00022421415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082241546,0.0002565861,0.00030693618,0.00040371568,0.00020293207,0.0003087415,0.00060566823,0.00025292617,0.000019948076],"category_scores_gemma":[0.00064218417,0.00028816253,0.00006145514,0.001486037,0.000019524057,0.0017500842,0.00013047569,0.00018771415,0.00036210183],"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.000012484467,0.00006411466,0.004265627,0.000009534256,0.0000036100864,4.6153556e-7,0.0005769856,0.9732496,0.005015434,0.00642699,0.000003707026,0.010371466],"study_design_scores_gemma":[0.00031329138,0.00007853073,0.043394577,0.00004815732,0.0000059995036,4.2157708e-7,0.000010998664,0.9467809,0.00019053309,0.008549812,0.00032540137,0.00030136507],"about_ca_topic_score_codex":0.00014142426,"about_ca_topic_score_gemma":0.00005153558,"teacher_disagreement_score":0.6459382,"about_ca_system_score_codex":0.00025720097,"about_ca_system_score_gemma":0.000051584004,"threshold_uncertainty_score":0.999957},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10996814,0.00016784816,0.8808923,0.0010889227,0.00025941874,0.00045957236,0.0000014985767,0.00042684693,0.0067354892],"genre_scores_gemma":[0.61894643,0.0000014896492,0.38026515,0.0002787972,0.00014865074,0.000017570763,9.868442e-7,0.000008756349,0.00033215218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982838,0.000058052156,0.00032468728,0.0005651794,0.00027477805,0.0004934771],"domain_scores_gemma":[0.9986685,0.00035063026,0.00015130485,0.000539342,0.00014727493,0.0001429783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004416997,0.00019477066,0.00025540552,0.0001377331,0.00027178857,0.0003244728,0.00081898767,0.00008794598,0.000008777884],"category_scores_gemma":[0.00031295483,0.00017345045,0.00012402615,0.00027956974,0.00001913524,0.0010238264,0.00011493704,0.00013582181,0.00004471475],"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.00016511846,0.00042898205,0.0021443847,0.0001458715,0.0002170674,0.000058422633,0.022845527,0.044335555,0.2476107,0.10325577,0.001981192,0.57681143],"study_design_scores_gemma":[0.000862804,0.00019027443,0.00282327,0.00007693825,0.0000074856803,0.000020526513,0.00065155956,0.9473964,0.040795393,0.0037207776,0.0029796488,0.00047492172],"about_ca_topic_score_codex":0.00012123399,"about_ca_topic_score_gemma":0.000014049121,"teacher_disagreement_score":0.90306085,"about_ca_system_score_codex":0.00007089499,"about_ca_system_score_gemma":0.00005297579,"threshold_uncertainty_score":0.70731044},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007190504,0.0000033981303,0.95688534,0.0005923684,0.00022195342,0.0345196,0.000008666229,0.00043978854,0.00013838107],"genre_scores_gemma":[0.095897436,0.0000013398974,0.88947916,0.00008089579,0.00031030053,0.0139592495,0.000048371094,0.00004615581,0.00017707207],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977426,0.00016010368,0.00064183446,0.000637726,0.00030403343,0.00051371893],"domain_scores_gemma":[0.9975144,0.00051554234,0.00039250104,0.0010579536,0.00023827657,0.00028129833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091472385,0.00036815737,0.00046075918,0.000129471,0.00041168707,0.001002506,0.0010658111,0.00019002783,0.000010827533],"category_scores_gemma":[0.000065556815,0.00032057066,0.000118739496,0.00016414051,0.000048955146,0.0005406688,0.0003135772,0.00045936185,0.000017667433],"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.0003365423,0.0005030563,0.00049388513,0.0006934107,0.00053228106,0.00003132243,0.0016832381,0.35538754,0.07329617,0.060692,0.004862636,0.5014879],"study_design_scores_gemma":[0.002503813,0.00022573485,0.0008597562,0.00018092619,0.00002101452,0.00004794432,0.000008854003,0.9834234,0.008136956,0.0032455013,0.0009756061,0.00037046013],"about_ca_topic_score_codex":0.0002847018,"about_ca_topic_score_gemma":0.00002912492,"teacher_disagreement_score":0.6280359,"about_ca_system_score_codex":0.00008003994,"about_ca_system_score_gemma":0.0002727409,"threshold_uncertainty_score":0.99992466},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060520396,0.00013695387,0.9265704,0.0006157193,0.0005871771,0.0018611597,0.000007868844,0.00041902188,0.009281269],"genre_scores_gemma":[0.97456986,0.0000013380156,0.023931408,0.00012844996,0.00021423004,0.00044467332,0.0000026041234,0.000024942135,0.0006825018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744153,0.00024058903,0.00056265754,0.0005158421,0.00040444024,0.00083492586],"domain_scores_gemma":[0.99772364,0.000824032,0.0001451976,0.0007350028,0.0002785443,0.0002935925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020123355,0.0002441778,0.00052135804,0.00014161789,0.00009737514,0.00047310168,0.0011186182,0.00012281224,0.0000115398425],"category_scores_gemma":[0.00021394076,0.0001811108,0.00006541868,0.00039139928,0.000054763677,0.0025751716,0.0001364227,0.0001152334,0.000079409],"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.002319999,0.007196306,0.28261763,0.014402355,0.0013332631,0.00024274466,0.013323131,0.03216416,0.121952064,0.47498605,0.02399812,0.02546418],"study_design_scores_gemma":[0.006060666,0.00018716948,0.018766193,0.00033226283,0.000039533083,0.00009644554,0.0004135111,0.9646396,0.0077732,0.00027951843,0.00046200556,0.0009498776],"about_ca_topic_score_codex":0.0012028423,"about_ca_topic_score_gemma":0.000043759912,"teacher_disagreement_score":0.93247545,"about_ca_system_score_codex":0.000107654996,"about_ca_system_score_gemma":0.00011423954,"threshold_uncertainty_score":0.7385484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002273807,0.00011795617,0.9805551,0.002112157,0.0000854368,0.00044508764,3.8897147e-7,0.0004532205,0.013956845],"genre_scores_gemma":[0.8587859,0.0000014493534,0.13894594,0.0005263041,0.00007229716,0.00011936349,8.9034796e-7,0.000009828988,0.0015380225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864495,0.00004674586,0.0002933567,0.00045603313,0.0002878937,0.00027104342],"domain_scores_gemma":[0.99901825,0.00008502351,0.00012347543,0.00056025013,0.00010256393,0.00011042018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025500855,0.00014479608,0.00020005817,0.00009136861,0.000200269,0.0001450267,0.00071186485,0.00006580607,0.000081044076],"category_scores_gemma":[0.000042873402,0.00012174502,0.00006985049,0.0003869821,0.000018231103,0.00046353866,0.00009588602,0.00008837935,0.0006380271],"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.00004062143,0.0017208222,0.0020049482,0.00020024863,0.00016299913,0.000020957374,0.0031385492,0.06111107,0.25156346,0.08356524,0.008408364,0.5880627],"study_design_scores_gemma":[0.00092538615,0.000042735508,0.00025192875,0.000010567413,0.000003079549,0.00000571481,0.0000071770046,0.99131864,0.0051868977,0.000113302965,0.00197602,0.00015854671],"about_ca_topic_score_codex":0.00008901256,"about_ca_topic_score_gemma":0.000006690964,"teacher_disagreement_score":0.93020755,"about_ca_system_score_codex":0.00003312194,"about_ca_system_score_gemma":0.000017598115,"threshold_uncertainty_score":0.82007605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25706485,0.000025430172,0.7387971,0.00054078526,0.00019836384,0.00041896207,0.0000016591046,0.00006524329,0.0028875808],"genre_scores_gemma":[0.9148295,0.0000019474514,0.08430222,0.0003704986,0.0000525714,0.00003236883,8.155503e-7,0.000016201564,0.00039386042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99775475,0.000097426244,0.0005959833,0.00056013645,0.0005295784,0.0004621065],"domain_scores_gemma":[0.9979079,0.00015991183,0.00022092159,0.0013439878,0.00019845569,0.00016885817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006807312,0.00021689115,0.0005074722,0.0003972565,0.00015267942,0.00041936195,0.0012603424,0.00008060704,0.00006917151],"category_scores_gemma":[0.000033672404,0.00013992836,0.00026979632,0.0019175,0.00003535886,0.0014399971,0.00053313485,0.00011924341,0.000084739884],"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.000005810278,0.000046092264,0.00089652574,0.000043330325,0.0013325826,0.000005415678,0.007384529,0.59884006,0.3635704,0.016936818,0.00047092716,0.010467514],"study_design_scores_gemma":[0.00013202678,0.000020566657,0.0011159077,0.000020449486,0.0001297117,0.0000029167372,0.00039742573,0.9939864,0.002883812,0.0010935365,0.000022564518,0.00019463112],"about_ca_topic_score_codex":0.0058339885,"about_ca_topic_score_gemma":0.00007771334,"teacher_disagreement_score":0.6577647,"about_ca_system_score_codex":0.0001528562,"about_ca_system_score_gemma":0.00008711276,"threshold_uncertainty_score":0.88192844},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25064635,0.000038180486,0.7447641,0.0005687499,0.00005835813,0.00084626285,0.0000016524858,0.0002601173,0.0028162284],"genre_scores_gemma":[0.7484044,4.925382e-7,0.2500751,0.00024383585,0.0000431247,0.00020104591,0.0000030202211,0.0000214704,0.0010075404],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978271,0.00006029997,0.0003369808,0.0007064898,0.00048393788,0.00058519165],"domain_scores_gemma":[0.9983294,0.00007018489,0.00008631844,0.0010538321,0.00015972725,0.000300522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039067253,0.00024592908,0.00026172656,0.000120177065,0.00021309542,0.00066762586,0.0009985298,0.00008593658,0.000050778322],"category_scores_gemma":[0.000007985855,0.00017815588,0.00009469172,0.0003425795,0.00005906333,0.0006183647,0.00006085736,0.00011438026,0.000081475606],"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.000033044973,0.00021852448,0.00025028412,0.00004438922,0.00002632236,0.000003935708,0.007999392,0.96203506,0.0072585284,0.010180589,0.0019911623,0.00995876],"study_design_scores_gemma":[0.00061927794,0.0002732864,0.0007781297,0.000045919867,0.0000069675243,0.000021653994,0.00023939415,0.9964843,0.00080060825,0.00008621558,0.00035363442,0.00029064156],"about_ca_topic_score_codex":0.00017024211,"about_ca_topic_score_gemma":0.000018237235,"teacher_disagreement_score":0.497758,"about_ca_system_score_codex":0.00007017475,"about_ca_system_score_gemma":0.00012884222,"threshold_uncertainty_score":0.7264986},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112527326,0.000014069561,0.8794283,0.00018800903,0.000065077955,0.0006201782,0.000029113107,0.000869525,0.00625837],"genre_scores_gemma":[0.6501135,0.000002812445,0.34937838,0.000014003665,0.000011185888,0.000060563245,0.000020048647,0.000008011427,0.00039148785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777395,0.00013588308,0.0007916679,0.00055769767,0.00037019947,0.00037059176],"domain_scores_gemma":[0.9977705,0.00028814818,0.00028206946,0.0010708455,0.0004647581,0.00012370315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071588054,0.00017495497,0.000454068,0.000396443,0.0001374203,0.000088600274,0.0006034995,0.0000706053,0.0002850914],"category_scores_gemma":[0.00008224837,0.00016099063,0.00030725816,0.002351657,0.00004271819,0.0008796502,0.00014137573,0.00004679098,0.000043866647],"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.00003641036,0.0015395259,0.021374263,0.00035514997,0.00483368,0.0000065240533,0.009806577,0.46431294,0.08031872,0.4047992,0.0068750363,0.005741985],"study_design_scores_gemma":[0.00041154062,0.00006196383,0.002015232,0.00000608465,0.00011474694,0.0000015335199,0.00009470518,0.9930443,0.0031731748,0.0008964988,0.000019363793,0.00016085932],"about_ca_topic_score_codex":0.00082948623,"about_ca_topic_score_gemma":0.00005916866,"teacher_disagreement_score":0.5375862,"about_ca_system_score_codex":0.000087445274,"about_ca_system_score_gemma":0.00004918386,"threshold_uncertainty_score":0.65650076},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032672165,0.000007316359,0.92789936,0.00020426004,0.0001158974,0.00090000936,7.761043e-7,0.0012953976,0.06630974],"genre_scores_gemma":[0.15826114,0.0000015598218,0.8395533,0.000051057603,0.00015285712,0.000050913306,0.000015610232,0.000014430094,0.0018991504],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99868894,0.00002646019,0.00035455744,0.00034211008,0.00023570315,0.0003522047],"domain_scores_gemma":[0.9990064,0.00013560943,0.00012132307,0.00047410445,0.00017011497,0.00009245904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014504422,0.00012439051,0.0001634176,0.00011459044,0.00009994866,0.00020456045,0.0005088195,0.00008896711,0.000009275064],"category_scores_gemma":[0.000025429215,0.000107664244,0.00007337144,0.00030457077,0.000023148716,0.00056063675,0.00009123786,0.000051437444,0.000098604905],"study_design_candidate":"design_other","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.000022977507,0.00016603459,0.002479563,0.00007844903,0.000031160675,0.000009557838,0.00065468665,0.000016847993,0.10217798,0.18918827,0.0036879003,0.7014866],"study_design_scores_gemma":[0.0013265435,0.001407999,0.011101255,0.00030517674,0.000027139937,0.00016218895,0.0001913901,0.3897883,0.5146595,0.019959178,0.059378523,0.0016927586],"about_ca_topic_score_codex":0.00008497426,"about_ca_topic_score_gemma":0.000013000807,"teacher_disagreement_score":0.6997938,"about_ca_system_score_codex":0.000060233247,"about_ca_system_score_gemma":0.00003406101,"threshold_uncertainty_score":0.43904206},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008130012,0.0003339646,0.9785783,0.00059382303,0.00024227911,0.00072336924,7.082098e-7,0.0005820592,0.010815433],"genre_scores_gemma":[0.53984874,0.000003551693,0.45724756,0.000037952752,0.00005864161,0.00003241802,0.0000023319785,0.000011582574,0.0027572322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857885,0.00012086435,0.000382456,0.0003607948,0.00025448733,0.00030256016],"domain_scores_gemma":[0.997677,0.0006791049,0.00020152559,0.00094460207,0.00036425702,0.00013346026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006511944,0.00014215303,0.00022277911,0.000100535464,0.00042697781,0.00025597506,0.0010046234,0.000077029275,0.0000022322474],"category_scores_gemma":[0.00035288153,0.00012370775,0.000055826884,0.0004678651,0.00002393689,0.0010761833,0.00027020153,0.000100964564,0.00009364625],"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.00007618236,0.0008710404,0.014096829,0.00079460273,0.0003400894,0.00013496315,0.023138946,0.08728964,0.07596689,0.5641896,0.123413764,0.10968746],"study_design_scores_gemma":[0.00055773393,0.00014396063,0.00086130603,0.00017965568,0.0000050351746,0.00027632643,0.000110240326,0.9933431,0.0016804909,0.00090053864,0.0017128836,0.00022874214],"about_ca_topic_score_codex":0.0026325693,"about_ca_topic_score_gemma":0.00002122891,"teacher_disagreement_score":0.9060534,"about_ca_system_score_codex":0.000096019685,"about_ca_system_score_gemma":0.00024191354,"threshold_uncertainty_score":0.5044656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002328479,0.000052637562,0.974491,0.000029243563,0.000389759,0.0008205175,0.000003182065,0.0005056918,0.021379473],"genre_scores_gemma":[0.7457567,4.2398193e-7,0.2515912,0.0000573634,0.000045995057,0.00021776056,0.000003229911,0.000013081315,0.0023142586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985186,0.00006349975,0.0003535864,0.00042398815,0.00027210786,0.00036823275],"domain_scores_gemma":[0.99875784,0.000074687196,0.00013272664,0.0007042708,0.00020274075,0.00012772022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079550006,0.00014998412,0.00021517048,0.00010342528,0.00011221138,0.00016863635,0.0006690774,0.0000975399,0.000008491682],"category_scores_gemma":[0.000044837052,0.00012898905,0.000084694926,0.00019648236,0.000019369967,0.00069916283,0.000069937334,0.000057144756,0.00005444232],"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.000109558314,0.00041509516,0.0005830774,0.0006957495,0.00010826792,0.000012033675,0.0062706033,0.33039176,0.011770217,0.6284289,0.01933819,0.0018765928],"study_design_scores_gemma":[0.00046995233,0.00007199688,0.000017231243,0.00004776855,0.0000073841693,0.0000069174785,0.00006313997,0.9942536,0.0038014927,0.0010025046,0.000098052595,0.00015996634],"about_ca_topic_score_codex":0.00024394962,"about_ca_topic_score_gemma":0.000007758526,"teacher_disagreement_score":0.7434282,"about_ca_system_score_codex":0.000066757646,"about_ca_system_score_gemma":0.00018899236,"threshold_uncertainty_score":0.5260021},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47554368,0.00006586921,0.4115787,0.0016379964,0.00011280719,0.03800094,0.000004464049,0.0012692891,0.07178624],"genre_scores_gemma":[0.9878725,0.0000025907466,0.008867734,0.000087847126,0.00005085688,0.0018521512,8.0857535e-7,0.000017431234,0.0012480799],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983345,0.00013829465,0.00040179206,0.00052429386,0.00029324385,0.0003078218],"domain_scores_gemma":[0.99909204,0.00015040213,0.00012556835,0.00044592362,0.00004618927,0.00013987228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044215564,0.00019459364,0.00032292376,0.00014773372,0.000093797746,0.00012129298,0.00030553478,0.00008917863,0.00007319676],"category_scores_gemma":[0.000031955922,0.00014496563,0.000031756175,0.00029109124,0.000045407793,0.0004668365,0.000021538499,0.0001193852,0.000039783812],"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.0034022538,0.0033174376,0.24321002,0.0028926316,0.00040869357,0.005185254,0.032587282,0.010402743,0.45403296,0.036569424,0.0062097614,0.20178153],"study_design_scores_gemma":[0.005924927,0.0013153538,0.01923233,0.00095805567,0.000018139008,0.00060173566,0.00013325863,0.965555,0.002569164,0.0001410342,0.0028830778,0.0006679182],"about_ca_topic_score_codex":0.00014568299,"about_ca_topic_score_gemma":0.000040472805,"teacher_disagreement_score":0.9551523,"about_ca_system_score_codex":0.000036864538,"about_ca_system_score_gemma":0.000031677515,"threshold_uncertainty_score":0.59115267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07789915,0.000014257975,0.9195201,0.00027028902,0.0001460316,0.00025718973,0.0000012814108,0.00011677663,0.0017749442],"genre_scores_gemma":[0.6434623,3.965366e-7,0.35540247,0.00005805168,0.00026390524,0.000027437563,0.000015320742,0.0000068612844,0.0007632702],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989088,0.000035698704,0.00030453052,0.000338659,0.00017787945,0.00023438854],"domain_scores_gemma":[0.9993773,0.000025908244,0.00011105171,0.00041207808,0.000021312006,0.00005232701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004911865,0.00008816851,0.0000955915,0.00003771974,0.000116173826,0.00020939586,0.00030808736,0.000040147846,0.000028503213],"category_scores_gemma":[0.0000072990706,0.00008013084,0.000039301984,0.00004747267,0.000008923497,0.0005810441,0.000041630035,0.000028423145,0.000063524036],"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.0000032149949,0.00020049686,0.003364707,0.00003219563,0.000015274141,0.00000917261,0.00046871838,0.07582061,0.70998335,0.15446216,0.0068347207,0.048805382],"study_design_scores_gemma":[0.00018147605,0.00006409178,0.00082624506,0.0000025998513,0.0000025954969,0.000008202506,0.000018428987,0.92886347,0.06486759,0.00064651517,0.0043782983,0.00014050532],"about_ca_topic_score_codex":0.00019315496,"about_ca_topic_score_gemma":0.000051653,"teacher_disagreement_score":0.85304284,"about_ca_system_score_codex":0.00004800611,"about_ca_system_score_gemma":0.00002285479,"threshold_uncertainty_score":0.32676408},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008481429,0.00011178909,0.9206659,0.0005632853,0.0009397575,0.0019046026,0.0000023455168,0.0004336651,0.07453046],"genre_scores_gemma":[0.8866271,0.000001421076,0.08630045,0.0004782471,0.0004838331,0.000444044,0.000004091237,0.00004258006,0.025618257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973984,0.00024345984,0.00061280146,0.0007270191,0.00040232707,0.0006159903],"domain_scores_gemma":[0.9976926,0.0005648075,0.00025536775,0.0010310442,0.00022466802,0.00023151774],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028338206,0.00026235628,0.0006474477,0.00011384678,0.0002947658,0.0020629137,0.0026960957,0.0001340375,0.000037752518],"category_scores_gemma":[0.0002588109,0.00020693663,0.00011201326,0.0002521145,0.000019191775,0.0014169496,0.0005531129,0.00012557043,0.0006680377],"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.0001540636,0.00029416513,0.0004979535,0.0004028629,0.00041178786,0.000008657162,0.0012853439,0.010391476,0.040772244,0.7838643,0.13046442,0.031452693],"study_design_scores_gemma":[0.0027577449,0.00018482946,0.000028841114,0.00008864127,0.000012991265,0.00002838039,0.000027218884,0.9557068,0.0003829663,0.0017021123,0.03879644,0.0002830669],"about_ca_topic_score_codex":0.00079186494,"about_ca_topic_score_gemma":0.00000982218,"teacher_disagreement_score":0.9453153,"about_ca_system_score_codex":0.000059593924,"about_ca_system_score_gemma":0.00010526613,"threshold_uncertainty_score":0.998973},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13035572,0.000066893066,0.083612345,0.00031303198,0.00047984842,0.00032939756,0.0000015998367,0.0012400427,0.7836011],"genre_scores_gemma":[0.81078655,0.000069480455,0.11153329,0.00024342882,0.00030638298,0.00003780771,0.0000092456285,0.00003313312,0.07698067],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822646,0.000109706794,0.00036794564,0.00051655754,0.00036010696,0.00041924053],"domain_scores_gemma":[0.99872684,0.00008798926,0.00006707194,0.000863914,0.00008104628,0.00017315116],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034100117,0.0001778817,0.00022990307,0.000082508086,0.00011203434,0.00017644957,0.00081276236,0.00007485172,0.002768713],"category_scores_gemma":[0.000023621926,0.00015393346,0.00008515008,0.0005589448,0.000035302237,0.0007553326,0.00010004992,0.00010599909,0.009160695],"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.00003789113,0.00053715,0.0035548834,0.00009553323,0.0001799808,0.00027141324,0.005835985,0.00077034766,0.07059708,0.22370996,0.0648283,0.6295815],"study_design_scores_gemma":[0.005819024,0.0011545655,0.02260734,0.0004707605,0.000060116625,0.00087741535,0.00027983196,0.69523907,0.06021152,0.006976484,0.2017674,0.0045364555],"about_ca_topic_score_codex":0.00038819545,"about_ca_topic_score_gemma":0.0000041500384,"teacher_disagreement_score":0.70662045,"about_ca_system_score_codex":0.00004565398,"about_ca_system_score_gemma":0.00009434613,"threshold_uncertainty_score":0.9981429},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060709618,0.000056780274,0.8354976,0.00006914095,0.000509639,0.0010589195,0.0000022260472,0.0004358412,0.101660244],"genre_scores_gemma":[0.9207544,0.0000051353404,0.07591831,0.00006963826,0.00006388063,0.00012499957,0.000002420506,0.000019051298,0.00304217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771994,0.00043156347,0.00038219383,0.0006815402,0.0003766754,0.0004080822],"domain_scores_gemma":[0.9984484,0.0000906915,0.00010698276,0.00084267155,0.00013866951,0.00037260936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009356089,0.00020789732,0.00032440844,0.00017736343,0.00018623128,0.00027453614,0.0004167712,0.00009367819,0.0000075575495],"category_scores_gemma":[0.00009009082,0.00017967807,0.000043242417,0.00052021956,0.000016670627,0.0009203697,0.00006269768,0.00009600353,0.00018231302],"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.000056484947,0.0011372847,0.008560754,0.00024399527,0.0003471313,0.00002544198,0.004614117,0.017067889,0.0624206,0.89880496,0.0038097766,0.0029115356],"study_design_scores_gemma":[0.0034893034,0.0006707246,0.0056267222,0.00015265269,0.0000404912,0.00075767154,0.0017809252,0.9768031,0.0014873428,0.00060635747,0.007207567,0.001377092],"about_ca_topic_score_codex":0.00059341465,"about_ca_topic_score_gemma":0.000003973142,"teacher_disagreement_score":0.9597353,"about_ca_system_score_codex":0.00007997089,"about_ca_system_score_gemma":0.000078031815,"threshold_uncertainty_score":0.7327059},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014581783,0.000010026533,0.91805744,0.0010745873,0.00006638036,0.00032959838,1.2084084e-7,0.00032410407,0.078679554],"genre_scores_gemma":[0.504926,5.4847334e-7,0.49244747,0.00013942747,0.0000046028763,0.0000082940805,8.1171527e-7,0.0000044783314,0.002468351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987817,0.000060956485,0.00017688985,0.00040089883,0.0003449905,0.00023460793],"domain_scores_gemma":[0.9992932,0.000024244144,0.00007891359,0.00046728563,0.00007710211,0.00005924866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003851383,0.0001293746,0.00012285571,0.00012627034,0.00007596616,0.00019581657,0.00049368234,0.000031355507,0.00001603024],"category_scores_gemma":[0.000005502826,0.00009588272,0.000028355453,0.00041050263,0.0000069521475,0.0006204769,0.0000734757,0.000070816204,0.00009252107],"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.000030357724,0.00037421094,0.0003651313,0.00016123576,0.00013214131,0.00036779194,0.0021170161,0.008715552,0.0045481347,0.46234223,0.0016406284,0.5192056],"study_design_scores_gemma":[0.0008369357,0.00048751035,0.028707616,0.00014954299,0.000016686376,0.00015939903,0.00044055455,0.9626831,0.0013872021,0.0036078529,0.0009705194,0.0005530835],"about_ca_topic_score_codex":0.0000071864383,"about_ca_topic_score_gemma":0.0000051773,"teacher_disagreement_score":0.9539676,"about_ca_system_score_codex":0.00007008626,"about_ca_system_score_gemma":0.000019826874,"threshold_uncertainty_score":0.3909984},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44637167,0.00029641137,0.5520879,0.00005480415,0.0003946794,0.0003345146,0.000007160536,0.00045195283,9.16922e-7],"genre_scores_gemma":[0.6458742,0.0000013689661,0.35389188,0.000017236332,0.00008230163,0.00009366471,0.000005086041,0.00002960502,0.0000046296436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982899,0.000017749206,0.0004688096,0.000419459,0.00034166346,0.0004624208],"domain_scores_gemma":[0.98634595,0.012147574,0.00018048569,0.0010578827,0.00015155581,0.00011654137],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003406204,0.00028720446,0.0004015969,0.00021637267,0.000085452375,0.00009344276,0.0013428254,0.00011796994,0.0000010437875],"category_scores_gemma":[0.01848482,0.00027384105,0.0001434634,0.00033770883,0.000030350171,0.00015782274,0.00015171953,0.00015450334,0.000010111739],"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.000011511659,0.000026528316,0.0302287,0.00077521626,0.000026180225,0.0000033114295,0.0002041911,0.9633856,0.0037906726,0.0005517754,0.000008304316,0.0009880107],"study_design_scores_gemma":[0.005889549,0.00173401,0.14580424,0.003995837,0.000087941924,0.0001824875,0.000028291232,0.6367861,0.2018432,0.0002494212,0.00072830514,0.0026706068],"about_ca_topic_score_codex":0.000078884776,"about_ca_topic_score_gemma":0.000001289846,"teacher_disagreement_score":0.32659948,"about_ca_system_score_codex":0.00007616169,"about_ca_system_score_gemma":0.00014325464,"threshold_uncertainty_score":0.9999714},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037036074,0.000104423685,0.99596614,0.00082394615,0.000050606697,0.00063725264,0.000004202853,0.0000624971,0.0019805934],"genre_scores_gemma":[0.4748373,2.3895956e-7,0.5249976,0.000012391989,0.00001842102,0.000028677812,0.000018084416,0.0000022457843,0.00008504573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989811,0.00023024077,0.00030107528,0.00015079301,0.00023294393,0.00010385618],"domain_scores_gemma":[0.9984661,0.00040982285,0.00018408998,0.00059319177,0.0003195337,0.0000272796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018322199,0.000058895683,0.0001407055,0.0000426195,0.000043637247,0.000055941076,0.00045547812,0.000038419796,0.000011663264],"category_scores_gemma":[0.00012047073,0.000051877065,0.00005472505,0.0001897981,0.000006630867,0.0002880752,0.00003906039,0.000027231605,0.0000048433967],"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.00002602551,0.000091381975,0.0007451538,0.000036699592,0.0000562699,1.262196e-7,0.00023952214,0.054928947,0.036186595,0.68687546,0.009506903,0.21130693],"study_design_scores_gemma":[0.0011651266,0.00002710769,0.0026616512,0.000012927992,0.00001706141,0.0000023801126,0.00001151334,0.96436924,0.00748896,0.023706585,0.00047613797,0.0000613085],"about_ca_topic_score_codex":0.0012814837,"about_ca_topic_score_gemma":0.000072142684,"teacher_disagreement_score":0.9094403,"about_ca_system_score_codex":0.000043912918,"about_ca_system_score_gemma":0.00011034416,"threshold_uncertainty_score":0.21154854},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0244647,0.000041437863,0.9166175,0.0025722522,0.0002927858,0.00014481421,3.8849467e-7,0.00066792866,0.055198207],"genre_scores_gemma":[0.55762315,0.0000042492966,0.4417114,0.00035642684,0.000079630954,0.0000023707887,5.125546e-7,0.0000040669584,0.00021820153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998146,0.00010568099,0.00038080523,0.0005216399,0.0003819407,0.0004639573],"domain_scores_gemma":[0.9987175,0.000058386187,0.000050453087,0.0008099055,0.0001361693,0.00022760253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075961265,0.00016779787,0.00023377758,0.0000783218,0.0001227509,0.0003457595,0.00091920735,0.000097880264,0.000026555801],"category_scores_gemma":[0.00015530309,0.0001456072,0.000099096134,0.0003455129,0.000031128642,0.00081778213,0.00014728414,0.00017171583,0.00026971725],"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.0000050706585,0.00025875052,0.00066331937,0.000026049873,0.000018133142,0.00007368146,0.00062094256,0.0005191122,0.013490674,0.874258,0.00019910875,0.109867156],"study_design_scores_gemma":[0.0010211058,0.000176445,0.03727934,0.00007522304,0.000009452142,0.00009258498,0.00013858255,0.9293492,0.017052803,0.013577029,0.0005162271,0.0007119963],"about_ca_topic_score_codex":0.0003379344,"about_ca_topic_score_gemma":0.0000090422645,"teacher_disagreement_score":0.9288301,"about_ca_system_score_codex":0.00006616937,"about_ca_system_score_gemma":0.000107918444,"threshold_uncertainty_score":0.59376895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009948934,0.000011278754,0.9284983,0.00030002283,0.00027068463,0.02307289,1.4583257e-7,0.00043650152,0.047310676],"genre_scores_gemma":[0.55330634,9.1382054e-7,0.3593448,0.0007790048,0.00094651117,0.075024456,8.192852e-7,0.000039801616,0.010557338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983735,0.00007148771,0.00031903927,0.00042079107,0.00032299262,0.00049218745],"domain_scores_gemma":[0.9988825,0.00008058885,0.000086560685,0.00071092916,0.00007280734,0.00016666658],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003112686,0.00016797702,0.00018826855,0.000045164074,0.0001200571,0.00022293245,0.0008231951,0.00008478261,0.0003442652],"category_scores_gemma":[0.000024584358,0.00013309474,0.000068177236,0.0003581333,0.00003252308,0.00054313405,0.00023757333,0.00012542302,0.0012131995],"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.00004038464,0.0009508013,0.0051272963,0.0003494705,0.00019030251,0.00035608409,0.0050157867,0.18342935,0.001213854,0.13299353,0.3195594,0.35077375],"study_design_scores_gemma":[0.00042193348,0.00006778439,0.00015080003,0.00003997151,0.0000013652777,0.00003820316,0.000025666335,0.9785578,0.00035980914,0.0004271199,0.019696614,0.00021289893],"about_ca_topic_score_codex":0.00009000624,"about_ca_topic_score_gemma":0.000018999055,"teacher_disagreement_score":0.79512846,"about_ca_system_score_codex":0.000052179283,"about_ca_system_score_gemma":0.000017037773,"threshold_uncertainty_score":0.99956447},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004453951,0.000113390546,0.9887035,0.00026545415,0.00045548598,0.0034129545,0.00008002279,0.0010545342,0.0014606911],"genre_scores_gemma":[0.60582286,0.000011754612,0.3905722,0.0000798843,0.00015096956,0.0008994737,0.000041993862,0.00004391035,0.0023769562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971313,0.00010460158,0.0013079222,0.00054396124,0.00038985861,0.0005223788],"domain_scores_gemma":[0.9965063,0.0003735666,0.0005578281,0.0006605034,0.0017910533,0.00011080095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011018636,0.0002488431,0.0005944562,0.00019889607,0.00013960853,0.0001753196,0.00055621663,0.000104854764,0.000031532923],"category_scores_gemma":[0.00013418321,0.00021552294,0.00018024618,0.00039460027,0.000018472145,0.0010462912,0.000058059093,0.00003216389,0.000019798523],"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.00011001819,0.00023564567,0.00010353866,0.0009911567,0.00058957265,0.0000037788157,0.0028158182,0.50307095,0.18645546,0.11886744,0.18196347,0.004793134],"study_design_scores_gemma":[0.0028447285,0.00023258044,0.0000061111346,0.000063023836,0.000034734367,0.000011702684,0.00043635737,0.98923194,0.006325572,0.00029156305,0.00029338212,0.00022832691],"about_ca_topic_score_codex":0.0011454816,"about_ca_topic_score_gemma":0.000013340111,"teacher_disagreement_score":0.6013689,"about_ca_system_score_codex":0.00008972075,"about_ca_system_score_gemma":0.000086964414,"threshold_uncertainty_score":0.8788771},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2392621,0.00005972232,0.694704,0.0002637126,0.0004188644,0.0007847311,0.0000019238303,0.0007574697,0.06374747],"genre_scores_gemma":[0.8834414,0.000003889755,0.11591063,0.000010108461,0.00010415549,0.00003368143,0.000009316645,0.000013259038,0.00047357785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975934,0.0003283317,0.0006459653,0.0006355286,0.00039813083,0.00039863668],"domain_scores_gemma":[0.99856216,0.0001257553,0.00016543097,0.00090741686,0.00015303085,0.00008621444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010008076,0.00019365005,0.00032447855,0.00018532896,0.00007608634,0.0003669376,0.00071566354,0.00014433992,0.000038074086],"category_scores_gemma":[0.000054432323,0.00018301269,0.00006422405,0.00077189313,0.000037230522,0.0010904422,0.00020087263,0.00013171497,0.00019393866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0000033406463,0.00013467621,0.011977832,0.00006016977,0.0000062175304,0.00001620447,0.00018830884,0.9261485,0.0020572715,0.058981795,0.00033950235,0.000086229455],"study_design_scores_gemma":[0.000292886,0.000020562426,0.0034307316,0.000043188902,0.0000019666948,0.000015024159,0.000028976723,0.99466735,0.00035182777,0.0008888584,0.00004613603,0.00021248331],"about_ca_topic_score_codex":0.0073284735,"about_ca_topic_score_gemma":0.00011287086,"teacher_disagreement_score":0.6441793,"about_ca_system_score_codex":0.00023426213,"about_ca_system_score_gemma":0.00010428356,"threshold_uncertainty_score":0.9992818},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886339,0.00032603083,0.1823544,0.00044663955,0.00013794137,0.000708304,7.430919e-7,0.00013074951,0.02726129],"genre_scores_gemma":[0.57230234,0.00001527789,0.42533162,0.0000229259,0.000025855066,0.000017440705,7.695273e-7,0.000008137585,0.002275629],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988912,0.00006414986,0.00032037793,0.00026784968,0.0002798141,0.00017663187],"domain_scores_gemma":[0.9993445,0.00003943331,0.00011457858,0.00044989045,0.000017755257,0.000033790708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004150113,0.00010477453,0.00015090982,0.000028436289,0.00008755857,0.000049496342,0.0004091049,0.000034241242,0.000018473234],"category_scores_gemma":[0.000005622961,0.00006777929,0.000029158267,0.0001124249,0.000035039368,0.00016556967,0.00036922004,0.000041368465,0.00005770619],"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.000007638814,0.0003850345,0.04616106,0.00048606453,0.00010774906,0.000013268878,0.0017604746,0.006719399,0.6954494,0.16249155,0.0010112486,0.08540712],"study_design_scores_gemma":[0.0007769352,0.000062618,0.13749655,0.00027130122,0.00001669683,0.00005885113,0.00006920118,0.08990789,0.7608038,0.0017410156,0.008100593,0.0006945455],"about_ca_topic_score_codex":0.00016900938,"about_ca_topic_score_gemma":0.000004499492,"teacher_disagreement_score":0.24297722,"about_ca_system_score_codex":0.00004528457,"about_ca_system_score_gemma":0.000052226333,"threshold_uncertainty_score":0.27639595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11676573,0.00008589216,0.87988937,0.00037522515,0.0004225823,0.00021172971,7.002357e-7,0.00004318734,0.0022056024],"genre_scores_gemma":[0.7439533,0.0000030530205,0.2557251,0.000103513456,0.00019508794,0.000010300001,4.518281e-8,0.0000075115963,0.0000020778907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976414,0.000042272277,0.00073853176,0.0003684495,0.0007285047,0.0004808432],"domain_scores_gemma":[0.9981947,0.00018979318,0.00094838836,0.00025666115,0.00020595273,0.00020451772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028170564,0.00017272375,0.0005177946,0.00032350133,0.00041098858,0.000408528,0.0016955298,0.000027277698,8.0935723e-7],"category_scores_gemma":[0.000040706313,0.00013170423,0.00016132863,0.00088955805,0.00029998462,0.0007746872,0.00006449709,0.00014887482,0.000010294337],"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.000036769896,0.000026469581,0.000035623863,0.000023634531,0.00003888081,0.000010629526,0.0010575133,0.81318307,0.0075083063,0.15586738,0.000008118981,0.022203578],"study_design_scores_gemma":[0.0015210987,0.0008972294,0.000020514412,0.0002708029,0.000029763,0.0004992248,0.0070601776,0.9823726,0.002183046,0.0047443444,0.000057418252,0.000343825],"about_ca_topic_score_codex":0.000042260126,"about_ca_topic_score_gemma":0.000001351351,"teacher_disagreement_score":0.6271876,"about_ca_system_score_codex":0.00017767728,"about_ca_system_score_gemma":0.00043595856,"threshold_uncertainty_score":0.53707427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13032226,0.0001248124,0.837535,0.00014137951,0.000111853886,0.00008107028,6.775916e-7,0.00014216185,0.03154077],"genre_scores_gemma":[0.9098585,0.000005414023,0.088957876,0.00003079131,0.000021527712,0.0000033391163,7.876186e-7,0.000004094034,0.0011176348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886626,0.00005893874,0.00034880667,0.00029693494,0.00023490061,0.00019417118],"domain_scores_gemma":[0.9989944,0.00012245346,0.00014462351,0.0005791403,0.00008387003,0.000075491094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037409647,0.00009856286,0.00025596374,0.00046450325,0.00007344679,0.00010345943,0.0003696542,0.00004950224,0.0003822174],"category_scores_gemma":[0.000036451125,0.000086393724,0.00015897959,0.0018329504,0.000019636836,0.0005296936,0.00011217406,0.00005302413,0.0001227055],"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.000009808378,0.0005880928,0.016658979,0.00014476792,0.0039760186,0.0018034882,0.015136464,0.04125527,0.021748012,0.6715788,0.00538529,0.22171499],"study_design_scores_gemma":[0.000091393245,0.000017170416,0.0002632132,0.000011309003,0.000101108664,0.00011556595,0.00011877213,0.9960764,0.0027617342,0.00024118283,0.000084877545,0.00011725544],"about_ca_topic_score_codex":0.00032801522,"about_ca_topic_score_gemma":0.000055513847,"teacher_disagreement_score":0.95482117,"about_ca_system_score_codex":0.000033958226,"about_ca_system_score_gemma":0.000007671538,"threshold_uncertainty_score":0.41850126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72596604,0.0012748757,0.25292316,0.00055420346,0.0044893445,0.0012885215,0.000005558865,0.00036650294,0.013131803],"genre_scores_gemma":[0.96553373,0.00006391786,0.033753294,0.000061025465,0.00019919331,0.00004504422,0.000004018074,0.000023071,0.0003166965],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.99735105,0.00011897685,0.00060491514,0.0009873766,0.0003645716,0.0005730898],"domain_scores_gemma":[0.9983569,0.00013519375,0.00019409403,0.0008412053,0.00006480219,0.00040782473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012605273,0.00036653603,0.0005474663,0.00030914356,0.00006577483,0.0005669728,0.00074878917,0.00025023316,0.00002151894],"category_scores_gemma":[0.00006583191,0.00033843244,0.00004879556,0.00019844314,0.00003447396,0.0005297829,0.0036316903,0.00058690854,0.000040237224],"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.000022390928,0.0002476513,0.34879765,0.0034881076,0.0002194613,0.00023519828,0.04857919,0.0017154473,0.0072778543,0.08129664,0.0009919596,0.5071285],"study_design_scores_gemma":[0.0077631897,0.0012006212,0.6805259,0.01310276,0.0002164906,0.0015435904,0.0047829733,0.18297169,0.021388961,0.0094812885,0.06198445,0.015038097],"about_ca_topic_score_codex":0.0008353346,"about_ca_topic_score_gemma":0.00009840693,"teacher_disagreement_score":0.49209037,"about_ca_system_score_codex":0.0001567355,"about_ca_system_score_gemma":0.00013799746,"threshold_uncertainty_score":0.9999068},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004295325,0.0005154337,0.9906009,0.0007807172,0.00006992824,0.0004009512,3.9100635e-7,0.00014507327,0.003191307],"genre_scores_gemma":[0.62326247,0.000013718099,0.3760091,0.000040920724,0.000050548624,0.000081745784,0.0000015441183,0.000005489212,0.0005344743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991522,0.00004922279,0.00025927302,0.00021130807,0.00015689521,0.00017112325],"domain_scores_gemma":[0.9989662,0.000066234075,0.00006283905,0.00082492863,0.000027595082,0.000052171057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052797014,0.000078303034,0.000107916516,0.000043345313,0.000106288004,0.00018229088,0.000677023,0.00003944667,0.00000433417],"category_scores_gemma":[0.000009209621,0.000070053364,0.000042503656,0.000049899772,0.0000071438126,0.0005477832,0.00014259267,0.000044223336,0.0001413653],"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.0000012319196,0.000026621014,0.000010272969,0.000013758261,0.000010274293,1.1076981e-7,0.0004459022,0.87942904,0.00054502644,0.108944006,0.00027849938,0.01029523],"study_design_scores_gemma":[0.00015502778,0.000012221292,0.0000026601467,0.000017789089,0.0000020093323,0.000006173913,0.00006201074,0.99212754,0.00016530107,0.00027809394,0.0070829336,0.00008823964],"about_ca_topic_score_codex":0.00013798977,"about_ca_topic_score_gemma":0.000004811688,"teacher_disagreement_score":0.6189671,"about_ca_system_score_codex":0.00008696881,"about_ca_system_score_gemma":0.00001604903,"threshold_uncertainty_score":0.28566933},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025620405,0.00006290593,0.96063584,0.00010714338,0.00024406219,0.00042971192,0.00000402931,0.00040103978,0.012494885],"genre_scores_gemma":[0.9419305,0.000014572599,0.05689726,0.000011214471,0.00004431794,0.000025874702,0.000004188671,0.000013065783,0.0010590535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813193,0.00019269103,0.0005226572,0.0003534183,0.00044359226,0.00035572695],"domain_scores_gemma":[0.9983842,0.00021972989,0.00022430786,0.00088077306,0.00016922587,0.00012176459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064806227,0.00017753035,0.00033544976,0.00013189371,0.00008209555,0.0001313405,0.00087467034,0.00008788087,0.00011480686],"category_scores_gemma":[0.00003649371,0.00014765792,0.0000682939,0.00059194723,0.000040325092,0.00051795144,0.00008119928,0.000074108,0.000596321],"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.0000403999,0.0005777245,0.005638737,0.0008434897,0.00016581742,0.00006264208,0.0007910642,0.8296004,0.114447124,0.013201878,0.025050266,0.009580444],"study_design_scores_gemma":[0.0003318226,0.00013221875,0.00041173564,0.00009031066,0.00000548766,0.000015953401,0.000010029239,0.99193066,0.0067790905,0.0000069551793,0.00011171851,0.00017403289],"about_ca_topic_score_codex":0.00014975792,"about_ca_topic_score_gemma":2.0572813e-7,"teacher_disagreement_score":0.9163101,"about_ca_system_score_codex":0.00007142035,"about_ca_system_score_gemma":0.00005154261,"threshold_uncertainty_score":0.7664699},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006801085,0.00030651005,0.9641258,0.0006715085,0.0010343986,0.0003435457,0.0000012557779,0.00035795197,0.026357926],"genre_scores_gemma":[0.9926201,0.000008497319,0.005651813,0.000058794532,0.00008831454,0.00002733906,0.0000023674863,0.000009989639,0.0015327742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982491,0.00010148444,0.0004331141,0.00042471683,0.00037007403,0.00042149937],"domain_scores_gemma":[0.9990467,0.00005587409,0.0001011681,0.0006563904,0.000043581356,0.00009628856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047125068,0.00014279564,0.00020731517,0.00015458027,0.00006742971,0.00036535447,0.000818436,0.000054343807,0.00004042705],"category_scores_gemma":[0.00003602559,0.00013073183,0.000039814415,0.00059888826,0.000014066258,0.0008928004,0.00022414328,0.0001026939,0.0005368023],"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.000020849202,0.0014597279,0.11629258,0.0016032731,0.00040055887,0.0024176731,0.00903924,0.16355604,0.015467308,0.44277307,0.09185894,0.15511073],"study_design_scores_gemma":[0.00035060255,0.000018022438,0.00086843234,0.00012138145,0.0000017505415,0.000027896602,0.00010310436,0.9962431,0.00014444227,0.00022068276,0.0017002719,0.00020031097],"about_ca_topic_score_codex":0.00042869087,"about_ca_topic_score_gemma":0.000014945528,"teacher_disagreement_score":0.98581904,"about_ca_system_score_codex":0.0001401302,"about_ca_system_score_gemma":0.000009854692,"threshold_uncertainty_score":0.68996865},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05557855,0.0001696925,0.93672276,0.00028669497,0.00032895195,0.0011804567,0.0000041306976,0.0007196881,0.0050090626],"genre_scores_gemma":[0.8804788,0.000044837427,0.118817285,0.00006653509,0.00009666507,0.00017132206,0.000008661312,0.000047082405,0.00026881497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573743,0.001107344,0.0010970859,0.0009565873,0.0005101236,0.00059142377],"domain_scores_gemma":[0.99434143,0.0017119043,0.00045134098,0.0031107762,0.00016789211,0.00021664557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00239049,0.00039689196,0.00063494185,0.00054538634,0.0006199464,0.00065678,0.0018956715,0.0002246062,0.0000065208014],"category_scores_gemma":[0.00008724089,0.0004297824,0.00011535985,0.0010198394,0.00010108173,0.0007403619,0.00010334411,0.00049960194,0.0001472476],"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.00009090797,0.0012474512,0.0006239477,0.0013266855,0.00041314386,0.000025048654,0.03891707,0.62780327,0.031726573,0.029168507,0.000480526,0.26817688],"study_design_scores_gemma":[0.0012471047,0.00010038266,0.00049739535,0.00063609506,0.00002808266,0.00010808118,0.00157463,0.99312896,0.0008596389,0.000724118,0.0004672054,0.00062830595],"about_ca_topic_score_codex":0.00060534134,"about_ca_topic_score_gemma":0.000027863505,"teacher_disagreement_score":0.82490027,"about_ca_system_score_codex":0.0002125719,"about_ca_system_score_gemma":0.000084131396,"threshold_uncertainty_score":0.9998154},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08513961,0.0015423913,0.14450848,0.00036152697,0.0030327893,0.00770021,0.000030125117,0.0024623503,0.7552225],"genre_scores_gemma":[0.7918983,0.00049432094,0.12729333,0.000099092846,0.002141029,0.00047682622,0.00006294553,0.00032389924,0.077210225],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953048,0.00024292005,0.0011501104,0.0012973741,0.00082487863,0.001179882],"domain_scores_gemma":[0.99657327,0.0005702013,0.00053144636,0.0015819757,0.0002683804,0.0004747418],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003939285,0.00055358536,0.0009107079,0.00049718836,0.00034996888,0.000655754,0.0011562088,0.0002640073,0.000034144003],"category_scores_gemma":[0.000066727574,0.00052017096,0.00018583426,0.000689776,0.00009186271,0.00079055666,0.00044225407,0.00015295544,0.001142126],"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.00058699655,0.0008831461,0.000834642,0.009746946,0.002847254,0.0019879506,0.006671641,0.0037592752,0.46662754,0.3621392,0.06755287,0.07636252],"study_design_scores_gemma":[0.02046659,0.0036155812,0.016794922,0.009709426,0.0011502294,0.0039533107,0.0037874486,0.81012225,0.044071592,0.006668299,0.06788635,0.011773969],"about_ca_topic_score_codex":0.0011654915,"about_ca_topic_score_gemma":0.000018207316,"teacher_disagreement_score":0.806363,"about_ca_system_score_codex":0.00028042958,"about_ca_system_score_gemma":0.00011486617,"threshold_uncertainty_score":0.999725},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04576251,0.0002888074,0.9500085,0.0007223595,0.00024965158,0.0005073227,0.0000012724433,0.00012486354,0.002334671],"genre_scores_gemma":[0.9334807,0.000008621933,0.0659858,0.00011538844,0.00008561749,0.00002088833,5.1105013e-7,0.0000172102,0.00028529856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976176,0.00038764696,0.0005754621,0.0004891704,0.00051023444,0.00041991344],"domain_scores_gemma":[0.9983219,0.0005203718,0.00018005563,0.0007311668,0.000112080736,0.00013441102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010404893,0.00022752427,0.00042772133,0.0002955352,0.000051142124,0.000108110915,0.0010523951,0.00018178363,0.000025702922],"category_scores_gemma":[0.00011001449,0.0001920756,0.00008514344,0.000613892,0.000049439597,0.0007451921,0.00009834854,0.0002814804,0.00011242766],"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.000059453872,0.00018317362,0.002036631,0.00009047471,0.000049594648,0.000020558558,0.0013726996,0.6264861,0.0010751828,0.36642757,0.0000792739,0.0021192986],"study_design_scores_gemma":[0.0011918269,0.00021849677,0.0009701899,0.00056577066,0.000008698951,0.000010709286,0.000700099,0.99189234,0.0031386204,0.0006551927,0.0002999971,0.00034804907],"about_ca_topic_score_codex":0.00025866064,"about_ca_topic_score_gemma":0.000014811679,"teacher_disagreement_score":0.88771814,"about_ca_system_score_codex":0.00017195937,"about_ca_system_score_gemma":0.00016032923,"threshold_uncertainty_score":0.7832616},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6121715,0.00056577666,0.28183576,0.0022275315,0.0009710568,0.0014333694,0.000003102756,0.00092315534,0.09986875],"genre_scores_gemma":[0.95131844,0.000015257003,0.041456204,0.000029692166,0.00008310161,0.00002149502,0.0000013583369,0.000017423286,0.0070570298],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803644,0.00018286266,0.00057429314,0.00042275383,0.000399351,0.00038426867],"domain_scores_gemma":[0.99809074,0.00017021493,0.00026399654,0.0012474436,0.000117411764,0.00011019448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066519435,0.00019414336,0.0003385765,0.0001354959,0.00014629005,0.00018244669,0.0013898355,0.00008430477,0.00036428706],"category_scores_gemma":[0.000041707997,0.00013065741,0.00016081605,0.000701031,0.00007868564,0.0005466186,0.0002717325,0.000154886,0.0004970898],"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.000023800038,0.0021989762,0.17334266,0.00035024085,0.00062888704,0.00053784135,0.009574999,0.018622974,0.45479128,0.092685685,0.048540957,0.1987017],"study_design_scores_gemma":[0.00083207083,0.00031927423,0.019556053,0.00013961093,0.00012498071,0.00018519854,0.0001946425,0.9628209,0.014358766,0.00035319934,0.00028908983,0.0008262263],"about_ca_topic_score_codex":0.00094233186,"about_ca_topic_score_gemma":0.00001709086,"teacher_disagreement_score":0.9441979,"about_ca_system_score_codex":0.00004169944,"about_ca_system_score_gemma":0.000032354867,"threshold_uncertainty_score":0.63892496},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008685873,0.000034888497,0.9890737,0.0009100839,0.000030484012,0.0007259706,0.000043612017,0.00018484588,0.00031052396],"genre_scores_gemma":[0.42293248,0.000026590826,0.57639235,0.000008802973,0.000032948672,0.00028715277,0.00006081417,0.000007768626,0.00025112106],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890226,0.00008832618,0.00040785733,0.000284421,0.00014903188,0.0001681303],"domain_scores_gemma":[0.9979943,0.00022278719,0.00023495608,0.0011489507,0.00033772146,0.00006127037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040777362,0.000105366766,0.00017056339,0.00006979851,0.00013289496,0.00006091955,0.0007782435,0.000072597264,0.000010059655],"category_scores_gemma":[0.00007469876,0.00007565226,0.00006796352,0.00020764464,0.00004957238,0.0005665599,0.00013414053,0.00002975754,0.00006669463],"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.000002588645,0.00008542443,0.00024802354,0.000016193242,0.000020065529,3.650087e-8,0.00006208647,0.00021904937,0.61265236,0.37528023,0.00036875324,0.011045206],"study_design_scores_gemma":[0.0009605334,0.00004529295,0.0011159335,0.000058272228,0.000012584684,0.0000028938807,0.000020660733,0.7624327,0.2313915,0.0026837427,0.0010374379,0.0002384791],"about_ca_topic_score_codex":0.00013264,"about_ca_topic_score_gemma":0.0000335516,"teacher_disagreement_score":0.76221365,"about_ca_system_score_codex":0.000062097,"about_ca_system_score_gemma":0.00007112759,"threshold_uncertainty_score":0.30850098},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90786475,0.00054774695,0.041744556,0.000002099504,0.002144286,0.00095081015,0.000009864961,0.00044064922,0.046295255],"genre_scores_gemma":[0.49357894,0.000051522456,0.50117475,0.000002472069,0.0003812228,0.000038442296,0.000080066355,0.00010279099,0.004589808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649996,0.00010809215,0.0011826645,0.00080879097,0.0008696107,0.0005308807],"domain_scores_gemma":[0.99690735,0.00014872472,0.0011364965,0.0010372706,0.00063165836,0.00013848221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004346305,0.00047439747,0.0007886678,0.0003831377,0.00016325254,0.00030506757,0.0013961525,0.000364375,0.000010588921],"category_scores_gemma":[0.000064732914,0.0004562674,0.0001234585,0.0008379317,0.000027976432,0.00058056565,0.00011723614,0.00025429405,0.00006700976],"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.000022067854,0.00024015496,0.005334482,0.012881667,0.00035396684,0.00013821562,0.0035233465,0.80581015,0.13535157,0.0018511231,0.00003900003,0.034454226],"study_design_scores_gemma":[0.00022566122,0.00009837986,0.003349551,0.0039020635,0.000043354245,0.00008654793,0.00027688922,0.9804135,0.011041843,0.000026726548,0.0000027500528,0.00053276494],"about_ca_topic_score_codex":0.005511564,"about_ca_topic_score_gemma":0.00001582683,"teacher_disagreement_score":0.45943016,"about_ca_system_score_codex":0.00024774656,"about_ca_system_score_gemma":0.00082351465,"threshold_uncertainty_score":0.9997889},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75720835,0.000095727846,0.14366083,0.00005454885,0.0002218772,0.00038595297,7.958358e-7,0.0003642179,0.098007716],"genre_scores_gemma":[0.90792954,0.000004640581,0.0903762,0.000012956354,0.000040307867,0.000012030446,6.170622e-7,0.0000104735855,0.0016132139],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981506,0.00009845342,0.00067851867,0.00042369703,0.00034580647,0.00030293767],"domain_scores_gemma":[0.99890184,0.00006755597,0.00031870994,0.00048149584,0.00012957043,0.00010083972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006252816,0.00015173234,0.0003108649,0.000102642065,0.00012684906,0.00011628464,0.0003357735,0.000052917825,0.000047051635],"category_scores_gemma":[0.000069236026,0.00013255722,0.000041530184,0.00036870682,0.000024132656,0.0005774483,0.00024733364,0.00006648485,0.00008374486],"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.0000053168988,0.00019867343,0.01356531,0.0009789902,0.00019229043,0.00010378616,0.0148539655,0.000360642,0.8615422,0.071643114,0.0005758951,0.03597977],"study_design_scores_gemma":[0.00050046825,0.00014475621,0.00093637535,0.00044485467,0.000009150577,0.00009589375,0.00057764386,0.96103877,0.035961106,0.000010748137,0.00003416145,0.0002461033],"about_ca_topic_score_codex":0.00028821966,"about_ca_topic_score_gemma":0.0000032612566,"teacher_disagreement_score":0.9606781,"about_ca_system_score_codex":0.000048765534,"about_ca_system_score_gemma":0.000018341942,"threshold_uncertainty_score":0.5405527},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75719184,0.000041966283,0.21799272,0.00001802269,0.0002748212,0.00033572238,0.0000028364748,0.0003867162,0.023755379],"genre_scores_gemma":[0.9753727,0.0000049931427,0.023424814,0.0000071855,0.00008668245,0.000014322861,0.0000033057636,0.00001604921,0.0010699489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811697,0.00021967564,0.0004945273,0.0003909607,0.00041000775,0.00036788467],"domain_scores_gemma":[0.9985538,0.00020362608,0.0002581192,0.000709367,0.00013700807,0.00013809337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006101786,0.00018744906,0.00034963185,0.00015506163,0.00016266412,0.000101584,0.0005328787,0.00008827681,0.000032693115],"category_scores_gemma":[0.00007991749,0.00014841575,0.0001678059,0.00036460726,0.000041067855,0.00053059956,0.000103164595,0.00011995394,0.00036436785],"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.00008437278,0.0012710497,0.090775155,0.00028833622,0.00081385736,0.0005664423,0.017924221,0.5413552,0.30613858,0.029127652,0.007408189,0.004246975],"study_design_scores_gemma":[0.00057186175,0.00023695546,0.027950943,0.00017503154,0.000005948823,0.00020531623,0.00005793275,0.9662897,0.004207831,0.000014496986,0.000010626266,0.00027333768],"about_ca_topic_score_codex":0.0025296796,"about_ca_topic_score_gemma":0.000004839558,"teacher_disagreement_score":0.42493454,"about_ca_system_score_codex":0.00014571077,"about_ca_system_score_gemma":0.00014705009,"threshold_uncertainty_score":0.60522187},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4767999,0.000009401501,0.5216612,0.0003985249,0.00020694926,0.00018226422,0.000012279302,0.000093545,0.00063589925],"genre_scores_gemma":[0.91984874,0.0000014226174,0.07999752,0.000014243931,0.000042693493,0.000012896296,0.000023624776,0.00000921411,0.00004967201],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9987161,0.000050508046,0.00039611536,0.00031462865,0.00028097865,0.0002416618],"domain_scores_gemma":[0.9985808,0.00012583114,0.00019848238,0.00091035693,0.000109931,0.00007458556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027479226,0.0001227275,0.00015943611,0.00012980432,0.000102330436,0.00014167314,0.0008784108,0.000052647847,0.0002316468],"category_scores_gemma":[0.000045307785,0.00011005418,0.00006658745,0.00033892988,0.000041083447,0.00025529772,0.00025697032,0.00015883459,0.000025208654],"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.0000061368723,0.00016860517,0.03658756,0.00017481468,0.00012846696,0.0000103341035,0.002714772,0.0034190603,0.79349834,0.12755765,0.00097178546,0.034762505],"study_design_scores_gemma":[0.0006461943,0.00006460042,0.53558266,0.000034997553,0.000019344076,0.000051961928,0.00048832357,0.40785828,0.049182754,0.005155642,0.0005165762,0.0003986646],"about_ca_topic_score_codex":0.00076292676,"about_ca_topic_score_gemma":0.0014092895,"teacher_disagreement_score":0.74431556,"about_ca_system_score_codex":0.00003385928,"about_ca_system_score_gemma":0.000080903206,"threshold_uncertainty_score":0.44878793},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043980483,0.00014756464,0.8602928,0.0005072764,0.0012084026,0.0033997353,0.000009025266,0.001557069,0.08889766],"genre_scores_gemma":[0.5630391,0.000017293289,0.29019767,0.00015411367,0.00024243077,0.0015051138,0.000031114658,0.00009941086,0.14471371],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715734,0.00020594028,0.00066287833,0.00074300036,0.0004671774,0.0007636719],"domain_scores_gemma":[0.99726284,0.00038638304,0.00024017162,0.0013850296,0.00043162593,0.00029397412],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010856541,0.00031163607,0.00048708424,0.00020360864,0.00022157696,0.0009215348,0.0014344011,0.00017176148,0.00015776925],"category_scores_gemma":[0.00009824783,0.000263366,0.00013334198,0.0005130511,0.000045803004,0.001861771,0.00027881266,0.00012584767,0.0022392527],"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.00007076943,0.0008037172,0.0007977659,0.002702672,0.0010142081,0.000077151715,0.007927876,0.042154796,0.48526785,0.17643881,0.2618151,0.020929284],"study_design_scores_gemma":[0.00057937135,0.0001124315,0.00014731131,0.00010496341,0.000011870725,0.00004368729,0.0004110731,0.9957053,0.000695798,0.0013778959,0.00046195762,0.0003483111],"about_ca_topic_score_codex":0.0026485773,"about_ca_topic_score_gemma":0.000017897983,"teacher_disagreement_score":0.9535505,"about_ca_system_score_codex":0.000113375136,"about_ca_system_score_gemma":0.00020847066,"threshold_uncertainty_score":0.9999819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027015213,0.0003721955,0.9682748,0.002980918,0.00023285885,0.00059470057,0.000010365842,0.000031510903,0.00048747155],"genre_scores_gemma":[0.8611079,0.000020648333,0.13729374,0.00054586586,0.00090641604,0.00001600761,0.000003582568,0.00001606316,0.00008979928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976101,0.00024460934,0.0011346589,0.00023746575,0.000431044,0.0003421161],"domain_scores_gemma":[0.9968307,0.0011325245,0.0008261078,0.00048144936,0.0005093315,0.00021989728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013933212,0.00017171123,0.0006387638,0.00011612446,0.00009889093,0.00008740045,0.0010330135,0.00015438312,0.000056022534],"category_scores_gemma":[0.00005589745,0.00013840015,0.00023962653,0.00043564817,0.00005593061,0.00026072346,0.000029613013,0.00047010923,0.000008418711],"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.0007601663,0.00037088088,0.00022411045,0.00018568942,0.00038325923,0.000013983782,0.0008388329,0.8012727,0.012543222,0.012113907,0.0016908711,0.16960241],"study_design_scores_gemma":[0.00784673,0.00049313804,0.0058293846,0.00028505598,0.00010433787,0.000346584,0.000040544455,0.95961106,0.0016520985,0.012483241,0.010809048,0.00049878145],"about_ca_topic_score_codex":0.00010762726,"about_ca_topic_score_gemma":0.000020653224,"teacher_disagreement_score":0.8340927,"about_ca_system_score_codex":0.000038326707,"about_ca_system_score_gemma":0.00013563062,"threshold_uncertainty_score":0.56437945},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49276906,0.000008435723,0.4424732,0.0008604276,0.00017486246,0.0004669992,2.6556685e-7,0.00036477193,0.062881954],"genre_scores_gemma":[0.958258,2.576509e-7,0.04114834,0.00010202351,0.000013565008,0.0000027696829,0.0000019522683,0.0000021545204,0.000470975],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993192,0.000027606644,0.00016901793,0.00016246417,0.00021133946,0.00011037893],"domain_scores_gemma":[0.9995541,0.00001796143,0.00007318546,0.0002771633,0.00004169423,0.00003589316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013362675,0.000060607883,0.00008887613,0.000054327775,0.000022648093,0.000061003815,0.00028585445,0.000027365193,0.000019797984],"category_scores_gemma":[0.0000074328595,0.000049400645,0.000030744723,0.00021077771,0.000007802274,0.0003174325,0.000022146925,0.000033334258,0.00018078982],"study_design_candidate":"design_other","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.000007450326,0.00020718129,0.00045341445,0.000016295642,0.000011797531,0.000004353999,0.0006277504,0.00033763002,0.012800039,0.1435419,0.0006059842,0.8413862],"study_design_scores_gemma":[0.0021783474,0.0043653,0.018223453,0.00044478613,0.000013139766,0.00005598684,0.00022930896,0.68597406,0.2550613,0.032089174,0.00050962187,0.0008555105],"about_ca_topic_score_codex":0.00001835692,"about_ca_topic_score_gemma":7.955422e-7,"teacher_disagreement_score":0.8405307,"about_ca_system_score_codex":0.000019430838,"about_ca_system_score_gemma":0.000020533327,"threshold_uncertainty_score":0.23237477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07936656,0.000028638367,0.917104,0.00008392371,0.00022576327,0.0007442813,0.000074886084,0.0012138624,0.0011580746],"genre_scores_gemma":[0.7772065,0.000001782279,0.22248068,0.000014590289,0.000014771336,0.00006073697,0.00018725776,0.000017053842,0.00001665441],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977042,0.00015325595,0.0006942422,0.00060786045,0.00052983913,0.00031060178],"domain_scores_gemma":[0.99767274,0.000061933955,0.0006620997,0.0011259778,0.00038312052,0.000094153955],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036849908,0.00032023477,0.0005251143,0.0001995643,0.000057670004,0.00018722854,0.0011376924,0.00016164915,0.000029498979],"category_scores_gemma":[0.00000400376,0.0002652211,0.0001050666,0.00022065453,0.0000612284,0.0004382022,0.0006414673,0.00020537645,0.000007865215],"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.00013715298,0.00054128113,0.008003074,0.004089255,0.0011329117,0.00007967401,0.0072922553,0.64412016,0.005680328,0.32077143,0.0026463177,0.0055061574],"study_design_scores_gemma":[0.0006564957,0.00009133469,0.0029324996,0.00028389247,0.00002912211,0.0000058917567,0.00020384476,0.97617453,0.016860358,0.0023975915,0.0000067717774,0.00035764786],"about_ca_topic_score_codex":0.0059627877,"about_ca_topic_score_gemma":0.00013234401,"teacher_disagreement_score":0.6978399,"about_ca_system_score_codex":0.00011490581,"about_ca_system_score_gemma":0.000607025,"threshold_uncertainty_score":0.99998},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43804923,0.0021531251,0.45747715,0.0024942465,0.003124748,0.0024049967,0.000007857287,0.0058592195,0.08842944],"genre_scores_gemma":[0.7070994,0.000053369087,0.28625894,0.0006680038,0.0004938599,0.00015166179,0.000018903487,0.00007723891,0.005178634],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99290305,0.00046132033,0.0019157937,0.0016960568,0.0015004526,0.001523303],"domain_scores_gemma":[0.99431044,0.0005403138,0.00063246436,0.003613678,0.00024933214,0.0006538023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004311462,0.0006500198,0.00096899417,0.00026966314,0.00037671346,0.0006025596,0.0020153553,0.0007584534,0.0008127765],"category_scores_gemma":[0.0006860574,0.00058787636,0.00055928616,0.001602824,0.00015343938,0.0023170486,0.0008327166,0.0010801486,0.0003440322],"study_design_candidate":"design_other","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.00017079437,0.0011984083,0.011184288,0.0003469464,0.00036079093,0.01027592,0.0014782082,0.0033934442,0.013787099,0.012546781,0.026188608,0.9190687],"study_design_scores_gemma":[0.0029440671,0.00091315905,0.07115435,0.0015156743,0.00024913723,0.02228297,0.00018482216,0.041917976,0.013667583,0.025115985,0.81408244,0.0059718248],"about_ca_topic_score_codex":0.00026470592,"about_ca_topic_score_gemma":0.000056579465,"teacher_disagreement_score":0.9130969,"about_ca_system_score_codex":0.0003142655,"about_ca_system_score_gemma":0.00037136156,"threshold_uncertainty_score":0.9996573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027951293,0.00004965093,0.9470989,0.0017076035,0.00009786784,0.0005725959,0.0000022448937,0.00033495788,0.022184892],"genre_scores_gemma":[0.5348201,0.000008108759,0.46449223,0.0001073729,0.000033784225,0.000056914538,0.000003696124,0.000010335475,0.00046747708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865466,0.0002070322,0.000294493,0.00041283757,0.00015674424,0.00027422418],"domain_scores_gemma":[0.9973575,0.0009001856,0.00011148929,0.0011340617,0.00037090873,0.00012585154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010329658,0.00015243956,0.00023866496,0.00009111112,0.00039367177,0.00029320453,0.0009202889,0.000063355954,0.0000067462415],"category_scores_gemma":[0.00032742124,0.00013082406,0.000049309423,0.000248711,0.00010580303,0.0002797059,0.0005001958,0.000093933544,0.00009353212],"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.0000080767095,0.00014351639,0.00012462438,0.000046147463,0.00006938468,6.600284e-7,0.0043005566,0.017026441,0.021254698,0.9451689,0.00040817555,0.011448819],"study_design_scores_gemma":[0.0003713011,0.00009386128,0.00025508253,0.00003876676,0.0000066768707,0.000008505809,0.00011791927,0.9953354,0.0024961135,0.0005911453,0.00051371095,0.0001715142],"about_ca_topic_score_codex":0.00008157115,"about_ca_topic_score_gemma":0.000008682511,"teacher_disagreement_score":0.978309,"about_ca_system_score_codex":0.000043894852,"about_ca_system_score_gemma":0.00006588191,"threshold_uncertainty_score":0.533485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006864567,0.000015200646,0.9137614,0.00019711739,0.00007898019,0.082940035,0.000022543698,0.00016333797,0.002134951],"genre_scores_gemma":[0.5385934,2.7148232e-7,0.21967617,0.00003327538,0.000065652486,0.24128705,0.000020169591,0.000015250201,0.000308732],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732476,0.00022689532,0.00088641385,0.00071135623,0.00037161735,0.00047894297],"domain_scores_gemma":[0.9967605,0.00047056057,0.0006186433,0.0010176194,0.0008742093,0.00025846637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010172621,0.00026809514,0.0007408858,0.00035591595,0.00011042324,0.0009375,0.00084436545,0.0003173052,0.00004327465],"category_scores_gemma":[0.00024133467,0.00021434197,0.0002058595,0.0015094215,0.0000734215,0.0018265538,0.00026672074,0.00023509018,0.000016070546],"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.00047136695,0.0018630178,0.052407406,0.0044131996,0.013571798,0.000030380128,0.005913806,0.04808159,0.004948425,0.7146828,0.102911286,0.050704885],"study_design_scores_gemma":[0.0007042247,0.0001804532,0.0017796956,0.000090569236,0.00008324842,0.0000071441114,0.0005054339,0.9940596,0.00036900848,0.0009134533,0.0010027076,0.0003044613],"about_ca_topic_score_codex":0.0019286743,"about_ca_topic_score_gemma":0.000025783005,"teacher_disagreement_score":0.945978,"about_ca_system_score_codex":0.00007228923,"about_ca_system_score_gemma":0.00012250556,"threshold_uncertainty_score":0.90403336},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5340865,0.000015801636,0.46353844,0.00006902442,0.00033019352,0.0009708997,3.8054398e-7,0.00015830688,0.0008304203],"genre_scores_gemma":[0.8911426,0.0000010901828,0.107923865,0.000033230324,0.000056199802,0.0002984328,0.0000064937026,0.000013929027,0.0005241736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982252,0.000023161609,0.00057638955,0.00044427166,0.00034019357,0.00039077768],"domain_scores_gemma":[0.9987845,0.00012315507,0.00019426504,0.00057655026,0.00024079932,0.00008074882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010230631,0.00017362167,0.0002331337,0.00024172889,0.00014468803,0.00021619444,0.00052981125,0.00011224578,0.000009210645],"category_scores_gemma":[0.00006061809,0.00013591348,0.000060975675,0.00046194158,0.000014830292,0.0015263326,0.00011911091,0.00010760026,0.00018238218],"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.00012055396,0.00057286967,0.06287733,0.0036869063,0.00009085432,0.000008853516,0.014675256,0.73111844,0.06889028,0.057487488,0.0020748258,0.05839636],"study_design_scores_gemma":[0.0008855057,0.000059650916,0.026786026,0.00015558343,0.0000018434247,0.000007394319,0.0003811281,0.96722025,0.004257992,0.0000469607,0.000018746112,0.00017893624],"about_ca_topic_score_codex":0.00044858654,"about_ca_topic_score_gemma":0.000041954954,"teacher_disagreement_score":0.35705605,"about_ca_system_score_codex":0.00025528698,"about_ca_system_score_gemma":0.000064006694,"threshold_uncertainty_score":0.5542391},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46306586,0.00009661658,0.48574904,0.00036149312,0.00034916343,0.0019248618,0.000010132354,0.0009740234,0.047468826],"genre_scores_gemma":[0.5499591,0.000011250909,0.4484288,0.000083559506,0.00008241375,0.00008871416,0.0000063659354,0.00004926274,0.001290481],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967071,0.0001486728,0.0006530194,0.0011467761,0.0004712667,0.000873171],"domain_scores_gemma":[0.99749047,0.00062900805,0.00024835445,0.0010001498,0.0002573371,0.0003746914],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014490284,0.00047155583,0.00063746376,0.00026832745,0.00034823464,0.0004522742,0.00077066553,0.00022769487,0.00007883446],"category_scores_gemma":[0.00011916447,0.00043012432,0.00020557757,0.000563549,0.00010396661,0.00085710053,0.00010931909,0.00017340979,0.00032940923],"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.00038122188,0.0011391654,0.0008660932,0.0005830185,0.0006647431,0.00018017023,0.004170054,0.3379429,0.45675147,0.1714428,0.005401602,0.02047676],"study_design_scores_gemma":[0.0015720263,0.00033706616,0.00017807326,0.00011227222,0.000027058444,0.00003113192,0.000084698986,0.9844541,0.011946492,0.0005265203,0.00012494718,0.00060563046],"about_ca_topic_score_codex":0.00011801374,"about_ca_topic_score_gemma":0.000014412214,"teacher_disagreement_score":0.6465112,"about_ca_system_score_codex":0.000111960675,"about_ca_system_score_gemma":0.00038555628,"threshold_uncertainty_score":0.99981505},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08295722,0.00022988943,0.8693757,0.0003267412,0.0008553004,0.00020490779,2.3262069e-7,0.00045967355,0.045590345],"genre_scores_gemma":[0.9169524,0.0000032055086,0.057881337,0.00007901674,0.00056175893,0.000010364983,4.7460622e-7,0.00001250086,0.024499001],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860317,0.000068868954,0.00023084285,0.00039549655,0.00038774044,0.0003138866],"domain_scores_gemma":[0.9988576,0.000056368237,0.000068928275,0.00075094466,0.000050661543,0.00021545624],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012911922,0.00014445398,0.00025636153,0.00007142172,0.00010451641,0.0001572243,0.0007798909,0.000051420007,0.000011917001],"category_scores_gemma":[0.000022459948,0.00011561027,0.00009088888,0.00029786464,0.000025930676,0.00072461565,0.00017513048,0.00010253606,0.0013071798],"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.000015642068,0.00043750074,0.005562659,0.00011084791,0.00024685942,0.0007272594,0.025975998,0.0052080005,0.013748604,0.4342976,0.4832657,0.030403316],"study_design_scores_gemma":[0.0012828507,0.00018411422,0.0042051026,0.0001096663,0.000013960444,0.0012047113,0.00041533253,0.9547407,0.0047336943,0.0012854077,0.03082661,0.0009978681],"about_ca_topic_score_codex":0.0013106616,"about_ca_topic_score_gemma":0.000003885094,"teacher_disagreement_score":0.9495327,"about_ca_system_score_codex":0.000048058246,"about_ca_system_score_gemma":0.0001666315,"threshold_uncertainty_score":0.9994704},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15484676,0.000074120995,0.80499285,0.0005267524,0.00009870557,0.00037081446,0.0000018197327,0.00009772167,0.03899046],"genre_scores_gemma":[0.8459839,0.00004176597,0.15361327,0.000012811992,0.000011392798,4.2975927e-7,0.0000048716493,0.0000034920502,0.000328035],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998297,0.00019013327,0.00019430486,0.00015062356,0.000831506,0.00033643868],"domain_scores_gemma":[0.9983869,0.00009367719,0.00016013763,0.00045207536,0.0007805892,0.00012658302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015255173,0.00008714331,0.00013827486,0.00042149427,0.00029180598,0.00012470358,0.0007170646,0.00006368983,0.000022409184],"category_scores_gemma":[0.0001499109,0.00008566135,0.000038111102,0.00091021595,0.00010451155,0.0045933896,0.00015304398,0.00025380435,0.00016717156],"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.0003378421,0.0003251402,0.013398991,0.0010899205,0.00026233948,0.00010807192,0.024497025,0.018784417,0.0042672628,0.895525,0.0034450474,0.03795899],"study_design_scores_gemma":[0.009784638,0.0018705733,0.0093530435,0.0021955527,0.000037624704,0.0002638467,0.024685608,0.46153992,0.053588,0.004248543,0.4306544,0.0017782454],"about_ca_topic_score_codex":0.0001393824,"about_ca_topic_score_gemma":0.000023565744,"teacher_disagreement_score":0.8912764,"about_ca_system_score_codex":0.00014801377,"about_ca_system_score_gemma":0.00027259163,"threshold_uncertainty_score":0.34931684},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9104619,0.000056338282,0.0804017,0.00041515267,0.00004530296,0.0018463572,0.000046010548,0.0002803582,0.0064469],"genre_scores_gemma":[0.9824955,0.000096108044,0.016268337,0.000021799797,0.000089915295,0.00066471717,0.000093451265,0.00002762124,0.00024255132],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966499,0.000023312365,0.0010949466,0.00093701953,0.0007306626,0.00056415255],"domain_scores_gemma":[0.99835086,0.00006770725,0.00061357114,0.00021793369,0.0005456357,0.00020431173],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085991155,0.00037021507,0.0007107619,0.0008022138,0.00028862426,0.00051573146,0.00094673247,0.00018830644,0.000006815529],"category_scores_gemma":[0.000077192926,0.0003639894,0.00012651035,0.001289133,0.00012891703,0.0025123993,0.00042056944,0.00023774282,0.0000048228076],"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.001358551,0.0010407406,0.24787326,0.0020010099,0.001830257,0.00014769268,0.019124784,0.31868804,0.39416832,0.0100174295,0.0005405709,0.0032093523],"study_design_scores_gemma":[0.0008896166,0.0000797043,0.00452734,0.0004313739,0.000074359785,0.00011209182,0.000097594246,0.99199593,0.00085659145,0.0005196567,0.000032735377,0.0003830058],"about_ca_topic_score_codex":0.00027188845,"about_ca_topic_score_gemma":0.0000032463136,"teacher_disagreement_score":0.6733079,"about_ca_system_score_codex":0.00015296144,"about_ca_system_score_gemma":0.00011114657,"threshold_uncertainty_score":0.9998812},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48266402,0.0012029051,0.5096775,0.0015400628,0.00043192302,0.0002137309,5.6520395e-7,0.00020279022,0.0040664845],"genre_scores_gemma":[0.9583088,0.00041459766,0.04088637,0.0002848429,0.000047401543,0.000017157156,0.0000022407062,0.0000057325024,0.000032837714],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986744,0.00010312183,0.00027937564,0.0005005664,0.00023858137,0.0002039839],"domain_scores_gemma":[0.9989842,0.00029368754,0.00019134217,0.00022371736,0.00017134128,0.00013571212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003401796,0.0001441778,0.0001600653,0.00006649718,0.0002903751,0.00037557495,0.00019950498,0.00005789311,0.0000040587643],"category_scores_gemma":[0.00024638601,0.00013633289,0.000021010208,0.0002612424,0.00009817642,0.0031176105,0.00015395806,0.000115812356,0.00005596634],"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.00007023561,0.00034425932,0.00039490778,0.00012786854,0.000048233982,0.00024016087,0.11092104,0.004244913,0.034348797,0.22239734,0.0003283356,0.6265339],"study_design_scores_gemma":[0.008136687,0.0021656388,0.017406894,0.001243484,0.0001288367,0.006205243,0.026379079,0.8467806,0.012628243,0.05123089,0.024016768,0.0036776457],"about_ca_topic_score_codex":0.00012323832,"about_ca_topic_score_gemma":6.036123e-7,"teacher_disagreement_score":0.8425357,"about_ca_system_score_codex":0.000021445003,"about_ca_system_score_gemma":0.00008135674,"threshold_uncertainty_score":0.5559494},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017750405,0.00016261385,0.9408234,0.00023237569,0.0003555149,0.000252069,5.5398397e-7,0.00020403798,0.040219035],"genre_scores_gemma":[0.46346542,0.0000046244977,0.53581995,0.00002438719,0.000017997729,0.00003504658,0.0000011852676,0.0000045272927,0.0006268569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871,0.00019134641,0.00032242003,0.00032919057,0.0002249613,0.0002221091],"domain_scores_gemma":[0.9989935,0.00019871951,0.000070417605,0.00057384005,0.000098091936,0.00006538626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086302386,0.00008648901,0.000109108354,0.00013045195,0.000101331025,0.0001424127,0.0004272103,0.00003778693,0.00016834284],"category_scores_gemma":[0.0005403332,0.000083322506,0.00003646962,0.00064637186,0.000017445314,0.00050838914,0.000049510476,0.00010768507,0.0004128521],"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":[1.906782e-7,0.00006392209,0.0038655708,0.000009159662,0.000004433429,0.000003097265,0.00064740994,0.0032125684,0.0018797901,0.9773606,0.0002635148,0.012689735],"study_design_scores_gemma":[0.0037002254,0.0003228471,0.105048135,0.00049211783,0.000022086859,0.00030680397,0.0020934506,0.73974466,0.008933765,0.116512775,0.020365212,0.0024578848],"about_ca_topic_score_codex":0.000036727422,"about_ca_topic_score_gemma":0.000016554844,"teacher_disagreement_score":0.86084783,"about_ca_system_score_codex":0.000064995635,"about_ca_system_score_gemma":0.00013120123,"threshold_uncertainty_score":0.5306516},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11212094,0.000044892076,0.870288,0.0005027579,0.00019837222,0.00012059248,6.783527e-8,0.00034209783,0.016382268],"genre_scores_gemma":[0.8232723,4.9143415e-7,0.17596558,0.0002869365,0.000031618692,0.0000024973233,2.605836e-7,0.0000034770103,0.00043687053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989386,0.000049675287,0.000269024,0.000304979,0.00017427052,0.0002634507],"domain_scores_gemma":[0.9993799,0.00005282762,0.000047665766,0.0004249201,0.000028151891,0.00006656139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032207262,0.000101554855,0.00015228841,0.00014462727,0.00003030704,0.00016518946,0.0005988651,0.00005073948,0.000023102639],"category_scores_gemma":[0.000069947964,0.00008954089,0.00004314347,0.00035827892,0.0000066034604,0.0007439795,0.00006764382,0.00011665758,0.00013501961],"study_design_candidate":"design_other","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.000013201485,0.00027732897,0.0047791107,0.000051197876,0.000018150973,0.00034628122,0.015858177,0.005266268,0.011616819,0.044807833,0.002263372,0.91470224],"study_design_scores_gemma":[0.0031654937,0.0006852504,0.09718677,0.0010660497,0.000008353981,0.0005226088,0.0013917506,0.79281396,0.06163585,0.038528662,0.0008861585,0.002109109],"about_ca_topic_score_codex":0.000050763796,"about_ca_topic_score_gemma":0.000030676798,"teacher_disagreement_score":0.9125931,"about_ca_system_score_codex":0.0000486811,"about_ca_system_score_gemma":0.00003317859,"threshold_uncertainty_score":0.36513713},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3289635,0.001417918,0.58659995,0.00069983525,0.0032109842,0.008676131,0.0003897683,0.0073952624,0.06264665],"genre_scores_gemma":[0.83919233,0.00003389949,0.05039344,0.0000373995,0.0017246569,0.0013707476,0.00030618726,0.0004341553,0.106507204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98757267,0.003434054,0.0023775864,0.0024314362,0.0022708834,0.0019133985],"domain_scores_gemma":[0.9885555,0.0024758845,0.0019467416,0.003831285,0.0017779128,0.0014126808],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.011392061,0.0011770793,0.0028007221,0.0013865888,0.00058633654,0.0022218921,0.002646345,0.000605085,0.000022569517],"category_scores_gemma":[0.0008374011,0.0010210745,0.00063046784,0.004206002,0.00017006858,0.0019792032,0.0005084266,0.00031762483,0.0011619945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0059891227,0.0012909088,0.009655625,0.002675231,0.013518674,0.0015055683,0.009465713,0.47348773,0.40913168,0.023223279,0.048088476,0.0019679763],"study_design_scores_gemma":[0.002323608,0.0009242642,0.0006445976,0.00075832393,0.0006130783,0.0005211986,0.00033507272,0.98452777,0.0006709295,0.00003922286,0.007019869,0.0016220879],"about_ca_topic_score_codex":0.014022935,"about_ca_topic_score_gemma":0.00004614801,"teacher_disagreement_score":0.5362065,"about_ca_system_score_codex":0.0011445628,"about_ca_system_score_gemma":0.0014575934,"threshold_uncertainty_score":0.9996157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3887004,0.000015471038,0.5932412,0.0000443591,0.00008074847,0.000086158856,5.6276e-7,0.00009196288,0.017739164],"genre_scores_gemma":[0.9409657,5.582618e-7,0.05861,0.00004736892,0.000017250864,9.820596e-7,0.0000022571728,0.0000031607801,0.00035269815],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99855375,0.00006199111,0.00046751316,0.00035836283,0.00031434558,0.00024402096],"domain_scores_gemma":[0.9985023,0.00014238313,0.00014882752,0.0008924925,0.00021454618,0.000099411795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016512822,0.000095205105,0.00030049437,0.00035568728,0.000039691673,0.000074400654,0.00068862364,0.00006264509,0.000114389135],"category_scores_gemma":[0.000070069655,0.00007834036,0.00015054629,0.0030301379,0.000027444372,0.00037394965,0.00014516164,0.000068782436,0.000033951546],"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.000053871096,0.00072755583,0.6467676,0.00009739606,0.0028378207,0.00006435911,0.0029068228,0.009140251,0.19675398,0.092795156,0.0010632239,0.046791926],"study_design_scores_gemma":[0.00033179478,0.0000590258,0.6405205,0.000009838231,0.00014545213,0.000004496397,0.00012557367,0.2751206,0.082903236,0.00038455616,0.00012241532,0.00027247603],"about_ca_topic_score_codex":0.0006489378,"about_ca_topic_score_gemma":0.00023382563,"teacher_disagreement_score":0.55226535,"about_ca_system_score_codex":0.00005150776,"about_ca_system_score_gemma":0.00004752938,"threshold_uncertainty_score":0.31946272},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83202475,0.0001316125,0.16340841,0.00014035277,0.00022847984,0.00030844758,4.2262786e-7,0.00028600034,0.0034715212],"genre_scores_gemma":[0.9806924,0.000005374054,0.018878603,0.00010475981,0.000045565925,0.000037830814,0.0000011108228,0.000016443699,0.00021795479],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813783,0.00014221076,0.00038162796,0.00049843465,0.00040609072,0.00043379632],"domain_scores_gemma":[0.9987542,0.000102820304,0.00014024987,0.000814657,0.00007676442,0.00011130255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042229603,0.00020700908,0.0002877746,0.00020733615,0.00010067848,0.00030091315,0.000743303,0.00007664866,0.000014204152],"category_scores_gemma":[0.000016709295,0.00015929622,0.000033009554,0.0007504218,0.000030030753,0.00077734276,0.00009386962,0.00017003571,0.0001618838],"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.000043626333,0.0004650212,0.62325776,0.0006360557,0.00007212837,0.00022436453,0.0007326815,0.3523815,0.0062511545,0.006540121,0.00021756349,0.009178009],"study_design_scores_gemma":[0.0006158131,0.00015819534,0.05488745,0.00022016132,0.000002625794,0.00004733665,0.000015767344,0.9408476,0.0028436217,7.145177e-7,0.00010775175,0.0002530145],"about_ca_topic_score_codex":0.00032808603,"about_ca_topic_score_gemma":0.000041265343,"teacher_disagreement_score":0.58846605,"about_ca_system_score_codex":0.00010669813,"about_ca_system_score_gemma":0.000030505173,"threshold_uncertainty_score":0.64959115},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65965575,0.0014985845,0.32036552,0.0057429243,0.00011864886,0.00023545504,4.410595e-7,0.00021862649,0.012164044],"genre_scores_gemma":[0.72261953,0.000026395477,0.2763211,0.00011968361,0.00002521532,0.000005839855,1.3879294e-7,0.000005059643,0.00087704783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912935,0.000065787404,0.00016920401,0.00027294396,0.00015633453,0.00020637603],"domain_scores_gemma":[0.99950856,0.0000689828,0.000029924866,0.000309103,0.000015677253,0.0000677776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018615664,0.00009336005,0.00013936387,0.00011748404,0.0000353168,0.00017377688,0.0002978674,0.000036466867,0.000054034343],"category_scores_gemma":[0.000026843481,0.00007487151,0.000016403623,0.00023672103,0.00003130653,0.0003137019,0.00011836074,0.00009768936,0.00010403101],"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.000008998497,0.0004382312,0.084696166,0.0005327653,0.00006121364,0.00023171012,0.03831579,0.006412478,0.011910616,0.19421814,0.0036117483,0.6595621],"study_design_scores_gemma":[0.0009923459,0.00014154662,0.022035602,0.00023516375,0.000004284205,0.00014524568,0.00060053996,0.9402752,0.0057785977,0.025473416,0.0036683958,0.00064969214],"about_ca_topic_score_codex":0.0001825382,"about_ca_topic_score_gemma":0.00010775145,"teacher_disagreement_score":0.9338627,"about_ca_system_score_codex":0.00001233206,"about_ca_system_score_gemma":0.0000056698914,"threshold_uncertainty_score":0.30531716},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24134506,0.00018650599,0.7437176,0.012152967,0.0004338822,0.00050798384,1.7718067e-7,0.00008698675,0.0015688419],"genre_scores_gemma":[0.88284206,0.0000024427736,0.11625673,0.00058846525,0.00018784945,0.000040510356,0.0000016026664,0.0000048931843,0.00007542326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988545,0.00010325369,0.0002479779,0.00022416333,0.0003287178,0.000241363],"domain_scores_gemma":[0.999418,0.00006321388,0.000041484178,0.0003857981,0.00005959822,0.00003188866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008480815,0.000092238646,0.00008061139,0.00003417551,0.00025984846,0.00044746097,0.000726229,0.00003525754,0.0000021945843],"category_scores_gemma":[0.000018265022,0.00004528588,0.000050014405,0.00027648697,0.00004022089,0.00029644885,0.0000461883,0.00013345446,0.00003605367],"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.000004377614,0.000072187635,0.0003302413,0.0000055932614,0.0000160481,0.000024424085,0.0043769632,0.01774956,0.011216233,0.87855774,0.000600399,0.08704623],"study_design_scores_gemma":[0.0016253587,0.00015945865,0.008610737,0.000048821115,0.0000081958015,0.0004301355,0.00070659496,0.9420905,0.0067969407,0.011152033,0.02782634,0.0005448441],"about_ca_topic_score_codex":0.00020136408,"about_ca_topic_score_gemma":0.00033849577,"teacher_disagreement_score":0.92434096,"about_ca_system_score_codex":0.000039283907,"about_ca_system_score_gemma":0.000071847026,"threshold_uncertainty_score":0.43148765},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06066386,0.000074389536,0.87151,0.0036703593,0.000104976345,0.0007242663,7.7013476e-7,0.00015999479,0.06309137],"genre_scores_gemma":[0.8567635,0.0000026494788,0.14264977,0.000115716466,0.000020041334,0.00001364209,1.5373891e-7,0.0000036401746,0.00043089167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987119,0.00037682298,0.00030624095,0.00019353654,0.00022966592,0.00018187509],"domain_scores_gemma":[0.9984381,0.0008960739,0.00007547102,0.00052006927,0.0000406599,0.000029604218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066385424,0.00008631209,0.00014324053,0.00009222472,0.000057093814,0.000113135415,0.00048339248,0.00003153237,0.00017830594],"category_scores_gemma":[0.00011126526,0.00005489864,0.000038806964,0.00028728053,0.000042456424,0.00023516518,0.00005753476,0.00008242895,0.00017664378],"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.000008322915,0.00051557104,0.0019472869,0.00007050054,0.00009409717,0.00023565997,0.065406874,0.15705556,0.18031174,0.5549089,0.021429125,0.018016428],"study_design_scores_gemma":[0.00033846774,0.0000907301,0.0029454948,0.000032468775,0.000003797861,0.0002949388,0.00012014109,0.97857857,0.005439833,0.011947727,0.000025677213,0.00018216556],"about_ca_topic_score_codex":0.0002666848,"about_ca_topic_score_gemma":0.00001274493,"teacher_disagreement_score":0.821523,"about_ca_system_score_codex":0.0000140286775,"about_ca_system_score_gemma":0.000024345825,"threshold_uncertainty_score":0.22704573},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79928267,0.000029652101,0.1966935,0.000055201705,0.00016645752,0.00019613246,8.954933e-7,0.000065263914,0.0035102149],"genre_scores_gemma":[0.9128624,1.3938205e-7,0.08697003,0.000027387896,0.00003689496,0.000007728553,0.0000017585953,0.0000061391142,0.00008748331],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99878734,0.000072510236,0.0002733487,0.00018358194,0.0003902361,0.00029300668],"domain_scores_gemma":[0.9992922,0.000047750662,0.0001537982,0.00035232547,0.00005386607,0.00010009084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005062538,0.00010016684,0.00014689076,0.00008414001,0.000049121645,0.00003729273,0.0003391708,0.000023681165,0.00006110185],"category_scores_gemma":[0.0000036826887,0.000075009826,0.000032885706,0.00020978639,0.000025822765,0.00028809276,0.00011955129,0.00004144261,0.00006259908],"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.00007150955,0.0013946733,0.27470955,0.00039987612,0.00032953644,0.000024128403,0.034085512,0.012302905,0.5557847,0.070499696,0.0014307392,0.048967198],"study_design_scores_gemma":[0.0022878444,0.00036982866,0.5227177,0.00008323702,0.000030767154,0.00009860661,0.0026484663,0.19283204,0.27805477,0.000020799984,0.00029532047,0.00056059816],"about_ca_topic_score_codex":0.0003554982,"about_ca_topic_score_gemma":0.000008405611,"teacher_disagreement_score":0.2777299,"about_ca_system_score_codex":0.00003531897,"about_ca_system_score_gemma":0.000038577855,"threshold_uncertainty_score":0.3058812},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010169329,0.0000019299061,0.9050733,0.0016174747,0.00021025317,0.08498611,0.000006411494,0.0006516193,0.0073512327],"genre_scores_gemma":[0.34892267,1.4521297e-7,0.5288668,0.0002764822,0.000893091,0.11955269,0.000087645596,0.00003590272,0.0013645452],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99759835,0.00011834737,0.00056560716,0.00086045865,0.00044800338,0.00040922815],"domain_scores_gemma":[0.99697405,0.00013341002,0.0002021349,0.0022668669,0.0002475822,0.00017598372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010260635,0.00021062061,0.00026472897,0.00008464819,0.00015374478,0.00039294868,0.0018025775,0.000077568024,0.00000940511],"category_scores_gemma":[0.00019405868,0.00017122486,0.00005737651,0.00027642527,0.000018531173,0.0012479008,0.00028243367,0.00012194564,0.00011561854],"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.00011326396,0.00042487623,0.00010385603,0.0007282583,0.0000761211,0.000054881006,0.0002818434,0.00029080652,0.0040165978,0.8236931,0.014879338,0.15533707],"study_design_scores_gemma":[0.0011290536,0.0003091263,0.00011080468,0.00021684286,0.000010156449,0.00008279133,0.000038036273,0.9640996,0.007820661,0.00026554524,0.025663914,0.0002534548],"about_ca_topic_score_codex":0.00004721702,"about_ca_topic_score_gemma":0.0000041608723,"teacher_disagreement_score":0.96380883,"about_ca_system_score_codex":0.00012991996,"about_ca_system_score_gemma":0.00017055639,"threshold_uncertainty_score":0.69823474},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021601858,0.000036860336,0.9751402,0.0002809877,0.0014566522,0.000603139,0.000016067399,0.00047013265,0.00039406592],"genre_scores_gemma":[0.67979425,0.000007992007,0.31983376,0.00014766924,0.000068251924,0.00007312007,0.0000013092189,0.000025973864,0.00004766586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977999,0.000057747555,0.0004106177,0.0007781467,0.00041210622,0.00054150395],"domain_scores_gemma":[0.9984344,0.0003078322,0.0001534432,0.0007420951,0.00015195471,0.00021024357],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025945524,0.00032102855,0.00034729508,0.00021739413,0.00063693384,0.00019565813,0.0008402927,0.00010305168,0.000007811415],"category_scores_gemma":[0.0000041875633,0.00030188914,0.00017462834,0.0004962663,0.000209973,0.0008078192,0.000005035727,0.00031594897,0.00003475244],"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.00014056142,0.00033111734,0.0002111246,0.00013162091,0.0002720583,0.00015871065,0.0025301748,0.8959425,0.001305519,0.0049847923,0.0002902266,0.0937016],"study_design_scores_gemma":[0.0024368877,0.0005440576,0.00014474183,0.00070067274,0.00003118398,0.0008945517,0.00010172553,0.9797473,0.013704335,0.00016429626,0.00062284915,0.0009074259],"about_ca_topic_score_codex":0.000023239389,"about_ca_topic_score_gemma":0.000015856662,"teacher_disagreement_score":0.6581924,"about_ca_system_score_codex":0.00013523808,"about_ca_system_score_gemma":0.00016518663,"threshold_uncertainty_score":0.9999433},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18006672,4.222092e-7,0.81668746,0.000053061496,0.002079238,0.00034012587,0.000023476528,0.00018544351,0.0005640341],"genre_scores_gemma":[0.93971944,0.0000012380008,0.05989689,0.000056792633,0.00009670839,0.000026801245,0.0000062314366,0.000013294828,0.0001826105],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982682,0.000047181842,0.00086159847,0.00012690331,0.00045992213,0.00023619948],"domain_scores_gemma":[0.99853927,0.00017607513,0.00038959028,0.0006144329,0.0001593957,0.00012121903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920853,0.00017808974,0.00025439222,0.00028755158,0.00015845931,0.00014657914,0.00059509306,0.0003000809,0.000109635395],"category_scores_gemma":[0.00003159975,0.00017248496,0.00011457129,0.00055324496,0.000075458396,0.0016194689,0.00000479893,0.00064802053,0.0002470006],"study_design_candidate":"design_other","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.00016625151,0.0007135761,0.000109400324,0.00027130338,0.0003874551,0.00000620653,0.023888903,0.15327235,0.021151032,0.0015389719,0.0032880618,0.7952065],"study_design_scores_gemma":[0.003811558,0.0005629932,0.000024487903,0.00023294966,0.00006903035,0.00008209649,0.001549244,0.5009773,0.49083918,0.00021823746,0.000906906,0.00072603597],"about_ca_topic_score_codex":0.0000316312,"about_ca_topic_score_gemma":0.0000075226694,"teacher_disagreement_score":0.79448044,"about_ca_system_score_codex":0.000047990558,"about_ca_system_score_gemma":0.00023192537,"threshold_uncertainty_score":0.70337325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18430306,0.000032715194,0.80853426,0.0009027992,0.000078326404,0.00034005643,0.0000073758797,0.0003370662,0.0054643494],"genre_scores_gemma":[0.6928919,1.07331005e-7,0.3067878,0.00015240582,0.00004555611,0.000041029067,0.000020697787,0.000006570627,0.000053963275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997601,0.00017825654,0.0006527057,0.00065754575,0.0005652995,0.0003452127],"domain_scores_gemma":[0.9982832,0.000090370806,0.00010155878,0.001171323,0.00019523584,0.00015830174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079133315,0.00021576734,0.00043321718,0.00039670686,0.00010020084,0.00037247283,0.0008253409,0.00009683488,0.000044640237],"category_scores_gemma":[0.000011484724,0.0001878421,0.00029645144,0.0019112253,0.000018185765,0.0017020792,0.0000573926,0.00009832246,0.00013092393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0000062783984,0.00007087633,0.0001768844,0.000008892971,0.00009697688,0.0000011048045,0.00057205785,0.97173697,0.0017737421,0.024039447,0.000041790165,0.0014749741],"study_design_scores_gemma":[0.0002662701,0.00001929738,0.00082580675,0.000008533948,0.00010438258,3.7024788e-7,0.000045342924,0.9751606,0.009556578,0.013747532,0.00003743306,0.00022786774],"about_ca_topic_score_codex":0.008851244,"about_ca_topic_score_gemma":0.0007533526,"teacher_disagreement_score":0.5085888,"about_ca_system_score_codex":0.00011646309,"about_ca_system_score_gemma":0.000107696826,"threshold_uncertainty_score":0.9977489},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19420722,0.00009549643,0.7547447,0.00015548216,0.00026068796,0.00024686614,2.1804262e-7,0.00035660074,0.049932744],"genre_scores_gemma":[0.714317,0.0000028949728,0.28498054,0.000079617865,0.000044131368,0.000013119106,6.173302e-7,0.00001077368,0.00055128074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825627,0.00009255048,0.00027247498,0.0005462104,0.0004383958,0.00039410562],"domain_scores_gemma":[0.99868333,0.000057221467,0.00010977825,0.0008865115,0.000116481526,0.00014668678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007206073,0.00019056717,0.00020178022,0.00009439953,0.00016441941,0.0003499737,0.00058062887,0.00009306844,0.000050495426],"category_scores_gemma":[0.000054115717,0.00014699418,0.000054651468,0.00045187343,0.000033820306,0.0011215922,0.00009397702,0.0002008936,0.00022713868],"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.000016606142,0.00018563346,0.055012453,0.00010210205,0.00008883312,0.00007252059,0.0011844445,0.014880842,0.012138361,0.90990996,0.00037730177,0.0060309353],"study_design_scores_gemma":[0.005351933,0.0011115676,0.028493213,0.00069119164,0.00007742247,0.001268122,0.0009849018,0.76702327,0.1598952,0.021324273,0.010107512,0.0036714047],"about_ca_topic_score_codex":0.00007688688,"about_ca_topic_score_gemma":0.00003648666,"teacher_disagreement_score":0.8885857,"about_ca_system_score_codex":0.0000631581,"about_ca_system_score_gemma":0.00013591345,"threshold_uncertainty_score":0.59942484},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023627481,0.000090265334,0.99528164,0.0007261703,0.000093007344,0.0011658331,0.0000070499464,0.00020614345,0.000067127476],"genre_scores_gemma":[0.50421244,0.0000053488293,0.49549794,0.000040514387,0.000033955672,0.00014230702,0.000028386437,0.000014615712,0.00002451422],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984943,0.00010111014,0.00040317234,0.0004573797,0.00018062229,0.00036337285],"domain_scores_gemma":[0.9991421,0.0001271189,0.00020967475,0.00024111656,0.00016239796,0.00011756037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005601453,0.00017511555,0.00024136304,0.0000741911,0.00027297295,0.00039748146,0.00023382329,0.00006988077,0.000008432908],"category_scores_gemma":[0.00004411702,0.00017326341,0.000042661864,0.00019530804,0.00003157284,0.00093593204,0.000025329426,0.000056961646,0.000021125792],"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.00008937889,0.00020108477,0.00016239399,0.00018706685,0.00009498415,0.000011276393,0.0029988424,0.16950315,0.7768701,0.013265147,0.00018217642,0.036434446],"study_design_scores_gemma":[0.007603052,0.00038331392,0.0021157581,0.00016001935,0.000052368232,0.00004706933,0.0007183786,0.8286585,0.1578063,0.0018923356,0.000033757908,0.00052913086],"about_ca_topic_score_codex":0.00014170916,"about_ca_topic_score_gemma":0.0000069855078,"teacher_disagreement_score":0.65915537,"about_ca_system_score_codex":0.0001502104,"about_ca_system_score_gemma":0.00015614074,"threshold_uncertainty_score":0.7065477},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057853884,0.000010258647,0.98900485,0.001082723,0.00028909,0.00035213825,0.000017674041,0.000725831,0.0027320562],"genre_scores_gemma":[0.6413651,0.00002152065,0.35596788,0.0003113191,0.000049734375,0.00004860365,0.000008098799,0.000038998318,0.0021887189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99672043,0.00052724907,0.00076667225,0.0008019016,0.0006504333,0.0005333116],"domain_scores_gemma":[0.9961422,0.000643637,0.0002941197,0.0024368532,0.00021247538,0.00027071554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010923067,0.00038039417,0.0005217493,0.0005146245,0.0005604326,0.00037759382,0.0021243924,0.00018168412,0.000019498142],"category_scores_gemma":[0.000014430758,0.00038664578,0.0003314163,0.0010085013,0.00008916294,0.00068495225,0.000023316954,0.00045682013,0.00034084433],"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.000020142308,0.00016818779,0.000004193886,0.000025110066,0.000103110455,0.0000029947867,0.0008852332,0.97349155,0.002168203,0.0012015458,0.0005597765,0.02136993],"study_design_scores_gemma":[0.00069890317,0.00010895462,0.000041183874,0.00011642061,0.000039854564,0.000013876759,0.000027382559,0.99610895,0.0019017964,0.00020169688,0.0003460726,0.000394908],"about_ca_topic_score_codex":0.00039199152,"about_ca_topic_score_gemma":0.00007279518,"teacher_disagreement_score":0.63557976,"about_ca_system_score_codex":0.00017751585,"about_ca_system_score_gemma":0.00016918033,"threshold_uncertainty_score":0.99985856},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06894111,0.00015515252,0.2425379,0.0034062546,0.0005096886,0.00020520944,3.7437712e-7,0.00013538446,0.6841089],"genre_scores_gemma":[0.99524885,0.000002262735,0.0032231885,0.00014361674,0.000016170328,0.0000028048776,2.6212119e-8,0.0000017467892,0.0013613348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948037,0.00004248089,0.00012176872,0.00010869202,0.00015821241,0.00008849246],"domain_scores_gemma":[0.9992787,0.00019799914,0.000046920475,0.00042703448,0.000028431368,0.00002086321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001749789,0.000042788135,0.00006305074,0.000022015869,0.00002919551,0.000032430766,0.0005421067,0.000015167392,0.0003237892],"category_scores_gemma":[0.00004923829,0.000023402798,0.00003003468,0.00015092568,0.000018586143,0.000107108426,0.000055847933,0.000044628014,0.0004648085],"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":[1.2174212e-7,0.000018937762,0.00006336814,0.0000032149255,0.000003759932,9.143133e-7,0.00033668996,0.000030690957,0.0006532207,0.9836105,0.008560584,0.00671801],"study_design_scores_gemma":[0.0005804958,0.00036901928,0.0015303632,0.00014091661,0.0000055246373,0.000035532656,0.00016455547,0.9033879,0.059716314,0.025785286,0.007859557,0.00042455172],"about_ca_topic_score_codex":0.000020378098,"about_ca_topic_score_gemma":6.818023e-7,"teacher_disagreement_score":0.9578252,"about_ca_system_score_codex":0.0000053172143,"about_ca_system_score_gemma":0.0000047651015,"threshold_uncertainty_score":0.5974328},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079344474,0.00023542432,0.9177036,0.00024924477,0.001182072,0.0010931734,0.0000012631224,0.0000943767,0.00009636771],"genre_scores_gemma":[0.8060193,0.000009319037,0.19323976,0.000007878129,0.00057748554,0.00006691989,2.769125e-7,0.000020018011,0.000059015532],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816436,0.00015149171,0.00076095684,0.0002283915,0.00041933553,0.00027549127],"domain_scores_gemma":[0.9980558,0.00005279146,0.0009929315,0.00027717574,0.00050172023,0.00011954705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017718897,0.00015726549,0.00036494597,0.00027283686,0.00018713679,0.0003328103,0.0004520529,0.00013105989,7.664453e-7],"category_scores_gemma":[0.000229692,0.00013584283,0.00020784563,0.00034001432,0.000014703142,0.0010349097,0.00004401961,0.00026022352,0.000012787389],"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.00025767132,0.00031671554,0.000029880639,0.00057582004,0.00038737245,0.000054979802,0.0027528186,0.03752272,0.9298498,0.007092534,0.00008026399,0.021079438],"study_design_scores_gemma":[0.03524838,0.01512859,0.0019409038,0.0062689134,0.00030189092,0.015804905,0.0009962552,0.63628334,0.2706196,0.011454681,0.003734596,0.002217943],"about_ca_topic_score_codex":0.00014575144,"about_ca_topic_score_gemma":0.00000519002,"teacher_disagreement_score":0.72667485,"about_ca_system_score_codex":0.0003649006,"about_ca_system_score_gemma":0.0002531494,"threshold_uncertainty_score":0.55395097},"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":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000003391749,0.4187059,0.5696384,0.000010276633,0.0039178985,0.004623629,0.00013704626,0.00097430544,0.0019891406],"genre_scores_gemma":[0.0002850447,0.7378997,0.24893913,0.00005874917,0.0016074766,0.00086904893,0.0025061136,0.00086207804,0.0069726626],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.97833604,0.013880141,0.0023346085,0.0025159162,0.0014484001,0.0014848893],"domain_scores_gemma":[0.98388046,0.007466531,0.0019845744,0.005466834,0.0007246694,0.0004769521],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.053858347,0.0014196804,0.0043704784,0.0007704125,0.00039562027,0.0013197863,0.0074518807,0.0007137935,0.0000037749198],"category_scores_gemma":[0.001496398,0.0012524567,0.00081410195,0.0016652083,0.00004680898,0.0002866739,0.0027613803,0.0006158705,0.0010942412],"study_design_candidate":"design_other","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.000004539659,0.00012888633,0.0000035257535,0.012870962,0.0008175437,0.000085774,0.00016122939,0.0009697031,7.248438e-7,0.006399988,0.010606683,0.96795046],"study_design_scores_gemma":[0.0036733737,0.0015803674,0.00035810107,0.08574907,0.0015499376,0.00040795913,0.000110134046,0.34346986,0.00000541245,0.002691055,0.5505714,0.009833345],"about_ca_topic_score_codex":0.0012448935,"about_ca_topic_score_gemma":0.000022936978,"teacher_disagreement_score":0.95811707,"about_ca_system_score_codex":0.0008017399,"about_ca_system_score_gemma":0.00060922484,"threshold_uncertainty_score":0.99985534},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071924543,0.0003377645,0.99084604,0.000103632956,0.00009242634,0.00035917052,0.0000016897538,0.00016244734,0.000904375],"genre_scores_gemma":[0.95837754,0.00007419195,0.04126208,0.0000047327585,0.00002147707,0.000059083057,0.000053770465,0.000012513336,0.00013460708],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825144,0.00043747842,0.0004942281,0.0003139587,0.00024792762,0.00025499854],"domain_scores_gemma":[0.9989975,0.0001615064,0.0003108672,0.0002626922,0.00019315648,0.00007429422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014026925,0.00014287196,0.00024957064,0.0005472508,0.00008437614,0.00024331947,0.00014780655,0.000090477864,0.0000064779942],"category_scores_gemma":[0.00009517966,0.00014496112,0.000020237083,0.0008537865,0.0000369192,0.0012268843,0.000026901678,0.00007054807,0.000005826443],"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.000032531017,0.00010664621,0.000252372,0.000048163176,0.000054907152,0.00000158317,0.0018759308,0.8334309,0.0019522562,0.11210019,0.0001660012,0.049978532],"study_design_scores_gemma":[0.0010686613,0.0001512834,0.00084735063,0.000040100393,0.00001710385,0.000026036134,0.000061519575,0.9962414,0.0000946986,0.001295139,0.000028791394,0.0001279263],"about_ca_topic_score_codex":0.00017380404,"about_ca_topic_score_gemma":0.000014392305,"teacher_disagreement_score":0.9511851,"about_ca_system_score_codex":0.0001804598,"about_ca_system_score_gemma":0.00018493,"threshold_uncertainty_score":0.5911343},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85389096,0.0017969768,0.0090941135,0.0031532508,0.0038260613,0.010623421,0.00015147691,0.01015481,0.10730894],"genre_scores_gemma":[0.8368481,0.0000205586,0.16173755,0.00054955896,0.00015267664,0.00028671641,0.000028610817,0.00009818418,0.0002780659],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9923951,0.00013907588,0.002775282,0.001629932,0.0015160214,0.0015445589],"domain_scores_gemma":[0.9947954,0.0009988773,0.0008072944,0.0022114194,0.00042863365,0.0007583948],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0029789305,0.0009049769,0.0015373611,0.00043211176,0.00048633467,0.00029529422,0.0027360718,0.0010439445,0.00008340324],"category_scores_gemma":[0.001327142,0.00078991527,0.00048013704,0.0011825933,0.0006808162,0.0009566332,0.00088618376,0.0008000774,0.00007195989],"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.00020563594,0.0002498085,0.0001118713,0.00026872332,0.00008741825,0.00003071641,0.0001502258,0.00006665993,0.9544919,0.03672672,0.002477316,0.005133009],"study_design_scores_gemma":[0.002052317,0.0021224201,0.7847639,0.00084238965,0.00008846389,0.0004192415,0.00046921245,0.0000029234507,0.0052330787,0.0013090384,0.20098422,0.0017128316],"about_ca_topic_score_codex":0.000029433611,"about_ca_topic_score_gemma":0.0072858995,"teacher_disagreement_score":0.9492588,"about_ca_system_score_codex":0.00057261134,"about_ca_system_score_gemma":0.0007490988,"threshold_uncertainty_score":0.99945515},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7364081,0.0018573418,0.047654778,0.06303431,0.005950108,0.028818466,0.00033905386,0.034416527,0.08152129],"genre_scores_gemma":[0.8994922,0.00007469371,0.09769974,0.001333417,0.00014075742,0.0009849471,0.000045484558,0.00010134283,0.00012743237],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9935679,0.00023460829,0.00151589,0.0019414142,0.0012792291,0.0014609552],"domain_scores_gemma":[0.99560714,0.0007504165,0.00046453078,0.0021526585,0.00042657336,0.0005986768],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013878025,0.00093038456,0.0011270085,0.0003268997,0.0006245918,0.0005040396,0.0025672049,0.0008541572,0.00007172925],"category_scores_gemma":[0.001879958,0.0007832484,0.00072104775,0.0013525945,0.00068517786,0.0009738181,0.00063278305,0.001039857,0.00022028112],"study_design_candidate":"observational","study_design_consensus":null,"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.00018365736,0.00048982335,0.000013165149,0.000040613562,0.00004209131,0.000034164237,0.00016480514,0.0012237094,0.8441332,0.14559887,0.0006550907,0.007420827],"study_design_scores_gemma":[0.0055936305,0.0034411224,0.9336296,0.0012211939,0.00014217863,0.00037736443,0.0003505577,0.000026328791,0.0065473625,0.020147154,0.026223266,0.0023002774],"about_ca_topic_score_codex":0.00008857991,"about_ca_topic_score_gemma":0.018347196,"teacher_disagreement_score":0.9336164,"about_ca_system_score_codex":0.0011321948,"about_ca_system_score_gemma":0.00036012655,"threshold_uncertainty_score":0.9995654},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7041783,0.007861372,0.016247844,0.08131112,0.009062967,0.032321956,0.002321822,0.06265965,0.084034994],"genre_scores_gemma":[0.9630455,0.00013094152,0.033933442,0.0008705561,0.0002091419,0.00081154436,0.0000133938565,0.00011904635,0.0008664331],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9937142,0.00029876526,0.0013937398,0.002160409,0.0010505865,0.0013823053],"domain_scores_gemma":[0.99402726,0.0021945278,0.00046971123,0.002200544,0.00042257007,0.00068538554],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013766399,0.0009489672,0.0013114652,0.0002641403,0.00056019466,0.0004831875,0.0022836113,0.00095915113,0.00009406692],"category_scores_gemma":[0.0029931883,0.0006721975,0.00047039287,0.0005996977,0.001563631,0.0015395521,0.0010063163,0.00065384666,0.00015633277],"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.00012411326,0.00018844704,0.00028944004,0.00021412273,0.000100160774,0.00008369886,0.000116161274,0.0000057370926,0.91129726,0.05376149,0.0043539726,0.029465385],"study_design_scores_gemma":[0.0023926464,0.0021849843,0.94120634,0.002045715,0.00009067675,0.0007594715,0.00016078762,0.000002022399,0.0003180099,0.0062628747,0.04289505,0.0016814141],"about_ca_topic_score_codex":0.000040103172,"about_ca_topic_score_gemma":0.004723791,"teacher_disagreement_score":0.9409169,"about_ca_system_score_codex":0.00042765972,"about_ca_system_score_gemma":0.00025409376,"threshold_uncertainty_score":0.99957293},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.090079665,0.0011670698,0.9059768,0.0021966635,0.0002467784,0.0002478676,0.0000028282516,0.000009480116,0.00007285425],"genre_scores_gemma":[0.9653427,0.000104988045,0.034238767,0.00013981276,0.00014142785,0.000006440212,4.873892e-8,0.000009216989,0.00001662371],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770933,0.000284995,0.0009855181,0.00021059283,0.00049693167,0.0003126578],"domain_scores_gemma":[0.9960863,0.0021427472,0.0009918265,0.00038587602,0.00030395162,0.00008930723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042517073,0.00016957431,0.000511168,0.00015405791,0.00007054795,0.00013307805,0.0011368713,0.000082275794,8.8226227e-7],"category_scores_gemma":[0.0007087435,0.00009038831,0.00011686092,0.00021199575,0.00010145996,0.0008181459,0.00005343735,0.00021087832,0.0000012710744],"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.0015889701,0.00051372615,0.18394181,0.00035534223,0.00058258086,0.0008387388,0.0054599047,0.3287299,0.20156877,0.10212431,0.00019088158,0.17410506],"study_design_scores_gemma":[0.003399189,0.00022856375,0.008910661,0.00058289786,0.000022950406,0.00023213372,0.000120110286,0.98246163,0.00013681076,0.0037549126,0.000012918133,0.0001371933],"about_ca_topic_score_codex":0.00001711043,"about_ca_topic_score_gemma":0.000011184422,"teacher_disagreement_score":0.87526304,"about_ca_system_score_codex":0.00007908857,"about_ca_system_score_gemma":0.0001424196,"threshold_uncertainty_score":0.36859283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28417358,0.000023557111,0.6869971,0.0008100037,0.0005885403,0.00047540307,0.0000016132658,0.00016179089,0.026768371],"genre_scores_gemma":[0.9729707,4.0927975e-7,0.026713988,0.00010529693,0.00003273528,0.000009349868,9.630774e-7,0.0000039583483,0.00016256202],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912584,0.000061812214,0.00023663975,0.00017021957,0.00026904081,0.00013646905],"domain_scores_gemma":[0.9993076,0.000090064714,0.00010870901,0.0003085462,0.00010292748,0.00008215379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044770126,0.00006637643,0.00013035093,0.000068052505,0.000019986175,0.000042224376,0.00029788126,0.000022133041,0.000018036493],"category_scores_gemma":[0.00004446537,0.000053716903,0.000036553243,0.00013179921,0.000010170602,0.00028786412,0.000056205434,0.00003085533,0.00009801189],"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.0003032632,0.00055568275,0.11657413,0.00012747331,0.00037791254,0.000038553655,0.019863112,0.022689577,0.0802539,0.30165464,0.05699596,0.40056577],"study_design_scores_gemma":[0.016440487,0.0019122403,0.020542124,0.00006679124,0.000017611566,0.000021878242,0.0074135414,0.5482369,0.3967693,0.0027941368,0.0050591687,0.00072580244],"about_ca_topic_score_codex":0.00086727383,"about_ca_topic_score_gemma":0.00009029443,"teacher_disagreement_score":0.6887972,"about_ca_system_score_codex":0.00004078305,"about_ca_system_score_gemma":0.00007317007,"threshold_uncertainty_score":0.21905118},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9908506,0.00010397296,0.0008006935,0.0031180237,0.00012311518,0.0038897106,0.00006840009,0.00085391937,0.00019151773],"genre_scores_gemma":[0.97328377,0.000019742009,0.025480065,0.00041230107,0.000053674463,0.0006722185,0.000008960016,0.00005181443,0.000017476956],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9948484,0.0006830897,0.0012374211,0.001705729,0.000811502,0.00071389123],"domain_scores_gemma":[0.9951305,0.0012877802,0.0003814105,0.002711144,0.00022863822,0.0002605662],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021862583,0.0006282548,0.0009795657,0.00016857873,0.00025836236,0.00012035435,0.0019037706,0.00048262588,0.000020084422],"category_scores_gemma":[0.0016517394,0.00036458392,0.00027476682,0.0007598544,0.00087314023,0.0011880016,0.0007045862,0.000772711,0.0000034269333],"study_design_candidate":"observational","study_design_consensus":null,"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.00066282606,0.00083204353,0.007903478,0.00009330195,0.000026212872,0.0000083042405,0.000428821,0.0000685031,0.94530433,0.008139775,0.000062295534,0.036470108],"study_design_scores_gemma":[0.0015230428,0.0020111443,0.9841089,0.00024581983,0.00002640011,0.00002006329,0.00036152784,0.0000016593303,0.00025936353,0.0105903335,0.00041069154,0.00044104713],"about_ca_topic_score_codex":0.00011259961,"about_ca_topic_score_gemma":0.18259259,"teacher_disagreement_score":0.9762054,"about_ca_system_score_codex":0.0003005291,"about_ca_system_score_gemma":0.00014378042,"threshold_uncertainty_score":0.9998806},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1857994,0.00032799633,0.80886483,0.00012331552,0.0011529608,0.0012951145,0.0002724669,0.0002863237,0.0018775662],"genre_scores_gemma":[0.9937479,0.00006558142,0.0043759365,0.00002704096,0.0001617272,0.00025810525,0.0000036385225,0.00006807538,0.0012920283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950617,0.0008769091,0.0012624837,0.0010141378,0.001116635,0.0006681435],"domain_scores_gemma":[0.99588346,0.0010550605,0.0005419665,0.0016244444,0.000501842,0.0003932343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013215296,0.0005806607,0.001015034,0.0005544,0.00042165277,0.0004321039,0.0010981859,0.00034503397,0.000026579775],"category_scores_gemma":[0.000040372364,0.00046336625,0.00027349277,0.00039274566,0.0004047588,0.0005610135,0.000014441347,0.00029242874,0.0001550487],"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.00072598876,0.0014689163,0.0013196756,0.0030545378,0.0012740705,0.00017193097,0.0047824504,0.79286665,0.16388586,0.024765743,0.0003968076,0.0052873814],"study_design_scores_gemma":[0.010240496,0.0024176533,0.0020406588,0.0072879815,0.00023809988,0.00038723828,0.0013457922,0.96490985,0.008867409,0.00016461687,0.00036516122,0.0017350665],"about_ca_topic_score_codex":0.000747433,"about_ca_topic_score_gemma":0.00001714406,"teacher_disagreement_score":0.80794847,"about_ca_system_score_codex":0.00028511896,"about_ca_system_score_gemma":0.0002537159,"threshold_uncertainty_score":0.9997818},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09491071,0.0000580435,0.9024048,0.00068610493,0.00008867588,0.00013807083,4.1918096e-7,0.00041513727,0.0012980535],"genre_scores_gemma":[0.88765925,9.910102e-7,0.11117706,0.0001444259,0.000060883944,0.0000023914972,0.0000013445579,0.0000058798655,0.00094774424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848515,0.000083115076,0.00028659494,0.0004677593,0.00038968763,0.0002877049],"domain_scores_gemma":[0.9986977,0.000109392335,0.00012079434,0.000796936,0.00014684329,0.00012835185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022201646,0.00015295144,0.0002662446,0.00024911063,0.00012180501,0.00023970459,0.00057591335,0.00007949685,0.000026973015],"category_scores_gemma":[0.00004477996,0.00013507689,0.00017674435,0.0013994265,0.000010544661,0.0008440146,0.0000833303,0.00008845091,0.00014851463],"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.0000020170953,0.000026084288,0.007478589,0.0000031891138,0.000088128625,0.000011794686,0.0005112901,0.979747,0.001503004,0.0007825044,0.00009940115,0.009747018],"study_design_scores_gemma":[0.00013448331,0.000034426066,0.028590264,0.0000064866954,0.00004669552,0.00000168399,0.000012859536,0.96947557,0.0011182645,0.00023438138,0.00017495602,0.00016991337],"about_ca_topic_score_codex":0.00029350148,"about_ca_topic_score_gemma":0.000068216425,"teacher_disagreement_score":0.7927486,"about_ca_system_score_codex":0.000073630385,"about_ca_system_score_gemma":0.000027353295,"threshold_uncertainty_score":0.55082756},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029475806,0.000074204014,0.6064328,0.0053739944,0.00019730137,0.34616077,0.00001750955,0.002790438,0.009477195],"genre_scores_gemma":[0.5533733,0.000005017581,0.212261,0.0001889094,0.00038542016,0.23287319,0.000007341577,0.00005725385,0.0008485892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975871,0.00005297803,0.000739611,0.0006498819,0.00042356164,0.00054690044],"domain_scores_gemma":[0.99780035,0.000114922346,0.0004957992,0.00069429085,0.0006655146,0.00022909624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013459981,0.00029748623,0.0003966447,0.00017443403,0.00033376174,0.0007776217,0.0019281859,0.00015897227,0.000033582593],"category_scores_gemma":[0.00014856269,0.00028304086,0.0001458575,0.00033841564,0.00006424656,0.002567363,0.00015642797,0.00016866492,0.00022505542],"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.0007913851,0.002573685,0.0100193415,0.0013810237,0.0004420205,0.0000039668453,0.019319989,0.0034893695,0.28961825,0.115539536,0.053834938,0.5029865],"study_design_scores_gemma":[0.0023382318,0.000552809,0.0006081418,0.00023768279,0.0000205548,0.000021678921,0.00020811339,0.93445706,0.024326846,0.0029024403,0.033712987,0.0006134314],"about_ca_topic_score_codex":0.00007753224,"about_ca_topic_score_gemma":0.0000066636635,"teacher_disagreement_score":0.9309677,"about_ca_system_score_codex":0.00020672781,"about_ca_system_score_gemma":0.00012712291,"threshold_uncertainty_score":0.99996215},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57328993,0.028505499,0.38274005,0.0016992455,0.004437931,0.0007099499,0.000032290965,0.0010827283,0.0075023654],"genre_scores_gemma":[0.8200734,0.0019248535,0.17191604,0.0003451366,0.00073834276,0.000029165052,0.000003457593,0.00018121129,0.0047883787],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9874447,0.0047698086,0.0027827902,0.0012705104,0.0016153941,0.0021168238],"domain_scores_gemma":[0.99251926,0.000561683,0.0022968536,0.0016757761,0.0016156954,0.0013307179],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0058432496,0.0011666595,0.0016415259,0.0008888604,0.0011073371,0.0032396682,0.0031376923,0.00060822756,0.0004371856],"category_scores_gemma":[0.0013906488,0.0010937728,0.0008456277,0.0017142909,0.0006548651,0.006133708,0.00091282156,0.0018486083,0.0008317881],"study_design_candidate":"observational","study_design_consensus":null,"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.00010751495,0.0012067565,0.10197276,0.0033318738,0.001942037,0.018045146,0.08450888,0.0053696483,0.004284605,0.04961406,0.009599003,0.72001773],"study_design_scores_gemma":[0.0006878651,0.0005759698,0.6800872,0.006371092,0.0003105122,0.025953047,0.0006076148,0.25767618,0.0026169927,0.023311736,0.0005604691,0.0012413295],"about_ca_topic_score_codex":0.010948951,"about_ca_topic_score_gemma":0.0006446454,"teacher_disagreement_score":0.7187764,"about_ca_system_score_codex":0.0016131771,"about_ca_system_score_gemma":0.0020067934,"threshold_uncertainty_score":0.9999462},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72227764,0.00037858175,0.22220111,0.00026747014,0.0007200399,0.0008601175,0.0000012582946,0.00066131045,0.052632492],"genre_scores_gemma":[0.99066836,0.0000070383658,0.0074804695,0.000029722056,0.0000811931,0.00002834857,0.0000017798876,0.000021067293,0.0016820333],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752915,0.0002005298,0.0005210564,0.0006714678,0.00056561385,0.0005121961],"domain_scores_gemma":[0.998562,0.00017414402,0.00016077534,0.00060817436,0.00017961125,0.0003153236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756692,0.00023519866,0.00039921547,0.00026465228,0.00008209779,0.00061855133,0.00066288747,0.00012453174,0.000003993424],"category_scores_gemma":[0.00014834733,0.00020399413,0.000035198966,0.0007145587,0.000045496512,0.00089255814,0.0002258054,0.00014710467,0.0001335665],"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.0002200505,0.0015714964,0.050285917,0.002456222,0.00033629022,0.0009924445,0.11247687,0.5489066,0.049895294,0.217411,0.00774043,0.0077073774],"study_design_scores_gemma":[0.0010273963,0.000085815256,0.0005418587,0.0002199545,0.000005331405,0.00011219094,0.0015718617,0.99473923,0.000698021,0.0005532078,0.00008701656,0.0003581193],"about_ca_topic_score_codex":0.0011806398,"about_ca_topic_score_gemma":0.00006550048,"teacher_disagreement_score":0.4458326,"about_ca_system_score_codex":0.00013723096,"about_ca_system_score_gemma":0.0002940326,"threshold_uncertainty_score":0.83186394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42901894,0.00005433467,0.56916696,0.00058902253,0.000045459365,0.0001629245,0.0000033130243,0.0008548857,0.00010417673],"genre_scores_gemma":[0.9288017,0.00009260434,0.07080077,0.000010820568,0.0000151890345,0.000011915542,0.0000027489898,0.000014485983,0.00024978077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981624,0.0000728915,0.00060119235,0.0005787057,0.00026410114,0.00032071967],"domain_scores_gemma":[0.9980233,0.0003954123,0.00025323578,0.00088368315,0.00038941388,0.00005496429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002773875,0.00023013336,0.00037811685,0.00029827128,0.00017126232,0.000100279394,0.00069389504,0.00023616156,0.000006191386],"category_scores_gemma":[0.00033384812,0.00017645945,0.00006282323,0.00032076414,0.00014381237,0.0008385008,0.00035120896,0.000112343114,0.000022795255],"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.0000041704184,0.000017159875,0.00035521595,0.000015818125,0.000014019136,0.0000012416947,0.000120715544,0.8738598,0.056821186,0.016162505,0.0000026978487,0.052625477],"study_design_scores_gemma":[0.00031845568,0.00006325734,0.00029847937,0.00013543796,0.000010469665,0.0000032076598,0.000045079258,0.9738683,0.005817064,0.019193819,0.00001295936,0.00023347288],"about_ca_topic_score_codex":0.00008204161,"about_ca_topic_score_gemma":0.000002492621,"teacher_disagreement_score":0.49978277,"about_ca_system_score_codex":0.000053414944,"about_ca_system_score_gemma":0.00011178656,"threshold_uncertainty_score":0.7195807},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6343044,0.024740992,0.2984792,0.0057556797,0.007189852,0.0018270776,0.00002590523,0.000984857,0.026692024],"genre_scores_gemma":[0.91018045,0.00073794246,0.06692272,0.0002371106,0.0016223313,0.00008267083,0.0000048381244,0.00018798665,0.020023927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98851645,0.004616359,0.002412516,0.000927653,0.0016246208,0.0019023899],"domain_scores_gemma":[0.99211055,0.0018311265,0.0018839117,0.0012383104,0.0017787649,0.0011573456],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004571736,0.00089203403,0.0012456801,0.000614154,0.0009966488,0.007430473,0.002218298,0.00054585206,0.000836793],"category_scores_gemma":[0.0022966866,0.00084897975,0.0005545139,0.0012845893,0.0005908677,0.008113682,0.0006079439,0.0013055559,0.0023859497],"study_design_candidate":"design_other","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.0000265862,0.000459973,0.0075337943,0.003113403,0.00069939485,0.0017498859,0.023109673,0.025107889,0.0065113637,0.04301788,0.03457275,0.8540974],"study_design_scores_gemma":[0.0013257784,0.00036923905,0.24749096,0.0042618443,0.00015039298,0.016661692,0.0009926197,0.70032847,0.0003564892,0.02031146,0.0066627082,0.0010883533],"about_ca_topic_score_codex":0.0054648975,"about_ca_topic_score_gemma":0.00017013597,"teacher_disagreement_score":0.85300905,"about_ca_system_score_codex":0.0030473473,"about_ca_system_score_gemma":0.0027147715,"threshold_uncertainty_score":0.9993961},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2993226,0.00262676,0.6952363,0.0009990564,0.000045968078,0.0011834495,0.0000910881,0.00009578601,0.00039900318],"genre_scores_gemma":[0.98416007,0.0023206382,0.012460313,0.000015366872,0.000065134576,0.00017861371,0.00008859284,0.000012289554,0.000698965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682474,0.0002462237,0.00087713177,0.0011817153,0.00055321434,0.00031698457],"domain_scores_gemma":[0.9973779,0.00018943999,0.0007135954,0.0005748538,0.0008799529,0.00026428184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080131256,0.00040796943,0.00068306795,0.0003932977,0.00045463457,0.00077552063,0.00042131243,0.00022011623,0.000039029273],"category_scores_gemma":[0.000099494086,0.0003548268,0.00007316223,0.00056681427,0.000270117,0.0009201307,0.0001636597,0.00029969937,0.0000039626066],"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.00069189054,0.0021816744,0.118425906,0.0047441553,0.0025861738,0.000015457996,0.00624407,0.027151223,0.010200515,0.6559342,0.00019611603,0.1716286],"study_design_scores_gemma":[0.001062961,0.00058982085,0.021518076,0.0013817586,0.0005041696,0.00008137696,0.0012378419,0.96368384,0.00022946722,0.008771511,0.000232434,0.0007067416],"about_ca_topic_score_codex":0.00042478467,"about_ca_topic_score_gemma":0.0002567946,"teacher_disagreement_score":0.9365326,"about_ca_system_score_codex":0.000050384195,"about_ca_system_score_gemma":0.00038852336,"threshold_uncertainty_score":0.9998904},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7981673,0.0018259517,0.03899543,0.00037448047,0.004285762,0.0030842032,0.000027970687,0.0045134593,0.14872544],"genre_scores_gemma":[0.87421745,0.00023584835,0.10129592,0.0000450943,0.0025179575,0.00023350178,0.000048774717,0.0002531385,0.021152329],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915032,0.0009478774,0.001880254,0.002070914,0.0017367179,0.0018610513],"domain_scores_gemma":[0.994193,0.00074330566,0.0006867265,0.003152875,0.0004000976,0.0008239874],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030524118,0.00096994365,0.0014758661,0.00044339502,0.00072981726,0.001691924,0.0029775777,0.0006154356,0.00063865224],"category_scores_gemma":[0.00025037944,0.0009768726,0.00048084147,0.0016101768,0.00014682565,0.0025301897,0.000453511,0.0007104764,0.0148156425],"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.0015086378,0.0015561443,0.0020433434,0.0027509239,0.0025930766,0.0012319258,0.01057578,0.5121921,0.31432253,0.037801977,0.0045302324,0.10889339],"study_design_scores_gemma":[0.0030167722,0.00037773483,0.00064998463,0.0009885149,0.00008965865,0.0003734407,0.00013126369,0.9835441,0.0016478711,0.00013498595,0.0072976877,0.0017479849],"about_ca_topic_score_codex":0.002213391,"about_ca_topic_score_gemma":0.000008125487,"teacher_disagreement_score":0.47135204,"about_ca_system_score_codex":0.00060075015,"about_ca_system_score_gemma":0.00058009976,"threshold_uncertainty_score":0.9993444},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11120115,0.00012591222,0.83668333,0.0007541535,0.0011529076,0.0012080106,0.000004361522,0.0006022496,0.048267912],"genre_scores_gemma":[0.96425796,0.000010089645,0.027593331,0.0000258649,0.00017795878,0.0001135567,7.193845e-7,0.00002124888,0.0077992664],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823946,0.00010814132,0.00046128308,0.0004954726,0.00024955007,0.0004460919],"domain_scores_gemma":[0.99843943,0.0006500072,0.00012376929,0.00060336874,0.0000664067,0.00011701525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010893414,0.00016613281,0.00032292394,0.0001953487,0.00006537198,0.00018763679,0.00076038804,0.000086164735,0.000025684556],"category_scores_gemma":[0.000094694245,0.00010615875,0.0000787193,0.0002470332,0.00002660791,0.000796272,0.00008857646,0.00004248292,0.00015619842],"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.00007648054,0.00018514851,0.0056956303,0.00050335936,0.000116464464,0.00009726951,0.0027674998,0.0007861155,0.60916656,0.29459426,0.02715351,0.058857698],"study_design_scores_gemma":[0.004502694,0.0003673181,0.0036269547,0.0013807912,0.000014636679,0.00017101491,0.00029905557,0.9495813,0.03185322,0.004467368,0.002492929,0.0012427134],"about_ca_topic_score_codex":0.00042731114,"about_ca_topic_score_gemma":0.00002004198,"teacher_disagreement_score":0.9487952,"about_ca_system_score_codex":0.00012964735,"about_ca_system_score_gemma":0.00008095489,"threshold_uncertainty_score":0.4329028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012314257,0.00008946488,0.98265165,0.0024613303,0.00073988,0.0007482588,0.000014988936,0.00029182446,0.00068834645],"genre_scores_gemma":[0.9075568,0.000004029536,0.091492936,0.00022192052,0.00014913091,0.00013934507,0.0000027896865,0.000014337763,0.00041876553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776345,0.00016436337,0.0005783823,0.0006827453,0.000335442,0.00047560036],"domain_scores_gemma":[0.99802107,0.00058329065,0.000072554314,0.00067676196,0.00040300845,0.00024332486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012790615,0.0001963137,0.00030020336,0.00006553479,0.0001853207,0.0003765151,0.0003804327,0.00012821979,0.000008295464],"category_scores_gemma":[0.00059998874,0.00013359517,0.00007305205,0.00012546014,0.00010987174,0.0010308486,0.00014670652,0.000063385065,0.00003591842],"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.000011768053,0.000113729344,0.0012896268,0.0004400832,0.000032020962,0.0000083892855,0.000121779725,0.000003586523,0.024328643,0.96908164,0.0006676693,0.00390109],"study_design_scores_gemma":[0.0055223485,0.00050445617,0.009383976,0.0011290489,0.00007624625,0.00016047971,0.0007110796,0.92678684,0.02906328,0.022231558,0.0029028142,0.0015278425],"about_ca_topic_score_codex":0.00016896582,"about_ca_topic_score_gemma":0.000029959892,"teacher_disagreement_score":0.94685006,"about_ca_system_score_codex":0.00008657455,"about_ca_system_score_gemma":0.00007030278,"threshold_uncertainty_score":0.54478526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014124246,0.0004597397,0.98247266,0.0005031665,0.00006871408,0.0011558799,0.000009903643,0.00055532623,0.0006503442],"genre_scores_gemma":[0.55972093,0.000024644447,0.43891943,0.0000760305,0.00022107431,0.0008700708,0.00003448522,0.000026191803,0.000107162174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997592,0.00014563186,0.0007124276,0.00069451367,0.00029013792,0.0005653369],"domain_scores_gemma":[0.99789345,0.00028530945,0.00023151125,0.0012621837,0.00017805913,0.00014947563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000508476,0.0002491101,0.00028848078,0.00014372973,0.0009032314,0.00030573338,0.0019971656,0.00011378282,0.0000010410383],"category_scores_gemma":[0.0000032064913,0.0002061679,0.00011307957,0.0011991118,0.00009316192,0.00037718905,0.0004373569,0.00028635183,0.00035210137],"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.00005299279,0.0012950131,0.012705218,0.0009452328,0.0004387206,0.0004231216,0.01582954,0.06226836,0.03990376,0.49294832,0.012537073,0.36065266],"study_design_scores_gemma":[0.0018798924,0.00005827067,0.0138106225,0.0003949822,0.000019785828,0.0017649072,0.00074393343,0.7719554,0.0059270943,0.001343176,0.20076224,0.001339728],"about_ca_topic_score_codex":0.00010595511,"about_ca_topic_score_gemma":0.000020367565,"teacher_disagreement_score":0.709687,"about_ca_system_score_codex":0.0002620225,"about_ca_system_score_gemma":0.00016643606,"threshold_uncertainty_score":0.8407283},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3887972,0.000020433303,0.6075685,0.000055210086,0.00026840245,0.0004601387,0.0000011358746,0.00018867369,0.0026403335],"genre_scores_gemma":[0.8440265,0.000016861828,0.15526542,0.000012364559,0.00006813748,0.000043263924,0.0000021331705,0.000015003839,0.00055028015],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982751,0.00005350451,0.0005577606,0.00041706464,0.00034192394,0.00035464077],"domain_scores_gemma":[0.99851364,0.00009872479,0.00028258105,0.0007106029,0.0002941253,0.000100314515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095415395,0.00017358453,0.0003689397,0.00018944383,0.00012782136,0.00012440175,0.00072341773,0.00009501042,0.0000062020163],"category_scores_gemma":[0.000047597667,0.00014710198,0.000116272924,0.00042259958,0.000017363856,0.00068207434,0.00015776236,0.00006064847,0.000068919246],"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.000021512691,0.00007176083,0.00011229953,0.0004539972,0.000053837026,0.00000456498,0.0011067279,0.017619886,0.5619322,0.4170477,0.000068098176,0.001507417],"study_design_scores_gemma":[0.0008775278,0.00030974517,0.00009026635,0.0003493694,0.00001467665,0.000043141834,0.00010286275,0.8640307,0.13194089,0.0019454915,0.000013354486,0.00028194528],"about_ca_topic_score_codex":0.00047406464,"about_ca_topic_score_gemma":0.0000047924523,"teacher_disagreement_score":0.8464109,"about_ca_system_score_codex":0.00009322293,"about_ca_system_score_gemma":0.00012614026,"threshold_uncertainty_score":0.5998644},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027712337,0.00005238889,0.98982453,0.0012680533,0.000051491523,0.0021154387,0.0000107964315,0.00091015437,0.0029959192],"genre_scores_gemma":[0.10652083,0.000027335574,0.88699996,0.0007396161,0.00050604396,0.0030471643,0.000050775114,0.00006156916,0.0020466945],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977362,0.00011592312,0.0005125861,0.0008692038,0.00029924623,0.0004668518],"domain_scores_gemma":[0.9979693,0.00011343282,0.00021225458,0.0013417439,0.00016051783,0.00020270579],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030932293,0.00029450894,0.0003523734,0.0002915796,0.0004865465,0.00016260838,0.001606273,0.0001419437,0.0000133127905],"category_scores_gemma":[0.000001720343,0.00028941446,0.00014362836,0.0008604823,0.00010535528,0.00022176563,0.00031687765,0.00023879675,0.00087318476],"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.000033187538,0.0013684565,0.00007176066,0.00015099069,0.00023951574,0.00015431966,0.0057600536,0.0034950397,0.69558775,0.0660269,0.08019981,0.14691219],"study_design_scores_gemma":[0.0014230417,0.0002226318,0.00039215194,0.00018875155,0.000019632409,0.0018267237,0.000017503438,0.035072856,0.238339,0.004844752,0.71621007,0.0014428952],"about_ca_topic_score_codex":0.00009617114,"about_ca_topic_score_gemma":0.0000016705867,"teacher_disagreement_score":0.6360102,"about_ca_system_score_codex":0.00015140272,"about_ca_system_score_gemma":0.00016714209,"threshold_uncertainty_score":0.9999558},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98033184,0.0000356062,0.014930651,0.0005663988,0.000026045525,0.00050367776,2.7472703e-7,0.00002631903,0.0035791832],"genre_scores_gemma":[0.9472594,0.0000036009178,0.052513078,0.000025838315,0.00001158715,0.000031975957,3.2656408e-7,0.0000053474528,0.00014882591],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984987,0.00008842132,0.000343941,0.0003730191,0.00037172972,0.00032418594],"domain_scores_gemma":[0.99932414,0.000046746005,0.00004287922,0.0004121497,0.00009545973,0.00007862693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016055668,0.00007745461,0.00015187763,0.00032735057,0.000024865218,0.000092916984,0.0004688843,0.000053464097,0.000005658515],"category_scores_gemma":[0.000011735983,0.00006517737,0.000011463504,0.000649564,0.000040755494,0.0005721626,0.00029427215,0.00016788347,0.000011579463],"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.000029976503,0.0009875805,0.033840507,0.0002835292,0.000013434706,0.00010532387,0.011668558,0.0043922933,0.7538159,0.14893736,0.00007811598,0.0458474],"study_design_scores_gemma":[0.011133969,0.005181994,0.1450705,0.0012087311,0.0000032030653,0.00006309892,0.0045095216,0.122251354,0.59455806,0.11439718,0.00038307687,0.001239305],"about_ca_topic_score_codex":0.004705324,"about_ca_topic_score_gemma":0.0020695103,"teacher_disagreement_score":0.15925783,"about_ca_system_score_codex":0.00009645198,"about_ca_system_score_gemma":0.00012443407,"threshold_uncertainty_score":0.71130735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016539032,0.000044246797,0.97872716,0.0003481775,0.00016912469,0.0033774779,0.000027550985,0.0006697715,0.0000974668],"genre_scores_gemma":[0.78231597,0.00004182425,0.21420209,0.00002077139,0.00009180591,0.0022874256,0.000010253658,0.000056415818,0.00097342144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660337,0.00020113421,0.0009922236,0.0008017541,0.000677311,0.00072418054],"domain_scores_gemma":[0.995006,0.0020991892,0.0006997907,0.0015952417,0.0004335984,0.00016613565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00131199,0.00039149786,0.00057877274,0.00043512747,0.0004653654,0.00017328768,0.000979614,0.00021499669,0.0000305577],"category_scores_gemma":[0.00013441172,0.00026610418,0.00016892001,0.0006922662,0.00007438239,0.0011258881,0.00001118782,0.0001904878,0.00016781008],"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.002434068,0.0020483527,0.000059834183,0.0015035671,0.0015407922,0.000010270879,0.0026986843,0.55056983,0.28113985,0.041086055,0.0005027948,0.11640587],"study_design_scores_gemma":[0.00670852,0.00353811,0.00017356161,0.0019377547,0.00017450648,0.00012392229,0.00045272073,0.84047526,0.14304295,0.001934192,0.00034318856,0.001095327],"about_ca_topic_score_codex":0.00004288595,"about_ca_topic_score_gemma":0.000012151749,"teacher_disagreement_score":0.76577693,"about_ca_system_score_codex":0.0006486363,"about_ca_system_score_gemma":0.0006449716,"threshold_uncertainty_score":0.99997914},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12659948,0.000034994042,0.8680411,0.00009302363,0.000032545897,0.00070920517,0.0000024854548,0.00021850494,0.0042686416],"genre_scores_gemma":[0.33496708,0.000018203338,0.6642035,0.00008567617,0.00019444227,0.00011731566,0.00000883504,0.000018565053,0.00038637163],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981633,0.000015895675,0.0006554111,0.00051040226,0.00025873334,0.0003962523],"domain_scores_gemma":[0.998359,0.00009643087,0.00028511733,0.0009273953,0.00020258543,0.00012944663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068316865,0.00018679602,0.00024472497,0.0001799331,0.00013612278,0.00008748162,0.0012802059,0.000083868734,0.0000099859035],"category_scores_gemma":[5.62149e-7,0.00018739532,0.0000961215,0.000509353,0.000051648458,0.00034193214,0.00038955436,0.000118315635,0.0003968356],"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.0000032277962,0.00014282262,0.00041953835,0.000074013005,0.000029200683,0.0000012252323,0.0004363503,0.00019412185,0.6397201,0.006104025,0.0004919019,0.3523835],"study_design_scores_gemma":[0.0010254943,0.00025793232,0.020166973,0.000121133,0.00002546182,0.00008233509,0.00003763431,0.06326237,0.83913565,0.0011276541,0.07392945,0.0008279408],"about_ca_topic_score_codex":0.00006642967,"about_ca_topic_score_gemma":0.0000020216173,"teacher_disagreement_score":0.35155556,"about_ca_system_score_codex":0.000084640196,"about_ca_system_score_gemma":0.00007477609,"threshold_uncertainty_score":0.76417595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14601167,0.0003603985,0.8451978,0.0020948115,0.00049306126,0.0035850778,0.0001139056,0.0020704474,0.00007281402],"genre_scores_gemma":[0.6422274,0.000008085286,0.3526963,0.0014854579,0.0003102497,0.0029626994,0.000048913116,0.00017990467,0.00008097485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9922227,0.0009236424,0.001256326,0.0027153406,0.0012635572,0.001618382],"domain_scores_gemma":[0.99129176,0.00056695286,0.0006410645,0.005671143,0.0006750247,0.0011540483],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028400137,0.0011954162,0.0014569847,0.0009233832,0.00042475085,0.0017097206,0.0036752983,0.0010167665,0.0000013150593],"category_scores_gemma":[0.00039558162,0.0010414652,0.00041006063,0.00046941414,0.000119730845,0.0003290724,0.0012948473,0.0013382463,0.000015744647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.00029286082,0.0003505232,0.00037990333,0.00043418646,0.00008493881,0.000045100565,0.00038663036,0.91632485,0.0044484455,0.065323934,0.0012339447,0.01069466],"study_design_scores_gemma":[0.00053025753,0.00081986905,0.0019427894,0.0010611643,0.000066035325,0.0001568863,0.000034355955,0.9734806,0.004878367,0.015678342,0.0001365717,0.0012147514],"about_ca_topic_score_codex":0.015637163,"about_ca_topic_score_gemma":0.0027177068,"teacher_disagreement_score":0.49621573,"about_ca_system_score_codex":0.0010092978,"about_ca_system_score_gemma":0.00079880253,"threshold_uncertainty_score":0.9993266},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5349178,0.000014166186,0.4534393,0.000073578434,0.0005367721,0.0003474277,0.000008275779,0.00030237748,0.010360322],"genre_scores_gemma":[0.98235226,0.0000037127584,0.017146915,0.000026397716,0.00008005053,0.000008133126,0.000019769957,0.000015682086,0.00034708818],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983864,0.00014606556,0.0005750484,0.00034560027,0.00032808445,0.00021880028],"domain_scores_gemma":[0.9985102,0.000115844094,0.00025248417,0.00051056826,0.00052176014,0.00008914367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035555646,0.00016826777,0.00024414877,0.00018199053,0.000079782745,0.000050815903,0.00042240927,0.000090073154,0.000045129746],"category_scores_gemma":[0.00003790803,0.00015769871,0.00007676596,0.0003684711,0.000035341247,0.0014540228,0.00015101458,0.000069172616,0.0001891488],"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.00016234306,0.00041842108,0.007230902,0.00012575432,0.00017194201,0.00002026042,0.054641835,0.33826494,0.5447362,0.049657654,0.00033002728,0.0042396905],"study_design_scores_gemma":[0.00048011012,0.00018121561,0.007943672,0.00006117422,0.000012106511,0.000006746655,0.00014422515,0.96237785,0.027971113,0.00009704641,0.0004777402,0.0002470319],"about_ca_topic_score_codex":0.00031912548,"about_ca_topic_score_gemma":0.0000029432986,"teacher_disagreement_score":0.6241129,"about_ca_system_score_codex":0.00005574625,"about_ca_system_score_gemma":0.000046827387,"threshold_uncertainty_score":0.64307666},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24104552,0.00010300353,0.744934,0.00021611954,0.00034342948,0.0019445079,0.000016902977,0.00013611345,0.011260357],"genre_scores_gemma":[0.9622346,0.00005413197,0.035887506,0.0000073200413,0.00005506018,0.000006303543,0.000022126489,0.000017890734,0.0017150727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812704,0.00021943846,0.00046967182,0.00044783717,0.0003429286,0.00039305614],"domain_scores_gemma":[0.9981524,0.0002967244,0.00043627326,0.0006972353,0.00028308778,0.00013429548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005769699,0.00019648367,0.0005341689,0.00031751682,0.00012612825,0.00007161857,0.001066196,0.00014132456,0.00004346593],"category_scores_gemma":[0.00003438332,0.00022789284,0.00016671179,0.00042495338,0.00011061352,0.0008363839,0.0002475769,0.00016061548,0.000043152144],"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.001091562,0.00170738,0.0073506967,0.0036522208,0.0008954207,0.00016197744,0.026139818,0.48297444,0.20603043,0.20134015,0.032204077,0.036451835],"study_design_scores_gemma":[0.0019637828,0.00021138413,0.0042121685,0.00045348878,0.000027413278,0.000012387097,0.00071171834,0.990385,0.00080918404,0.00047973733,0.00042488502,0.00030884673],"about_ca_topic_score_codex":0.0050220084,"about_ca_topic_score_gemma":0.00014234602,"teacher_disagreement_score":0.7211891,"about_ca_system_score_codex":0.000120211516,"about_ca_system_score_gemma":0.00018182483,"threshold_uncertainty_score":0.92932004},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013791972,0.040315766,0.91166824,0.0001028636,0.0042044027,0.004677826,0.000056233752,0.0002604565,0.037335005],"genre_scores_gemma":[0.9848686,0.004062453,0.0030489613,0.000056839028,0.0012981598,0.00034951302,0.000044492288,0.00016596515,0.0061050584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940082,0.0004965173,0.00239427,0.0014897615,0.0006637041,0.0009475889],"domain_scores_gemma":[0.9939702,0.0030094802,0.0015589374,0.001028283,0.00030485715,0.00012820044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002861824,0.00085466134,0.0016164604,0.00036649688,0.00026230016,0.0006844478,0.0015122207,0.00042010783,0.0000071022378],"category_scores_gemma":[0.00013849752,0.0006089257,0.00027214419,0.00023484802,0.00030199517,0.00062133203,0.0003584513,0.0006000843,0.000046520385],"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.000016404829,0.00003512133,0.00009606511,0.0010021272,0.00011822253,0.00009289017,0.0038353105,0.008191823,0.00010623278,0.95949817,0.00006435321,0.02694329],"study_design_scores_gemma":[0.0027808973,0.00066069816,0.00002528553,0.03781767,0.00014296037,0.001232281,0.004302281,0.88144064,0.00013835536,0.014292542,0.053840265,0.003326141],"about_ca_topic_score_codex":0.00041758094,"about_ca_topic_score_gemma":0.00006731234,"teacher_disagreement_score":0.98348933,"about_ca_system_score_codex":0.000514734,"about_ca_system_score_gemma":0.00020540442,"threshold_uncertainty_score":0.99963623},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01598338,0.0015707555,0.7015251,0.00092874974,0.27705747,0.0022171866,0.000029295154,0.0003402092,0.00034788958],"genre_scores_gemma":[0.028184967,0.000009814545,0.07010643,0.0003802232,0.90002525,0.00035686302,0.00017729113,0.000069422895,0.00068973284],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569166,0.00054445566,0.0009808931,0.0012978725,0.0009020818,0.00058301794],"domain_scores_gemma":[0.99711525,0.000106701606,0.0005092621,0.0011519104,0.00067048066,0.00044638876],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012434447,0.0006166565,0.00073408324,0.00034568628,0.00046769335,0.0020321673,0.0008144919,0.00043241106,0.0000033431015],"category_scores_gemma":[0.000034463228,0.0005238675,0.00014876659,0.00036791325,0.000038189184,0.00040491135,0.00018646763,0.00029733303,0.00006882098],"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.00003120961,0.000063224856,0.00006716079,0.00023391463,0.00009989342,0.000025754909,0.0059869383,0.15666534,0.00090520934,0.025002787,0.79404294,0.016875636],"study_design_scores_gemma":[0.001005834,0.00029864034,0.000050716255,0.00006767795,0.000015535607,0.00021726449,0.0003825275,0.70322937,0.00026144204,0.000006862936,0.2940187,0.00044540744],"about_ca_topic_score_codex":0.000056214176,"about_ca_topic_score_gemma":0.000042542863,"teacher_disagreement_score":0.63141865,"about_ca_system_score_codex":0.00019977588,"about_ca_system_score_gemma":0.00018380696,"threshold_uncertainty_score":0.9997213},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2177091,0.00069544703,0.78053856,0.00048082063,0.0001231876,0.00035742685,0.000004861855,0.00008743216,0.000003164286],"genre_scores_gemma":[0.76748264,0.000061010203,0.23237431,0.00001288124,0.00003672664,0.000013634991,5.0544924e-7,0.000011709841,0.000006559777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972496,0.00086847605,0.0010692701,0.00032441237,0.00023133721,0.00025691357],"domain_scores_gemma":[0.99476635,0.002467947,0.001180788,0.0006793219,0.00082280155,0.000082774655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002945776,0.00021004766,0.0005437091,0.0006919166,0.00025423066,0.000024490242,0.0007292417,0.00032283264,7.064459e-7],"category_scores_gemma":[0.00106038,0.00012605003,0.00009402319,0.0006796794,0.00017322063,0.0001755818,0.0001312517,0.0002984556,0.0000033834726],"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.000061521234,0.000059702204,0.00011382661,0.000022331786,0.000068908674,0.0000019544764,0.00034998276,0.9359471,0.050858896,0.0016159369,5.874319e-7,0.010899215],"study_design_scores_gemma":[0.0009274511,0.0001630678,0.00003834992,0.0001370993,0.000041796065,0.00038984374,0.00038156408,0.99255574,0.0024374565,0.0027497774,0.000043036245,0.00013481644],"about_ca_topic_score_codex":0.000008762739,"about_ca_topic_score_gemma":8.7487155e-7,"teacher_disagreement_score":0.5497736,"about_ca_system_score_codex":0.000084544234,"about_ca_system_score_gemma":0.00007325524,"threshold_uncertainty_score":0.5140171},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058326375,0.21458974,0.50450575,0.117307976,0.0066271927,0.01791983,0.00016066233,0.00227629,0.078286186],"genre_scores_gemma":[0.6278921,0.03337402,0.33365655,0.0022404902,0.00069320074,0.0009986978,0.00005052888,0.00012101556,0.0009734146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"systematic_review","domain_scores_codex":[0.995304,0.0011863181,0.0012661464,0.0009370743,0.0006779958,0.0006284518],"domain_scores_gemma":[0.99592376,0.0009264313,0.00029317397,0.002295374,0.0002794836,0.0002817753],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0044056443,0.00033083896,0.0010498045,0.00011586441,0.00012998685,0.00047019048,0.0046503777,0.00013180728,0.0000959041],"category_scores_gemma":[0.0015404449,0.00022976694,0.00017069293,0.00071300607,0.00008520496,0.0016439161,0.0021055434,0.00019931981,0.0014012695],"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.000051055027,0.00090968196,0.0030712076,0.016486106,0.00031500313,0.0006835215,0.00032342118,0.0002215064,0.105785094,0.6237484,0.012693357,0.23571162],"study_design_scores_gemma":[0.018653007,0.0015076959,0.050389674,0.58204293,0.0007098222,0.004881267,0.00022750963,0.0825103,0.018286085,0.085438214,0.14160678,0.013746687],"about_ca_topic_score_codex":0.0005328119,"about_ca_topic_score_gemma":0.0000050944363,"teacher_disagreement_score":0.5695657,"about_ca_system_score_codex":0.00027352673,"about_ca_system_score_gemma":0.000341511,"threshold_uncertainty_score":0.99937624},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29729882,0.0000026651892,0.7007683,0.0010807802,0.00012992372,0.00039985456,0.000053667365,0.00019445403,0.000071554234],"genre_scores_gemma":[0.904911,0.000012077267,0.09445242,0.000092219816,0.0000320608,0.00010473503,0.000009147558,0.0000214013,0.00036492935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977884,0.00017165684,0.00041049163,0.000838602,0.00043078986,0.00036005292],"domain_scores_gemma":[0.9978413,0.00069679576,0.0001860008,0.00091508444,0.00018405051,0.00017675932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059246836,0.00028420275,0.00036189583,0.000580105,0.00054539193,0.00022413129,0.00038141134,0.000101642996,0.000007747916],"category_scores_gemma":[0.000010932447,0.00020885149,0.00015963822,0.0010464184,0.00012800207,0.00075882627,0.0000060565685,0.00013665309,0.000033095977],"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.00079462456,0.00091887545,0.0022861902,0.00024346894,0.002528705,0.000017960327,0.004425886,0.559282,0.027275823,0.0021490697,0.00092052296,0.39915684],"study_design_scores_gemma":[0.00231224,0.0012819315,0.013532177,0.00034531573,0.00029261,0.000052073,0.000071426344,0.97011137,0.010597574,0.000059919126,0.0005770013,0.0007663435],"about_ca_topic_score_codex":0.000058025278,"about_ca_topic_score_gemma":0.000039712744,"teacher_disagreement_score":0.6076122,"about_ca_system_score_codex":0.00021262142,"about_ca_system_score_gemma":0.000107970205,"threshold_uncertainty_score":0.8516717},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028156224,0.00016020122,0.9894815,0.0005755086,0.00056349766,0.0011080891,0.000005611846,0.00008644713,0.0077375555],"genre_scores_gemma":[0.20320791,0.000010303201,0.79496765,0.00041720722,0.0005997602,0.00004185298,0.0000041483618,0.000043318876,0.00070781563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99565035,0.00013077694,0.0008876851,0.0014711508,0.0011121903,0.00074786384],"domain_scores_gemma":[0.9968621,0.00049754867,0.0004617025,0.0017535359,0.0002735886,0.00015153053],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020069883,0.0005094319,0.0007338865,0.0005557591,0.00014564802,0.00035341358,0.004414176,0.0003452477,0.000008166142],"category_scores_gemma":[0.00007927331,0.00034310232,0.00014100202,0.0008667124,0.0003686658,0.0005642942,0.0010468685,0.0005775843,0.000085431835],"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.000008715041,0.000015751673,0.0000112068265,0.000018377024,0.000008565337,0.000005358379,0.0013300992,0.92972636,0.0004203677,0.011425027,0.000035273984,0.056994885],"study_design_scores_gemma":[0.00023843853,0.000082013044,0.00002584484,0.0005277701,0.00000456128,0.000020604566,2.481375e-7,0.9864395,0.00029355066,0.011787149,0.00017273602,0.00040754853],"about_ca_topic_score_codex":0.00003685612,"about_ca_topic_score_gemma":0.00007216921,"teacher_disagreement_score":0.20292635,"about_ca_system_score_codex":0.00028601737,"about_ca_system_score_gemma":0.0006249907,"threshold_uncertainty_score":0.99990207},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18822461,0.00004690476,0.3644539,0.0013082315,0.00046631665,0.00022689674,1.5667251e-7,0.0011233707,0.4441496],"genre_scores_gemma":[0.7532881,0.00006119537,0.2124723,0.0003305062,0.00023292712,0.000010217552,0.0000017144293,0.000021910704,0.033581123],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866384,0.00006858909,0.0002400985,0.00041936515,0.00029758544,0.0003105038],"domain_scores_gemma":[0.99876755,0.00007682642,0.00006464666,0.0008743736,0.00008831912,0.00012826541],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00042835757,0.000121995545,0.00016323494,0.00008874959,0.00009116989,0.0001798326,0.0006411967,0.000062463165,0.00020454262],"category_scores_gemma":[0.000035151665,0.000099511075,0.000060085553,0.00038700434,0.000016815233,0.00065100857,0.00021684096,0.00006767901,0.0038599267],"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.000025417468,0.00027707688,0.003582421,0.00003724054,0.000060957253,0.0009128482,0.0013127854,0.0017314227,0.63499844,0.15223727,0.054568026,0.15025607],"study_design_scores_gemma":[0.0008435671,0.0001893373,0.016575558,0.00011018192,0.000009658823,0.0011157984,0.000075635806,0.936391,0.012425588,0.0046409233,0.026737414,0.00088534894],"about_ca_topic_score_codex":0.00030062752,"about_ca_topic_score_gemma":0.0000047588487,"teacher_disagreement_score":0.93465954,"about_ca_system_score_codex":0.000034146346,"about_ca_system_score_gemma":0.000038037168,"threshold_uncertainty_score":0.9969157},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023522472,0.000010104624,0.9558631,0.00090872654,0.00036472277,0.00013822602,0.000002321128,0.00044581958,0.018744485],"genre_scores_gemma":[0.98005575,6.006159e-7,0.019030513,0.0005491046,0.0000909457,0.00001106319,0.000008666447,0.000010310707,0.00024303062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864584,0.000082794424,0.00024138812,0.00047161555,0.0002414775,0.00031688897],"domain_scores_gemma":[0.99887186,0.00015915143,0.00006547129,0.00064033724,0.00013701031,0.0001261759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056496,0.00014496184,0.00019579251,0.00005598536,0.00011015513,0.00027350534,0.000984093,0.00006002533,0.00002992057],"category_scores_gemma":[0.000051777493,0.0001261296,0.000057409598,0.0005089237,0.00001165354,0.00061843486,0.00017454514,0.00011386502,0.00039601856],"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.000068764304,0.0004437654,0.012582635,0.0006427071,0.00040346733,0.000117214164,0.02630783,0.029348157,0.07908957,0.721328,0.006992156,0.12267574],"study_design_scores_gemma":[0.00035846743,0.00004259747,0.002543285,0.00007228071,0.000006107239,0.00003533742,0.00014964708,0.9862108,0.007401096,0.0010436875,0.0018627655,0.0002738938],"about_ca_topic_score_codex":0.0005971376,"about_ca_topic_score_gemma":0.00012647295,"teacher_disagreement_score":0.9568627,"about_ca_system_score_codex":0.00004123418,"about_ca_system_score_gemma":0.000029655617,"threshold_uncertainty_score":0.51434153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4544905,0.00005994578,0.5424822,0.000956285,0.00009870935,0.0001864952,0.0000033649828,0.00023949175,0.0014829718],"genre_scores_gemma":[0.90720934,0.0000047958088,0.09237056,0.00006110406,0.000031153973,0.00003380419,0.000001792047,0.000009351084,0.00027810677],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99652016,0.00036721525,0.0008301093,0.0011291364,0.0005544311,0.0005989257],"domain_scores_gemma":[0.99709946,0.00049116387,0.00016204921,0.0018532899,0.00015974087,0.00023428429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026563539,0.0002484862,0.00051473203,0.0003605819,0.00007780726,0.00018165818,0.0013255568,0.0001566209,0.00018809328],"category_scores_gemma":[0.0006546259,0.00016605819,0.00022971825,0.0024886606,0.00010759622,0.0015718701,0.00041422667,0.00015721885,0.00015356822],"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.000011142572,0.00022806472,0.9526267,0.00003285275,0.00018870493,0.000005939184,0.00028046212,0.00084388925,0.02079524,0.0100314375,0.000105268555,0.014850319],"study_design_scores_gemma":[0.0027648138,0.00016928776,0.474567,0.00016194997,0.00014493492,0.00001322761,0.00023181814,0.47000217,0.040551715,0.009096175,0.0006948685,0.0016020498],"about_ca_topic_score_codex":0.0007125558,"about_ca_topic_score_gemma":0.00028619537,"teacher_disagreement_score":0.47805968,"about_ca_system_score_codex":0.00029635828,"about_ca_system_score_gemma":0.00014023155,"threshold_uncertainty_score":0.6771656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05630486,0.000017483566,0.6131709,0.002716206,0.0001462924,0.25522754,0.0000132296,0.00006298331,0.072340466],"genre_scores_gemma":[0.9330645,0.0000064289457,0.011129624,0.00025151944,0.000007352795,0.05528017,9.755498e-7,0.000006640993,0.00025278752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9990699,0.00019640586,0.00021334345,0.0001696558,0.00023267827,0.000117997275],"domain_scores_gemma":[0.99952495,0.00003868198,0.00003718657,0.00038055345,0.000004976418,0.000013657196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048714847,0.0000669918,0.000064396474,0.00003249749,0.000051717325,0.00009629391,0.0006147217,0.000014189828,0.00026451828],"category_scores_gemma":[0.0000017410002,0.000035791803,0.00002194499,0.00017484183,0.00002080433,0.00027063963,0.0000971905,0.000039734812,0.0000035892838],"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.000013547882,0.00047473607,0.041792665,0.0007631087,0.00009480816,0.00001451242,0.013984328,0.0021255251,0.0023422807,0.81606483,0.005844569,0.116485074],"study_design_scores_gemma":[0.0072035836,0.00041215343,0.72775704,0.00025339998,0.00003862019,0.000053047836,0.009828063,0.0124723,0.09715286,0.011415975,0.13256766,0.000845274],"about_ca_topic_score_codex":0.00016463523,"about_ca_topic_score_gemma":0.00007974953,"teacher_disagreement_score":0.87675965,"about_ca_system_score_codex":0.000020774964,"about_ca_system_score_gemma":0.00001292053,"threshold_uncertainty_score":0.28962895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14142673,0.000005228787,0.8576564,0.00010036527,0.00014770166,0.00019991513,5.9322645e-7,0.00013158878,0.000331482],"genre_scores_gemma":[0.9353256,0.0000011368052,0.06431577,0.0000250853,0.000026131485,0.000013340643,3.7642488e-7,0.000006499611,0.00028602115],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987309,0.00011158544,0.000283252,0.00037295048,0.00031367163,0.00018766413],"domain_scores_gemma":[0.99872315,0.00046406582,0.00015434463,0.0004910311,0.000102175196,0.00006522034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003092841,0.00011956332,0.00025174936,0.00029567405,0.00004343885,0.00003559831,0.0003857647,0.00006016666,0.000010807138],"category_scores_gemma":[0.0002473844,0.0000724651,0.00012936926,0.0007982574,0.000015579588,0.0002428192,0.000089197325,0.00004510022,0.00004585906],"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.000010419867,0.00016097228,0.000045361132,0.00011339858,0.0002456978,0.000008413075,0.00013983222,0.002865402,0.8508776,0.033342753,0.00000522679,0.112184934],"study_design_scores_gemma":[0.0003756921,0.00029121697,0.0022389996,0.00012168658,0.00011984615,0.0000042811007,0.000009482847,0.2552458,0.7369355,0.00446984,0.000008084126,0.00017957161],"about_ca_topic_score_codex":0.00008124148,"about_ca_topic_score_gemma":0.00006917097,"teacher_disagreement_score":0.79389894,"about_ca_system_score_codex":0.00006952042,"about_ca_system_score_gemma":0.00002326232,"threshold_uncertainty_score":0.2955041},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20360708,0.00023174689,0.79120207,0.0018125363,0.000803492,0.00031401592,0.000004474364,0.00025016852,0.0017744027],"genre_scores_gemma":[0.93673587,0.000006056236,0.06271005,0.00005803665,0.00011503983,0.00002322142,8.687508e-7,0.000018641722,0.00033221793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701947,0.00026955456,0.0008331659,0.00064224255,0.00069890614,0.00053666695],"domain_scores_gemma":[0.9975634,0.00052436057,0.00018895933,0.0011377356,0.00034960217,0.00023594916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000890862,0.00025801078,0.00047624638,0.0001324035,0.00010697304,0.00019970728,0.001043331,0.00014014397,0.000027756987],"category_scores_gemma":[0.00017343812,0.00015972671,0.0001560735,0.00023491618,0.00013274918,0.0007828835,0.0003436144,0.000119305456,0.00021002654],"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.000013242851,0.0002098831,0.0023153063,0.00040595751,0.00010961503,0.000034947752,0.00052696303,0.0048261657,0.11030303,0.87611526,0.00021018017,0.0049294215],"study_design_scores_gemma":[0.0038484982,0.00029054278,0.014181026,0.0027596192,0.00007482609,0.0003901028,0.0030935805,0.8834085,0.08007795,0.008248318,0.0016869743,0.0019400492],"about_ca_topic_score_codex":0.00069826737,"about_ca_topic_score_gemma":0.000023719289,"teacher_disagreement_score":0.87858236,"about_ca_system_score_codex":0.0001035158,"about_ca_system_score_gemma":0.0001067675,"threshold_uncertainty_score":0.6513466},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09027225,0.000086826534,0.9079429,0.00038022158,0.00017845772,0.00041011255,4.7846567e-7,0.00011820775,0.0006105315],"genre_scores_gemma":[0.87456053,9.743e-7,0.12423439,0.0000884446,0.00005112057,0.000021841295,2.815404e-7,0.0000092843375,0.0010331406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991884,0.0000772529,0.00022020048,0.00022471361,0.00013277,0.0001566506],"domain_scores_gemma":[0.99908483,0.00049174903,0.00008606086,0.00025697847,0.000034673893,0.00004571334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046749765,0.000085653126,0.00009761368,0.0000400251,0.00012816249,0.0003532138,0.00025704983,0.000033574026,0.0000022553777],"category_scores_gemma":[0.000035330173,0.00004176921,0.00001967241,0.00008646271,0.000013951261,0.0010787784,0.00015107857,0.000019660252,0.000008432784],"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.00007979246,0.00012592964,0.0074191536,0.0006502008,0.00031689773,0.000016598618,0.022206526,0.18394195,0.06688723,0.51320463,0.0018860686,0.20326503],"study_design_scores_gemma":[0.00026999364,0.000010538868,0.00034466776,0.00011246782,0.0000022677514,0.000011824218,0.00010636989,0.9920815,0.0035185476,0.00026535318,0.0031627542,0.00011372001],"about_ca_topic_score_codex":0.000011143638,"about_ca_topic_score_gemma":9.807169e-7,"teacher_disagreement_score":0.80813956,"about_ca_system_score_codex":0.00002289848,"about_ca_system_score_gemma":0.00010010103,"threshold_uncertainty_score":0.3406049},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011417876,0.00011577512,0.9863973,0.00027218962,0.00029350558,0.0011598862,0.000016965016,0.00023639403,0.000090077105],"genre_scores_gemma":[0.92324674,0.00003415631,0.07639421,0.0000064418327,0.000017820701,0.00022493099,0.0000023627617,0.00002099707,0.00005233803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643135,0.00087799504,0.0011232737,0.0004969832,0.00059111457,0.0004792839],"domain_scores_gemma":[0.996561,0.0011340198,0.00063506945,0.0011266691,0.00045189686,0.000091352376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015962601,0.00024435355,0.0005065242,0.00034082105,0.00011507551,0.000061260434,0.00077067525,0.00013696717,0.000027565107],"category_scores_gemma":[0.00007420898,0.00019808802,0.00016239616,0.0004773557,0.00006716981,0.0014980275,0.000012053535,0.00012668733,0.000030583713],"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.0002092253,0.0005729961,0.000012955557,0.0003749501,0.00071294425,0.000003619926,0.0019181491,0.523592,0.23903218,0.07016461,0.00006973793,0.16333662],"study_design_scores_gemma":[0.002284823,0.00068757933,0.00011702699,0.0003260151,0.00006471032,0.000040252897,0.0004075982,0.71291023,0.27771547,0.005126477,0.000011060909,0.00030875514],"about_ca_topic_score_codex":0.00040582748,"about_ca_topic_score_gemma":0.000009143493,"teacher_disagreement_score":0.9118289,"about_ca_system_score_codex":0.0005546949,"about_ca_system_score_gemma":0.00045135943,"threshold_uncertainty_score":0.8077795},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94353664,0.00024792334,0.0028776457,0.0004124193,0.0012149031,0.0035707678,0.00014003448,0.00059388333,0.0474058],"genre_scores_gemma":[0.94097775,0.000026275633,0.01236967,0.00002292558,0.00045932346,0.00060135673,0.00021005381,0.00018435436,0.0451483],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944969,0.00092860934,0.0013950585,0.0013365502,0.0011970614,0.0006458659],"domain_scores_gemma":[0.9942473,0.0015265801,0.0012490707,0.0024198527,0.00039623905,0.00016093558],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002648056,0.00062525866,0.0010757429,0.00043189726,0.00019042716,0.00042269338,0.0024868434,0.0005529074,0.00016544395],"category_scores_gemma":[0.00072046375,0.00038687588,0.0002850035,0.0006218816,0.00007652726,0.0005611194,0.00025249535,0.0003935627,0.00031642985],"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.0016594906,0.0015434931,0.011496582,0.011668137,0.001166705,0.0002530376,0.107188284,0.0017529338,0.7976517,0.018288722,0.012222757,0.035108123],"study_design_scores_gemma":[0.009209755,0.0023743701,0.10365596,0.047058128,0.0003644682,0.000111945774,0.026316086,0.738364,0.059865393,0.0018981373,0.0025431693,0.008238617],"about_ca_topic_score_codex":0.0048517343,"about_ca_topic_score_gemma":0.00022241136,"teacher_disagreement_score":0.73778635,"about_ca_system_score_codex":0.00037123312,"about_ca_system_score_gemma":0.00032255065,"threshold_uncertainty_score":0.9998583},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014758084,0.000008707094,0.97830015,0.00086332834,0.00047598206,0.0010833151,0.000007137707,0.00057531067,0.003928003],"genre_scores_gemma":[0.7602375,3.1541626e-7,0.2383498,0.000031050167,0.00010353803,0.0001381588,0.0000023373366,0.000015245236,0.0011220372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770325,0.0002037726,0.0005618958,0.0006739275,0.00044413493,0.0004130441],"domain_scores_gemma":[0.99425256,0.0037022438,0.00020670191,0.0012472174,0.00042434977,0.0001669323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015976774,0.00020257407,0.00031627825,0.000106374864,0.00014434612,0.00028937878,0.0007481979,0.00010593861,0.00005387684],"category_scores_gemma":[0.0004127576,0.00012998338,0.00013447198,0.00024070016,0.000038750975,0.00073419104,0.000096958465,0.00004296463,0.00021550675],"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.00003198072,0.00029935504,0.008671979,0.00034411732,0.00009989819,0.0000053216436,0.00009005899,0.6604132,0.08673641,0.22743045,0.00061633193,0.015260895],"study_design_scores_gemma":[0.0007354369,0.00008711013,0.0011528791,0.00007812083,0.000005467011,6.597597e-7,0.0000073814927,0.9950948,0.0013107801,0.0007363189,0.00056621997,0.00022485096],"about_ca_topic_score_codex":0.00014619627,"about_ca_topic_score_gemma":0.0000027555448,"teacher_disagreement_score":0.74547946,"about_ca_system_score_codex":0.00028883247,"about_ca_system_score_gemma":0.00034798222,"threshold_uncertainty_score":0.5300569},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16455297,0.00008453984,0.83424217,0.00015909344,0.000051429983,0.00016828974,4.1795755e-7,0.000013404605,0.00072768994],"genre_scores_gemma":[0.9716522,0.000010836657,0.028280491,0.000013793175,0.000014657322,0.000011177396,3.012074e-7,0.0000030350516,0.000013527649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911726,0.00013266207,0.000374437,0.0001466052,0.0001370555,0.000092008246],"domain_scores_gemma":[0.99941194,0.0001212061,0.00011621932,0.00023246482,0.00010229877,0.000015865533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083536765,0.00005607961,0.00013565822,0.0000547791,0.00002797294,0.000058795016,0.00021596388,0.000030296867,0.0000017444586],"category_scores_gemma":[0.000059298145,0.000030106425,0.000015012631,0.00012774207,0.000018583354,0.0005109841,0.00005729213,0.000025449493,0.0000010463791],"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.0000027283313,0.000023057019,0.0015102162,0.00007557828,0.000007401076,9.557194e-7,0.0024750947,0.8584246,0.020119613,0.11317113,0.0000065573217,0.004183072],"study_design_scores_gemma":[0.00021446942,0.000024447569,0.00004621838,0.00019167643,0.0000013950204,0.000007380083,0.00075243035,0.99692243,0.0017014171,0.000095322626,0.0000010141491,0.000041766456],"about_ca_topic_score_codex":0.000748707,"about_ca_topic_score_gemma":0.000022154549,"teacher_disagreement_score":0.8070992,"about_ca_system_score_codex":0.0000140091015,"about_ca_system_score_gemma":0.000021869966,"threshold_uncertainty_score":0.122770436},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15267412,0.000026633008,0.8461219,0.000091064925,0.00026209332,0.00053092017,0.0000015618135,0.00020289038,0.0000888227],"genre_scores_gemma":[0.92712617,1.3897865e-7,0.07269093,0.000017482258,0.0001090116,0.00002273238,0.000005436739,0.0000147689425,0.000013342128],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988825,0.000043173095,0.00029793312,0.00035405796,0.0002294703,0.00019291366],"domain_scores_gemma":[0.9984923,0.0003552958,0.00025333307,0.00065760984,0.00017460034,0.00006687919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005208674,0.00012474775,0.00015666481,0.00008205721,0.00060232583,0.0006241245,0.00031860356,0.00007937503,4.3578896e-7],"category_scores_gemma":[0.0002447618,0.00012410818,0.000048789312,0.000043440774,0.000012536102,0.0009947857,0.000072307994,0.00004330381,0.000006008749],"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.000009255161,0.0000062778604,0.00089778274,0.000078123434,0.0000059720733,4.6105419e-7,0.00010702004,0.9878522,0.00013623112,0.0034559118,4.6905046e-7,0.0074502514],"study_design_scores_gemma":[0.0006507774,0.000031682608,0.0008045627,0.00010278927,0.0000101098085,4.6374024e-7,0.000014552571,0.9974467,0.00022674193,0.00053956883,0.000034060005,0.0001379591],"about_ca_topic_score_codex":0.000120886245,"about_ca_topic_score_gemma":0.000010802193,"teacher_disagreement_score":0.77445203,"about_ca_system_score_codex":0.00010364991,"about_ca_system_score_gemma":0.00006421824,"threshold_uncertainty_score":0.60184467},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42539182,0.00012251415,0.5742991,0.00001303286,0.000053959702,0.000099492776,3.388573e-7,0.000007718282,0.00001204874],"genre_scores_gemma":[0.6922706,0.0000082236475,0.30765,0.000007771629,0.000054945227,1.9678941e-7,2.0419878e-7,0.0000066992516,0.00000138901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983871,0.0001301626,0.0006978102,0.00024192988,0.00033220564,0.00021077479],"domain_scores_gemma":[0.99762064,0.00021957066,0.0014280393,0.00032728602,0.0003108521,0.000093605355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010999185,0.00015943615,0.0003891377,0.00016190311,0.0004428877,0.00047279903,0.0007112358,0.000059292066,6.8226797e-7],"category_scores_gemma":[0.00012319465,0.00013302438,0.00007684647,0.00007429476,0.000123671,0.00039886174,0.00031574487,0.00022172261,2.3438783e-7],"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.000027299544,0.000033233642,0.00037683503,0.000041776995,0.000037365004,0.000005840223,0.003590794,0.9795536,0.0038006222,0.0008205355,7.022696e-7,0.011711396],"study_design_scores_gemma":[0.00022517474,0.00012774461,0.00048077782,0.0002625692,0.00002241667,0.00011638678,0.0001400097,0.99205434,0.003152604,0.0032891484,0.0000012592103,0.00012753792],"about_ca_topic_score_codex":0.000037624082,"about_ca_topic_score_gemma":8.073725e-7,"teacher_disagreement_score":0.26687872,"about_ca_system_score_codex":0.000036406353,"about_ca_system_score_gemma":0.00006176364,"threshold_uncertainty_score":0.5424577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034141243,0.00026491747,0.9487617,0.0108554885,0.00045184663,0.0026273292,0.00019619401,0.002093368,0.0006079094],"genre_scores_gemma":[0.7078917,0.00006387004,0.2892833,0.00031587062,0.00036404756,0.0011219835,0.00011268019,0.00012394125,0.000722597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99375427,0.00042183365,0.0012343215,0.00199318,0.0010228422,0.001573558],"domain_scores_gemma":[0.9936377,0.000598694,0.00086282537,0.0037596703,0.00042651163,0.0007146416],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0019701375,0.0009933652,0.0012447468,0.0014421883,0.00020977865,0.0020350188,0.0034366164,0.0011979867,0.000011956302],"category_scores_gemma":[0.00090807246,0.000944852,0.00040775063,0.0012119698,0.0000766528,0.0012959201,0.0035641436,0.001028886,0.000116387004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","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.0002886976,0.00079882407,0.017814355,0.0006977745,0.0003642445,0.00079755025,0.0026356843,0.70309424,0.094403565,0.092733234,0.006855594,0.07951626],"study_design_scores_gemma":[0.00065651577,0.00013000084,0.020064173,0.0011607138,0.000028797791,0.00004522297,0.00003912358,0.94931734,0.007634275,0.01837176,0.0009800023,0.0015720733],"about_ca_topic_score_codex":0.007982337,"about_ca_topic_score_gemma":0.0012195453,"teacher_disagreement_score":0.67375046,"about_ca_system_score_codex":0.002240638,"about_ca_system_score_gemma":0.0007762532,"threshold_uncertainty_score":0.9993002},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79089296,0.0011313072,0.004186544,0.014940221,0.003571901,0.012507545,0.00041144344,0.030741839,0.14161623],"genre_scores_gemma":[0.889765,0.00006680443,0.10839681,0.00067384297,0.00017687846,0.00027681282,0.000023726565,0.00013522255,0.00048484968],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99203235,0.0006207409,0.0017623196,0.0023168605,0.001852064,0.0014156575],"domain_scores_gemma":[0.9896668,0.0010033845,0.0011914083,0.006890699,0.0004750202,0.0007726509],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0022167144,0.0011095465,0.0017301091,0.0003227826,0.0012036694,0.0008256858,0.0078087924,0.001167765,0.00021790386],"category_scores_gemma":[0.0037880638,0.0009794489,0.00064475986,0.0005697734,0.0017608638,0.0033236076,0.0016003781,0.0014431044,0.00026200368],"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.00020496093,0.0005733282,0.00016956092,0.00009305758,0.000089920075,0.00019927869,0.00028390178,0.0001173802,0.97810817,0.008596936,0.0021137174,0.009449792],"study_design_scores_gemma":[0.0011994852,0.0028625524,0.981882,0.0005907946,0.00006935422,0.00023006281,0.00009744834,0.000010957793,0.0023269157,0.005287247,0.0041766004,0.0012666296],"about_ca_topic_score_codex":0.00015935209,"about_ca_topic_score_gemma":0.0074887625,"teacher_disagreement_score":0.9817124,"about_ca_system_score_codex":0.00035902986,"about_ca_system_score_gemma":0.00039781167,"threshold_uncertainty_score":0.9992656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026542999,0.00010359546,0.960505,0.0005658652,0.0052086078,0.00045040654,0.0000028025604,0.00079221476,0.005828526],"genre_scores_gemma":[0.9431483,0.000005846224,0.05563855,0.000045983685,0.0003082129,0.00002656088,7.003388e-7,0.00003627881,0.0007895489],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969843,0.00023470115,0.0006595725,0.00086784794,0.0006332394,0.0006203517],"domain_scores_gemma":[0.9933352,0.00035595938,0.0005480301,0.005354867,0.00018253272,0.0002234347],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001035673,0.00034450364,0.0004714865,0.0002303504,0.0020294285,0.0023046297,0.0047891107,0.00017738332,0.000007573336],"category_scores_gemma":[0.00014322838,0.00033551303,0.00021917127,0.00022056297,0.00008172902,0.0010315696,0.0000915697,0.00042829095,0.0005457189],"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.000073273804,0.0010111125,0.002535429,0.00081776414,0.0011013891,0.00043531126,0.016402822,0.40521774,0.0102280015,0.048817717,0.0015138412,0.5118456],"study_design_scores_gemma":[0.0023180675,0.00036094792,0.0037509308,0.0015635054,0.000061024544,0.0007144633,0.0012010692,0.977301,0.0072859423,0.0013682091,0.0025044507,0.0015703646],"about_ca_topic_score_codex":0.000373277,"about_ca_topic_score_gemma":0.00000531449,"teacher_disagreement_score":0.9166053,"about_ca_system_score_codex":0.00014183726,"about_ca_system_score_gemma":0.000104492385,"threshold_uncertainty_score":0.9999097},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015025448,0.00010350364,0.9372241,0.00021606288,0.0015675881,0.0017485585,0.000016222686,0.00072844536,0.043370083],"genre_scores_gemma":[0.6875816,0.000008605113,0.27034247,0.000026476117,0.0003160701,0.00032645834,0.000006181312,0.000035227968,0.041356944],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978538,0.00005514446,0.0004487925,0.0007026682,0.00036037472,0.0005791822],"domain_scores_gemma":[0.99649906,0.00016259792,0.00042360675,0.002425844,0.00027225705,0.00021664111],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010564083,0.00024006338,0.000396824,0.000067550616,0.0007328112,0.0014938315,0.0025759223,0.00015139312,0.000019191568],"category_scores_gemma":[0.00028239793,0.00019932864,0.00010851178,0.00008250658,0.00007376499,0.0014846933,0.00046558023,0.00010621448,0.00040427083],"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.00014778822,0.0012418054,0.0634974,0.003009945,0.0009491895,0.0002651223,0.0065911617,0.014674319,0.35210344,0.38564464,0.14070092,0.031174267],"study_design_scores_gemma":[0.0008264128,0.00008673517,0.0024689713,0.0001399204,0.000010548077,0.00003450391,0.00005089871,0.9925582,0.0019051132,0.00015599489,0.0014608897,0.00030183946],"about_ca_topic_score_codex":0.0033904978,"about_ca_topic_score_gemma":0.000043621898,"teacher_disagreement_score":0.9778839,"about_ca_system_score_codex":0.00007878181,"about_ca_system_score_gemma":0.00016701769,"threshold_uncertainty_score":0.9995427},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035444573,0.00009243675,0.9462082,0.0016757336,0.00027038483,0.00037327877,0.0000024575475,0.00009471361,0.015838217],"genre_scores_gemma":[0.9594448,9.386212e-7,0.03952323,0.00032780215,0.00005731506,0.000018930834,3.1992738e-7,0.0000101373325,0.0006165104],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986736,0.0000926212,0.0003574919,0.0003332012,0.00025993172,0.00028315117],"domain_scores_gemma":[0.99776834,0.00013383717,0.00024223655,0.001601781,0.0001585347,0.000095276904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006952515,0.00014276875,0.00035953414,0.000076854645,0.00020782722,0.00032483265,0.0016762797,0.0000825422,0.0000785415],"category_scores_gemma":[0.00010768816,0.00011435225,0.000151206,0.000044956592,0.000068702626,0.00079127186,0.000104616214,0.00009406369,0.00012907421],"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.00020350463,0.0006684045,0.049948905,0.00030788555,0.00044030676,0.000119848424,0.0016422156,0.0013705713,0.81966466,0.055083014,0.0036907794,0.06685992],"study_design_scores_gemma":[0.010424537,0.00017100411,0.03552289,0.00011771715,0.000034388653,0.000021533608,0.00003975656,0.86258113,0.086021684,0.0013009808,0.0031901787,0.000574209],"about_ca_topic_score_codex":0.00023816753,"about_ca_topic_score_gemma":0.000023458271,"teacher_disagreement_score":0.92400026,"about_ca_system_score_codex":0.000015715963,"about_ca_system_score_gemma":0.000114322356,"threshold_uncertainty_score":0.46631494},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47506785,0.000031176216,0.5228085,0.00029289123,0.00007862888,0.00022426267,7.846091e-8,0.000038912265,0.0014576978],"genre_scores_gemma":[0.97605115,0.0000027793992,0.023819286,0.000037386602,0.000032004216,0.000019619149,1.3663198e-7,0.0000047165913,0.00003292039],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911606,0.000058129546,0.00018507765,0.0003028521,0.00020335897,0.00013454598],"domain_scores_gemma":[0.99812365,0.00021009773,0.0001275156,0.0014434936,0.000054174332,0.000041058272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006800685,0.00008818411,0.00013604852,0.000025962148,0.00032830858,0.00020876675,0.0007575289,0.00004614323,5.781647e-7],"category_scores_gemma":[0.00028595337,0.00005786602,0.00003370689,0.000043099448,0.00005444933,0.00041774407,0.0002528132,0.0000861227,0.000008676162],"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.0000216171,0.00019239914,0.010775168,0.0009046132,0.00007314868,0.0000031356828,0.0025846427,0.044549286,0.1295084,0.6167524,0.00004043087,0.19459476],"study_design_scores_gemma":[0.00014520565,0.000033392378,0.0048578805,0.00005438611,0.0000034462114,0.0000020613425,0.000010238841,0.9781274,0.01434016,0.0023543593,0.0000065817,0.000064866515],"about_ca_topic_score_codex":0.00040378032,"about_ca_topic_score_gemma":0.000007944151,"teacher_disagreement_score":0.93357813,"about_ca_system_score_codex":0.00002022584,"about_ca_system_score_gemma":0.000026001846,"threshold_uncertainty_score":0.25251174},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3802098,0.009181962,0.002764973,0.1759719,0.00079716387,0.01850285,0.0007357599,0.0021835235,0.40965208],"genre_scores_gemma":[0.7690862,0.023235232,0.047552463,0.0034647242,0.011014367,0.009725986,0.0004481548,0.0006139808,0.13485894],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99593395,0.00020466566,0.00086232007,0.001606661,0.00048191354,0.00091046555],"domain_scores_gemma":[0.99660355,0.00061493274,0.00035429068,0.0019714364,0.00014503981,0.00031074282],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050101895,0.0006156634,0.0007107956,0.00031030978,0.000879069,0.00032327042,0.0013279306,0.0005380719,0.0002507564],"category_scores_gemma":[0.00003996711,0.0004597246,0.000053268977,0.0012328569,0.0008978365,0.0004884809,0.00087056943,0.0004390747,0.000049111593],"study_design_candidate":"not_applicable","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.0002164356,0.0006789275,0.01747719,0.0001896855,0.00083629135,0.00007571696,0.005913987,0.0018320329,0.7493137,0.047326818,0.0631784,0.11296081],"study_design_scores_gemma":[0.009852596,0.00094407744,0.011621151,0.00058684143,0.0008607114,0.0018253094,0.019622963,0.053400155,0.036412578,0.0024921703,0.8566627,0.005718747],"about_ca_topic_score_codex":0.17453784,"about_ca_topic_score_gemma":0.4935799,"teacher_disagreement_score":0.79348433,"about_ca_system_score_codex":0.00059749995,"about_ca_system_score_gemma":0.00037931695,"threshold_uncertainty_score":0.9997854},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078236565,0.0004262682,0.89886767,0.0068426738,0.0005625054,0.0018409538,0.00007206602,0.0006557619,0.01249551],"genre_scores_gemma":[0.4702895,0.000083893916,0.5231608,0.000055065157,0.00005189872,0.00054710364,0.00045396193,0.00006988283,0.005287896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932448,0.0029294647,0.0010790579,0.001382755,0.00071691454,0.0006470004],"domain_scores_gemma":[0.98979634,0.0028672325,0.0010058542,0.003689001,0.002278972,0.00036258323],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0068722847,0.00054889166,0.000669974,0.00036616367,0.0004211497,0.0019635563,0.0035280145,0.00037656308,0.00006944855],"category_scores_gemma":[0.0022137584,0.0005543352,0.00034722273,0.00039903895,0.00017239297,0.000716632,0.0021582546,0.0008434037,0.00021145356],"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.00003306668,0.0011023154,0.00051222346,0.001514984,0.00032164977,0.000010952005,0.022256156,0.008908201,0.008686085,0.18334122,0.004761537,0.7685516],"study_design_scores_gemma":[0.0005651893,7.734056e-7,0.0035920676,0.0015854618,0.000027396727,0.00001686181,0.000010217535,0.92258316,0.015075552,0.05441752,0.0015007548,0.0006250389],"about_ca_topic_score_codex":0.0014747033,"about_ca_topic_score_gemma":0.00024131549,"teacher_disagreement_score":0.91367495,"about_ca_system_score_codex":0.00017898323,"about_ca_system_score_gemma":0.0005012465,"threshold_uncertainty_score":0.99969083},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13902542,0.0000025249424,0.85726887,0.00023443758,0.000096821685,0.00023445791,3.398776e-7,0.00015298197,0.002984169],"genre_scores_gemma":[0.92190415,4.928555e-7,0.07746383,0.000030692845,0.000025245292,0.000035728703,7.4210675e-7,0.000008249973,0.00053087005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986202,0.000060871025,0.00022165776,0.0004581823,0.00037893778,0.00026014124],"domain_scores_gemma":[0.99819,0.000045710345,0.00024612664,0.0012927923,0.00012430317,0.00010107818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040186854,0.00014388563,0.00023034686,0.00017563876,0.00048587885,0.0008997537,0.00081807334,0.000040650324,0.000017697384],"category_scores_gemma":[0.000067822955,0.000104946914,0.00007677304,0.0002624406,0.00003152564,0.0008078055,0.00017622065,0.00008831059,0.0000735037],"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.00012758069,0.00080717664,0.007963401,0.0012686008,0.005700655,0.00084181386,0.024366535,0.2001853,0.084167466,0.46841535,0.00011538052,0.20604074],"study_design_scores_gemma":[0.00020655645,0.000097767064,0.0029369737,0.00002206043,0.00015852165,0.00003341212,0.00009761667,0.98893195,0.004744938,0.0025512266,0.000013861433,0.00020511929],"about_ca_topic_score_codex":0.0007890671,"about_ca_topic_score_gemma":0.00067709194,"teacher_disagreement_score":0.78874665,"about_ca_system_score_codex":0.00008226735,"about_ca_system_score_gemma":0.00004602939,"threshold_uncertainty_score":0.8676346},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53333354,0.000016035103,0.21006933,0.004515619,0.0005825699,0.00073288864,0.0000106229645,0.0006933579,0.250046],"genre_scores_gemma":[0.7725663,0.0000036485883,0.22657037,0.00008709387,0.000050003357,0.000030289675,0.0000034714772,0.000014019505,0.0006747793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829394,0.00013176387,0.00028708167,0.00057460973,0.0003962149,0.00031641536],"domain_scores_gemma":[0.9974058,0.00038570756,0.0002304429,0.0017473623,0.00007096797,0.0001596938],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008635197,0.00021719107,0.00029800303,0.00012503938,0.00070878875,0.0016787569,0.0009733965,0.00010796766,0.0001376348],"category_scores_gemma":[0.0005205864,0.00018652488,0.000062009436,0.00008637416,0.00009435665,0.0010592287,0.00020105504,0.00009123666,0.00026096377],"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.00027636823,0.00079612486,0.032057635,0.00087606814,0.00032801044,0.00032106187,0.0038241665,0.013942021,0.10673458,0.13335536,0.026178395,0.6813102],"study_design_scores_gemma":[0.00025581685,0.000071463786,0.014019292,0.00010726005,0.000009794624,0.00001674755,0.000011475327,0.9791489,0.0053345193,0.00057773886,0.00019259645,0.0002543537],"about_ca_topic_score_codex":0.00063362694,"about_ca_topic_score_gemma":0.000014279861,"teacher_disagreement_score":0.9652069,"about_ca_system_score_codex":0.000066714674,"about_ca_system_score_gemma":0.000105833744,"threshold_uncertainty_score":0.9993576},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034181061,0.000121359175,0.9947428,0.00013318786,0.00012976337,0.0013005509,0.000012742967,0.00009683363,0.000044637778],"genre_scores_gemma":[0.925565,0.000007774492,0.07391425,0.000004063518,0.000015620262,0.00036254834,0.000002454806,0.000014711268,0.0001135448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979514,0.0002742872,0.0006492893,0.00039459404,0.00040549767,0.00032491382],"domain_scores_gemma":[0.9952923,0.0010936761,0.00088015286,0.0023359547,0.00034564536,0.000052248117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019067918,0.0001827871,0.00046009166,0.00036846488,0.0005374913,0.00020904171,0.0019189524,0.00010115938,0.000003324845],"category_scores_gemma":[0.00016043212,0.00014450854,0.00024081992,0.00043038387,0.00007994219,0.0008194616,0.000009388312,0.000122382,0.0000020582304],"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.00003640625,0.000072279145,0.000005434729,0.000053089396,0.00070891675,1.0340072e-7,0.0007660593,0.9801163,0.0021679623,0.0069367476,0.0000056910567,0.009130977],"study_design_scores_gemma":[0.0002587146,0.00035383584,0.00026429258,0.00006692608,0.0005285155,0.0000036072504,0.00013313869,0.994908,0.0023935337,0.00095373555,0.0000016540964,0.0001340582],"about_ca_topic_score_codex":0.00028242567,"about_ca_topic_score_gemma":0.00007139942,"teacher_disagreement_score":0.9221469,"about_ca_system_score_codex":0.00020336172,"about_ca_system_score_gemma":0.00031901945,"threshold_uncertainty_score":0.5892887},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020829909,0.0000148679765,0.94038534,0.00025337152,0.00013534444,0.00009540116,1.5852864e-7,0.00015174967,0.03813383],"genre_scores_gemma":[0.74795526,9.144828e-7,0.25103945,0.000015107658,0.00004057574,0.0000061025867,3.55122e-7,0.000004277536,0.00093797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988449,0.000032267355,0.00022662229,0.00040849388,0.00024379237,0.00024389467],"domain_scores_gemma":[0.99780947,0.000057797693,0.00017229593,0.0017864871,0.00008496364,0.00008897469],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005091477,0.00010356017,0.00021185569,0.00013587899,0.0004680093,0.0011700281,0.0015699387,0.00004189344,0.000021679813],"category_scores_gemma":[0.00007615121,0.00008721806,0.00012803962,0.00021300363,0.000029612382,0.0009907099,0.00032887983,0.00007153457,0.00013098921],"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":[5.9542515e-7,0.0000137152065,0.0013984346,0.000012935492,0.00012789178,0.000010113748,0.00026519323,0.9328661,0.00009317176,0.06232818,0.000026319494,0.002857348],"study_design_scores_gemma":[0.000055896297,0.000005844262,0.00037383274,0.000009491621,0.00004488618,0.000002907363,0.000008980631,0.9963833,0.00015444872,0.002793383,0.000048710674,0.00011833662],"about_ca_topic_score_codex":0.00072742545,"about_ca_topic_score_gemma":0.000028934815,"teacher_disagreement_score":0.72712535,"about_ca_system_score_codex":0.000031887936,"about_ca_system_score_gemma":0.00003529789,"threshold_uncertainty_score":0.99986684},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079229884,0.000053609052,0.9159198,0.0008536594,0.002653111,0.0003627889,0.000004456174,0.00026735602,0.0006553676],"genre_scores_gemma":[0.9319461,0.000013435212,0.067689344,0.000101672864,0.00012490066,0.000033478078,3.660165e-7,0.00002487978,0.00006582167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976691,0.00017247988,0.00039947464,0.00082424894,0.00046768354,0.00046703644],"domain_scores_gemma":[0.9975721,0.00032159826,0.00019926883,0.0015142728,0.00011636499,0.00027634687],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058536546,0.00031638102,0.0004023852,0.00022123275,0.0013694506,0.0017222338,0.0009812481,0.00011575612,0.0000015879839],"category_scores_gemma":[0.000012073769,0.00028154702,0.00009168503,0.00016216026,0.00019902592,0.0010170074,0.000013900244,0.00040558534,0.00004462829],"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.00018079771,0.00080833863,0.0006621515,0.0010035846,0.00079084764,0.0005296065,0.0038833797,0.80437744,0.0025141581,0.021455964,0.00028907025,0.16350466],"study_design_scores_gemma":[0.0014498794,0.0004043271,0.0019450173,0.0018844025,0.000027379221,0.00033350117,0.00022183203,0.9895646,0.0030216582,0.0002179705,0.00021718131,0.0007122657],"about_ca_topic_score_codex":0.00017441463,"about_ca_topic_score_gemma":0.000011699285,"teacher_disagreement_score":0.8527162,"about_ca_system_score_codex":0.00009091172,"about_ca_system_score_gemma":0.0000771778,"threshold_uncertainty_score":0.99996364},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9246516,0.00008337348,0.03472608,0.0003104611,0.0005508452,0.0008106386,0.000001899665,0.00039195432,0.03847313],"genre_scores_gemma":[0.99495506,0.000016096415,0.0030558808,0.000031101896,0.00008469096,0.000043000837,0.0000012600193,0.000027762346,0.0017851504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724394,0.00012102898,0.0005304109,0.00093844265,0.00056963135,0.00059654133],"domain_scores_gemma":[0.9976247,0.00025469187,0.00041067778,0.0013644402,0.00013857034,0.00020694305],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012684952,0.00031661714,0.00047827308,0.00026702887,0.0005587158,0.0017723925,0.0015097879,0.0001618233,0.000005473247],"category_scores_gemma":[0.00034737107,0.0002696609,0.000052301373,0.00023245272,0.000095167736,0.0012584525,0.00030261607,0.00021780658,0.00012366429],"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.000562724,0.003149429,0.11772536,0.006601187,0.00055265334,0.0014291456,0.075435914,0.46891135,0.10322314,0.19170985,0.0015152927,0.029183963],"study_design_scores_gemma":[0.0012757821,0.000105883315,0.006956974,0.0006827867,0.0000063366706,0.000038700815,0.0005359605,0.9869028,0.0027356956,0.00025899138,0.00003181542,0.0004683218],"about_ca_topic_score_codex":0.0013926735,"about_ca_topic_score_gemma":0.0001184346,"teacher_disagreement_score":0.5179914,"about_ca_system_score_codex":0.00009767986,"about_ca_system_score_gemma":0.00014661941,"threshold_uncertainty_score":0.99997556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06957444,0.00028581757,0.9283395,0.0001978245,0.0003219743,0.0002924788,0.0000013618744,0.00036844861,0.00061815855],"genre_scores_gemma":[0.6595736,0.000002478256,0.34008485,0.000015960308,0.00006943958,0.000040271832,0.000002969639,0.000016114489,0.0001942724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753267,0.00010761019,0.0004921943,0.0008165871,0.0004731604,0.0005777697],"domain_scores_gemma":[0.9966771,0.00017430235,0.0003810569,0.002466859,0.00014173899,0.0001589467],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008017273,0.0002533771,0.0004904054,0.0003509307,0.000504704,0.0012151296,0.0022554402,0.00013101798,0.000022211087],"category_scores_gemma":[0.00036334907,0.00024670732,0.00022401687,0.0007941571,0.00009321319,0.0011778135,0.00051027065,0.00026136907,0.000107661435],"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.00001788133,0.00010851979,0.09218438,0.0001160602,0.00031334485,0.0002282879,0.004747142,0.8689836,0.000009722837,0.0026160604,0.00014275342,0.030532213],"study_design_scores_gemma":[0.00032691227,0.000018428475,0.009175945,0.00022453415,0.00008905243,0.000006765142,0.00005724215,0.9862554,0.000054235712,0.0032683588,0.00008085304,0.00044223625],"about_ca_topic_score_codex":0.00011581373,"about_ca_topic_score_gemma":0.00004081441,"teacher_disagreement_score":0.5899992,"about_ca_system_score_codex":0.000112079615,"about_ca_system_score_gemma":0.00009181877,"threshold_uncertainty_score":0.9999985},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67309767,0.065578334,0.011724486,0.18273064,0.0063975323,0.03354779,0.0006870874,0.00013747385,0.026098987],"genre_scores_gemma":[0.99629164,0.0023954173,0.0007329611,0.000007603279,0.00003711304,0.00027651832,7.2253266e-7,0.00000848301,0.0002495527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"qualitative","domain_scores_codex":[0.99687487,0.000917536,0.0004784511,0.00044174137,0.0008679513,0.00041944193],"domain_scores_gemma":[0.9928132,0.0013217815,0.0006037495,0.0016948341,0.0035273973,0.00003899291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035598865,0.00015729252,0.00044094506,0.00011046134,0.0006929855,0.00016108213,0.0026516959,0.000049764163,7.379791e-7],"category_scores_gemma":[0.0022547962,0.0000910832,0.00006684165,0.00039687954,0.0004479639,0.00038078125,0.000550351,0.00021434351,0.000004372725],"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.00027108687,0.0005006209,0.0011811004,0.0007899928,0.00018290467,0.0000031264315,0.08170961,0.0005375533,0.006749478,0.88859135,0.0011081883,0.018375002],"study_design_scores_gemma":[0.0046986123,0.0011459541,0.009405367,0.0043495037,0.00002091815,0.0000021948122,0.8021539,0.012071238,0.13826953,0.008920711,0.018453585,0.0005084709],"about_ca_topic_score_codex":0.000018396568,"about_ca_topic_score_gemma":0.0007196908,"teacher_disagreement_score":0.8796706,"about_ca_system_score_codex":0.00016896585,"about_ca_system_score_gemma":0.00025188897,"threshold_uncertainty_score":0.5329954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08421557,0.00009861432,0.88973004,0.010141934,0.00015176264,0.000705121,0.0000091113425,0.00035138222,0.014596475],"genre_scores_gemma":[0.5854018,0.000009921902,0.41106138,0.000072369745,0.000014882304,0.00013278547,0.000058237925,0.000020996416,0.0032276867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684197,0.0012847388,0.000518051,0.00057132094,0.00037764068,0.00040629628],"domain_scores_gemma":[0.99482745,0.0018949182,0.00031717826,0.0014687867,0.0012760472,0.0002156478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037553832,0.0002148229,0.00024653843,0.00015877972,0.00034187792,0.00091829046,0.0013969657,0.00009231983,0.00008883675],"category_scores_gemma":[0.0012808352,0.0002058041,0.0001275017,0.00038166365,0.000100414545,0.0010010445,0.00033137813,0.0002117594,0.0002894595],"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.000009893499,0.00047903275,0.00087587454,0.00017657809,0.00007241469,0.0000035562405,0.008585078,0.000842928,0.031183608,0.21150091,0.0037756332,0.7424945],"study_design_scores_gemma":[0.0005606271,7.983061e-7,0.010635517,0.0002720303,0.0000068008667,0.000015687328,0.000016199667,0.9299114,0.029746404,0.02673873,0.0017897071,0.00030610984],"about_ca_topic_score_codex":0.00096577546,"about_ca_topic_score_gemma":0.0001516054,"teacher_disagreement_score":0.92906845,"about_ca_system_score_codex":0.000063606414,"about_ca_system_score_gemma":0.00013077592,"threshold_uncertainty_score":0.8855096},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30982837,0.000048022488,0.6845538,0.00003479351,0.0018400685,0.0012582358,0.000003872735,0.00039189353,0.0020409634],"genre_scores_gemma":[0.9862,7.828968e-7,0.013268607,0.000023170427,0.00021735915,0.000059446047,9.128463e-7,0.000025695208,0.00020404841],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960267,0.00069051323,0.0011116131,0.000826195,0.0008020861,0.0005428683],"domain_scores_gemma":[0.995914,0.0007177684,0.0005659472,0.0020808538,0.0005457916,0.00017564592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011037422,0.0003604428,0.0009374535,0.00040435663,0.0005548661,0.00030677384,0.0019062253,0.00012604478,0.000009585289],"category_scores_gemma":[0.00004689636,0.00033595788,0.00015352348,0.0011193688,0.0001234302,0.00048699902,0.000053398806,0.0003234683,0.00011213274],"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.00036665198,0.005184901,0.00085695303,0.00033031122,0.00249302,0.00004641731,0.19189991,0.7772082,0.0068921545,0.003108983,0.00090208685,0.010710436],"study_design_scores_gemma":[0.0037173536,0.0028031515,0.0003197722,0.00038109,0.000070586655,0.00007119773,0.018891938,0.97067356,0.0024009375,0.00009226107,0.00012765652,0.0004504678],"about_ca_topic_score_codex":0.00066291523,"about_ca_topic_score_gemma":0.000040714156,"teacher_disagreement_score":0.67637163,"about_ca_system_score_codex":0.00013549378,"about_ca_system_score_gemma":0.00013751752,"threshold_uncertainty_score":0.9999092},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68265486,0.00017734976,0.28988513,0.0004056803,0.0009827607,0.0009961694,0.000028418714,0.0010779839,0.02379162],"genre_scores_gemma":[0.7961576,0.0000047793183,0.20319119,0.000024271152,0.00027168376,0.000031553383,0.000008588953,0.000027619859,0.00028270244],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675643,0.0002762472,0.00093009375,0.00062316674,0.00091430784,0.0004997404],"domain_scores_gemma":[0.99624294,0.0003675136,0.0005981133,0.0020632728,0.000521641,0.0002065286],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012881693,0.0002889728,0.00063685654,0.0002670557,0.0001980794,0.0002187306,0.0020617698,0.00017027851,0.00007866331],"category_scores_gemma":[0.00040535236,0.00027949404,0.00014215993,0.0006495757,0.00028341627,0.0009411855,0.0005457758,0.00016003885,0.000959725],"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.000033276334,0.0004958068,0.0017153521,0.0012397193,0.0007631243,0.00016753886,0.007825472,0.003486293,0.16751172,0.8109354,0.0037836074,0.0020427143],"study_design_scores_gemma":[0.0007457273,0.00027066897,0.0076244776,0.00065129536,0.00003878899,0.0001232319,0.00013832339,0.97314435,0.0053462046,0.011335192,0.00014197537,0.00043975373],"about_ca_topic_score_codex":0.0002503658,"about_ca_topic_score_gemma":0.0000026730536,"teacher_disagreement_score":0.9696581,"about_ca_system_score_codex":0.000120129036,"about_ca_system_score_gemma":0.0002936071,"threshold_uncertainty_score":0.9999657},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4703991,0.000023957122,0.524065,0.000104407045,0.00029558688,0.00040122014,0.000002926576,0.0002548032,0.004452931],"genre_scores_gemma":[0.7362206,0.0000065583777,0.2631742,0.000028074945,0.00009223214,0.00001727691,0.000006285192,0.000017599628,0.00043718563],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972837,0.00024068599,0.00055522926,0.00084007863,0.0006327844,0.00044751028],"domain_scores_gemma":[0.9950708,0.00048458335,0.00060099154,0.0033444206,0.00024050796,0.00025866588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016995348,0.0003020628,0.00089991646,0.0005079082,0.00041989324,0.0005448018,0.0022689165,0.00016385164,0.000025514075],"category_scores_gemma":[0.00041680803,0.0002446729,0.0003689326,0.00051675434,0.00007823528,0.0010802515,0.0002781342,0.0001732839,0.000120586425],"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.00026364162,0.0014160479,0.05840637,0.00035394647,0.0055843326,0.0003478417,0.004884037,0.15917477,0.6038214,0.021768214,0.000119455384,0.14385992],"study_design_scores_gemma":[0.0018243594,0.00014157356,0.026431324,0.00007362724,0.00021252228,0.000003031624,0.000031011004,0.93958133,0.03136172,0.00006321279,0.0000044822377,0.00027178138],"about_ca_topic_score_codex":0.0025542763,"about_ca_topic_score_gemma":0.00007823002,"teacher_disagreement_score":0.7804066,"about_ca_system_score_codex":0.00006432992,"about_ca_system_score_gemma":0.00007358997,"threshold_uncertainty_score":0.9977471},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10272579,0.00030598885,0.844321,0.0045574782,0.0005528635,0.0011145549,0.00007343652,0.00063921965,0.045709666],"genre_scores_gemma":[0.53358483,0.000038146805,0.46562234,0.0000604458,0.000039019225,0.0001664597,0.00004371745,0.000045763503,0.00039928907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9856353,0.008243803,0.0013624812,0.0024691822,0.0013386648,0.00095061515],"domain_scores_gemma":[0.9848411,0.0037351327,0.0008954449,0.0056441976,0.0041219885,0.00076210126],"candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.017537616,0.0007192891,0.00087840785,0.00048357894,0.00068029016,0.0018714485,0.0056849727,0.00060633663,0.000028077273],"category_scores_gemma":[0.009626792,0.0006676866,0.00040123065,0.0009638595,0.00029095472,0.00066539855,0.004699531,0.0012081233,0.00017161902],"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.0000764498,0.0020515248,0.0080271065,0.0016522526,0.00040157847,0.000036931837,0.02303767,0.0026674406,0.0035517693,0.3526282,0.001023398,0.6048457],"study_design_scores_gemma":[0.0024659734,0.0000028379577,0.015203201,0.0165874,0.00016097439,0.00018712954,0.000541818,0.78961176,0.038708944,0.13139132,0.0016093104,0.003529368],"about_ca_topic_score_codex":0.0005079214,"about_ca_topic_score_gemma":0.0001731962,"teacher_disagreement_score":0.78694427,"about_ca_system_score_codex":0.00030055264,"about_ca_system_score_gemma":0.00089305267,"threshold_uncertainty_score":0.99969476},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012838245,0.0007455291,0.942067,0.0076749753,0.00026053502,0.001000904,0.000021233745,0.000773812,0.034617726],"genre_scores_gemma":[0.5392087,0.00024354873,0.4549925,0.00011662803,0.00012685555,0.00052924815,0.00022166705,0.000057721772,0.004503107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909798,0.0056061777,0.0007946564,0.0013595981,0.0006622119,0.0005975452],"domain_scores_gemma":[0.9901282,0.0014138042,0.00087200204,0.004794387,0.0024786983,0.00031289237],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.009255603,0.00044747515,0.00046751456,0.00028510432,0.00057939184,0.0013111393,0.004123648,0.00047352773,0.00004828196],"category_scores_gemma":[0.0010599123,0.000493936,0.0002612312,0.0006392783,0.00022955122,0.00041075033,0.0026603185,0.0007122692,0.00032567856],"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.000013084454,0.0014304196,0.004675188,0.0007955135,0.00031454721,0.000011298456,0.02671063,0.0022209752,0.009577723,0.8073365,0.0059212847,0.1409928],"study_design_scores_gemma":[0.0015163344,0.0000019554868,0.007935117,0.0042161555,0.00013025163,0.00009337232,0.00026878086,0.71475655,0.058857508,0.054623455,0.15515906,0.0024414882],"about_ca_topic_score_codex":0.0009891194,"about_ca_topic_score_gemma":0.0004963161,"teacher_disagreement_score":0.7527131,"about_ca_system_score_codex":0.0002846338,"about_ca_system_score_gemma":0.0006384136,"threshold_uncertainty_score":0.9997512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3530807,0.000054387776,0.6434814,0.0000564106,0.0012559849,0.0007533077,0.0006288084,0.00017170294,0.00051733997],"genre_scores_gemma":[0.91395533,0.000008685249,0.08531024,0.00005229495,0.0004641454,0.00004696255,0.00010270457,0.00003512571,0.00002447771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99521357,0.00020155594,0.0022184204,0.00046144324,0.0008386718,0.0010663588],"domain_scores_gemma":[0.99537957,0.00036829122,0.0010377438,0.0014429569,0.0013946313,0.0003768317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021670794,0.00047710803,0.0008086748,0.0002928286,0.0008665725,0.0008047318,0.0013084954,0.00033643004,0.000011403814],"category_scores_gemma":[0.0005958231,0.00044370195,0.00033791427,0.0006603915,0.00040505256,0.0027622695,0.00071837055,0.00047162417,0.000097537595],"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.0006071037,0.0030864635,0.26465216,0.019219667,0.0039093113,0.00008830275,0.06402962,0.031231787,0.00782542,0.5909418,0.0045970865,0.009811318],"study_design_scores_gemma":[0.0016538487,0.00025169164,0.0016664452,0.0006841714,0.00010556708,0.00020750018,0.0016640257,0.9876298,0.0033268007,0.0007351271,0.0014280287,0.00064699946],"about_ca_topic_score_codex":0.00025854752,"about_ca_topic_score_gemma":0.000017962668,"teacher_disagreement_score":0.956398,"about_ca_system_score_codex":0.00025848724,"about_ca_system_score_gemma":0.00024144174,"threshold_uncertainty_score":0.99980146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10281977,0.000005550513,0.85571456,0.00089647295,0.00010951458,0.00046795132,0.0000011598456,0.00037729566,0.039607707],"genre_scores_gemma":[0.90064704,6.9801973e-7,0.098514445,0.0002102381,0.00022973974,0.000035989113,0.0000018390969,0.000016221891,0.00034378553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979917,0.00024168109,0.0003652034,0.00067294005,0.0004074941,0.000321],"domain_scores_gemma":[0.9981769,0.0003826198,0.00007407197,0.00084954506,0.00022557612,0.0002912912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842034,0.0001580637,0.00023663891,0.000097037286,0.00021256146,0.0004226239,0.0004719106,0.000067028646,0.0000072170305],"category_scores_gemma":[0.000117239906,0.00012287544,0.000015379872,0.00031697867,0.00007270053,0.0005055675,0.00016279513,0.0000727081,0.000469898],"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.000066071094,0.00006379125,0.00045361213,0.00007229889,0.000012185992,0.0000034610034,0.0009242834,0.00023815154,0.024238357,0.9680369,0.00020294932,0.005687921],"study_design_scores_gemma":[0.0012542384,0.0046902914,0.01225049,0.0006378748,0.000022690052,0.00025140366,0.0008531651,0.9655409,0.007593842,0.0033562845,0.0019127877,0.0016360561],"about_ca_topic_score_codex":0.0010840109,"about_ca_topic_score_gemma":0.00005237914,"teacher_disagreement_score":0.9653027,"about_ca_system_score_codex":0.00005570084,"about_ca_system_score_gemma":0.0000391014,"threshold_uncertainty_score":0.6039745},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01225208,0.00004866828,0.9098546,0.000032875058,0.0018767819,0.0007154483,0.000005939388,0.0006865107,0.07452711],"genre_scores_gemma":[0.6962536,5.438851e-7,0.3004232,0.00010678014,0.00036963148,0.00007806624,0.00006553966,0.00006382545,0.0026387866],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99612695,0.00013172682,0.0011085296,0.00114645,0.0008018698,0.00068449473],"domain_scores_gemma":[0.99672604,0.00047953366,0.001111965,0.0011691954,0.0003855545,0.0001277259],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00107576,0.00062238355,0.0010015658,0.00017632812,0.0003075823,0.0017973757,0.0016317499,0.00039860446,0.000007585003],"category_scores_gemma":[0.00011467373,0.00053802243,0.00026819395,0.00031785647,0.000016358701,0.0023483837,0.00014766864,0.0005338033,0.00021491475],"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.0002939971,0.0004398382,0.0032005461,0.033088293,0.0018799845,0.00011285329,0.024403859,0.01453685,0.08251966,0.31068304,0.00094532303,0.52789575],"study_design_scores_gemma":[0.0010085067,0.000086388645,0.00042585077,0.0010897842,0.000044827666,0.00012107604,0.0009886095,0.9928,0.0022025034,0.000020588788,0.00041359424,0.0007982979],"about_ca_topic_score_codex":0.00034028533,"about_ca_topic_score_gemma":0.000019255034,"teacher_disagreement_score":0.97826314,"about_ca_system_score_codex":0.00021065059,"about_ca_system_score_gemma":0.00020832417,"threshold_uncertainty_score":0.9997071},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115549326,0.000010870313,0.8802955,0.000030297713,0.00008082316,0.00088700757,0.0000053923645,0.00085707806,0.0022836616],"genre_scores_gemma":[0.8621945,9.451169e-7,0.13760203,0.000024481364,0.000018032506,0.000045046585,0.000011424209,0.000021612492,0.00008194213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791235,0.00007623988,0.00053997687,0.00065115566,0.00049824844,0.0003220479],"domain_scores_gemma":[0.9981559,0.0002714525,0.00039622845,0.0008555219,0.00022428292,0.000096631906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041441756,0.0002914153,0.00069119106,0.00059437606,0.00005782635,0.00049726403,0.00085497607,0.00011378655,0.0000055113064],"category_scores_gemma":[0.000034386885,0.0002427548,0.0002622321,0.0014341676,0.00005928109,0.0013314115,0.00024576404,0.0001352537,0.000027771623],"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.0012262637,0.0011390531,0.0020081657,0.0009915248,0.0074830083,0.00013580322,0.0049083363,0.07158728,0.3290772,0.02139164,0.0003755225,0.5596762],"study_design_scores_gemma":[0.001219626,0.000827854,0.00027555032,0.00028143526,0.00023533269,0.000059418664,0.000033385448,0.8312417,0.16244166,0.0026784136,0.0000824528,0.00062314386],"about_ca_topic_score_codex":0.000050475974,"about_ca_topic_score_gemma":0.000005086886,"teacher_disagreement_score":0.75965446,"about_ca_system_score_codex":0.000104335086,"about_ca_system_score_gemma":0.00005564108,"threshold_uncertainty_score":0.9899254},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04599793,0.00011835861,0.9223237,0.00020572821,0.0013688775,0.0013951221,0.000005876965,0.0006042676,0.027980145],"genre_scores_gemma":[0.9044301,0.000014863539,0.083823666,0.000034292243,0.00016805569,0.00013105186,0.0000075780886,0.000026663114,0.011363711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978786,0.00009220348,0.00047105478,0.000689253,0.0003767544,0.00049212185],"domain_scores_gemma":[0.9981278,0.0002493187,0.00021200259,0.0010788242,0.00021877735,0.00011323868],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006843456,0.00022115697,0.00040225286,0.000105521736,0.000105687905,0.00036044125,0.00090020004,0.00013629436,0.000020048581],"category_scores_gemma":[0.000017574643,0.00019655755,0.0001020961,0.00024431653,0.000016629772,0.0015541503,0.00012756545,0.000073430856,0.001200276],"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.000022841657,0.00007322482,0.00007235925,0.00039988675,0.000066853136,0.000004882833,0.0004876432,0.1639756,0.07213274,0.75603557,0.0049259095,0.0018024783],"study_design_scores_gemma":[0.0005770025,0.00013172823,0.000090997746,0.00009898733,0.000005716318,0.00002539017,0.00003892181,0.99351376,0.0021068705,0.0028896348,0.00022347072,0.00029751746],"about_ca_topic_score_codex":0.0012244467,"about_ca_topic_score_gemma":0.0000056371637,"teacher_disagreement_score":0.8584322,"about_ca_system_score_codex":0.00016067993,"about_ca_system_score_gemma":0.00013913702,"threshold_uncertainty_score":0.9995774},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051872887,0.00011497192,0.9437936,0.000052271036,0.0015133139,0.0018206715,0.000048406513,0.00045452346,0.00032934156],"genre_scores_gemma":[0.8616631,0.00001028568,0.1378564,0.000010419999,0.00008692538,0.000057215755,0.000022127735,0.000041967272,0.00025158838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964422,0.00034832806,0.0010847597,0.0011128407,0.00050891825,0.0005029535],"domain_scores_gemma":[0.995679,0.0012346242,0.00064693566,0.0019090907,0.00038119598,0.00014912833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017320428,0.00034019878,0.00074009725,0.0003181448,0.0004131374,0.00042554035,0.001427528,0.00020623245,0.000005823456],"category_scores_gemma":[0.00008590543,0.00034549375,0.000114392155,0.00054109725,0.000047034548,0.0009537256,0.00008555415,0.0002198807,0.000053123473],"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.00018097172,0.0006648574,0.0006361368,0.0052861334,0.0012658113,0.000012226056,0.005541531,0.6138845,0.26875392,0.080945,0.0003565273,0.022472356],"study_design_scores_gemma":[0.0009829556,0.00031424226,0.00007656243,0.00087722496,0.00006070369,0.00016840722,0.00085488695,0.9940896,0.0019288597,0.00023715492,0.000059268314,0.00035015523],"about_ca_topic_score_codex":0.000669057,"about_ca_topic_score_gemma":0.0000074726713,"teacher_disagreement_score":0.8097902,"about_ca_system_score_codex":0.0001147385,"about_ca_system_score_gemma":0.00014619774,"threshold_uncertainty_score":0.9998997},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04226466,0.000013899044,0.91870683,0.0005056241,0.00076543255,0.0003539755,3.6746596e-7,0.00013993285,0.037249286],"genre_scores_gemma":[0.8455762,5.856675e-7,0.14626385,0.0001649974,0.00007002826,0.000018886863,0.000001392562,0.0000060986763,0.007897907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925566,0.000022779472,0.00016375903,0.00026286204,0.0001219584,0.00017296922],"domain_scores_gemma":[0.99934584,0.000069582966,0.000052765667,0.00042871863,0.00005907685,0.00004400322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031171355,0.00007086117,0.00010426779,0.00005354217,0.000027428032,0.00013020067,0.00045055564,0.000039126113,0.000059493872],"category_scores_gemma":[0.000020856596,0.000058510883,0.000058636928,0.00010057334,0.000005211148,0.0005152996,0.00010557629,0.0000386754,0.0013664187],"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.000023873334,0.00009884249,0.002587112,0.0002420951,0.000068367175,0.000004541473,0.0019026262,0.0019236569,0.13276406,0.734821,0.010937806,0.114626],"study_design_scores_gemma":[0.0008920496,0.00022585478,0.0015329164,0.00009001052,0.000004566214,0.000036095233,0.00012222918,0.93596554,0.014080803,0.005259029,0.041422915,0.00036800967],"about_ca_topic_score_codex":0.000039378763,"about_ca_topic_score_gemma":0.0000046926552,"teacher_disagreement_score":0.93404186,"about_ca_system_score_codex":0.000032591994,"about_ca_system_score_gemma":0.000024014329,"threshold_uncertainty_score":0.9994111},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37147212,0.000035662797,0.6222239,0.00005627126,0.00018703267,0.00027467962,0.000006055417,0.00031961323,0.005424677],"genre_scores_gemma":[0.96495724,0.0000072226244,0.034128405,0.000026583304,0.00007912009,0.000002066858,0.000022855751,0.000023705707,0.0007527896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962031,0.00047634658,0.00041700187,0.0020865905,0.00028003138,0.0005368802],"domain_scores_gemma":[0.99487144,0.00014654736,0.00061031163,0.0031686358,0.0008036285,0.0003994655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013652284,0.0005325013,0.000887419,0.00071198586,0.00017989283,0.00044302247,0.0029580835,0.00038894513,0.000025406143],"category_scores_gemma":[0.00014817606,0.00050511555,0.00042325183,0.003237531,0.00017131139,0.000867093,0.002468011,0.0009754423,0.00010316224],"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.000037642283,0.00012291806,0.064859696,0.00013230676,0.0014758116,0.0003768611,0.0008310587,0.8644474,0.000033305667,0.067021504,0.00009090032,0.00057058275],"study_design_scores_gemma":[0.00037095352,0.00006561987,0.0023619414,0.0001284331,0.0005608044,0.000008240305,0.00032292632,0.98615074,0.000080714264,0.009234787,0.000056705532,0.00065812375],"about_ca_topic_score_codex":0.0016257493,"about_ca_topic_score_gemma":0.0005709706,"teacher_disagreement_score":0.5934851,"about_ca_system_score_codex":0.0006719137,"about_ca_system_score_gemma":0.0007912784,"threshold_uncertainty_score":0.99974006},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007868033,0.00011165231,0.18698336,0.00012698636,0.00048021137,0.00023870074,0.0000019503784,0.00006923393,0.81198007],"genre_scores_gemma":[0.049069285,0.000013806136,0.011553161,0.00018228184,0.00008827962,0.0000010427011,0.0000023830892,0.000022774826,0.939067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99881315,0.000015189329,0.0003324556,0.00034419764,0.00036226513,0.00013271575],"domain_scores_gemma":[0.9985287,0.00010338145,0.00030413602,0.0008843296,0.00012276585,0.000056683228],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022072818,0.00017870702,0.00041290995,0.00014020472,0.000016252605,0.000038765007,0.00082064053,0.00022875587,0.00019523806],"category_scores_gemma":[0.000009047411,0.00015004046,0.00015394234,0.000020837366,0.000025182188,0.0002109405,0.00019690946,0.00014669914,0.0015218699],"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.0000023946366,0.0000029781331,0.000015618367,0.00006831401,0.000041888165,0.0000051951133,0.00003659946,0.000041039402,0.0003207954,0.9931384,0.0028949461,0.0034318327],"study_design_scores_gemma":[0.0056949183,0.0010149407,0.000118915865,0.0032205065,0.00019060662,0.00011595121,0.000029147086,0.31372938,0.004062531,0.11469253,0.55386174,0.0032688403],"about_ca_topic_score_codex":0.00004137226,"about_ca_topic_score_gemma":0.0000024632056,"teacher_disagreement_score":0.87844586,"about_ca_system_score_codex":0.000037102884,"about_ca_system_score_gemma":0.00013832493,"threshold_uncertainty_score":0.99925554},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020522859,0.0035750652,0.9661836,0.005254154,0.00071775605,0.0010151402,0.00004565562,0.00020311766,0.0024826343],"genre_scores_gemma":[0.69861585,0.0004020773,0.30008537,0.000020418182,0.00013169402,0.00018494384,0.00008412711,0.000044599314,0.00043090328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958638,0.0019636466,0.00068814465,0.0006295983,0.0004043542,0.00045048952],"domain_scores_gemma":[0.9912476,0.0039876313,0.00067147147,0.0024270667,0.0014720509,0.00019419435],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008708352,0.0003363272,0.00043486973,0.00011343577,0.00035105756,0.001158506,0.0022208537,0.00030209392,0.000003995175],"category_scores_gemma":[0.0011294322,0.0002913896,0.00018548465,0.000285813,0.00011660343,0.000502187,0.001364071,0.00047327534,0.0000043517166],"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.000019382987,0.00020576046,0.0010371902,0.0011339327,0.00033000528,0.000002617649,0.014560232,0.0003328315,0.030234192,0.6825017,0.00081240013,0.2688298],"study_design_scores_gemma":[0.0016333254,0.0000028397947,0.0068714935,0.0042193434,0.00016447602,0.00009039497,0.0008541558,0.6882491,0.19958602,0.005649657,0.09084254,0.0018366233],"about_ca_topic_score_codex":0.000127105,"about_ca_topic_score_gemma":0.000102709484,"teacher_disagreement_score":0.6879163,"about_ca_system_score_codex":0.00006955188,"about_ca_system_score_gemma":0.00026982164,"threshold_uncertainty_score":0.9999538},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31532624,0.004203934,0.33132976,0.0020436263,0.046697013,0.044798594,0.00094683847,0.014704606,0.23994938],"genre_scores_gemma":[0.86211574,0.00020889103,0.063662395,0.000058976413,0.0027678735,0.0014752529,0.00026132533,0.0005966821,0.068852864],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9894485,0.0009700922,0.0028946009,0.0026656922,0.0016481576,0.00237298],"domain_scores_gemma":[0.9911684,0.0018011784,0.0010085446,0.00392365,0.001127017,0.00097125757],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004064054,0.0011992265,0.0024665557,0.00062204595,0.0005802272,0.0014835814,0.0028634875,0.00090567453,0.000108034605],"category_scores_gemma":[0.0005671617,0.0011218913,0.000698255,0.0012070846,0.0001714004,0.0018516012,0.0005845149,0.0005228603,0.009897322],"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.00033130773,0.00089126755,0.0011701625,0.0064543053,0.00083349546,0.0002825542,0.0028362144,0.011407347,0.8059422,0.1499163,0.018402178,0.0015326537],"study_design_scores_gemma":[0.002869213,0.00061400875,0.0005887268,0.0021958405,0.000104079285,0.00071715674,0.00035762938,0.98413455,0.0008879799,0.00013840829,0.0055622887,0.0018301102],"about_ca_topic_score_codex":0.0031682744,"about_ca_topic_score_gemma":0.0000054855927,"teacher_disagreement_score":0.97272724,"about_ca_system_score_codex":0.00079169346,"about_ca_system_score_gemma":0.000679441,"threshold_uncertainty_score":0.99955297},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6277406,0.0004010859,0.36242777,0.000118242046,0.00068534596,0.0040283473,0.0000961195,0.00031667674,0.004185786],"genre_scores_gemma":[0.99462056,0.0000034826307,0.0011427576,0.000017512115,0.0009638715,0.0027280562,0.000019824645,0.000075160206,0.00042877774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994047,0.00129775,0.0013496979,0.0014338136,0.0009021588,0.00096958724],"domain_scores_gemma":[0.9917071,0.004709578,0.00065002026,0.0022573872,0.00035250428,0.00032344458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031767807,0.00053989893,0.0013919766,0.00029055835,0.00033505834,0.00045419915,0.001947468,0.00024129999,0.0000028965515],"category_scores_gemma":[0.00024326175,0.0005061064,0.00047499247,0.0013652522,0.00022825472,0.00082973717,0.00041921414,0.0005669941,0.000266076],"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.000025643742,0.00048362737,0.00050394185,0.00066897913,0.000081181985,0.000001856179,0.0015725496,0.003245995,0.04595666,0.9460227,0.00007961378,0.0013572832],"study_design_scores_gemma":[0.0043550665,0.00085841387,0.008549178,0.0035600346,0.00033681342,0.00014193,0.008794943,0.734287,0.014753225,0.19817305,0.022393698,0.0037966496],"about_ca_topic_score_codex":0.0005701321,"about_ca_topic_score_gemma":0.0000063714992,"teacher_disagreement_score":0.74784964,"about_ca_system_score_codex":0.00033037158,"about_ca_system_score_gemma":0.000114269606,"threshold_uncertainty_score":0.99973905},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3844442,0.00004997226,0.6127151,0.00035196528,0.00020151265,0.000554963,6.9203026e-7,0.00007171052,0.0016098616],"genre_scores_gemma":[0.8826079,5.152064e-7,0.11420642,0.000067625486,0.00016623105,0.000031177584,0.0000054413026,0.000010957579,0.002903729],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992116,0.00003489957,0.00014185629,0.00031029183,0.00015773506,0.00014358544],"domain_scores_gemma":[0.9993945,0.00005261425,0.000101108686,0.00032430363,0.00008535111,0.00004215916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026265395,0.00008962248,0.00011851969,0.00005011562,0.00005677857,0.00023186124,0.00013045195,0.000059637427,0.000006352213],"category_scores_gemma":[0.00002046461,0.000072532515,0.0000218255,0.00012206205,0.000011216146,0.0006130517,0.00003305246,0.00003908283,0.000018158464],"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.00008882337,0.00013310126,0.005574762,0.00020180512,0.00006886173,0.000002309898,0.0032567857,0.006995988,0.9005038,0.029212609,0.0036147977,0.050346326],"study_design_scores_gemma":[0.0018579413,0.00062745233,0.01112068,0.00007852793,0.000016720847,0.000034307912,0.00004870822,0.9038323,0.074832425,0.0009505983,0.00623962,0.00036072315],"about_ca_topic_score_codex":0.000024686919,"about_ca_topic_score_gemma":0.000020540618,"teacher_disagreement_score":0.8968363,"about_ca_system_score_codex":0.000033697277,"about_ca_system_score_gemma":0.00005169344,"threshold_uncertainty_score":0.29577902},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21466853,0.00003610383,0.76632035,0.00008602194,0.0020092856,0.00061174156,7.0002227e-7,0.00023665455,0.016030638],"genre_scores_gemma":[0.98496896,2.8073592e-7,0.007931748,0.000057066492,0.0003464715,0.000063137915,0.000002365552,0.000013141617,0.0066168057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988037,0.0000448355,0.00020976579,0.00040794164,0.00025759288,0.0002761674],"domain_scores_gemma":[0.9989551,0.00016791666,0.00008534047,0.0005978678,0.00011544312,0.000078351506],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032387793,0.00012314126,0.00020629795,0.00006108897,0.00007304281,0.00038541786,0.00043693793,0.000059972634,0.000009269688],"category_scores_gemma":[0.000013589781,0.000099774676,0.00009727474,0.00018580706,0.000009840509,0.0007221168,0.00009056374,0.000065721964,0.0012824719],"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.000020004998,0.00008249515,0.0008740422,0.00017146335,0.00007561712,0.0000026471803,0.0004286507,0.0048036855,0.017602626,0.96694213,0.0035115592,0.0054850676],"study_design_scores_gemma":[0.0005013316,0.00025754745,0.0004796561,0.000036427027,0.000009814458,0.00003067935,0.00010480518,0.9850076,0.00080116314,0.0019487406,0.010574106,0.00024812773],"about_ca_topic_score_codex":0.0001546611,"about_ca_topic_score_gemma":0.0000034236753,"teacher_disagreement_score":0.9802039,"about_ca_system_score_codex":0.00005464377,"about_ca_system_score_gemma":0.00005229554,"threshold_uncertainty_score":0.99949515},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15027809,0.00048353072,0.8314208,0.0007019383,0.005877554,0.0054622665,0.000035318873,0.0014185718,0.004321955],"genre_scores_gemma":[0.8742139,0.00002507014,0.124073565,0.00000727458,0.0006846395,0.0006336819,0.000030234012,0.0000503589,0.00028132924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961578,0.00027305193,0.001082182,0.00139116,0.0005442466,0.0005515142],"domain_scores_gemma":[0.9974654,0.00029768297,0.00057385984,0.0011133217,0.00033796483,0.00021177238],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009847096,0.00048483623,0.0010035489,0.00024005017,0.00010014104,0.0010694292,0.0015359587,0.00047513514,0.0000035556725],"category_scores_gemma":[0.0002587551,0.00049757666,0.00023129642,0.00028206967,0.000025511887,0.00048614995,0.0011204374,0.0005659825,0.00008307482],"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.00040424935,0.0009927558,0.019019071,0.021594238,0.0011233793,0.0010347327,0.2161302,0.5565184,0.064597,0.08211298,0.0026978059,0.033775218],"study_design_scores_gemma":[0.00058495946,0.00006311513,0.000617847,0.0007963195,0.000015643142,0.000016154892,0.0012864451,0.99454105,0.0005387778,0.0009152238,0.000097729346,0.0005267337],"about_ca_topic_score_codex":0.0041365614,"about_ca_topic_score_gemma":0.00003146733,"teacher_disagreement_score":0.7239358,"about_ca_system_score_codex":0.00036763054,"about_ca_system_score_gemma":0.00035158434,"threshold_uncertainty_score":0.9999676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017644545,0.000047731126,0.97793204,0.0005938834,0.00012290361,0.002199588,0.00018165611,0.0007088229,0.000568855],"genre_scores_gemma":[0.384064,0.00011958001,0.6096382,0.00006260424,0.000097171775,0.0007275739,0.004838144,0.000052979314,0.0003997682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947386,0.0014848718,0.0016768163,0.0009813816,0.0005878101,0.0005305334],"domain_scores_gemma":[0.99276674,0.0012165172,0.0013760191,0.0023517197,0.002088062,0.00020092362],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028805954,0.00048411402,0.0006407351,0.0005302938,0.00042471313,0.0005680192,0.001419133,0.00028404486,0.00009630281],"category_scores_gemma":[0.0018902037,0.0005199972,0.000121567056,0.0011724209,0.00018621083,0.0016030011,0.0002407067,0.00029024485,0.0016951665],"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.000030252639,0.0008944522,0.0010868813,0.00026659077,0.000043548625,3.5901917e-7,0.0011453601,0.028942872,0.829559,0.12347259,0.007325356,0.007232693],"study_design_scores_gemma":[0.0017489293,0.00010312034,0.0066699614,0.00041198003,0.00004582512,0.000019039877,0.000018757257,0.9469713,0.01505002,0.0024655447,0.025588445,0.0009070893],"about_ca_topic_score_codex":0.00024694108,"about_ca_topic_score_gemma":0.00034526628,"teacher_disagreement_score":0.9180284,"about_ca_system_score_codex":0.0001290633,"about_ca_system_score_gemma":0.00032662135,"threshold_uncertainty_score":0.99972516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54829526,0.000021836431,0.4478349,0.00017947324,0.0011444256,0.0009912932,0.000005466491,0.00045761932,0.0010697602],"genre_scores_gemma":[0.8036131,5.163475e-7,0.19601458,0.000059775644,0.000213263,0.00003502026,0.000007867378,0.000031781055,0.000024061517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965759,0.00032570673,0.00091614225,0.0009812072,0.00041001174,0.00079104234],"domain_scores_gemma":[0.9968464,0.002045024,0.00023967531,0.00059362943,0.00016063983,0.000114675626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013516989,0.00036269386,0.00073125976,0.00039815222,0.00021625026,0.00029359167,0.00071516045,0.00021024243,0.00001411148],"category_scores_gemma":[0.0007408705,0.00036531675,0.00012201097,0.00063326897,0.00011805367,0.00040350927,0.00023784682,0.00045612027,0.000039412625],"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.0004721243,0.00029077884,0.008251792,0.004695623,0.00007956889,0.00025334753,0.029761566,0.8637618,0.015411284,0.01652751,0.00006628287,0.060428318],"study_design_scores_gemma":[0.0018095778,0.00026534594,0.0026620927,0.0028775267,0.0000051435086,0.00027684285,0.001792671,0.9882106,0.0008873998,0.0006639809,0.000039632323,0.00050915696],"about_ca_topic_score_codex":0.00013959508,"about_ca_topic_score_gemma":0.000042092455,"teacher_disagreement_score":0.2553179,"about_ca_system_score_codex":0.00032361923,"about_ca_system_score_gemma":0.00013896414,"threshold_uncertainty_score":0.9998799},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43423587,0.0006165642,0.5592668,0.000092667775,0.00324365,0.0014916125,0.0000048340307,0.0006342863,0.00041367568],"genre_scores_gemma":[0.9646322,9.834978e-7,0.03346847,0.000048293972,0.00042826062,0.00028367733,0.000014152684,0.00004224672,0.0010816808],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766624,0.00012326249,0.00041778566,0.0007536505,0.0004555234,0.00058350974],"domain_scores_gemma":[0.9981489,0.00037915015,0.00019798451,0.0009690343,0.00017222825,0.00013271249],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050816167,0.0002650932,0.000437078,0.00016623041,0.00010873557,0.00047944934,0.0007622344,0.00015572518,0.000010207801],"category_scores_gemma":[0.00008131183,0.00024887783,0.00016749666,0.0006351554,0.00003599651,0.00087297324,0.00016659488,0.00021626177,0.00064283604],"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.0016359127,0.0026647295,0.25210494,0.005488654,0.0012988695,0.00042136633,0.042086937,0.13890952,0.004027372,0.2196163,0.04285549,0.2888899],"study_design_scores_gemma":[0.012823758,0.002713474,0.03759835,0.0041156537,0.00018387075,0.00031401578,0.0029014167,0.86921954,0.0013782653,0.019138789,0.04411879,0.0054940516],"about_ca_topic_score_codex":0.000037104182,"about_ca_topic_score_gemma":0.0000048792435,"teacher_disagreement_score":0.73031,"about_ca_system_score_codex":0.00015008957,"about_ca_system_score_gemma":0.00011393087,"threshold_uncertainty_score":0.99999636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040099554,0.00026969338,0.95844,0.00030108987,0.0003050477,0.0003897872,0.0000024108604,0.00006812796,0.00012429334],"genre_scores_gemma":[0.90922743,0.00004375051,0.090094,0.0001429721,0.00042483932,0.0000033371718,0.0000011700838,0.000018638642,0.00004384777],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975416,0.00010748684,0.0011324198,0.00038585326,0.0004919531,0.00034066464],"domain_scores_gemma":[0.9972458,0.0003789915,0.0010793447,0.000220283,0.0008163702,0.00025923116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010868139,0.00022736745,0.00056182523,0.00016592894,0.0003023162,0.0005195161,0.00083514815,0.00007778901,0.0000027270037],"category_scores_gemma":[0.00013425275,0.00020266959,0.00018267614,0.00026927542,0.000041497045,0.000755508,0.00022787823,0.0002421241,0.000017250202],"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.00019927911,0.0001270727,0.00007291389,0.00031114748,0.0002725692,0.000061345134,0.041663874,0.8551345,0.01673294,0.06559844,0.001019785,0.018806115],"study_design_scores_gemma":[0.0003009151,0.000505441,0.0000133791245,0.00030807982,0.000029227876,0.000090110836,0.0009694091,0.99536455,0.0007594937,0.0014038994,0.000045468336,0.00021001874],"about_ca_topic_score_codex":0.000025389041,"about_ca_topic_score_gemma":8.5348415e-7,"teacher_disagreement_score":0.86912787,"about_ca_system_score_codex":0.00008277182,"about_ca_system_score_gemma":0.00017358661,"threshold_uncertainty_score":0.8264626},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021948855,0.0005101974,0.9703193,0.0011488935,0.000099160075,0.0013094641,0.000086113025,0.0003845037,0.0041935267],"genre_scores_gemma":[0.39660904,0.000069031514,0.60226434,0.0000067789506,0.000025509196,0.00027734792,0.0002403908,0.000040292598,0.00046729858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99428463,0.002212149,0.001041206,0.00119196,0.0008221077,0.00044797506],"domain_scores_gemma":[0.99134004,0.0008069944,0.0014965228,0.0031584525,0.0029405146,0.00025747638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034209758,0.00043437435,0.0007644091,0.0002808313,0.00030404792,0.0003317113,0.0026285977,0.00029252592,0.00004493717],"category_scores_gemma":[0.0003235901,0.0004319045,0.00027809798,0.00092491653,0.00040482386,0.00031082932,0.0020968802,0.0005573211,0.00004374267],"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.0002084165,0.013908406,0.06611786,0.009974351,0.0025864537,0.000050335537,0.12147699,0.047930602,0.16644967,0.40421483,0.0014862719,0.16559581],"study_design_scores_gemma":[0.002501851,0.000008027212,0.031058365,0.005366362,0.00020171191,0.000060867867,0.000564918,0.9252286,0.03015595,0.00048635632,0.0029352987,0.0014317043],"about_ca_topic_score_codex":0.0016578486,"about_ca_topic_score_gemma":0.0008913417,"teacher_disagreement_score":0.877298,"about_ca_system_score_codex":0.00012447314,"about_ca_system_score_gemma":0.000840798,"threshold_uncertainty_score":0.99981326},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008944763,0.00013150096,0.9864567,0.00044629505,0.00091613753,0.0012138294,0.000030549098,0.00029385003,0.0015664102],"genre_scores_gemma":[0.64429116,0.0000037743214,0.35479096,0.00009077997,0.000035501158,0.000057621044,0.000053888227,0.000012297643,0.000664003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981187,0.0001781898,0.00044439812,0.00063479366,0.00029674242,0.00032718314],"domain_scores_gemma":[0.9941646,0.00037484735,0.00012079694,0.00492378,0.00030462135,0.00011135397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016199088,0.0001524731,0.00028467563,0.000055899633,0.00012633647,0.0003886395,0.0032173248,0.00010845933,0.000006399068],"category_scores_gemma":[0.00021711904,0.00013376102,0.00005467249,0.00016642986,0.000022515866,0.0011491118,0.0012637563,0.00012172382,0.00028444701],"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.0000021871351,0.000054484874,0.00021993024,0.00016752938,0.000021459613,7.360128e-7,0.00013121915,0.00006213497,0.0023252598,0.9958059,0.0006788358,0.00053031015],"study_design_scores_gemma":[0.00047581267,0.000029484929,0.00014373934,0.00007819426,0.000008196817,0.000018026492,0.0002638417,0.9951584,0.00070018944,0.0021378838,0.00079837313,0.0001878978],"about_ca_topic_score_codex":0.00124162,"about_ca_topic_score_gemma":0.00007777147,"teacher_disagreement_score":0.9950962,"about_ca_system_score_codex":0.00006003683,"about_ca_system_score_gemma":0.00007973276,"threshold_uncertainty_score":0.59786433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03754681,0.00004740001,0.96052843,0.00031265142,0.000106024105,0.0012726118,8.8362174e-7,0.00006106853,0.00012412928],"genre_scores_gemma":[0.7063994,0.0000034293193,0.2933597,0.000052581374,0.00001759719,0.00007299422,0.0000017718558,0.000004817024,0.00008773057],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992701,0.000028140063,0.00016348089,0.0002304346,0.00014678336,0.00016106338],"domain_scores_gemma":[0.9994014,0.00017677488,0.00006879061,0.00027779967,0.00004335123,0.000031904205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062033784,0.00007741625,0.000075222044,0.00003206499,0.00011390817,0.00018748839,0.00021153777,0.000021389193,0.000008013947],"category_scores_gemma":[0.00000438112,0.000051442228,0.000024924588,0.000069400194,0.000007057073,0.00049219484,0.000071965755,0.000027280346,0.00000909651],"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.00003991909,0.00007306615,0.0006429431,0.000078291014,0.00008339617,8.78947e-7,0.0029046237,0.1771758,0.061792,0.18708147,0.0009977813,0.5691298],"study_design_scores_gemma":[0.00071816985,0.00010399181,0.000088607,0.000007287876,0.0000066933617,0.0000032672808,0.00024941686,0.9889515,0.0077764997,0.0019903786,0.000033884568,0.000070325834],"about_ca_topic_score_codex":0.000088542845,"about_ca_topic_score_gemma":0.00001717338,"teacher_disagreement_score":0.8117757,"about_ca_system_score_codex":0.00003754012,"about_ca_system_score_gemma":0.00003891749,"threshold_uncertainty_score":0.20977531},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024955587,0.00084469985,0.9712015,0.00054742175,0.00041684927,0.00051927596,0.0000037101554,0.00068364776,0.0008273527],"genre_scores_gemma":[0.72398466,0.00006201431,0.27550375,0.000089863825,0.0002198459,0.000074900876,0.000002074614,0.000024549381,0.000038326474],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715036,0.00038418168,0.0006097546,0.0008647105,0.0005433745,0.000447629],"domain_scores_gemma":[0.99738586,0.00073321443,0.00049990625,0.0007387009,0.00023670065,0.0004056027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065388676,0.00026663896,0.00035589474,0.00007321194,0.000525784,0.0010363526,0.0008197215,0.000100844096,0.0000054593643],"category_scores_gemma":[0.0010093384,0.00025400217,0.000066635585,0.00062659377,0.00007703972,0.003928614,0.00037381685,0.00021061447,0.00014494275],"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.0003316812,0.00036973957,0.004035615,0.0022430762,0.00042616823,0.0013945706,0.3911473,0.033617456,0.48338467,0.057267275,0.0014012211,0.024381237],"study_design_scores_gemma":[0.0007888415,0.0003185003,0.00024525865,0.0010074622,0.00011983013,0.0018362295,0.083426714,0.89500767,0.008031091,0.00004539395,0.007632558,0.0015404756],"about_ca_topic_score_codex":0.0004788423,"about_ca_topic_score_gemma":3.939628e-7,"teacher_disagreement_score":0.8613902,"about_ca_system_score_codex":0.00014869422,"about_ca_system_score_gemma":0.00015698645,"threshold_uncertainty_score":0.99999124},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5826185,0.000009451764,0.41326988,0.00018595778,0.00011307931,0.0003897577,0.000004119151,0.00011691822,0.003292349],"genre_scores_gemma":[0.8155885,0.0000010385204,0.18318723,0.000031334184,0.000022017472,0.000022994378,0.000006474788,0.000009253123,0.0011311854],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997648,0.00016162734,0.0006885216,0.00076880376,0.0003520567,0.0003809673],"domain_scores_gemma":[0.9969666,0.0006462614,0.00025182054,0.0016060406,0.00038587072,0.00014339156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011905415,0.00020812736,0.00066663633,0.00026692185,0.000052207317,0.00014567538,0.0012334106,0.00013754734,0.00018511072],"category_scores_gemma":[0.00024086543,0.00016897888,0.0003917159,0.0012058964,0.000073795396,0.00053038663,0.00035288703,0.00011264338,0.0001774656],"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.00012506351,0.00082542206,0.81320924,0.00056562736,0.0017537306,0.0000040157915,0.0042184014,0.006074103,0.14492722,0.020433845,0.00067398633,0.007189319],"study_design_scores_gemma":[0.0004896116,0.00024770582,0.045534857,0.000028528928,0.00011169563,0.0000031792001,0.000111536,0.9422955,0.010095253,0.00072436215,0.00006835974,0.0002894213],"about_ca_topic_score_codex":0.00054908835,"about_ca_topic_score_gemma":0.00004542465,"teacher_disagreement_score":0.93622136,"about_ca_system_score_codex":0.000098932745,"about_ca_system_score_gemma":0.00016498851,"threshold_uncertainty_score":0.6890759},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015600661,0.00009794138,0.9940354,0.0013533662,0.000048311078,0.0009442319,0.000004974227,0.0002148936,0.0017407796],"genre_scores_gemma":[0.96193814,0.000017637103,0.03754564,0.00012636281,0.00014706707,0.00016852835,9.0399016e-7,0.000012678356,0.000043020118],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882513,0.00011708993,0.00029401112,0.0003782618,0.00018786674,0.00019766315],"domain_scores_gemma":[0.9986207,0.00067491346,0.00009354867,0.0003044305,0.0001375435,0.00016885296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031052352,0.00013253659,0.0002465366,0.00005158031,0.000115354116,0.00011193301,0.0002972721,0.000077017634,0.000005743714],"category_scores_gemma":[0.00018386889,0.00012310379,0.000045749788,0.00030692594,0.00008106492,0.00029444537,0.00003285308,0.00010334242,0.00014186437],"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.000022726625,0.0001640823,0.00023273834,0.00014667721,0.00003488491,0.00001470061,0.00051239575,0.0007549518,0.96139085,0.009795068,0.00038658883,0.026544323],"study_design_scores_gemma":[0.0009793037,0.0005399684,0.00075420656,0.00009208291,0.00003498936,0.00003887934,0.00001806488,0.95250493,0.041998785,0.0023175434,0.00036628576,0.0003549325],"about_ca_topic_score_codex":0.000022374421,"about_ca_topic_score_gemma":2.417326e-7,"teacher_disagreement_score":0.9603781,"about_ca_system_score_codex":0.000015776252,"about_ca_system_score_gemma":0.00006820599,"threshold_uncertainty_score":0.5020027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023780573,0.00037110518,0.96926,0.001250781,0.003935295,0.00066480914,0.000018741894,0.00007472733,0.00064399466],"genre_scores_gemma":[0.9729857,0.0000024841995,0.02493505,0.0002602475,0.0016568796,0.000042275755,0.000008008912,0.000031732216,0.00007761746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942612,0.0010932965,0.0018898748,0.0004070782,0.0020493953,0.0002991361],"domain_scores_gemma":[0.99454194,0.0006713633,0.0018717184,0.0005772754,0.0019490384,0.00038867583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029196849,0.00029391563,0.0006879811,0.00037371498,0.00009006586,0.00084584544,0.0033938254,0.0001329287,0.0000050528693],"category_scores_gemma":[0.0012797046,0.00020999541,0.00029338367,0.000674781,0.0000542238,0.0010847184,0.00024363802,0.0003431753,0.000014600331],"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.00014819889,0.0001375775,0.0002887628,0.00018756988,0.00029594722,0.000053544325,0.002191003,0.98433787,0.003175766,0.0050668498,0.0037350547,0.00038183542],"study_design_scores_gemma":[0.0009531461,0.00016588958,0.000056377077,0.0004918023,0.000031140964,0.00047590068,0.0011470541,0.9949145,0.0008235574,0.000018725916,0.0006936494,0.00022830818],"about_ca_topic_score_codex":0.0002694569,"about_ca_topic_score_gemma":0.0000018688777,"teacher_disagreement_score":0.94920516,"about_ca_system_score_codex":0.00019087539,"about_ca_system_score_gemma":0.0005784802,"threshold_uncertainty_score":0.8563365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41020924,0.00036165718,0.58842903,0.000676713,0.00014503513,0.000121464414,0.0000012864056,0.00003274573,0.00002281407],"genre_scores_gemma":[0.95754844,0.000024460993,0.04185808,0.00014732781,0.00040070832,0.000002195307,8.7687806e-7,0.000014813217,0.000003074971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874806,0.000043935917,0.0003941747,0.00025720536,0.00019208639,0.00036450624],"domain_scores_gemma":[0.9986872,0.0001312682,0.00014211597,0.00009764516,0.000102835606,0.00083892356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000228255,0.00017490759,0.0002876238,0.000253625,0.000109071705,0.00037063626,0.00027737403,0.00005661926,0.0000046992354],"category_scores_gemma":[0.00004147641,0.00016588456,0.00006372063,0.00033966018,0.000011396547,0.00047502609,0.000043502827,0.000292661,0.000004103176],"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.00010240334,0.00006601261,0.0072209043,0.00044866986,0.00086264306,0.0021628363,0.016104836,0.51291066,0.035879426,0.026366988,0.0014351245,0.39643946],"study_design_scores_gemma":[0.000511529,0.00055321207,0.0033397584,0.00015576182,0.000015487658,0.00024717613,0.000029527318,0.9934171,0.001145568,0.00004106378,0.00032333354,0.00022052582],"about_ca_topic_score_codex":0.00027213618,"about_ca_topic_score_gemma":0.000024657224,"teacher_disagreement_score":0.5473392,"about_ca_system_score_codex":0.00011320741,"about_ca_system_score_gemma":0.00026972697,"threshold_uncertainty_score":0.67645764},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08409137,0.024371637,0.8837611,0.0007389219,0.0015018794,0.004053205,0.0000031768138,0.0007664847,0.00071221666],"genre_scores_gemma":[0.45475677,0.06659606,0.4744942,0.001129803,0.0004243756,0.0019346362,0.00016080962,0.000079432066,0.0004239034],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996617,0.00009378524,0.00093450525,0.0005637371,0.0012896013,0.0005013439],"domain_scores_gemma":[0.9964434,0.00044673862,0.00047827073,0.001461873,0.001037418,0.00013229092],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0067217103,0.00029062608,0.00045616349,0.00056081003,0.00023391988,0.00018775383,0.0014631697,0.00010503907,0.000110655106],"category_scores_gemma":[0.0050741225,0.000277963,0.00015086772,0.0033211857,0.000013502577,0.0026352361,0.00022239178,0.00017260405,0.00036552115],"study_design_candidate":"design_other","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.0000030262077,0.000032162065,0.005221541,0.0032371318,0.000024594729,7.930852e-7,0.00007423842,0.0106454175,0.000064823806,0.00020826192,0.0017155515,0.97877246],"study_design_scores_gemma":[0.00049849506,0.000188335,0.014384925,0.0016049352,0.00007485923,0.000065903194,0.000002273378,0.95217437,0.00035001858,0.000029517225,0.030237652,0.000388749],"about_ca_topic_score_codex":0.0000021062585,"about_ca_topic_score_gemma":2.573233e-7,"teacher_disagreement_score":0.9783837,"about_ca_system_score_codex":0.00030773744,"about_ca_system_score_gemma":0.0003111901,"threshold_uncertainty_score":0.9999673},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004788926,0.000020137682,0.890117,0.007007528,0.00012513735,0.000054795364,5.8868245e-8,0.00035105416,0.097535394],"genre_scores_gemma":[0.8794042,4.4895833e-7,0.11786059,0.002174727,0.00009143032,0.0000021666015,1.1023417e-7,0.0000034592283,0.00046287282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941945,0.000019713467,0.00010343972,0.00020872851,0.00013272442,0.0001159321],"domain_scores_gemma":[0.9995797,0.000022363189,0.000021790613,0.00024888274,0.000020850079,0.00010636573],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008243999,0.000048652168,0.00006801617,0.000012705051,0.000025723195,0.00011635573,0.00048936607,0.000018895054,0.000079837875],"category_scores_gemma":[0.000028841407,0.000039354298,0.000027475096,0.00018404526,0.0000047204135,0.0003488078,0.00014700438,0.00004379459,0.0017195862],"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.0000054501843,0.000038441223,0.0033702087,0.000056416997,0.000046424124,0.00012458504,0.0051230895,0.0010765296,0.05611081,0.81254,0.075238846,0.046269186],"study_design_scores_gemma":[0.00041778805,0.00011637069,0.0014827527,0.000012149632,0.0000027817089,0.00004295589,0.00010394488,0.8960571,0.036734123,0.0014019519,0.06323419,0.00039388903],"about_ca_topic_score_codex":0.000018916682,"about_ca_topic_score_gemma":5.772473e-7,"teacher_disagreement_score":0.89498055,"about_ca_system_score_codex":0.000005707748,"about_ca_system_score_gemma":0.000020745878,"threshold_uncertainty_score":0.9990577},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06522652,0.00021034286,0.9248431,0.007852598,0.0006576272,0.00047042422,0.000009177724,0.0006522848,0.0000779328],"genre_scores_gemma":[0.9343846,0.0000058845817,0.064952396,0.00029002613,0.000029761695,0.0002185207,5.1900906e-7,0.000020657892,0.00009764058],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9984057,0.00015505492,0.00028563562,0.000554441,0.0001583647,0.0004408288],"domain_scores_gemma":[0.99836254,0.0002541026,0.00009648663,0.0010322998,0.00020978152,0.000044782122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002554078,0.00019937719,0.00024589337,0.00026528822,0.00053243485,0.00013017075,0.00067846774,0.00023864234,0.000013335336],"category_scores_gemma":[0.000044820426,0.00015543425,0.00021833977,0.0009118438,0.00012761839,0.00009186116,0.000009417048,0.0004597585,0.00002281271],"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.00008491525,0.0008542904,0.000026453705,0.0002453815,0.0012766494,0.021129752,0.0036454278,0.3624102,0.06723481,0.08665636,0.00053230923,0.45590347],"study_design_scores_gemma":[0.0017399208,0.00027868623,0.000022874734,0.00016751158,0.00013328253,0.041384656,0.0011531892,0.33425373,0.59680957,0.017780548,0.0056196586,0.0006563679],"about_ca_topic_score_codex":0.000021964777,"about_ca_topic_score_gemma":0.00007257483,"teacher_disagreement_score":0.8691581,"about_ca_system_score_codex":0.00008178983,"about_ca_system_score_gemma":0.000110806606,"threshold_uncertainty_score":0.6338424},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089942545,0.00033483785,0.8989612,0.0002304538,0.007031057,0.002462097,0.00007502166,0.0009245742,0.00003825146],"genre_scores_gemma":[0.88075763,0.0000035041814,0.11716057,0.000053640822,0.000763074,0.00047680197,0.00049789733,0.00010619227,0.00018069525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99385065,0.0008830032,0.0016084675,0.0020260965,0.0009067272,0.00072504487],"domain_scores_gemma":[0.9940795,0.0007542954,0.0010909393,0.002942715,0.00086912874,0.000263473],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016970744,0.00083110394,0.0010310838,0.0005731469,0.0009899853,0.0020223418,0.0014060028,0.0009095664,0.0000044315607],"category_scores_gemma":[0.00011903094,0.00093898247,0.00057643506,0.0007642466,0.00006051263,0.00059664604,0.000094326504,0.0008756285,0.000033461987],"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.000018381088,0.00021189166,0.0000059242802,0.0005734142,0.00020796017,0.00007234072,0.001174411,0.9824105,0.0075709205,0.00033494135,0.00029579215,0.0071235076],"study_design_scores_gemma":[0.00084352924,0.00010785756,0.000004025933,0.0011265639,0.000121341094,0.00035276392,0.00033143102,0.9867496,0.009328859,0.00012179965,0.000049576214,0.0008626461],"about_ca_topic_score_codex":0.00096319785,"about_ca_topic_score_gemma":0.00002131874,"teacher_disagreement_score":0.79081506,"about_ca_system_score_codex":0.0008760839,"about_ca_system_score_gemma":0.00056742306,"threshold_uncertainty_score":0.9993061},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02004353,0.0001985398,0.97653884,0.000109802655,0.00070171966,0.000961532,0.000022875853,0.0013533593,0.00006982269],"genre_scores_gemma":[0.510075,5.6675594e-7,0.48832518,0.000039647046,0.0002045472,0.0011226182,0.000035970195,0.000051117422,0.00014539922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971501,0.00014976307,0.00052098103,0.00074377033,0.0007704872,0.00066487055],"domain_scores_gemma":[0.99807155,0.00073628343,0.00014797834,0.0007074129,0.00009005465,0.00024672766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011424893,0.00030093433,0.0004321278,0.0001820768,0.00039156745,0.00026800964,0.0009808241,0.00009510026,0.000014228093],"category_scores_gemma":[0.000331659,0.00032146278,0.00019894534,0.0006344632,0.000017166747,0.00035555311,0.0004020407,0.00032032182,0.00001845042],"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.000009447601,0.000105740764,0.0011588023,0.00014798014,0.000033132816,0.000009175381,0.00022035028,0.99588364,0.0005837253,0.0003646215,0.0012877389,0.00019563352],"study_design_scores_gemma":[0.00051368645,0.00015938228,0.0010657546,0.00002627622,0.000012278238,0.000032670298,0.000028341894,0.992204,0.00007390445,0.000011162117,0.0054853167,0.00038720752],"about_ca_topic_score_codex":0.000049971473,"about_ca_topic_score_gemma":7.088641e-8,"teacher_disagreement_score":0.49003142,"about_ca_system_score_codex":0.00091921486,"about_ca_system_score_gemma":0.0002505371,"threshold_uncertainty_score":0.99992377},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026437933,0.00015524986,0.8992951,0.00006633691,0.001130807,0.0001861689,8.934545e-8,0.00045538667,0.07227293],"genre_scores_gemma":[0.9323263,0.0000015012344,0.06451616,0.00006754527,0.0001609992,0.0000051023553,4.964749e-7,0.00000952413,0.0029123423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839425,0.000089238674,0.000380012,0.00035674928,0.00039174705,0.00038800918],"domain_scores_gemma":[0.99875736,0.00017422008,0.0001082542,0.0006994757,0.00009733289,0.00016337304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019562044,0.00012687175,0.00017479976,0.00012606625,0.00009985777,0.00031669813,0.00071915984,0.00008634913,0.000017610753],"category_scores_gemma":[0.00005364917,0.000097379554,0.00005331071,0.00039340125,0.000013929015,0.00073167775,0.0001744769,0.00009783513,0.00061452336],"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.000024528083,0.000251656,0.008764074,0.00034946285,0.000113901915,0.0005401295,0.0043226313,0.0036638454,0.13483159,0.7010877,0.012590132,0.13346031],"study_design_scores_gemma":[0.00114865,0.00015792932,0.005642625,0.0004009174,0.000013155849,0.0006311121,0.002277429,0.9105485,0.061935235,0.001147984,0.014928741,0.0011676885],"about_ca_topic_score_codex":0.00014998225,"about_ca_topic_score_gemma":0.000011785045,"teacher_disagreement_score":0.9068847,"about_ca_system_score_codex":0.000058459562,"about_ca_system_score_gemma":0.00004655264,"threshold_uncertainty_score":0.7898659},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4824032,0.003469559,0.0026786046,0.10252247,0.003658187,0.0062147737,0.0002141561,0.025864605,0.37297446],"genre_scores_gemma":[0.8754967,0.00011757229,0.11852348,0.0042646285,0.00023935,0.00027020156,0.00004088207,0.00014185776,0.0009053308],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99063045,0.00088511576,0.0017090847,0.0028084773,0.0019468919,0.0020200063],"domain_scores_gemma":[0.9934006,0.0010151949,0.00045211698,0.0038037142,0.0003952634,0.00093310996],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0014014244,0.0012579046,0.0016487892,0.0003373546,0.00062947016,0.00068250165,0.0034518333,0.0011881891,0.0005858985],"category_scores_gemma":[0.0014161635,0.0010964205,0.0010559707,0.0023497913,0.000996356,0.0010765995,0.0016643096,0.002308027,0.00039603637],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"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.00011145118,0.00043684593,0.000039140585,0.000059699014,0.0000964859,0.0007686415,0.0002258364,0.000048730843,0.88073504,0.11051358,0.0023256252,0.004638921],"study_design_scores_gemma":[0.002211861,0.0011885999,0.8164833,0.0006845372,0.00007724059,0.0019221144,0.00030340013,6.454415e-7,0.0013200125,0.02870291,0.14526077,0.0018445799],"about_ca_topic_score_codex":0.00004923767,"about_ca_topic_score_gemma":0.021744102,"teacher_disagreement_score":0.87941504,"about_ca_system_score_codex":0.00056851836,"about_ca_system_score_gemma":0.0005819656,"threshold_uncertainty_score":0.9999937},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11835637,0.0017861355,0.68326354,0.09203086,0.003810192,0.0011402918,0.000018650657,0.0003598912,0.09923407],"genre_scores_gemma":[0.9157528,0.0004984689,0.053913858,0.0010101335,0.00022031531,0.00017972116,0.00014483121,0.0000953918,0.028184423],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.968325,0.025417479,0.0015156192,0.002312457,0.0013893908,0.0010400148],"domain_scores_gemma":[0.9780443,0.009242922,0.0016055681,0.00656834,0.004093982,0.00044490522],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.018777601,0.00092556176,0.0009933839,0.0003417265,0.0015799846,0.011808446,0.010229079,0.0005625514,0.00046486105],"category_scores_gemma":[0.003145151,0.00080765405,0.00062411546,0.0013422027,0.00077882817,0.0014408897,0.010881641,0.0021342805,0.0003652366],"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.00003458112,0.0014383321,0.002011863,0.00084688276,0.00065214094,0.00009610356,0.085935995,0.0060694157,0.0026858156,0.7788086,0.007165829,0.11425444],"study_design_scores_gemma":[0.0013426394,0.000003806552,0.0076676332,0.030700045,0.00017464109,0.00025223833,0.0021127323,0.82721674,0.08716421,0.008489723,0.032416943,0.0024586546],"about_ca_topic_score_codex":0.004739269,"about_ca_topic_score_gemma":0.0033151142,"teacher_disagreement_score":0.8211473,"about_ca_system_score_codex":0.00046249022,"about_ca_system_score_gemma":0.0011441665,"threshold_uncertainty_score":0.9997198},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077500995,0.00020124113,0.98519534,0.000010795969,0.00016640277,0.0010249707,9.255199e-7,0.00009121964,0.0055590016],"genre_scores_gemma":[0.030221554,0.000014867588,0.96604955,0.000036408455,0.00014382579,0.0007326163,0.00040484814,0.000023993243,0.00237233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849236,0.00001486782,0.00039018862,0.0005965901,0.0002550884,0.0002509046],"domain_scores_gemma":[0.999116,0.00007498443,0.0001887883,0.0004511188,0.000043313532,0.00012577871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048769853,0.00020453359,0.0001901348,0.00015819485,0.00022865641,0.00021261063,0.00048487954,0.00017160024,0.000011191408],"category_scores_gemma":[0.0000033383035,0.00020157504,0.000034404886,0.00008690221,0.000008568497,0.0002627917,0.000038982882,0.00008762611,0.000024360832],"study_design_candidate":"design_other","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.0000051847783,0.00005819695,0.000077194476,0.00022428887,0.000039748422,0.0000012569216,0.0023284343,0.00009761767,0.0011855151,0.030103276,0.00006229396,0.965817],"study_design_scores_gemma":[0.0014825218,0.00039595968,0.026573662,0.00053497305,0.00011600724,0.00005166083,0.003578279,0.09568005,0.07506986,0.003381223,0.7891706,0.0039651515],"about_ca_topic_score_codex":0.000024072204,"about_ca_topic_score_gemma":0.00009672096,"teacher_disagreement_score":0.96185184,"about_ca_system_score_codex":0.00009628361,"about_ca_system_score_gemma":0.00012018131,"threshold_uncertainty_score":0.82199913},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9033682,0.001272282,0.011347365,0.009514416,0.0014983346,0.00925702,0.00028664226,0.017310698,0.046145085],"genre_scores_gemma":[0.96706086,0.000028758077,0.0314887,0.00063169625,0.00015063286,0.0002734706,0.00009262947,0.00009954404,0.0001737111],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.993073,0.0010335391,0.001726991,0.0017883576,0.0011653815,0.0012127735],"domain_scores_gemma":[0.9949588,0.00065755687,0.0007118644,0.0025170352,0.0007750007,0.00037970048],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013201293,0.00080872903,0.0014669176,0.00029425326,0.000678913,0.0006439153,0.002776993,0.0007738616,0.00013563944],"category_scores_gemma":[0.00065693416,0.0007264974,0.000444116,0.0017881443,0.0005142163,0.0014219467,0.0010042867,0.0012076533,0.00005328113],"study_design_candidate":"observational","study_design_consensus":null,"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.0000551664,0.00021204223,0.000034159944,0.00007856653,0.00013620593,0.00008069496,0.000109955836,0.0029546102,0.90461427,0.09073161,0.00031333236,0.0006794013],"study_design_scores_gemma":[0.006277306,0.002913436,0.94403404,0.0019055074,0.00055029686,0.0026028526,0.0008229616,0.0017231554,0.020315018,0.003807423,0.011882769,0.003165222],"about_ca_topic_score_codex":0.0005085479,"about_ca_topic_score_gemma":0.035406783,"teacher_disagreement_score":0.9439999,"about_ca_system_score_codex":0.0007308397,"about_ca_system_score_gemma":0.0010807702,"threshold_uncertainty_score":0.99951863},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20266707,0.00026446712,0.793223,0.00013539768,0.0008238299,0.0003692842,0.000016296826,0.0003909166,0.0021097008],"genre_scores_gemma":[0.97979987,0.000010216048,0.017282918,0.00019368129,0.00038951164,0.00024077429,0.000027931601,0.00006223144,0.0019928697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963038,0.00030517715,0.0007273988,0.0011807531,0.00071472954,0.00076814165],"domain_scores_gemma":[0.99676824,0.00018339539,0.00030999494,0.0019170608,0.00047480848,0.00034650016],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00086611207,0.0003503111,0.00055445323,0.00018380833,0.00050368265,0.0030124108,0.0025079015,0.00019233768,0.000008744265],"category_scores_gemma":[0.000035312776,0.00034250293,0.00019031057,0.00064140465,0.00005922956,0.0011423867,0.0002868844,0.00014337988,0.000033690427],"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.000023845038,0.00017666371,0.000029983468,0.000113182716,0.000048215512,0.00010062205,0.0013729752,0.9585524,0.025368484,0.011378255,0.0015761284,0.001259218],"study_design_scores_gemma":[0.0005331402,0.000050347167,0.000020002879,0.000118094475,0.000019874362,0.00013905486,0.00007498512,0.9914169,0.005725446,0.00031314077,0.0011608851,0.0004281437],"about_ca_topic_score_codex":0.000609969,"about_ca_topic_score_gemma":0.000037187074,"teacher_disagreement_score":0.7771328,"about_ca_system_score_codex":0.00019683958,"about_ca_system_score_gemma":0.0005769613,"threshold_uncertainty_score":0.9999027},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26302296,0.002431473,0.73171467,0.00025846754,0.0020070919,0.0004200091,0.000008224418,0.00006737236,0.00006969436],"genre_scores_gemma":[0.78952,0.000040270115,0.20951091,0.000043747772,0.00070316275,0.000033437034,0.000009064262,0.0000355639,0.00010380601],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996329,0.00063781784,0.0014597503,0.00042268488,0.00068353507,0.00046720295],"domain_scores_gemma":[0.99432653,0.00068394316,0.0016036768,0.0018168672,0.0012836519,0.00028530508],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022434627,0.00032422968,0.00087657606,0.00034667083,0.00029604882,0.00090162404,0.0020957708,0.00028172127,0.0000038028688],"category_scores_gemma":[0.00037602865,0.00025930302,0.0002160349,0.0006644067,0.000050264985,0.0010388527,0.00018912657,0.0008423425,0.000008510524],"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.00020601567,0.0005055468,0.004319403,0.0032163733,0.00087645015,0.00022708939,0.013828377,0.8388704,0.04008971,0.074238636,0.0011581758,0.022463832],"study_design_scores_gemma":[0.002141132,0.0010723852,0.001817018,0.008863374,0.00014607403,0.005808287,0.0038728854,0.96129674,0.0060195248,0.004927028,0.003079594,0.0009559781],"about_ca_topic_score_codex":0.00009514126,"about_ca_topic_score_gemma":0.000011116458,"teacher_disagreement_score":0.52649707,"about_ca_system_score_codex":0.00017823275,"about_ca_system_score_gemma":0.00031040667,"threshold_uncertainty_score":0.99998593},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06389887,0.00072426954,0.91058135,0.0007278842,0.0010947429,0.00042315462,0.0000042137676,0.00028709375,0.022258436],"genre_scores_gemma":[0.79236984,0.0000040605955,0.19836274,0.00008531601,0.0013508599,0.00011829597,0.0000091497195,0.000026002363,0.0076737353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984284,0.000120643264,0.00027063666,0.00052497326,0.00030829784,0.00034705756],"domain_scores_gemma":[0.9985968,0.00026133147,0.00007220787,0.00082918175,0.000119551274,0.00012094138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035054647,0.00014828493,0.00030378255,0.00005370275,0.00009091795,0.0005051244,0.00055224245,0.00006007822,0.0000105859735],"category_scores_gemma":[0.000023101515,0.00012750509,0.00015780942,0.0003806918,0.000017582619,0.00034341333,0.0001622089,0.00008829933,0.00022175453],"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.0000062523955,0.0001396624,0.000033254182,0.00011477023,0.00004353872,0.00024862075,0.0025063804,0.0001704223,0.085125126,0.8979823,0.008015795,0.005613908],"study_design_scores_gemma":[0.0061666886,0.0004779633,0.0004520988,0.0005187785,0.0000378331,0.0016251141,0.01157543,0.2956566,0.18905891,0.014369442,0.47766092,0.0024001996],"about_ca_topic_score_codex":0.000053582313,"about_ca_topic_score_gemma":0.000006979477,"teacher_disagreement_score":0.8836128,"about_ca_system_score_codex":0.000059903028,"about_ca_system_score_gemma":0.000091233705,"threshold_uncertainty_score":0.5199507},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4015367,0.000049159487,0.5978951,0.000057797744,0.000097396594,0.000025263991,1.3742489e-7,0.000025488613,0.0003129603],"genre_scores_gemma":[0.8689501,0.0000017089862,0.13098715,0.000013454515,0.000016120615,5.391506e-7,2.9831855e-7,0.000003526504,0.000027073564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929476,0.000055601486,0.00023354522,0.00020923978,0.00011594198,0.000090908215],"domain_scores_gemma":[0.9994407,0.0000894346,0.000042495245,0.00023590715,0.00015069486,0.00004073359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001398935,0.0000596679,0.00011154776,0.000076411096,0.000047813613,0.00009184233,0.00011171319,0.000030168934,0.000010181655],"category_scores_gemma":[0.000055185006,0.00005725823,0.000033502878,0.00025398127,0.000012563154,0.0005709006,0.00017039254,0.00007950742,0.000002232709],"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":[9.1143846e-7,0.000011400947,0.00015365709,0.000010765431,0.000008778879,0.0000016577494,0.00033651054,0.96583307,0.030301202,0.0022119845,6.98434e-7,0.0011293922],"study_design_scores_gemma":[0.00007334019,0.0000061867586,0.000044814693,0.000050637896,0.000003930596,0.000030806907,0.00012799076,0.99192375,0.0070028813,0.0006719306,0.000006713195,0.000057010486],"about_ca_topic_score_codex":0.0001472229,"about_ca_topic_score_gemma":0.000022317732,"teacher_disagreement_score":0.46741343,"about_ca_system_score_codex":0.000014747548,"about_ca_system_score_gemma":0.000032091066,"threshold_uncertainty_score":0.23349229},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09271748,0.0027044062,0.8955155,0.0059408075,0.0008153857,0.00074499915,0.0000048553675,0.00009220358,0.0014643403],"genre_scores_gemma":[0.9640029,0.0000058060996,0.035330754,0.00017827697,0.00008110614,0.00011347465,3.957298e-7,0.000009015673,0.00027827642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975983,0.0005396591,0.00063992344,0.00054080435,0.00029654216,0.00038475863],"domain_scores_gemma":[0.99304837,0.005292925,0.00009638874,0.0009927814,0.00045934736,0.00011018011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017651324,0.00015173503,0.0003445774,0.000058100773,0.00010521337,0.0002563416,0.0008338477,0.00010879478,0.00001692642],"category_scores_gemma":[0.0033281285,0.00010480223,0.00010659486,0.00066396245,0.000117909316,0.0005745727,0.00032894345,0.00018647363,0.00001980775],"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.00008351101,0.00091461337,0.034451988,0.0042713988,0.00017138994,0.014636678,0.014707298,0.007827325,0.019590545,0.87293833,0.014508329,0.015898598],"study_design_scores_gemma":[0.00085800415,0.00027352982,0.0018297251,0.001697387,0.000043841883,0.010708419,0.0060597532,0.9585562,0.015150287,0.0033538754,0.00082753366,0.000641453],"about_ca_topic_score_codex":0.0013409528,"about_ca_topic_score_gemma":0.00042264973,"teacher_disagreement_score":0.9507289,"about_ca_system_score_codex":0.00008142013,"about_ca_system_score_gemma":0.0004372753,"threshold_uncertainty_score":0.4273711},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004967809,0.0002187109,0.97950286,0.00410869,0.00039073554,0.0003322631,0.0000049372507,0.00030022475,0.010173757],"genre_scores_gemma":[0.22631253,0.000004456679,0.7700353,0.00088217657,0.00019056194,0.000040964955,0.000009149076,0.000018757111,0.0025060505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99841166,0.00011942918,0.00028759855,0.00051103544,0.0002391942,0.00043109685],"domain_scores_gemma":[0.9986644,0.00029430998,0.000064836524,0.0007229059,0.000113025715,0.00014054964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026409037,0.0001618364,0.00024249917,0.00006494121,0.0001311991,0.00023275107,0.0006235728,0.00006795056,0.00006216064],"category_scores_gemma":[0.0001720063,0.00012969796,0.00018651944,0.00031616946,0.000021664047,0.00008756906,0.00019800694,0.00012516235,0.000026752261],"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.00014801946,0.00021099849,0.0004907488,0.00034918048,0.00029958333,0.00017960636,0.00477286,0.022338945,0.07405389,0.57576394,0.006948603,0.31444362],"study_design_scores_gemma":[0.0079024695,0.00027860934,0.0048835725,0.00028579286,0.000056130004,0.0016539928,0.00032008407,0.15274762,0.25583532,0.1444918,0.4294891,0.0020554874],"about_ca_topic_score_codex":0.00003138938,"about_ca_topic_score_gemma":0.00006472073,"teacher_disagreement_score":0.43127215,"about_ca_system_score_codex":0.00003106163,"about_ca_system_score_gemma":0.00016313815,"threshold_uncertainty_score":0.52889293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002827676,0.00006816697,0.99849665,0.00006760149,0.000064848275,0.00018612482,0.000004004642,0.00023101142,0.0005988089],"genre_scores_gemma":[0.27222553,0.000027000531,0.725503,0.000030778694,0.00003994891,0.00005663231,0.0000343164,0.000014496843,0.002068273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983442,0.00021063232,0.00033933815,0.00062598364,0.00023127554,0.00024858117],"domain_scores_gemma":[0.9984646,0.00014930281,0.00012118506,0.00074336614,0.00036335757,0.00015818627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005378003,0.00015469617,0.00033677026,0.00020355934,0.00014223495,0.000655167,0.00034874125,0.000096712916,0.000008878073],"category_scores_gemma":[0.00001792948,0.00014401018,0.00008658145,0.0008600619,0.000012449104,0.0008917881,0.00008268725,0.000028622815,0.0000027090555],"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.0000026179055,0.000020279305,0.000034257686,0.000016481574,0.00010753724,0.0000037377974,0.00014173838,0.989327,0.0021144317,0.007649076,0.00009198356,0.0004908578],"study_design_scores_gemma":[0.00017032646,0.000031788248,0.000008296798,0.000012019618,0.000093003364,0.000012716474,0.000050092836,0.99812233,0.0011164054,0.00019548496,0.000003883109,0.00018366284],"about_ca_topic_score_codex":0.00033201955,"about_ca_topic_score_gemma":0.000020565718,"teacher_disagreement_score":0.27299365,"about_ca_system_score_codex":0.000044210825,"about_ca_system_score_gemma":0.00014027068,"threshold_uncertainty_score":0.631779},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37894207,0.000017324113,0.6204069,0.00006252597,0.00019716822,0.0001626349,0.0000049352475,0.00009708272,0.00010935972],"genre_scores_gemma":[0.9904904,0.0000017876101,0.008213603,0.000045259978,0.00010949642,0.0000024645017,0.00007479505,0.0000129779955,0.0010492409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987469,0.00014289797,0.00017758946,0.0006108436,0.000085941334,0.00023585456],"domain_scores_gemma":[0.9988657,0.00009738373,0.00014012615,0.00049679726,0.00028720032,0.0001127436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026072183,0.00014967442,0.00015634055,0.000113182236,0.00026992123,0.00014367692,0.00025027487,0.00011914245,0.000009107032],"category_scores_gemma":[0.00004444957,0.00018205584,0.000104925304,0.0007037606,0.000032790358,0.00087203266,0.00006359127,0.0000746668,0.00005197915],"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.00004921789,0.0002383295,0.0018155043,0.00008040857,0.00008555827,0.0015704228,0.0002911048,0.7147615,0.11309065,0.16425827,0.0019312972,0.001827725],"study_design_scores_gemma":[0.00058783847,0.00003272663,0.000057954065,0.00001953474,0.000024403065,0.00004715591,0.000041929427,0.97037625,0.027357526,0.0010969657,0.0001471546,0.00021054094],"about_ca_topic_score_codex":0.000113871676,"about_ca_topic_score_gemma":0.000025387706,"teacher_disagreement_score":0.6121933,"about_ca_system_score_codex":0.00019948812,"about_ca_system_score_gemma":0.00014682984,"threshold_uncertainty_score":0.74240214},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82709455,0.00007230383,0.17089653,0.000531495,0.00014941485,0.0003250963,0.000005695024,0.00008353471,0.00084135483],"genre_scores_gemma":[0.94950277,0.0000033299832,0.050238755,0.00006543061,0.00008309481,0.000015981093,0.000017872839,0.0000046788937,0.000068090354],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982361,0.00018400785,0.0005329161,0.00054558244,0.00024911202,0.00025224584],"domain_scores_gemma":[0.99898696,0.00019030797,0.00010923344,0.00044600712,0.00018821277,0.00007929622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013069205,0.00014334204,0.0003592634,0.00014138421,0.00013800443,0.0004125463,0.000263546,0.0001190388,0.000027934131],"category_scores_gemma":[0.00037701125,0.0001308966,0.000094256124,0.0011757119,0.000019540037,0.0010109232,0.00018181227,0.00018684684,0.0000032273692],"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.00005675851,0.00048145486,0.5484055,0.00043232873,0.00048255292,0.00004335468,0.017010128,0.29965815,0.01111641,0.017154736,0.0001707717,0.104987815],"study_design_scores_gemma":[0.00079651247,0.000023786917,0.007234327,0.000019498664,0.000020636135,0.0000098856335,0.00020405845,0.9874427,0.0038153434,0.0002331341,0.000048376267,0.00015174037],"about_ca_topic_score_codex":0.00070058246,"about_ca_topic_score_gemma":0.00071759475,"teacher_disagreement_score":0.68778455,"about_ca_system_score_codex":0.00008521402,"about_ca_system_score_gemma":0.00011720126,"threshold_uncertainty_score":0.5337809},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015016744,0.0005771414,0.9969101,0.000057740122,0.0001332461,0.00036843063,0.000011963995,0.00041223018,0.000027492975],"genre_scores_gemma":[0.16475695,0.00003851185,0.83406484,0.00002970241,0.00006903873,0.00022350533,0.00011098099,0.00004005301,0.0006664055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722916,0.00038579048,0.0005571609,0.00097571133,0.0003754313,0.00047677508],"domain_scores_gemma":[0.9978045,0.0003116887,0.00023114332,0.0010154406,0.0004179203,0.00021929033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071293116,0.0002843687,0.0005861411,0.00038387792,0.00017717853,0.0006799296,0.0005392026,0.0002017387,0.000008401601],"category_scores_gemma":[0.00009391946,0.00029515545,0.00013755103,0.001902398,0.000035297406,0.0010250397,0.00017032839,0.00009203842,0.0000033424217],"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.000017788036,0.000051277493,0.0007807231,0.000049259328,0.00012327524,0.00003105335,0.0009900817,0.9946276,0.000047378864,0.00042916197,0.0001718148,0.0026805971],"study_design_scores_gemma":[0.00040404967,0.00003818938,0.00008868875,0.00010225779,0.00009660833,0.000014047149,0.00011303705,0.9983818,0.00014326767,0.0002809261,0.000006570579,0.000330568],"about_ca_topic_score_codex":0.00007871232,"about_ca_topic_score_gemma":0.000023862134,"teacher_disagreement_score":0.16325529,"about_ca_system_score_codex":0.00010627542,"about_ca_system_score_gemma":0.00023210606,"threshold_uncertainty_score":0.99995005},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012483745,0.00022712006,0.9826062,0.0004580212,0.00052992185,0.0011581294,0.0000016332458,0.00032044132,0.013450214],"genre_scores_gemma":[0.22358122,0.000021213169,0.77430624,0.00030066175,0.0006230174,0.000044063785,0.0000062413733,0.000079314814,0.0010380059],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99398065,0.000101217745,0.0008603822,0.0024144985,0.0014776887,0.001165539],"domain_scores_gemma":[0.99631506,0.0006667927,0.0006075318,0.001801584,0.0003413896,0.0002676368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017095705,0.0008191442,0.0010020457,0.0012817025,0.00019058022,0.0008714827,0.0035785334,0.00046834964,0.000012605833],"category_scores_gemma":[0.00009453145,0.0006970156,0.00012771013,0.0012107743,0.0006547587,0.0015134383,0.0010324268,0.0012401342,0.0001374439],"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.000038134836,0.00008818801,0.00033038773,0.000060636405,0.000033809192,0.00063961704,0.0036556069,0.031066805,0.001639631,0.009479873,0.0000075790394,0.9529597],"study_design_scores_gemma":[0.0027547025,0.0014330026,0.0029705341,0.004029781,0.000036893092,0.0009554398,0.0000031864533,0.9475073,0.0031067675,0.029756878,0.003156984,0.00428852],"about_ca_topic_score_codex":0.00028603995,"about_ca_topic_score_gemma":0.0003671251,"teacher_disagreement_score":0.9486712,"about_ca_system_score_codex":0.0009509476,"about_ca_system_score_gemma":0.0010458062,"threshold_uncertainty_score":0.9995481},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019923606,0.00008364844,0.92101854,0.000074413634,0.000044786477,0.07633357,0.00017023696,0.00024984212,0.0020050271],"genre_scores_gemma":[0.04639585,0.000050713283,0.23564039,0.00014745122,0.00094313733,0.70454764,0.0018491733,0.00015837396,0.010267262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744695,0.000040424853,0.00084185734,0.0009923113,0.00030136495,0.00037709947],"domain_scores_gemma":[0.99750525,0.00014731145,0.0008327112,0.0009214809,0.00042864346,0.00016462563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069786434,0.00041862737,0.0006345807,0.0003148085,0.0010052857,0.0005430799,0.00042226646,0.00030820398,0.0000034866036],"category_scores_gemma":[0.00000483687,0.0004201378,0.00012987175,0.0004708224,0.00006778536,0.00025180297,0.00013345381,0.00021095299,0.000009241726],"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.000015445275,0.0001777147,0.0010052378,0.004304178,0.0004488733,5.2015713e-7,0.00011712223,0.33266243,0.000038162598,0.6474549,0.0010362372,0.012739144],"study_design_scores_gemma":[0.00070488575,0.000041709,0.0001088749,0.00024349493,0.00015403841,0.00001003261,0.0000064115443,0.8353406,0.000012754313,0.00014666341,0.1628406,0.00038989782],"about_ca_topic_score_codex":0.000015638383,"about_ca_topic_score_gemma":0.0000047204144,"teacher_disagreement_score":0.68537813,"about_ca_system_score_codex":0.00013380093,"about_ca_system_score_gemma":0.00012172946,"threshold_uncertainty_score":0.99982506},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010374532,0.00010317301,0.29656476,0.00004517632,0.00025484516,0.0002929179,0.00001279932,0.0002679002,0.70244807],"genre_scores_gemma":[0.36294043,0.0000042282954,0.12714028,0.0001344428,0.00021148364,0.000034093246,0.000019930822,0.000114550254,0.50940055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99775773,0.00004858238,0.0006511646,0.0007019205,0.0005502103,0.00029037538],"domain_scores_gemma":[0.9971166,0.00009613024,0.00060043606,0.0017896518,0.0002449297,0.00015222619],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000319345,0.00041678498,0.00069724943,0.0003174542,0.000044711167,0.00006341685,0.0017737279,0.00042303445,0.00011045255],"category_scores_gemma":[0.000012259317,0.00033485508,0.00019650122,0.00006173259,0.00006895752,0.000072520794,0.00023365363,0.00040890128,0.0001978013],"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.0000043167156,0.00000571974,0.0000041195262,0.0005742068,0.000045785568,0.000036924892,0.0001985079,0.00007221482,0.00009142536,0.9921985,0.0001371504,0.0066311094],"study_design_scores_gemma":[0.008114146,0.0061261193,0.0006196802,0.07228507,0.0011617845,0.0027651205,0.00027751506,0.10919844,0.039161906,0.32173434,0.4190285,0.019527357],"about_ca_topic_score_codex":0.00073838764,"about_ca_topic_score_gemma":0.00018922401,"teacher_disagreement_score":0.67046416,"about_ca_system_score_codex":0.00010945549,"about_ca_system_score_gemma":0.000455796,"threshold_uncertainty_score":0.99991035},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8718101,0.000050983264,0.1260356,0.00040251983,0.000089709465,0.00039471796,0.0000026331377,0.0001665178,0.0010472396],"genre_scores_gemma":[0.79114574,0.000028463093,0.20683683,0.000036340145,0.000028819613,0.0000016794204,0.000022495726,0.000018947676,0.0018806572],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99755335,0.0002531953,0.0004474238,0.0006585982,0.0006984441,0.00038901906],"domain_scores_gemma":[0.99754244,0.00014022639,0.00065347453,0.0010056327,0.0004059844,0.00025223033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012114401,0.0002482456,0.00041972534,0.00040081266,0.0003528528,0.000055068336,0.001565328,0.00047174102,0.000070727154],"category_scores_gemma":[0.0000817161,0.0003125694,0.00014193116,0.0011079892,0.00017476639,0.0018452763,0.00054997083,0.00043639267,0.00040567535],"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.00012812567,0.00019720236,0.56116396,0.00019662635,0.00019634805,0.00003904442,0.012345345,0.00047137658,0.40415344,0.005575088,0.00015354058,0.015379892],"study_design_scores_gemma":[0.0016249809,0.000089552945,0.9466908,0.00030828326,0.00004412052,0.00003434981,0.00059184874,0.005756007,0.040534154,0.00068814546,0.0030084106,0.0006293758],"about_ca_topic_score_codex":0.00019437967,"about_ca_topic_score_gemma":0.00009837451,"teacher_disagreement_score":0.38552678,"about_ca_system_score_codex":0.0002379308,"about_ca_system_score_gemma":0.00023538037,"threshold_uncertainty_score":0.99993265},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100134276,0.00037312633,0.06998927,0.79070705,0.019375626,0.0019523961,0.00082719605,0.00014467587,0.016496383],"genre_scores_gemma":[0.98291147,0.00015512286,0.011707818,0.0019781569,0.0014878287,0.000069722824,0.00009920086,0.000051118193,0.0015395402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99083024,0.00028245023,0.0025696168,0.001019094,0.0046026255,0.0006959907],"domain_scores_gemma":[0.99459654,0.0011652948,0.001910375,0.0009011654,0.0011973222,0.00022927519],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0026551844,0.0007547258,0.0008703076,0.0002881457,0.0006733914,0.0008012536,0.010834124,0.00031335,0.00025573277],"category_scores_gemma":[0.0012024567,0.0004426939,0.0007353685,0.00033221603,0.004423303,0.0018325404,0.0034213199,0.0014393404,0.000029502948],"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.00061222,0.00041678615,0.0005259276,0.000022192966,0.0015996587,0.000004533856,0.00033516507,0.02568212,0.0014482928,0.96722573,0.0011997138,0.00092764053],"study_design_scores_gemma":[0.02362752,0.00062878296,0.022161435,0.0021978782,0.0006444448,0.0006759445,0.0018371238,0.2252694,0.06872114,0.5044836,0.14785302,0.0018997474],"about_ca_topic_score_codex":0.001077117,"about_ca_topic_score_gemma":0.00035066876,"teacher_disagreement_score":0.8827772,"about_ca_system_score_codex":0.0006071137,"about_ca_system_score_gemma":0.0004041661,"threshold_uncertainty_score":0.9998025},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3120721,0.0012718416,0.68461007,0.00044583163,0.0006849593,0.0005519281,0.00014301129,0.00006485943,0.00015542215],"genre_scores_gemma":[0.86052096,0.000023293913,0.13911957,0.00007842778,0.000025423264,0.000050023584,0.00011031534,0.000015990323,0.000055973516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983529,0.00009342843,0.0004351336,0.00047082998,0.00034250214,0.00030524674],"domain_scores_gemma":[0.999001,0.00026833604,0.00022818122,0.00038480182,0.000061751954,0.000055926717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084183924,0.00017690251,0.00039609565,0.00006206077,0.000283264,0.00006601674,0.00065389666,0.00013940937,0.0000012401607],"category_scores_gemma":[0.00003317272,0.0001739335,0.00020637417,0.0003976763,0.000056976107,0.0002368705,0.0005277068,0.00084289885,1.1696854e-7],"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.000117281976,0.00096454436,0.12274579,0.0014184143,0.00052964553,0.000028401548,0.07501122,0.14969997,0.004657388,0.54418427,0.0005425851,0.10010048],"study_design_scores_gemma":[0.00079540216,0.00006417173,0.0015969673,0.000028124201,0.000009461658,0.0000062443246,0.0038457287,0.99030447,0.00003353763,0.0030621463,0.000063579166,0.00019018301],"about_ca_topic_score_codex":0.00013806835,"about_ca_topic_score_gemma":0.00017024932,"teacher_disagreement_score":0.8406045,"about_ca_system_score_codex":0.00027302123,"about_ca_system_score_gemma":0.00005484689,"threshold_uncertainty_score":0.70928025},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024833904,0.0003621946,0.014281667,0.00013342612,0.00076501456,0.00071302446,0.0000035740889,0.00062565325,0.98309064],"genre_scores_gemma":[0.0014648966,0.000123236,0.024282245,0.00004380458,0.00065496884,0.000029297347,0.00001199037,0.000090656125,0.9732989],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99639463,0.00009403958,0.0010947945,0.0010983328,0.00075649127,0.00056171604],"domain_scores_gemma":[0.99714214,0.00021106013,0.00044379174,0.0018603163,0.00013409696,0.00020858289],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010691971,0.00058470137,0.0009619159,0.0005749803,0.000055304972,0.00046451206,0.0017889984,0.0006428765,0.00040297763],"category_scores_gemma":[0.000022137872,0.0005461918,0.00020449613,0.00011562234,0.00004208867,0.0006170956,0.0004461829,0.0004628386,0.0076630707],"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.0000037008692,0.000019578694,0.000004833922,0.0001193789,0.000060634695,0.00022713061,0.00030277882,0.0010178812,0.0005193177,0.9849123,0.007750492,0.0050619915],"study_design_scores_gemma":[0.0019803944,0.00026339613,0.00006988037,0.0047109826,0.00006809681,0.00091838295,0.00007158121,0.63733774,0.00024527236,0.013926755,0.3352334,0.0051741186],"about_ca_topic_score_codex":0.00049279735,"about_ca_topic_score_gemma":0.000050561033,"teacher_disagreement_score":0.97098553,"about_ca_system_score_codex":0.00037181342,"about_ca_system_score_gemma":0.00025551455,"threshold_uncertainty_score":0.99969894},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052757695,0.00025767344,0.9301266,0.00067946216,0.008307809,0.0043044128,0.00069870456,0.0013340832,0.001533544],"genre_scores_gemma":[0.9938992,0.000012859729,0.001075616,0.000027677508,0.0011618288,0.002833975,0.000025351967,0.000105865875,0.0008575947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99414957,0.00092085137,0.0011051391,0.0013556106,0.0014214405,0.0010473632],"domain_scores_gemma":[0.99459505,0.0017882872,0.00048504188,0.0023799671,0.00031888604,0.00043278004],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001284327,0.0006130637,0.0011598369,0.0003089023,0.0018530115,0.0006415834,0.0024549153,0.0001850286,0.00001565763],"category_scores_gemma":[0.000044927943,0.00062506535,0.0005935684,0.001026069,0.00006734336,0.0009298431,0.000092344766,0.00077070313,0.00020067388],"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.0004997679,0.0020673003,0.00014433269,0.0010016744,0.0013794494,0.00014678432,0.006426388,0.92868835,0.018710786,0.027394673,0.0014356072,0.012104878],"study_design_scores_gemma":[0.003513209,0.0011806831,0.000094346564,0.00030427086,0.00024578074,0.00031242316,0.002340356,0.9828669,0.0009893728,0.0010214833,0.005761955,0.0013692331],"about_ca_topic_score_codex":0.0019536314,"about_ca_topic_score_gemma":0.0000062767285,"teacher_disagreement_score":0.94114155,"about_ca_system_score_codex":0.0009442974,"about_ca_system_score_gemma":0.0002130818,"threshold_uncertainty_score":0.9996201},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020792685,0.0000638661,0.9752546,0.00055815757,0.00086151325,0.0017187225,0.00009118609,0.0002643798,0.00039488755],"genre_scores_gemma":[0.86472034,0.0000022484205,0.13426808,0.00002749485,0.00004902498,0.0006641416,0.0000038505705,0.000020920408,0.00024392463],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997269,0.00006564418,0.0009400559,0.0005379312,0.0007670313,0.0004203504],"domain_scores_gemma":[0.99686235,0.00054227764,0.0007644544,0.0005354649,0.0011870484,0.000108405555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021936398,0.00022429517,0.00042591037,0.00019094415,0.0005706127,0.00024524468,0.0027001242,0.000085550215,0.000016884747],"category_scores_gemma":[0.0017891254,0.00019985714,0.00013984456,0.00069309137,0.000117525255,0.0010317676,0.00075785565,0.000245315,0.0000048879087],"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.00012799668,0.0005853,0.0050160796,0.002995819,0.0002028629,0.0000012442379,0.008663551,0.058265176,0.2980146,0.62023884,0.0042000795,0.0016884357],"study_design_scores_gemma":[0.0005716731,0.000147142,0.001079241,0.0003467032,0.00003973933,0.000036579433,0.00059678283,0.9623318,0.02893198,0.0055828136,0.00012157791,0.00021402394],"about_ca_topic_score_codex":0.0000632262,"about_ca_topic_score_gemma":0.0000013759185,"teacher_disagreement_score":0.90406656,"about_ca_system_score_codex":0.00016252826,"about_ca_system_score_gemma":0.00030983827,"threshold_uncertainty_score":0.81499374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009529216,0.000113347385,0.9874472,0.00024304414,0.00027719457,0.0019101204,0.000023011578,0.00013372465,0.0003231427],"genre_scores_gemma":[0.8758041,0.0000039771917,0.12268958,0.000020210353,0.00006350869,0.0012846561,0.00006541893,0.000009854003,0.00005864671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985874,0.00013000148,0.00038563562,0.00040441373,0.00019874476,0.00029377325],"domain_scores_gemma":[0.99868333,0.00038026556,0.000226494,0.0005068812,0.00010749311,0.00009551166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005755679,0.00015243488,0.00020355608,0.00011657234,0.00016764966,0.0005496666,0.00040773864,0.00007921983,0.000010521735],"category_scores_gemma":[0.00022910576,0.00014328274,0.000026695983,0.0002528892,0.000026769561,0.0009762457,0.00017595188,0.00009585403,0.000014827674],"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.000026173053,0.00023244544,0.041383065,0.00044282665,0.000083374274,0.000007810936,0.0007872823,0.93684584,0.0059095467,0.010214923,0.0024282304,0.0016384958],"study_design_scores_gemma":[0.0008248541,0.00014633128,0.004465875,0.00019039103,0.00001672502,0.000014477829,0.0003198676,0.9926447,0.00046764375,0.00028536303,0.00036178582,0.0002619305],"about_ca_topic_score_codex":0.0006971086,"about_ca_topic_score_gemma":0.00005568544,"teacher_disagreement_score":0.86627495,"about_ca_system_score_codex":0.000107784006,"about_ca_system_score_gemma":0.0000460055,"threshold_uncertainty_score":0.58429},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017644545,0.000047731126,0.97793204,0.0005938834,0.00012290361,0.002199588,0.00018165611,0.0007088229,0.000568855],"genre_scores_gemma":[0.384064,0.00011958001,0.6096382,0.00006260424,0.000097171775,0.0007275739,0.004838144,0.000052979314,0.0003997682],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947386,0.0014848718,0.0016768163,0.0009813816,0.0005878101,0.0005305334],"domain_scores_gemma":[0.99276674,0.0012165172,0.0013760191,0.0023517197,0.002088062,0.00020092362],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028805954,0.00048411402,0.0006407351,0.0005302938,0.00042471313,0.0005680192,0.001419133,0.00028404486,0.00009630281],"category_scores_gemma":[0.0018902037,0.0005199972,0.000121567056,0.0011724209,0.00018621083,0.0016030011,0.0002407067,0.00029024485,0.0016951665],"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.000030252639,0.0008944522,0.0010868813,0.00026659077,0.000043548625,3.5901917e-7,0.0011453601,0.028942872,0.829559,0.12347259,0.007325356,0.007232693],"study_design_scores_gemma":[0.0017489293,0.00010312034,0.0066699614,0.00041198003,0.00004582512,0.000019039877,0.000018757257,0.9469713,0.01505002,0.0024655447,0.025588445,0.0009070893],"about_ca_topic_score_codex":0.00024694108,"about_ca_topic_score_gemma":0.00034526628,"teacher_disagreement_score":0.9180284,"about_ca_system_score_codex":0.0001290633,"about_ca_system_score_gemma":0.00032662135,"threshold_uncertainty_score":0.99972516},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009939674,0.000039819217,0.99487907,0.00016418226,0.00018485705,0.0023953335,0.000007039239,0.00015645991,0.0011792579],"genre_scores_gemma":[0.78754014,0.0000028546121,0.20956327,0.000017595969,0.00003548335,0.0025198243,0.000030847048,0.00000790687,0.0002820574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998791,0.00009517967,0.00035993705,0.00034940342,0.00015853775,0.00024594567],"domain_scores_gemma":[0.99927044,0.000097293945,0.00012583568,0.0003007097,0.00011925299,0.00008648146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005372489,0.000120071076,0.00016177444,0.00009951562,0.00012856841,0.00042493368,0.0001709775,0.000063202104,0.000017268821],"category_scores_gemma":[0.000047615627,0.00010923016,0.000025576988,0.00026287205,0.000017632176,0.0007708058,0.0000968494,0.00006828417,0.000011329456],"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.000011170498,0.00023753085,0.014309056,0.00022087248,0.000050105922,0.0000025148647,0.0002743096,0.91384697,0.00684598,0.058611292,0.004295386,0.0012947954],"study_design_scores_gemma":[0.00057522714,0.000073995376,0.001008102,0.00007178008,0.000004324883,0.000012407501,0.00014117507,0.99716103,0.0003980871,0.00018326544,0.00022495312,0.0001456482],"about_ca_topic_score_codex":0.00064367236,"about_ca_topic_score_gemma":0.00002796945,"teacher_disagreement_score":0.7865462,"about_ca_system_score_codex":0.00015431184,"about_ca_system_score_gemma":0.000046281093,"threshold_uncertainty_score":0.44542766},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027732918,0.000017125836,0.9611215,0.000518039,0.00032537215,0.0028158696,0.000072767536,0.0013395611,0.0060568308],"genre_scores_gemma":[0.27227464,0.00008614679,0.7167656,0.00052236055,0.00041574505,0.0015074315,0.0016096453,0.0001753555,0.0066430466],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443525,0.00059172715,0.0016303067,0.0015524237,0.0008742308,0.00091606175],"domain_scores_gemma":[0.99267936,0.0023881146,0.0011008207,0.0022224414,0.0012440645,0.00036519676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031127606,0.00070408266,0.0007762702,0.0007755837,0.000512464,0.0009893549,0.00149265,0.00032811885,0.00025506804],"category_scores_gemma":[0.0020232168,0.0006950886,0.00016346542,0.0010955066,0.00015679952,0.0018297583,0.00023678412,0.0004133953,0.011552508],"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.00022924543,0.0019455375,0.0014890736,0.0011153568,0.00013269388,0.000009755303,0.007324233,0.044226576,0.70929664,0.09112486,0.08934046,0.05376553],"study_design_scores_gemma":[0.0063954317,0.00069307437,0.01539397,0.0021442415,0.00011629639,0.00014535504,0.00013068083,0.71842283,0.015808078,0.00883055,0.22784677,0.0040727486],"about_ca_topic_score_codex":0.00008962465,"about_ca_topic_score_gemma":0.00008321949,"teacher_disagreement_score":0.6934886,"about_ca_system_score_codex":0.00017742727,"about_ca_system_score_gemma":0.0003460402,"threshold_uncertainty_score":0.99955004},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34208587,0.000062982224,0.65576035,0.000121392324,0.00022362218,0.0003749455,0.0000010734009,0.000102767684,0.001267011],"genre_scores_gemma":[0.8207403,5.009605e-7,0.17898957,0.000044830154,0.000044574317,0.000053657965,8.6822826e-7,0.000007632914,0.000118061806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989036,0.000025711106,0.0003239371,0.000258886,0.00024091822,0.0002469558],"domain_scores_gemma":[0.9990758,0.0001078368,0.0001424294,0.00050647196,0.000102671554,0.00006482131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032478225,0.00011899879,0.00021887761,0.000097393386,0.000063310414,0.00006338185,0.0006452225,0.000048801092,0.0000017348648],"category_scores_gemma":[0.000025868754,0.00009251779,0.00007982058,0.00017868505,0.000032180167,0.00008618532,0.000046099267,0.000052916694,0.000015464275],"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.000022422057,0.0000440149,0.0012322565,0.0003687687,0.00001679602,0.0000014697545,0.00021246378,0.9710387,0.0037651246,0.021957,0.00005022369,0.0012907683],"study_design_scores_gemma":[0.0011921956,0.0003504347,0.0015473946,0.00017529343,0.000004727166,0.000020190484,0.000024024592,0.9714313,0.024483312,0.00040695452,0.0001648873,0.00019926668],"about_ca_topic_score_codex":0.00018559874,"about_ca_topic_score_gemma":0.0000066732205,"teacher_disagreement_score":0.47865444,"about_ca_system_score_codex":0.00003542444,"about_ca_system_score_gemma":0.00014479109,"threshold_uncertainty_score":0.3772766},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4218908e-7,0.00005335928,0.5123566,0.0002775031,0.00012873243,0.00030330106,0.0000024308977,0.00031497446,0.48656276],"genre_scores_gemma":[0.008704538,0.00000820971,0.1685199,0.0007320024,0.0004916698,0.00013188634,0.00004918831,0.00007490409,0.8212877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981856,0.00002483633,0.000436503,0.0006740145,0.00043640516,0.00024268457],"domain_scores_gemma":[0.9975394,0.00016026408,0.0002793372,0.0017292658,0.00013272403,0.0001590015],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00029200505,0.00031549815,0.00038861923,0.00020839536,0.00011106722,0.00022449158,0.001505044,0.00025932657,0.00022444746],"category_scores_gemma":[0.0000043485047,0.00029315052,0.00018382547,0.00004785141,0.000052496584,0.00009729734,0.00021925391,0.0002520813,0.0052318294],"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":[4.2599277e-7,0.000005812701,0.0000017280694,0.000038707276,0.000017148126,0.0000024125613,0.0000048656048,0.00009216238,0.00016402501,0.9883491,0.0032648852,0.00805877],"study_design_scores_gemma":[0.00019568951,0.000022048753,0.0000035838016,0.00009941448,0.000013118026,0.000012067652,6.1173193e-7,0.08674215,0.00010836636,0.007166073,0.90520096,0.00043590993],"about_ca_topic_score_codex":0.000021391683,"about_ca_topic_score_gemma":0.000010981637,"teacher_disagreement_score":0.981183,"about_ca_system_score_codex":0.000074054704,"about_ca_system_score_gemma":0.00018625868,"threshold_uncertainty_score":0.9999521},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023780573,0.00037110518,0.96926,0.001250781,0.003935295,0.00066480914,0.000018741894,0.00007472733,0.00064399466],"genre_scores_gemma":[0.9729857,0.0000024841995,0.02493505,0.0002602475,0.0016568796,0.000042275755,0.000008008912,0.000031732216,0.00007761746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942612,0.0010932965,0.0018898748,0.0004070782,0.0020493953,0.0002991361],"domain_scores_gemma":[0.99454194,0.0006713633,0.0018717184,0.0005772754,0.0019490384,0.00038867583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029196849,0.00029391563,0.0006879811,0.00037371498,0.00009006586,0.00084584544,0.0033938254,0.0001329287,0.0000050528693],"category_scores_gemma":[0.0012797046,0.00020999541,0.00029338367,0.000674781,0.0000542238,0.0010847184,0.00024363802,0.0003431753,0.000014600331],"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.00014819889,0.0001375775,0.0002887628,0.00018756988,0.00029594722,0.000053544325,0.002191003,0.98433787,0.003175766,0.0050668498,0.0037350547,0.00038183542],"study_design_scores_gemma":[0.0009531461,0.00016588958,0.000056377077,0.0004918023,0.000031140964,0.00047590068,0.0011470541,0.9949145,0.0008235574,0.000018725916,0.0006936494,0.00022830818],"about_ca_topic_score_codex":0.0002694569,"about_ca_topic_score_gemma":0.0000018688777,"teacher_disagreement_score":0.94920516,"about_ca_system_score_codex":0.00019087539,"about_ca_system_score_gemma":0.0005784802,"threshold_uncertainty_score":0.8563365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40577716,0.000015496587,0.59272575,0.000024240288,0.00005003743,0.00053438894,2.5658198e-7,0.00005882593,0.000813848],"genre_scores_gemma":[0.84273416,0.0000014303146,0.15718888,0.000008709374,0.000007868774,0.0000144619835,2.2400542e-7,0.0000053586805,0.000038922113],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882084,0.00016844648,0.00038141749,0.00025720045,0.000183051,0.00018905323],"domain_scores_gemma":[0.99925774,0.00021989828,0.00015475998,0.00027434115,0.0000509677,0.000042300097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001105139,0.000089406116,0.00023917326,0.00014526826,0.00001847275,0.00007215122,0.00024302053,0.00003753375,0.0000139169115],"category_scores_gemma":[0.000006506308,0.00007938979,0.000020663501,0.00021190799,0.000007556303,0.0004713564,0.000064272135,0.00003507954,0.000031143478],"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.000026248601,0.000022853352,0.035300855,0.00039940924,0.000051381638,0.000013489575,0.002128245,0.0071052737,0.8253836,0.11991817,0.000056897665,0.009593569],"study_design_scores_gemma":[0.001956483,0.00013435824,0.008692745,0.00016078008,0.0000061026058,0.00003460744,0.00067451247,0.9586246,0.02941378,0.00012459337,0.0000058230257,0.00017158275],"about_ca_topic_score_codex":0.0011751612,"about_ca_topic_score_gemma":0.000009146808,"teacher_disagreement_score":0.95151937,"about_ca_system_score_codex":0.00006831272,"about_ca_system_score_gemma":0.00006198438,"threshold_uncertainty_score":0.32374218},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.3624343e-7,0.0000381756,0.49811482,0.000018081637,0.00011219492,0.000055794782,0.000004058146,0.00011289078,0.50154364],"genre_scores_gemma":[0.0039864713,0.0000125160095,0.20002843,0.00007647281,0.000094870506,0.0000037408427,0.000016799819,0.00002316966,0.79575753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827045,0.000022164717,0.00041725213,0.00064658694,0.00040777578,0.00023578484],"domain_scores_gemma":[0.99823564,0.00011704266,0.00017827589,0.0011963319,0.000104637074,0.00016805004],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00026473895,0.0002654514,0.0005412199,0.00039336106,0.00004493915,0.00016920785,0.0010129763,0.00023509654,0.0032482492],"category_scores_gemma":[0.000014221166,0.00022496626,0.000242557,0.00010271687,0.000045272212,0.00018537125,0.0003144294,0.00022163142,0.0031910315],"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":[5.2165467e-7,0.0000033157621,0.000017902388,0.000008230494,0.00044010195,0.000046360394,0.000042411157,0.00000604948,0.0000011856197,0.9921913,0.0014286871,0.0058139013],"study_design_scores_gemma":[0.0003600392,0.00021299704,0.0012816655,0.00014095857,0.002219573,0.0000914367,0.000006900492,0.0427874,0.00007786944,0.6729279,0.2771703,0.0027229236],"about_ca_topic_score_codex":0.00017688722,"about_ca_topic_score_gemma":0.000044292952,"teacher_disagreement_score":0.3192634,"about_ca_system_score_codex":0.000045221186,"about_ca_system_score_gemma":0.00008226222,"threshold_uncertainty_score":0.9976629},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000012542267,0.00006248081,0.465103,0.00020378527,0.00017534001,0.00035653776,0.0000045690495,0.00034332887,0.5337497],"genre_scores_gemma":[0.0025838998,0.000008222742,0.19867444,0.0004988342,0.00068669923,0.00010979298,0.000042981814,0.000067337794,0.79732776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99816567,0.000018491077,0.00042230752,0.0007040137,0.0004385521,0.00025097388],"domain_scores_gemma":[0.99754745,0.00010472677,0.00026415338,0.0017327148,0.00019707228,0.00015387601],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024614602,0.00031148354,0.00033854344,0.00021186151,0.00012676284,0.00023920274,0.0015564098,0.00026427789,0.0009417182],"category_scores_gemma":[0.0000037526365,0.00028848127,0.00016853045,0.00005919845,0.00009191882,0.00016958929,0.00026469427,0.0002089462,0.010434519],"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.000001038523,0.000015669659,0.0000022845134,0.00004806408,0.000036566587,0.0000061825635,0.000022523382,0.000022533168,0.00031897533,0.9803045,0.015053976,0.004167716],"study_design_scores_gemma":[0.00020465832,0.000037689908,0.0000033885235,0.0001219806,0.000015287338,0.000016264168,0.000001878523,0.04379173,0.00024022184,0.01335411,0.94171846,0.0004943417],"about_ca_topic_score_codex":0.000018031833,"about_ca_topic_score_gemma":0.000014415719,"teacher_disagreement_score":0.96695036,"about_ca_system_score_codex":0.00008675064,"about_ca_system_score_gemma":0.00025665612,"threshold_uncertainty_score":0.99997157},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090960274,0.00018590172,0.9279196,0.000014405698,0.0014588744,0.0022547059,0.000006781148,0.00042115603,0.06682893],"genre_scores_gemma":[0.0819289,0.000008299659,0.72028714,0.00017476859,0.00012409633,0.00078691996,0.0012120948,0.0001289091,0.19534884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996962,0.00003907473,0.00091679534,0.00074695173,0.00071108533,0.0006241005],"domain_scores_gemma":[0.9978294,0.00008359896,0.0005168251,0.0011624672,0.00025061058,0.0001571116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009919011,0.00046710426,0.00048745598,0.00067907403,0.00018668038,0.0005250695,0.0014806862,0.0004395304,0.0000026582088],"category_scores_gemma":[0.000015426322,0.00043639544,0.00023937058,0.0003650905,0.000012491056,0.0004588555,0.00007967,0.00023786782,0.00008056231],"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.00022248807,0.00022709809,0.000015480742,0.010872171,0.000409572,0.000040630006,0.00234971,0.8308165,0.00029884907,0.08049643,0.0061169905,0.06813408],"study_design_scores_gemma":[0.0007232968,0.000040550145,0.000039394596,0.00047520682,0.00003477184,0.0000024991161,0.0007503402,0.9926633,0.0001759613,0.000038024667,0.0045574023,0.0004992337],"about_ca_topic_score_codex":0.00008885763,"about_ca_topic_score_gemma":0.00010729205,"teacher_disagreement_score":0.20763248,"about_ca_system_score_codex":0.0003191954,"about_ca_system_score_gemma":0.0001553389,"threshold_uncertainty_score":0.9998088},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019842358,0.000056350564,0.97113043,0.00024114265,0.0003747329,0.002096193,0.000059470636,0.00099139,0.005207925],"genre_scores_gemma":[0.8636989,0.000051017556,0.13169399,0.0001203969,0.00020628195,0.0006036554,0.0008613032,0.00008365839,0.0026807813],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396175,0.0014525172,0.0016999709,0.0012146438,0.001003428,0.0006677114],"domain_scores_gemma":[0.99362284,0.0013064526,0.0012712546,0.0020973082,0.0014260336,0.00027613106],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027212086,0.000575278,0.00076428545,0.0008015357,0.00029478775,0.0005639096,0.0012738426,0.00032008428,0.00017568127],"category_scores_gemma":[0.0015479935,0.0005804464,0.00010950606,0.0014336213,0.00021010284,0.0014160611,0.00020671451,0.00040661168,0.009964451],"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.00010285093,0.0020774805,0.0024016101,0.0010598219,0.000094061594,0.0000059468844,0.0040458157,0.15519474,0.72424245,0.071327895,0.02751429,0.011933056],"study_design_scores_gemma":[0.0022763237,0.00025833133,0.007433753,0.0016692486,0.000052180792,0.000079861275,0.00005674053,0.91303605,0.006935936,0.00085782795,0.06603099,0.0013127632],"about_ca_topic_score_codex":0.00026738807,"about_ca_topic_score_gemma":0.00005930713,"teacher_disagreement_score":0.8438566,"about_ca_system_score_codex":0.00014758359,"about_ca_system_score_gemma":0.00026819803,"threshold_uncertainty_score":0.9996647},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.617019e-7,0.00010714599,0.09080524,0.00019321124,0.0006389816,0.0001967272,0.000002672337,0.0003132868,0.9077418],"genre_scores_gemma":[0.0018506648,0.00001848568,0.030468386,0.00022140075,0.00022246911,0.000006532898,0.000004198824,0.000036340425,0.96717155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985092,0.000012585191,0.00034150426,0.00056082284,0.00031851226,0.00025736008],"domain_scores_gemma":[0.998242,0.000054038006,0.00018715703,0.0012824459,0.000094496776,0.00013984695],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002077123,0.00028778304,0.00034281678,0.00012978853,0.000051155315,0.00027048215,0.0014050213,0.00027585487,0.0007703564],"category_scores_gemma":[0.000011583614,0.00024767328,0.00014638787,0.000024389707,0.000030266783,0.0003288724,0.0004055564,0.00024481036,0.0026625255],"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":[2.9239158e-7,0.0000017224431,0.000001122002,0.000011956282,0.000022090378,0.000030344558,0.000101270125,7.121301e-7,0.000011780159,0.9739757,0.0026761338,0.023166865],"study_design_scores_gemma":[0.00018815363,0.000094927505,0.0000332445,0.00031147615,0.00002248553,0.0001571843,0.000004254597,0.000612986,0.00042915042,0.2461921,0.7507858,0.0011681906],"about_ca_topic_score_codex":0.00022685684,"about_ca_topic_score_gemma":0.000059229296,"teacher_disagreement_score":0.7481097,"about_ca_system_score_codex":0.00006234606,"about_ca_system_score_gemma":0.0001546694,"threshold_uncertainty_score":0.99999756},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027732918,0.000017125836,0.9611215,0.000518039,0.00032537215,0.0028158696,0.000072767536,0.0013395611,0.0060568308],"genre_scores_gemma":[0.27227464,0.00008614679,0.7167656,0.00052236055,0.00041574505,0.0015074315,0.0016096453,0.0001753555,0.0066430466],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99443525,0.00059172715,0.0016303067,0.0015524237,0.0008742308,0.00091606175],"domain_scores_gemma":[0.99267936,0.0023881146,0.0011008207,0.0022224414,0.0012440645,0.00036519676],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0031127606,0.00070408266,0.0007762702,0.0007755837,0.000512464,0.0009893549,0.00149265,0.00032811885,0.00025506804],"category_scores_gemma":[0.0020232168,0.0006950886,0.00016346542,0.0010955066,0.00015679952,0.0018297583,0.00023678412,0.0004133953,0.011552508],"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.00022924543,0.0019455375,0.0014890736,0.0011153568,0.00013269388,0.000009755303,0.007324233,0.044226576,0.70929664,0.09112486,0.08934046,0.05376553],"study_design_scores_gemma":[0.0063954317,0.00069307437,0.01539397,0.0021442415,0.00011629639,0.00014535504,0.00013068083,0.71842283,0.015808078,0.00883055,0.22784677,0.0040727486],"about_ca_topic_score_codex":0.00008962465,"about_ca_topic_score_gemma":0.00008321949,"teacher_disagreement_score":0.6934886,"about_ca_system_score_codex":0.00017742727,"about_ca_system_score_gemma":0.0003460402,"threshold_uncertainty_score":0.99955004},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84386593,0.00032926718,0.0032779914,0.00070778,0.0010509263,0.00051146315,0.000014917015,0.0012277837,0.14901394],"genre_scores_gemma":[0.95560074,0.000054215052,0.039525148,0.00015401929,0.00034207417,0.000023739634,0.000023722645,0.000028886627,0.0042474447],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756926,0.00019057222,0.00047385195,0.0006874102,0.0005079947,0.00057089375],"domain_scores_gemma":[0.99731976,0.00052866415,0.00018190467,0.0016636042,0.0000919698,0.00021411927],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004659969,0.00027292134,0.0003463857,0.00012239946,0.00019403877,0.00032122334,0.0021854066,0.000118947115,0.0009263967],"category_scores_gemma":[0.00020730475,0.0002487051,0.00009446001,0.00056775735,0.00006522766,0.0011535551,0.0002499064,0.00018353686,0.0058007184],"study_design_candidate":"design_other","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.00023791622,0.0011836882,0.034653727,0.0006176066,0.0007286752,0.0013762757,0.030357106,0.005238403,0.08193655,0.056113597,0.056564663,0.7309918],"study_design_scores_gemma":[0.012321148,0.0034540538,0.14691137,0.0023191827,0.00045755808,0.0011326494,0.0013081469,0.4441887,0.056374773,0.012747924,0.3076687,0.011115794],"about_ca_topic_score_codex":0.0005219048,"about_ca_topic_score_gemma":0.00001588834,"teacher_disagreement_score":0.719876,"about_ca_system_score_codex":0.00004523951,"about_ca_system_score_gemma":0.000104218976,"threshold_uncertainty_score":0.99999654},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40692815,0.00043555198,0.574379,0.00021850856,0.00024193927,0.0011188384,0.00014195645,0.0005187128,0.016017314],"genre_scores_gemma":[0.98962235,0.000025330337,0.00943627,0.0000042533256,0.000017847373,0.000017067552,0.00001872454,0.00001777389,0.00084038504],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976213,0.0002187956,0.00076239574,0.00044234036,0.00059319823,0.0003619451],"domain_scores_gemma":[0.9979569,0.00031687465,0.00045281954,0.00092153146,0.00021417438,0.00013770207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000565339,0.00021240178,0.00058936997,0.00014625188,0.000059881928,0.00007021916,0.00092507416,0.00013075653,0.000097471835],"category_scores_gemma":[0.00009058019,0.00018663208,0.00012807232,0.0006079934,0.000050828377,0.0005256257,0.00018906799,0.00008275426,0.00018750624],"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.000040480714,0.000414664,0.0005213654,0.0005289478,0.00018651002,0.000020278569,0.00091875746,0.009158302,0.95658743,0.004195361,0.02637783,0.0010500448],"study_design_scores_gemma":[0.00044506183,0.000087261455,0.000036592086,0.00023229387,0.000015663401,0.000017630358,0.000059504837,0.9462095,0.052583665,0.000020690492,0.00010295813,0.00018917985],"about_ca_topic_score_codex":0.00099641,"about_ca_topic_score_gemma":0.0000012564893,"teacher_disagreement_score":0.9370512,"about_ca_system_score_codex":0.00008441324,"about_ca_system_score_gemma":0.000032029657,"threshold_uncertainty_score":0.7610636},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01073075,0.0011069486,0.9835767,0.00025949132,0.0007850564,0.0011680421,0.000015215252,0.0023543173,0.0000034753239],"genre_scores_gemma":[0.66665375,0.000015900736,0.3320426,0.00007732321,0.0002563898,0.0008060415,0.00004780698,0.000079238576,0.00002096229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975356,0.00003502534,0.0005803276,0.0007039427,0.00039919245,0.0007459201],"domain_scores_gemma":[0.9739732,0.023853043,0.00017044364,0.0015430907,0.00020201353,0.00025820037],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053292466,0.00042736757,0.00045449162,0.00040019202,0.00014886505,0.0004390451,0.0016384779,0.0001656371,0.0000045021307],"category_scores_gemma":[0.0157468,0.0004691474,0.00018576745,0.00092587154,0.000013515769,0.0005599248,0.00023262925,0.00024128014,0.00007326378],"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.000007623404,0.00009513616,0.013477119,0.0006237843,0.00007590008,0.000020210458,0.00016694167,0.97055024,0.0056858687,0.0064391587,0.00032924194,0.0025288055],"study_design_scores_gemma":[0.001331072,0.00007666717,0.00851616,0.00042188546,0.000044514516,0.000118313445,0.000014292,0.9478311,0.0029748054,0.000022921364,0.037449263,0.0011989854],"about_ca_topic_score_codex":0.00006341885,"about_ca_topic_score_gemma":7.798327e-7,"teacher_disagreement_score":0.655923,"about_ca_system_score_codex":0.00016093958,"about_ca_system_score_gemma":0.000102843194,"threshold_uncertainty_score":0.999776},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9782706,0.00002255268,0.0056773983,0.012100202,0.000474772,0.0011996981,9.95994e-7,0.0009032692,0.0013505105],"genre_scores_gemma":[0.8387931,0.0000051187053,0.15559892,0.0041057197,0.00045269838,0.000439204,0.000008678836,0.00008601709,0.00051056774],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99653816,0.0001038275,0.00056459126,0.0009910937,0.00086334324,0.0009389711],"domain_scores_gemma":[0.9969336,0.00032465105,0.00030807717,0.0019821664,0.00014593011,0.00030558996],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039335122,0.00043874676,0.0004121065,0.00021830267,0.00025798255,0.0010082811,0.0030290508,0.00013486341,0.00009232226],"category_scores_gemma":[0.00024602874,0.00039034287,0.00013770928,0.0007167721,0.00007510615,0.0017798374,0.00055573706,0.00034778367,0.00242415],"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.00002601651,0.00025000342,0.0035402388,0.0003519198,0.00019642874,0.0003610846,0.0034777618,0.0007722045,0.83877826,0.003587107,0.075177886,0.0734811],"study_design_scores_gemma":[0.0140130585,0.0043362384,0.08888663,0.0067540132,0.0003387723,0.0012782458,0.002907084,0.23290163,0.52648634,0.011174959,0.09005856,0.02086446],"about_ca_topic_score_codex":0.00062836974,"about_ca_topic_score_gemma":0.0000036583262,"teacher_disagreement_score":0.3122919,"about_ca_system_score_codex":0.00016061096,"about_ca_system_score_gemma":0.000099431265,"threshold_uncertainty_score":0.99985486},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8492712,0.001028824,0.054345015,0.00017921037,0.0041342205,0.00443842,0.00004556594,0.0022459375,0.084311634],"genre_scores_gemma":[0.43025988,0.00049589196,0.44600594,0.00010126983,0.0007873557,0.0009955836,0.00088647206,0.00040945405,0.12005815],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9965515,0.00015709705,0.00081308564,0.0012355485,0.0007122451,0.0005305182],"domain_scores_gemma":[0.99789286,0.0001710636,0.00041736176,0.0012426873,0.000055118664,0.00022093477],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006890519,0.0005311912,0.0007879158,0.00036363455,0.000117082775,0.00040761,0.00096931634,0.00068657,0.0000889011],"category_scores_gemma":[0.0000548209,0.000501014,0.00012601528,0.00020774323,0.000026028318,0.00055293756,0.00019638984,0.0005958091,0.0007190523],"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.0006495915,0.0015991017,0.020832462,0.028998576,0.0013801331,0.003294278,0.061388284,0.001812639,0.4700273,0.08561664,0.01359494,0.31080607],"study_design_scores_gemma":[0.014099026,0.0018633142,0.46796888,0.027524693,0.00067028165,0.0019959086,0.013958444,0.36921066,0.0613188,0.002605662,0.01863835,0.020145962],"about_ca_topic_score_codex":0.0014219652,"about_ca_topic_score_gemma":0.0002712504,"teacher_disagreement_score":0.44713643,"about_ca_system_score_codex":0.00026702916,"about_ca_system_score_gemma":0.00017590208,"threshold_uncertainty_score":0.9997442},"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":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031899402,0.0000106470225,0.81268454,0.0000023566095,0.000167799,0.1860642,0.00016330852,0.00016264048,0.00042553557],"genre_scores_gemma":[0.20743729,0.0000024098,0.32371658,0.000013296926,0.0004205956,0.46101826,0.0056055957,0.00017409776,0.0016118443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966922,0.00040085986,0.0011361024,0.00085078075,0.0005304933,0.0003895916],"domain_scores_gemma":[0.9954932,0.0012208071,0.0012411451,0.0007778379,0.0010706707,0.00019634161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018166213,0.0004334249,0.00080690964,0.00026981108,0.0001283072,0.00022612764,0.0006190916,0.00036068243,0.000008815079],"category_scores_gemma":[0.00014878665,0.00038900986,0.00008652614,0.00030796748,0.000033573622,0.0011130549,0.00003575832,0.00015617258,0.000007044257],"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.013074,0.001709422,0.00008099613,0.017642185,0.0013167573,0.00009233286,0.0045073004,0.73900163,0.10294259,0.070436165,0.0021216038,0.047075015],"study_design_scores_gemma":[0.0025822609,0.0007186368,0.00006372814,0.00066896155,0.0000491385,0.0000047582453,0.0001513517,0.99222744,0.0029632435,0.00011608527,0.00005799011,0.00039639877],"about_ca_topic_score_codex":0.0003501713,"about_ca_topic_score_gemma":0.000013793668,"teacher_disagreement_score":0.48896793,"about_ca_system_score_codex":0.00009294839,"about_ca_system_score_gemma":0.00038218044,"threshold_uncertainty_score":0.9998562},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019842358,0.000056350564,0.97113043,0.00024114265,0.0003747329,0.002096193,0.000059470636,0.00099139,0.005207925],"genre_scores_gemma":[0.8636989,0.000051017556,0.13169399,0.0001203969,0.00020628195,0.0006036554,0.0008613032,0.00008365839,0.0026807813],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396175,0.0014525172,0.0016999709,0.0012146438,0.001003428,0.0006677114],"domain_scores_gemma":[0.99362284,0.0013064526,0.0012712546,0.0020973082,0.0014260336,0.00027613106],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0027212086,0.000575278,0.00076428545,0.0008015357,0.00029478775,0.0005639096,0.0012738426,0.00032008428,0.00017568127],"category_scores_gemma":[0.0015479935,0.0005804464,0.00010950606,0.0014336213,0.00021010284,0.0014160611,0.00020671451,0.00040661168,0.009964451],"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.00010285093,0.0020774805,0.0024016101,0.0010598219,0.000094061594,0.0000059468844,0.0040458157,0.15519474,0.72424245,0.071327895,0.02751429,0.011933056],"study_design_scores_gemma":[0.0022763237,0.00025833133,0.007433753,0.0016692486,0.000052180792,0.000079861275,0.00005674053,0.91303605,0.006935936,0.00085782795,0.06603099,0.0013127632],"about_ca_topic_score_codex":0.00026738807,"about_ca_topic_score_gemma":0.00005930713,"teacher_disagreement_score":0.8438566,"about_ca_system_score_codex":0.00014758359,"about_ca_system_score_gemma":0.00026819803,"threshold_uncertainty_score":0.9996647},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91439927,0.00008877263,0.07006015,0.001003503,0.0011520805,0.001654891,0.0000044881267,0.000321314,0.011315563],"genre_scores_gemma":[0.8204216,0.0000032288344,0.17913453,0.00015547132,0.000087646324,0.000039607243,0.0000061104906,0.000021559004,0.0001302977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977264,0.00011446238,0.00079730136,0.0005640655,0.00030363962,0.000494149],"domain_scores_gemma":[0.9961213,0.0027762868,0.00022623553,0.00063664216,0.000121559846,0.00011798259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003120288,0.00021989502,0.0003241294,0.00020125699,0.00016842759,0.00015810264,0.00040079613,0.00016832694,0.000013077003],"category_scores_gemma":[0.0007094196,0.00021258343,0.00007850598,0.00022584783,0.000023226428,0.001034077,0.00010196776,0.00027057435,0.00018657284],"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.000030195275,0.00008982669,0.0042783474,0.00015679839,0.00002661167,0.000039176066,0.0037760823,0.89049757,0.099145226,0.00095450145,0.0007442464,0.00026139262],"study_design_scores_gemma":[0.0032469805,0.00038196312,0.04158332,0.0015417967,0.000017849554,0.00015452756,0.000823303,0.5917467,0.33507687,0.023484526,0.000646492,0.0012956538],"about_ca_topic_score_codex":0.00037171098,"about_ca_topic_score_gemma":0.00006975711,"teacher_disagreement_score":0.29875088,"about_ca_system_score_codex":0.00014438985,"about_ca_system_score_gemma":0.00026443042,"threshold_uncertainty_score":0.8668901},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019996151,0.00021036659,0.91319084,0.00020708142,0.0015069974,0.00094980444,0.0000017570292,0.00070999487,0.06322703],"genre_scores_gemma":[0.89456385,0.0000031358672,0.10207632,0.00020863384,0.00011912216,0.00010811362,0.0000016694036,0.000034360273,0.002884799],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806654,0.00021837378,0.0004268681,0.00053612195,0.00031800166,0.00043406337],"domain_scores_gemma":[0.9983584,0.00056312873,0.0001695106,0.0007119667,0.000042664626,0.00015427335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083442684,0.00019315086,0.00023366777,0.00011421851,0.00015106091,0.00058608706,0.0005834006,0.00008431617,0.00003809522],"category_scores_gemma":[0.00012107898,0.00016252715,0.00009578436,0.00024628537,0.000009236917,0.0011033292,0.00004897229,0.00010492687,0.00026239888],"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.000028598864,0.00031550718,0.0024350944,0.00034060667,0.00013391396,0.0000739395,0.0013439369,0.012864389,0.008994625,0.9411498,0.022903925,0.009415675],"study_design_scores_gemma":[0.0029741724,0.0005439071,0.00028251501,0.00058595027,0.00002957702,0.00035900756,0.0015858625,0.8102784,0.1303936,0.0017246767,0.049635574,0.0016067715],"about_ca_topic_score_codex":0.000019874571,"about_ca_topic_score_gemma":7.233804e-7,"teacher_disagreement_score":0.9394251,"about_ca_system_score_codex":0.00004354419,"about_ca_system_score_gemma":0.000095284384,"threshold_uncertainty_score":0.6627665},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025372474,0.00009236851,0.9727139,0.000069663496,0.00017091639,0.00047731295,6.9453586e-7,0.00029615543,0.0008065095],"genre_scores_gemma":[0.64221376,1.5104469e-7,0.35763565,0.000015949952,0.000044671488,0.000017450464,8.97936e-7,0.0000076131255,0.00006381831],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99888265,0.000026079388,0.00037193936,0.000271194,0.00020581445,0.00024230193],"domain_scores_gemma":[0.99903846,0.0001414667,0.00016657652,0.0004403825,0.00016074299,0.000052376494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008482935,0.00010209862,0.00017264078,0.00011917455,0.00009781178,0.00007344005,0.00045856522,0.000059389327,6.1450146e-7],"category_scores_gemma":[0.00009070205,0.00007857832,0.000065871696,0.00021018827,0.000018414521,0.00024149717,0.00007181249,0.000055760465,0.000006730551],"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.00011232955,0.000098004246,0.00127339,0.0075974967,0.00012553262,0.000009658005,0.013423412,0.021833064,0.4670637,0.12771142,0.0001690542,0.36058295],"study_design_scores_gemma":[0.0010977127,0.0002911091,0.0014548879,0.0019014473,0.00003239759,0.00019056583,0.003425035,0.2806012,0.707697,0.0010808286,0.0014147412,0.0008130806],"about_ca_topic_score_codex":0.000059788825,"about_ca_topic_score_gemma":0.000008547761,"teacher_disagreement_score":0.6168413,"about_ca_system_score_codex":0.0000558287,"about_ca_system_score_gemma":0.000047945723,"threshold_uncertainty_score":0.3204331},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0979861,0.000106488485,0.89998174,0.000063235166,0.00036072524,0.00073486235,0.000005640616,0.00019802965,0.0005631794],"genre_scores_gemma":[0.6710685,5.6130006e-7,0.32874286,0.0000084651665,0.00004746548,0.00006834362,0.0000092407345,0.000010254899,0.000044326425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976789,0.000801681,0.0005101614,0.00052439776,0.00022415971,0.00026071307],"domain_scores_gemma":[0.9974057,0.0015911836,0.00029287115,0.00045232702,0.00017616776,0.00008173151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004219393,0.00015147278,0.00028910366,0.00015536517,0.00050631334,0.00029415457,0.00032644544,0.00005366808,0.000016806765],"category_scores_gemma":[0.0006125533,0.00015555833,0.00007123165,0.0004212588,0.000049824976,0.0005711653,0.00025851643,0.0001478133,0.0000035988428],"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.000018750614,0.00003517241,0.0032303615,0.00015201228,0.000054871696,0.0000018138363,0.0020191611,0.7977065,0.033528008,0.03803061,0.000012238336,0.1252105],"study_design_scores_gemma":[0.00028966405,0.0000633772,0.0005618775,0.000024393705,0.000010923886,0.00001108281,0.0003029306,0.9964353,0.00021153188,0.001752992,0.00017453605,0.0001613901],"about_ca_topic_score_codex":0.00014806456,"about_ca_topic_score_gemma":0.0000013004776,"teacher_disagreement_score":0.5730824,"about_ca_system_score_codex":0.00019396785,"about_ca_system_score_gemma":0.0000965939,"threshold_uncertainty_score":0.63434845},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060404785,0.0015127653,0.97287583,0.0029649078,0.0033824781,0.005751655,0.0003086268,0.0051775263,0.0074221557],"genre_scores_gemma":[0.5025105,0.000045643166,0.47922146,0.00034358507,0.00045756897,0.0155810965,0.00017005546,0.00018855378,0.0014815395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9915323,0.0008941735,0.0020368309,0.0023204202,0.0014271138,0.0017891214],"domain_scores_gemma":[0.99280417,0.00058701495,0.00086238957,0.00466071,0.00040988543,0.0006758157],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004189515,0.0010106564,0.0014470121,0.0009837776,0.0012644028,0.0015548342,0.004211696,0.0007668555,0.000035447116],"category_scores_gemma":[0.00019696986,0.001131004,0.00081129,0.0008198199,0.00010481969,0.000743928,0.00530941,0.0012875298,0.000060270937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017230428,0.00030054466,0.00020573783,0.0112792365,0.00044684295,0.0005748657,0.00043891446,0.116496734,0.00047450085,0.8593455,0.0049122926,0.0053525567],"study_design_scores_gemma":[0.00090133416,0.00016329529,0.00042328017,0.0018668683,0.00024487963,0.00042148188,0.0015963262,0.98118496,0.0025993907,0.002930291,0.006133458,0.0015344395],"about_ca_topic_score_codex":0.0047274125,"about_ca_topic_score_gemma":0.00014307491,"teacher_disagreement_score":0.8646882,"about_ca_system_score_codex":0.005772707,"about_ca_system_score_gemma":0.0006534797,"threshold_uncertainty_score":0.9994816},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022777924,0.0002914059,0.97509223,0.00006109589,0.00092743756,0.00038253985,0.000018029617,0.00044027748,0.0000090668345],"genre_scores_gemma":[0.087158814,0.00001826475,0.91230005,0.000007945617,0.000030671632,0.00021255366,0.0000027078706,0.00002993154,0.00023905374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99739116,0.0010873105,0.00044679118,0.00048013913,0.00026150316,0.00033310844],"domain_scores_gemma":[0.9929574,0.005955323,0.00016146149,0.0007617345,0.00006289232,0.00010118521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026869052,0.00021924985,0.00051470136,0.00028850595,0.00029380037,0.00003669367,0.00059319194,0.000087695174,0.000027298878],"category_scores_gemma":[0.0010749383,0.0002277572,0.00007858717,0.00037350866,0.000041977484,0.00014985986,0.00007796393,0.00027767202,0.00000529386],"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.000022522185,0.000027219812,0.00002260723,0.00021337552,0.0000618464,0.00001076367,0.00083319924,0.97919893,0.01225448,0.00032439618,0.000018071074,0.007012611],"study_design_scores_gemma":[0.00081384694,0.00076472486,0.00033412807,0.0001650032,0.00009453288,0.0007802627,0.00015644402,0.9882744,0.007267309,0.00046147613,0.00031567534,0.00057218753],"about_ca_topic_score_codex":0.00012474835,"about_ca_topic_score_gemma":7.0529137e-7,"teacher_disagreement_score":0.06438089,"about_ca_system_score_codex":0.00013830517,"about_ca_system_score_gemma":0.000061996376,"threshold_uncertainty_score":0.9287669},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87708783,0.00018740368,0.042894136,0.0007664034,0.0020511947,0.0020191593,0.00004845457,0.00039895813,0.07454646],"genre_scores_gemma":[0.9906629,0.0003433046,0.0004440387,0.0000862473,0.00027427264,0.0000065438803,0.000008269374,0.000044699143,0.008129776],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99589294,0.0009905274,0.00065117347,0.001482055,0.0004226243,0.000560663],"domain_scores_gemma":[0.99271244,0.00086173177,0.0011466614,0.004506152,0.00059458194,0.00017844829],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0018357842,0.00056324457,0.00069681037,0.00031325666,0.00047256937,0.0003319581,0.0054096226,0.00047854945,0.00007145679],"category_scores_gemma":[0.00012450748,0.00040132887,0.00042717496,0.00086904946,0.0004332836,0.00041061285,0.002394035,0.0008084112,0.0011754764],"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.00012690976,0.0004495027,0.0009011723,0.0006613743,0.00096791907,0.00030804533,0.0044972794,0.24473433,0.0009958668,0.7380074,0.007811473,0.00053867843],"study_design_scores_gemma":[0.000682738,0.00040365118,0.00094836537,0.0019694825,0.00031137152,0.000044516644,0.0011816507,0.9542644,0.00071120285,0.037898973,0.00043956612,0.0011440723],"about_ca_topic_score_codex":0.0024868583,"about_ca_topic_score_gemma":0.000023449373,"teacher_disagreement_score":0.70953006,"about_ca_system_score_codex":0.00029863772,"about_ca_system_score_gemma":0.00045597056,"threshold_uncertainty_score":0.99997157},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028150406,0.00029220726,0.9562752,0.00018110617,0.00857694,0.004177716,0.00012853582,0.0018948221,0.00032303072],"genre_scores_gemma":[0.9205931,0.000013840858,0.074935816,0.000056934183,0.00046543957,0.0013905445,0.000053247288,0.00017196227,0.002319118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99235487,0.0009430456,0.0019973707,0.0019022367,0.0014995531,0.0013029453],"domain_scores_gemma":[0.99402845,0.0010824392,0.0009876036,0.0030169825,0.0004935017,0.0003910491],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0028113844,0.00083183096,0.0012247657,0.00076872564,0.0022753803,0.00089399744,0.0027935212,0.00027617454,0.000032361102],"category_scores_gemma":[0.00007628826,0.0008938785,0.00061355554,0.0014957302,0.00007186204,0.00066033093,0.0000973412,0.0008811305,0.00017132795],"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.00016117682,0.0007446951,0.000021387532,0.0006143964,0.00037775634,0.00003701766,0.0042592515,0.9687794,0.013994456,0.0024894162,0.0005887972,0.0079322625],"study_design_scores_gemma":[0.0027729946,0.0006137496,0.0000322756,0.0003863717,0.0001009186,0.00050336233,0.0025933168,0.98988456,0.0005737232,0.00006289241,0.001553038,0.0009228027],"about_ca_topic_score_codex":0.0016745265,"about_ca_topic_score_gemma":0.000016593474,"teacher_disagreement_score":0.8924427,"about_ca_system_score_codex":0.0011937363,"about_ca_system_score_gemma":0.00037780337,"threshold_uncertainty_score":0.9993512},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26536223,0.00018291423,0.72161305,0.007864665,0.0014480251,0.0020808212,0.00029036624,0.00024259715,0.00091530813],"genre_scores_gemma":[0.9930735,0.000002805406,0.0049255635,0.0008394911,0.00020034709,0.000584262,0.000005367845,0.000016275308,0.00035236654],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980491,0.00019238093,0.00030964243,0.0004329275,0.00057048385,0.00044546812],"domain_scores_gemma":[0.9977848,0.00072988326,0.00031877036,0.00067280675,0.00041498762,0.00007873851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074134546,0.00020145015,0.0003979957,0.000014488334,0.0005724588,0.0001240744,0.0018440131,0.000058309695,0.000028268409],"category_scores_gemma":[0.000110851426,0.00015292535,0.000677528,0.00039549964,0.000112388145,0.00029953307,0.0007032749,0.00029142047,0.000004719822],"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.00023659068,0.0022521329,0.012881244,0.00035025133,0.0011772029,0.0000071213367,0.06457384,0.33128715,0.01174723,0.1446837,0.40907145,0.021732086],"study_design_scores_gemma":[0.0016925201,0.00034280977,0.00093409524,0.00006273471,0.0000574601,0.0000033324282,0.0019531166,0.97049326,0.0029917015,0.008683183,0.012397895,0.00038787405],"about_ca_topic_score_codex":0.00009867299,"about_ca_topic_score_gemma":0.00000369091,"teacher_disagreement_score":0.72771126,"about_ca_system_score_codex":0.00007670414,"about_ca_system_score_gemma":0.00026764703,"threshold_uncertainty_score":0.6236115},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010690514,0.00017349614,0.9969472,0.00020075528,0.000049444552,0.00095906033,0.0000047572967,0.00023488713,0.0003613471],"genre_scores_gemma":[0.3587,0.0000070188507,0.6386802,0.000028004357,0.00002476311,0.0006803415,0.000020247655,0.000024085939,0.0018352852],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772185,0.00036903858,0.0004743578,0.00066754775,0.00040740563,0.000359822],"domain_scores_gemma":[0.99872255,0.00025596595,0.00019967012,0.0006329591,0.00008420034,0.00010463376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016711364,0.0001762726,0.00039738682,0.0005979718,0.00027396632,0.00038094074,0.0006364094,0.000058136247,0.000015350928],"category_scores_gemma":[0.000023858356,0.00017225032,0.000100811456,0.0021818199,0.000022505877,0.0003852717,0.0003540641,0.00009554597,0.000002749876],"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.00002666981,0.00002556733,0.00048335653,0.000019130759,0.00007601497,0.000004925509,0.00068441563,0.99695456,0.000019376404,0.0008675535,0.00040105198,0.00043738738],"study_design_scores_gemma":[0.00032708384,0.000054622156,0.00004597661,0.000017288618,0.000056307465,0.000008248651,0.00019300789,0.9990041,0.000008478391,0.0000575906,0.000025005129,0.00020228185],"about_ca_topic_score_codex":0.00015486233,"about_ca_topic_score_gemma":0.000003983727,"teacher_disagreement_score":0.35826695,"about_ca_system_score_codex":0.00015163375,"about_ca_system_score_gemma":0.000079053716,"threshold_uncertainty_score":0.7024164},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15619305,0.00018011392,0.8422207,0.00005300905,0.00013351052,0.00066513364,0.0000032655346,0.0004474228,0.00010378356],"genre_scores_gemma":[0.7394691,0.0000063237403,0.26000515,0.0000043229234,0.00003093626,0.0003143912,0.0000033218596,0.000043850698,0.00012258213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981965,0.000040313258,0.0004566228,0.0004937631,0.00037224893,0.0004405959],"domain_scores_gemma":[0.99888,0.0003436431,0.00011964806,0.00042778006,0.00006920111,0.00015970411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009585511,0.00024597376,0.0003921975,0.00013984911,0.0002765365,0.0003062245,0.00033684968,0.00006466488,0.0000074053764],"category_scores_gemma":[0.000028369315,0.00021990224,0.000059712424,0.00019310637,0.000019818373,0.00027872494,0.00014709483,0.00021154092,0.000014421649],"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.0000074988725,0.000031990996,0.0000032440846,0.00061157485,0.000035163735,0.0000026214107,0.00069351547,0.95678514,0.0035247093,0.03827101,0.00000469217,0.00002886616],"study_design_scores_gemma":[0.00038519318,0.00014517823,0.0000010847585,0.00029521776,0.00001726027,0.00009919252,0.000037981383,0.9969781,0.000104241124,0.0015525703,0.000083832354,0.00030016733],"about_ca_topic_score_codex":0.000010302399,"about_ca_topic_score_gemma":2.3488756e-8,"teacher_disagreement_score":0.5832761,"about_ca_system_score_codex":0.00008110358,"about_ca_system_score_gemma":0.000033552118,"threshold_uncertainty_score":0.8967353},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000034036162,0.00029757112,0.98783594,0.0006715594,0.0061851866,0.0019587616,0.000010044972,0.0006765728,0.0023303116],"genre_scores_gemma":[0.092887774,0.000051808893,0.8990543,0.0009079953,0.002177683,0.00033755696,0.00003386497,0.00025099757,0.004298051],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937883,0.000060291048,0.00097326026,0.0024977392,0.0014249305,0.0012555062],"domain_scores_gemma":[0.99527615,0.0014589742,0.00051771605,0.00195332,0.0004832012,0.00031061622],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020456451,0.0008180372,0.0009978947,0.00089549413,0.00034534096,0.0014149896,0.004971235,0.00047044596,0.00001113726],"category_scores_gemma":[0.00020414863,0.0007318256,0.00035615507,0.00085930043,0.0007141885,0.00065237645,0.0016327697,0.0007760627,0.00027363765],"study_design_candidate":"design_other","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.0000061925666,0.000045078712,0.000034348108,0.00023531089,0.000037337682,0.000071564755,0.0007126996,0.012558183,0.00013038589,0.052929834,0.00009438682,0.9331447],"study_design_scores_gemma":[0.0005746478,0.00038849527,0.00006195991,0.0019620443,0.000022193879,0.000082734616,5.935892e-7,0.8987287,0.00077416847,0.08804546,0.007937737,0.0014212116],"about_ca_topic_score_codex":0.000025258449,"about_ca_topic_score_gemma":0.00006046804,"teacher_disagreement_score":0.9317235,"about_ca_system_score_codex":0.00039071846,"about_ca_system_score_gemma":0.00073961815,"threshold_uncertainty_score":0.9996216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03893753,0.000039179726,0.95393735,0.00010706329,0.0016275683,0.0032189547,0.000078004945,0.0012884496,0.00076587126],"genre_scores_gemma":[0.8893395,0.00010553568,0.0759579,0.000012978809,0.00025544854,0.000074145304,0.00016353861,0.00013553305,0.03395538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956221,0.0006001513,0.00063792773,0.002121583,0.00027835555,0.00073986524],"domain_scores_gemma":[0.99500364,0.0011388201,0.0008457357,0.0022526793,0.00046455098,0.00029457652],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017462359,0.0006060847,0.00084843504,0.00049898284,0.00039636286,0.0005635741,0.002459648,0.000526341,0.000013618719],"category_scores_gemma":[0.0003532071,0.00069469877,0.00033183477,0.0007376615,0.000110928195,0.00071877637,0.0019977142,0.00036868453,0.0010527387],"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.00005215906,0.000039287672,0.00014485564,0.00085025263,0.00013730906,0.00012015915,0.00021358297,0.95837367,0.00057471776,0.0369564,0.002452448,0.00008514553],"study_design_scores_gemma":[0.00046121026,0.00011402142,0.00041978378,0.0005670803,0.0001230405,0.000012455515,0.000039362298,0.9828471,0.00016004393,0.014462818,0.00010669011,0.00068641757],"about_ca_topic_score_codex":0.000645326,"about_ca_topic_score_gemma":0.000020436779,"teacher_disagreement_score":0.87797946,"about_ca_system_score_codex":0.0012700197,"about_ca_system_score_gemma":0.0005209483,"threshold_uncertainty_score":0.99972504},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05155746,0.00017845668,0.94305223,0.0003879385,0.0015682828,0.001694086,0.000021972952,0.0013615451,0.00017800769],"genre_scores_gemma":[0.94194806,0.000007471267,0.057030905,0.000056363442,0.00020471087,0.0005713052,0.0000142135395,0.00005483357,0.00011213072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958222,0.00035498975,0.0011047579,0.0011307113,0.00066621404,0.00092114235],"domain_scores_gemma":[0.9952994,0.0019638615,0.00021918963,0.0019663337,0.00032521345,0.00022599795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002124948,0.00038632765,0.00059516303,0.00048831967,0.0006313819,0.0005094399,0.0017705406,0.00024335617,0.0000019822455],"category_scores_gemma":[0.00021065706,0.00041267808,0.0002818201,0.0019520358,0.00006128204,0.00036930316,0.00006538226,0.0004132508,0.00020573617],"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.000012132566,0.00022864786,0.00012318097,0.00046602817,0.00009676655,0.000019487014,0.0017563227,0.96768206,0.0009922504,0.007653882,0.000054257922,0.020915003],"study_design_scores_gemma":[0.0007707358,0.000087024906,0.0001370503,0.00032426137,0.000021856016,0.00005727783,0.0010342068,0.9934986,0.0014192646,0.0014184859,0.0007468829,0.00048435637],"about_ca_topic_score_codex":0.00022171217,"about_ca_topic_score_gemma":0.000039626582,"teacher_disagreement_score":0.89039063,"about_ca_system_score_codex":0.000420714,"about_ca_system_score_gemma":0.00021928,"threshold_uncertainty_score":0.9998325},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08049904,0.000016897244,0.9129587,0.00017406886,0.0022055209,0.0009326536,0.0000051903303,0.0027450519,0.00046291132],"genre_scores_gemma":[0.7770634,0.0000014556283,0.22152597,0.000023813573,0.00089314685,0.00009595181,0.00002848708,0.00004608409,0.0003216543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704677,0.00020956082,0.00062864827,0.0008384724,0.0005809863,0.000695551],"domain_scores_gemma":[0.9964662,0.0012826313,0.00026560202,0.0013527488,0.0003671142,0.0002656817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014534562,0.0002946127,0.00042654798,0.00031439212,0.00041140063,0.00090590876,0.001330143,0.00022863635,0.00000816994],"category_scores_gemma":[0.00017957106,0.0002854374,0.00013880544,0.0012058681,0.000025875774,0.00071479246,0.00014858687,0.00016772385,0.0006028983],"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.000042513962,0.00027959608,0.008624181,0.0010149442,0.00018566714,0.00007400534,0.008576711,0.8360792,0.034124304,0.093257084,0.005213809,0.012528003],"study_design_scores_gemma":[0.00033035214,0.00011289989,0.0018176482,0.00029593767,0.000008424752,0.0000043372256,0.0004136477,0.9926288,0.0030400178,0.00094830996,0.000046168247,0.00035345732],"about_ca_topic_score_codex":0.0002336299,"about_ca_topic_score_gemma":0.000002102681,"teacher_disagreement_score":0.69656444,"about_ca_system_score_codex":0.00012731257,"about_ca_system_score_gemma":0.00019481541,"threshold_uncertainty_score":0.99995977},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5425018,0.0035087436,0.44295797,0.0067299856,0.00382325,0.000382761,0.000004886003,0.000021639402,0.00006893148],"genre_scores_gemma":[0.9454615,0.0052091773,0.048360784,0.00011505516,0.00080447266,0.0000243615,0.0000039906563,0.000006986361,0.000013682616],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843025,0.00013984344,0.00058641273,0.0002802755,0.00041240308,0.00015082175],"domain_scores_gemma":[0.99732304,0.0011484496,0.0009980429,0.00014705872,0.0003288652,0.00005455479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014890439,0.00010629514,0.00018830426,0.00029127445,0.000034057528,0.00036168454,0.00079149904,0.000040737927,0.0000065730906],"category_scores_gemma":[0.0028996146,0.00009055315,0.00007094095,0.00032070835,0.00001532727,0.0040090354,0.00019618694,0.00029796397,0.0000013470586],"study_design_candidate":"design_other","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.000090300586,0.000091497335,0.024703333,0.000058118407,0.000024135243,0.000018068169,0.00069994986,0.013796545,0.00014125014,0.0004875914,0.00018678376,0.95970243],"study_design_scores_gemma":[0.006983898,0.0013800641,0.28956744,0.0025684915,0.000059536756,0.00037511296,0.00081824284,0.38430348,0.0060684388,0.1755345,0.13131641,0.0010243924],"about_ca_topic_score_codex":0.00010655508,"about_ca_topic_score_gemma":0.00050778704,"teacher_disagreement_score":0.958678,"about_ca_system_score_codex":0.00009727459,"about_ca_system_score_gemma":0.00015322944,"threshold_uncertainty_score":0.36926502},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063909115,0.0032749756,0.9798048,0.0036085392,0.0013762163,0.001606474,0.00017019734,0.0002418199,0.0035260646],"genre_scores_gemma":[0.5444676,0.0005563153,0.45273283,0.000039078164,0.0002186422,0.000650519,0.00023117145,0.000066920096,0.0010368632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99102604,0.006153966,0.00086525327,0.0010181139,0.00054584554,0.00039077064],"domain_scores_gemma":[0.9917108,0.0028788112,0.0010284216,0.002573398,0.0016165759,0.00019199356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.008608742,0.00037405803,0.0006397961,0.00026903854,0.0003822149,0.0007526572,0.0023173525,0.00023077753,0.000022561098],"category_scores_gemma":[0.00071749307,0.00039257275,0.00020861153,0.00037483385,0.00019233569,0.00023008541,0.0023305856,0.0005134297,0.0000034389886],"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.00005290218,0.0009794532,0.0023663677,0.0048910924,0.00056393974,0.000031781303,0.03541376,0.0081779305,0.0050119055,0.86947906,0.005064216,0.06796762],"study_design_scores_gemma":[0.0025624332,0.00001067292,0.003501261,0.007195303,0.00025498078,0.00032000642,0.002818155,0.87505937,0.017411228,0.011219161,0.077093415,0.0025540476],"about_ca_topic_score_codex":0.0006627039,"about_ca_topic_score_gemma":0.000047739704,"teacher_disagreement_score":0.86688143,"about_ca_system_score_codex":0.0001330191,"about_ca_system_score_gemma":0.00045944983,"threshold_uncertainty_score":0.9998526},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12597774,0.00007568297,0.8732136,0.00010909508,0.00007762187,0.00026434485,6.510683e-7,0.00026959451,0.000011701969],"genre_scores_gemma":[0.52147704,0.000014714222,0.4783744,0.000007649874,0.00003120774,0.000016677095,0.000003748146,0.00002411904,0.00005045317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901974,0.000015381362,0.00028148736,0.00028632078,0.00011269929,0.000284366],"domain_scores_gemma":[0.99943686,0.00021692905,0.000035797562,0.00016962393,0.00002746306,0.00011334753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059271406,0.00014799349,0.00021882211,0.0000877141,0.00009925333,0.00029858283,0.00012385106,0.00008056887,7.5560695e-7],"category_scores_gemma":[0.000034755667,0.0001302162,0.000033978893,0.00014231338,0.000012929822,0.0002774822,0.00009197094,0.000096365344,0.0000085212805],"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.0000012289579,0.000006097205,0.0000018721686,0.00022323907,0.000010159635,9.744273e-7,0.00046275978,0.9951011,0.0019363327,0.0018795035,0.000010149983,0.00036661132],"study_design_scores_gemma":[0.00013586541,0.000035901754,0.0000012441403,0.00045597754,0.000008125115,0.000017517796,0.000006543823,0.9954943,0.00017925777,0.0034909155,0.000019963805,0.00015435959],"about_ca_topic_score_codex":0.0000067055607,"about_ca_topic_score_gemma":6.9580615e-8,"teacher_disagreement_score":0.3954993,"about_ca_system_score_codex":0.0000175112,"about_ca_system_score_gemma":0.000007610454,"threshold_uncertainty_score":0.5310062},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034693775,0.000107642925,0.9878371,0.0011969185,0.0021402447,0.00090592285,0.000018058601,0.0015826342,0.0027420956],"genre_scores_gemma":[0.9459812,0.0000013235306,0.051579002,0.00011816104,0.00023658849,0.0003196681,0.000014541751,0.000031378942,0.0017181044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756336,0.0001692355,0.0004823713,0.00067164167,0.00047259626,0.00064078637],"domain_scores_gemma":[0.9960107,0.0025869063,0.00007881107,0.0008515237,0.00023762525,0.00023443902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010936905,0.00022635133,0.00035889755,0.00016442833,0.00023485502,0.0003991987,0.00097175804,0.0001228736,0.000016157921],"category_scores_gemma":[0.00090660166,0.00019070225,0.00013322865,0.00068982004,0.000071641116,0.0003961293,0.00016376325,0.0001299411,0.00054019707],"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.00015846349,0.0005679812,0.009175912,0.0040252004,0.00028027044,0.0004164504,0.0029456129,0.09281641,0.06707687,0.7278301,0.054049958,0.040656745],"study_design_scores_gemma":[0.00047562266,0.00006815764,0.0006452837,0.00013474612,0.000008833698,0.000009122641,0.00012627327,0.9900553,0.0027685727,0.0002516633,0.00515654,0.00029988217],"about_ca_topic_score_codex":0.00031352436,"about_ca_topic_score_gemma":0.000019557669,"teacher_disagreement_score":0.94251186,"about_ca_system_score_codex":0.000101034755,"about_ca_system_score_gemma":0.0001873485,"threshold_uncertainty_score":0.7776612},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9728461,0.000007234989,0.013250046,0.00006824008,0.00051909033,0.002084914,0.000005302809,0.0036855221,0.007533544],"genre_scores_gemma":[0.9857033,9.1452154e-7,0.011775015,0.000017462691,0.00012851963,0.00026330716,0.000015224663,0.00005878446,0.0020374751],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573416,0.00073728955,0.00068272493,0.0012273835,0.0008821418,0.0007362916],"domain_scores_gemma":[0.9977188,0.0001919731,0.00016093458,0.0012784177,0.000121545,0.00052829593],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014769544,0.00042093304,0.00059700914,0.00033991807,0.00033996903,0.00038909845,0.00135502,0.00013216802,0.00008721894],"category_scores_gemma":[0.000018335862,0.00035226467,0.0001552846,0.0010220412,0.000033717926,0.00085822184,0.00029102626,0.00017619235,0.0011347296],"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.00013524204,0.0037806437,0.0060168775,0.00033266767,0.00034683238,0.002590444,0.12769626,0.0020847279,0.8398418,0.0040335166,0.0021297687,0.011011239],"study_design_scores_gemma":[0.0043570073,0.0047093607,0.012890581,0.00020073338,0.00004353897,0.0002261205,0.031508658,0.791314,0.15323065,0.000031244253,0.0000744335,0.0014136606],"about_ca_topic_score_codex":0.0014699833,"about_ca_topic_score_gemma":0.000024684992,"teacher_disagreement_score":0.7892293,"about_ca_system_score_codex":0.00025482097,"about_ca_system_score_gemma":0.00020393531,"threshold_uncertainty_score":0.99989295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004993222,0.000077540215,0.9848088,0.0005021275,0.0012009992,0.0046396777,0.00005570847,0.0035062958,0.00021563457],"genre_scores_gemma":[0.6389729,0.000008870887,0.3529115,0.00023338042,0.00015435477,0.0053455597,0.0012722037,0.00011972702,0.0009815053],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970245,0.00032654146,0.0010219152,0.0005820099,0.00049414183,0.0005508906],"domain_scores_gemma":[0.9953661,0.0016463517,0.0006583687,0.0012574771,0.0009326426,0.00013908594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004324411,0.00030852616,0.00046887592,0.0004455761,0.00050609244,0.00081318675,0.001168749,0.00022172615,0.0000032548792],"category_scores_gemma":[0.0005044472,0.0002938477,0.00014707232,0.0016803225,0.000018311757,0.0019122537,0.00013083844,0.00011336876,0.00025850494],"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.00014262318,0.00017203724,0.00008821657,0.0022853778,0.000411244,0.0000036679062,0.019564316,0.37029135,0.03300902,0.526726,0.041316405,0.0059896912],"study_design_scores_gemma":[0.0011903448,0.00009970927,0.00012126265,0.0002318818,0.000015232018,0.000013540664,0.000603329,0.98864263,0.0025908058,0.0023732104,0.003780755,0.00033728115],"about_ca_topic_score_codex":0.00010890154,"about_ca_topic_score_gemma":0.000009542149,"teacher_disagreement_score":0.6339797,"about_ca_system_score_codex":0.00018406616,"about_ca_system_score_gemma":0.0002315508,"threshold_uncertainty_score":0.99995136},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46458974,0.00010431951,0.5345354,0.00006112241,0.00062850513,0.000046791276,0.000007304172,0.000017315411,0.000009494904],"genre_scores_gemma":[0.9536001,0.00003681936,0.045999166,0.000026050082,0.00030430214,0.000003691963,0.0000050250974,0.000010026389,0.000014836161],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980228,0.000057646932,0.000833689,0.00025938396,0.0006048164,0.0002216852],"domain_scores_gemma":[0.9971607,0.0008519839,0.00090303307,0.00019373884,0.00079202815,0.00009853845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012305246,0.00013725738,0.00045919468,0.0007123036,0.0001016279,0.00019735574,0.0008718319,0.00007466162,0.000001942448],"category_scores_gemma":[0.00019291231,0.00012173071,0.00031268364,0.00077296613,0.000040455863,0.00019840433,0.00036270468,0.00015635652,5.186488e-7],"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.000034017226,0.000065904285,0.0056364588,0.00004254474,0.0013340494,0.00003578111,0.0020844527,0.8581896,0.006387694,0.022760658,0.000015119365,0.10341376],"study_design_scores_gemma":[0.00035516356,0.00007032493,0.005452467,0.0003018768,0.000076039665,0.00002176093,0.0002465003,0.99119234,0.0016111984,0.0004295475,0.0001227359,0.00012006864],"about_ca_topic_score_codex":0.00006196979,"about_ca_topic_score_gemma":0.000003379093,"teacher_disagreement_score":0.48901033,"about_ca_system_score_codex":0.00006057282,"about_ca_system_score_gemma":0.00009220759,"threshold_uncertainty_score":0.49640343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007410751,0.00009440867,0.98028886,0.00033191784,0.0015859791,0.0011305633,0.000012335741,0.0024860506,0.006659127],"genre_scores_gemma":[0.040557124,0.0000456641,0.94173205,0.00009183401,0.0009925987,0.000512997,0.000041435374,0.000108695596,0.015917577],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664176,0.00013062108,0.00072881236,0.00094782875,0.0006283309,0.0009226322],"domain_scores_gemma":[0.99747175,0.00065425556,0.00022636616,0.001116471,0.000270379,0.00026079826],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001732501,0.0003336283,0.00055383344,0.00037124887,0.00031794957,0.00084477675,0.0012595529,0.00017929802,0.00001854789],"category_scores_gemma":[0.000116273295,0.00029905248,0.00022519956,0.0013126645,0.000032523247,0.00095901306,0.00036041325,0.0001455774,0.0015971145],"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.00003338188,0.00029289108,0.00029311993,0.0010649931,0.0006944202,0.00043286305,0.003567486,0.6088174,0.064630866,0.14605565,0.03144818,0.14266872],"study_design_scores_gemma":[0.00058069103,0.00007277318,0.000083104955,0.00014352852,0.000011263564,0.000057763882,0.00020448005,0.99641067,0.00065525685,0.00023530175,0.0011524337,0.00039275948],"about_ca_topic_score_codex":0.00064429065,"about_ca_topic_score_gemma":0.000004063324,"teacher_disagreement_score":0.38759324,"about_ca_system_score_codex":0.0001261138,"about_ca_system_score_gemma":0.00018207675,"threshold_uncertainty_score":0.9999462},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008556117,0.00007686365,0.9878433,0.00017487456,0.0010511292,0.0007726759,0.000022518036,0.0014978843,0.000004647444],"genre_scores_gemma":[0.015188409,0.000059756603,0.9830529,0.000010991386,0.000054502645,0.0005057611,0.000013397617,0.000044823548,0.0010694629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796844,0.00043458422,0.00039583773,0.0005769669,0.00017900643,0.00044519175],"domain_scores_gemma":[0.9910396,0.007902862,0.000096265525,0.00072913227,0.000094405186,0.00013775309],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024460251,0.00025077455,0.00044302232,0.0003657962,0.00024253156,0.00010394423,0.00043336794,0.00019233332,0.0000053289345],"category_scores_gemma":[0.0020635354,0.0002498106,0.00009050381,0.00046893972,0.000032362484,0.00026443577,0.00002737564,0.00015904257,0.00006912823],"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.000026620888,0.000013601363,0.000007643896,0.00030497115,0.000065311215,0.0000061784403,0.0004371785,0.9744939,0.00910243,0.0008166385,0.00016263314,0.01456289],"study_design_scores_gemma":[0.00044423973,0.00029567143,0.00054414355,0.00014124023,0.00005505995,0.00012897406,0.000029340557,0.99315095,0.0035048963,0.0008148451,0.0005287185,0.00036191518],"about_ca_topic_score_codex":0.000046531422,"about_ca_topic_score_gemma":0.0000011411697,"teacher_disagreement_score":0.018657053,"about_ca_system_score_codex":0.00012383015,"about_ca_system_score_gemma":0.000058072426,"threshold_uncertainty_score":0.9999954},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004149098,0.00030806358,0.9784085,0.0006299697,0.01032331,0.001961512,0.000053137024,0.00304931,0.0011170655],"genre_scores_gemma":[0.95071524,0.000010417359,0.046582934,0.00005330215,0.0008406312,0.00032026877,0.000021976875,0.000109645895,0.0013455597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9938067,0.00055584445,0.0016727214,0.0014501846,0.0010247878,0.0014897442],"domain_scores_gemma":[0.9922928,0.004016828,0.00036638993,0.0024707702,0.00045794688,0.00039523246],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0035105424,0.00056339387,0.0009276822,0.0006404787,0.0014019129,0.0012595808,0.0022979353,0.00033285233,0.0000042152933],"category_scores_gemma":[0.0005514692,0.0005693956,0.00037097116,0.0015946061,0.00008415075,0.0008021641,0.000098510805,0.0005389046,0.0004122691],"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.00006238853,0.00019792041,0.000049647544,0.0017000416,0.000331152,0.000063295214,0.004237552,0.9393511,0.0017759457,0.035445858,0.0018102166,0.014974921],"study_design_scores_gemma":[0.0009460004,0.00023672312,0.000035148856,0.0011558648,0.00004801152,0.00021557703,0.002206986,0.99067146,0.0003977516,0.00036383347,0.0031339773,0.000588644],"about_ca_topic_score_codex":0.0003076327,"about_ca_topic_score_gemma":0.000003726362,"teacher_disagreement_score":0.94656616,"about_ca_system_score_codex":0.00040701573,"about_ca_system_score_gemma":0.00021945943,"threshold_uncertainty_score":0.99989814},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018883399,0.00052036694,0.17816572,0.0034876834,0.0019765303,0.04242298,0.00012582686,0.0044642794,0.7669483],"genre_scores_gemma":[0.2148162,0.0001966285,0.041026916,0.00028652995,0.0056102853,0.017601637,0.00006812362,0.0008321803,0.7195615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979839,0.00005465854,0.0004583663,0.00073256454,0.00039702444,0.0003735273],"domain_scores_gemma":[0.99828726,0.00043023375,0.00023537251,0.0007867542,0.00009604856,0.00016430485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005738982,0.00036806945,0.0005272245,0.00026513686,0.00020101853,0.00039513805,0.0005740965,0.0003225061,0.000030077186],"category_scores_gemma":[0.000054783173,0.00035274192,0.00016608786,0.000119633296,0.00008565932,0.00033090299,0.0002220417,0.0003633811,0.0004474376],"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.0000432885,0.000065856264,0.0009055234,0.0015190474,0.0010175864,0.000324613,0.008050134,0.00019723403,0.0008274681,0.857968,0.0015337171,0.12754758],"study_design_scores_gemma":[0.00294868,0.0015186464,0.011946877,0.026840203,0.0006637541,0.00025718458,0.00039439223,0.0030267457,0.004154521,0.4123305,0.52793264,0.007985828],"about_ca_topic_score_codex":0.00003700059,"about_ca_topic_score_gemma":0.000008516731,"teacher_disagreement_score":0.52639896,"about_ca_system_score_codex":0.00006112205,"about_ca_system_score_gemma":0.00008892149,"threshold_uncertainty_score":0.9998925},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026521753,0.0004963861,0.07428934,0.00010189372,0.0014270581,0.00086533313,0.000010515793,0.0008973018,0.92164695],"genre_scores_gemma":[0.0008105155,0.00026901122,0.020107122,0.000009827796,0.00035166935,0.000028358725,0.00003963594,0.0000730567,0.9783108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973365,0.00012309045,0.0009491901,0.0007559823,0.0005328165,0.00030242893],"domain_scores_gemma":[0.99750936,0.00041656883,0.00072304165,0.000981485,0.0002620229,0.00010750419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011300426,0.000342279,0.00078346714,0.0004088424,0.00007939411,0.00035815418,0.00074527675,0.00044304947,0.000019973108],"category_scores_gemma":[0.00008007953,0.00032315485,0.000111391855,0.00023128197,0.00005402053,0.00053668785,0.0002697166,0.00023534257,0.00065031566],"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.00001960449,0.000050112598,0.000041283656,0.006416244,0.0007574824,0.0001480174,0.001891411,0.005686861,0.02851873,0.86964726,0.06647496,0.020348031],"study_design_scores_gemma":[0.00086273917,0.00034977237,0.00011128205,0.007105096,0.00012324554,0.00028221734,0.00018430836,0.9662762,0.0014106419,0.010595766,0.010664006,0.0020346704],"about_ca_topic_score_codex":0.00026278445,"about_ca_topic_score_gemma":0.0000071816394,"teacher_disagreement_score":0.9605894,"about_ca_system_score_codex":0.00013214286,"about_ca_system_score_gemma":0.00048781795,"threshold_uncertainty_score":0.99992204},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33706686,0.000037637612,0.65955037,0.0007338933,0.00031875583,0.00033501352,0.000005277714,0.0012940152,0.0006581931],"genre_scores_gemma":[0.7521537,0.000019187406,0.24649195,0.00022901698,0.00012125136,0.000035837416,0.000010284411,0.000029901601,0.0009088787],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997205,0.00023356592,0.0004816805,0.00089882733,0.0004645475,0.00071633415],"domain_scores_gemma":[0.9980245,0.00064019684,0.00017366791,0.00073468796,0.00013059594,0.00029633509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019309996,0.000312317,0.0004076549,0.00023965436,0.0004957744,0.00060186576,0.00034281122,0.00016286026,0.000021268574],"category_scores_gemma":[0.00044262802,0.00026614737,0.000094168434,0.0008367711,0.00008979133,0.0012423757,0.00036577543,0.0003229609,0.0004500106],"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.00021872424,0.00052269397,0.034778915,0.00091845426,0.000624433,0.0045505944,0.036812726,0.18849862,0.6241377,0.02425232,0.004492609,0.08019221],"study_design_scores_gemma":[0.000663178,0.000044388784,0.0030992518,0.0001158443,0.00001275821,0.00018092801,0.0011686161,0.97756684,0.016473413,0.000051164265,0.00019582662,0.00042777054],"about_ca_topic_score_codex":0.0005115476,"about_ca_topic_score_gemma":0.00017105977,"teacher_disagreement_score":0.7890682,"about_ca_system_score_codex":0.000081393184,"about_ca_system_score_gemma":0.00014072277,"threshold_uncertainty_score":0.9999791},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040427394,0.0003303868,0.117578894,0.00050844054,0.00068216847,0.003505929,0.8340567,0.00067903235,0.0022310533],"genre_scores_gemma":[0.51118845,0.000100059005,0.0006929194,0.000018560151,0.00008748469,2.540127e-7,0.48747417,0.00040818274,0.000029900088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962843,0.00091524265,0.00080923823,0.00055983965,0.001093379,0.00033797827],"domain_scores_gemma":[0.9973456,0.00018493591,0.0006138898,0.0014121056,0.0003747041,0.00006873737],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021274618,0.00023131292,0.0003797452,0.00056681235,0.00047903,0.0003505499,0.0037448995,0.00010636146,0.0011932182],"category_scores_gemma":[0.0006809453,0.00020037932,0.000085079155,0.0010718207,0.00008450592,0.0003779538,0.0020947237,0.0006173053,0.00011512869],"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.00021919466,0.000809363,0.000004709592,0.001180874,0.00013162011,0.000036676458,0.008442976,0.6497231,0.0012913345,0.00021748086,0.2525875,0.08535516],"study_design_scores_gemma":[0.0008279647,0.0003462266,0.00017214735,0.00015970373,0.00001508922,0.0000294135,0.00010257256,0.600954,0.00013204837,0.000037649563,0.39700952,0.0002136831],"about_ca_topic_score_codex":0.00005704669,"about_ca_topic_score_gemma":7.882757e-7,"teacher_disagreement_score":0.47076106,"about_ca_system_score_codex":0.00016520178,"about_ca_system_score_gemma":0.000013026215,"threshold_uncertainty_score":0.9997198},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032505897,0.00019571351,0.049428735,0.00088404986,0.0010949589,0.0013959444,0.91932386,0.0015541993,0.026090039],"genre_scores_gemma":[0.0005239243,0.00012474712,0.0012887084,0.000121656776,0.0003350302,7.7896416e-8,0.99570054,0.0010035986,0.0009017046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99650013,0.00065283565,0.0004917786,0.0010051852,0.0008264304,0.0005236164],"domain_scores_gemma":[0.9960755,0.000045950197,0.00039481398,0.0025351138,0.00073060475,0.00021802825],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013274859,0.00029783224,0.00031968337,0.0005072092,0.0014377604,0.0033251853,0.0058451607,0.00024693177,0.0044127796],"category_scores_gemma":[0.00062056235,0.00031937344,0.0001016968,0.0008859652,0.00008581253,0.0007948407,0.0031402023,0.000624454,0.10716086],"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.0000056180347,0.000060938877,5.5628547e-8,0.00015918781,0.000033335513,0.000012049021,0.000117496544,0.00005347136,0.00026570604,0.0010781336,0.985465,0.012749023],"study_design_scores_gemma":[0.000228719,0.00011976528,0.000022573426,0.00008329817,0.000013730014,0.00015610161,0.000027935801,0.0010406853,0.0000718852,0.0000674428,0.9978403,0.00032756643],"about_ca_topic_score_codex":0.000048678445,"about_ca_topic_score_gemma":2.2655394e-7,"teacher_disagreement_score":0.10274808,"about_ca_system_score_codex":0.00026739403,"about_ca_system_score_gemma":0.0000150809465,"threshold_uncertainty_score":0.99992585},"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":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040427394,0.0003303868,0.117578894,0.00050844054,0.00068216847,0.003505929,0.8340567,0.00067903235,0.0022310533],"genre_scores_gemma":[0.51118845,0.000100059005,0.0006929194,0.000018560151,0.00008748469,2.540127e-7,0.48747417,0.00040818274,0.000029900088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962843,0.00091524265,0.00080923823,0.00055983965,0.001093379,0.00033797827],"domain_scores_gemma":[0.9973456,0.00018493591,0.0006138898,0.0014121056,0.0003747041,0.00006873737],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021274618,0.00023131292,0.0003797452,0.00056681235,0.00047903,0.0003505499,0.0037448995,0.00010636146,0.0011932182],"category_scores_gemma":[0.0006809453,0.00020037932,0.000085079155,0.0010718207,0.00008450592,0.0003779538,0.0020947237,0.0006173053,0.00011512869],"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.00021919466,0.000809363,0.000004709592,0.001180874,0.00013162011,0.000036676458,0.008442976,0.6497231,0.0012913345,0.00021748086,0.2525875,0.08535516],"study_design_scores_gemma":[0.0008279647,0.0003462266,0.00017214735,0.00015970373,0.00001508922,0.0000294135,0.00010257256,0.600954,0.00013204837,0.000037649563,0.39700952,0.0002136831],"about_ca_topic_score_codex":0.00005704669,"about_ca_topic_score_gemma":7.882757e-7,"teacher_disagreement_score":0.47076106,"about_ca_system_score_codex":0.00016520178,"about_ca_system_score_gemma":0.000013026215,"threshold_uncertainty_score":0.9997198},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032505897,0.00019571351,0.049428735,0.00088404986,0.0010949589,0.0013959444,0.91932386,0.0015541993,0.026090039],"genre_scores_gemma":[0.0005239243,0.00012474712,0.0012887084,0.000121656776,0.0003350302,7.7896416e-8,0.99570054,0.0010035986,0.0009017046],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99650013,0.00065283565,0.0004917786,0.0010051852,0.0008264304,0.0005236164],"domain_scores_gemma":[0.9960755,0.000045950197,0.00039481398,0.0025351138,0.00073060475,0.00021802825],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0013274859,0.00029783224,0.00031968337,0.0005072092,0.0014377604,0.0033251853,0.0058451607,0.00024693177,0.0044127796],"category_scores_gemma":[0.00062056235,0.00031937344,0.0001016968,0.0008859652,0.00008581253,0.0007948407,0.0031402023,0.000624454,0.10716086],"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.0000056180347,0.000060938877,5.5628547e-8,0.00015918781,0.000033335513,0.000012049021,0.000117496544,0.00005347136,0.00026570604,0.0010781336,0.985465,0.012749023],"study_design_scores_gemma":[0.000228719,0.00011976528,0.000022573426,0.00008329817,0.000013730014,0.00015610161,0.000027935801,0.0010406853,0.0000718852,0.0000674428,0.9978403,0.00032756643],"about_ca_topic_score_codex":0.000048678445,"about_ca_topic_score_gemma":2.2655394e-7,"teacher_disagreement_score":0.10274808,"about_ca_system_score_codex":0.00026739403,"about_ca_system_score_gemma":0.0000150809465,"threshold_uncertainty_score":0.99992585},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024291128,0.00015853549,0.97299963,0.00030390572,0.0005209179,0.0013629078,0.000018665185,0.00018923145,0.00015508653],"genre_scores_gemma":[0.67291945,0.0000019389418,0.32606548,0.00007776928,0.00003158194,0.00033202415,0.000026292999,0.000022627068,0.0005228063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998351,0.000038931597,0.0003507999,0.0006893417,0.00020767484,0.00036228585],"domain_scores_gemma":[0.999102,0.00048137136,0.000058064317,0.00025432635,0.0000331022,0.00007112844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061229215,0.00018882462,0.00019901624,0.00023523714,0.00009377012,0.00022395507,0.00028396441,0.00010401403,0.0000035991513],"category_scores_gemma":[0.00008412716,0.0001789357,0.0001312349,0.00022460698,0.000024637011,0.00066260877,0.000060920014,0.000112193964,0.00004642888],"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.00015298768,0.00025629348,0.00014708118,0.0007297016,0.00012562168,0.000014956969,0.0013112141,0.7692029,0.092135645,0.0119770095,0.00011441661,0.123832196],"study_design_scores_gemma":[0.0010529346,0.00008085582,0.00004081974,0.00021911779,0.000014917676,0.0000020130597,0.000086218024,0.9921908,0.0042419066,0.0016712343,0.00018681065,0.00021239181],"about_ca_topic_score_codex":0.00002510979,"about_ca_topic_score_gemma":0.000027018257,"teacher_disagreement_score":0.64862835,"about_ca_system_score_codex":0.00022447233,"about_ca_system_score_gemma":0.00012906242,"threshold_uncertainty_score":0.72967863},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25073335,0.040314164,0.5680561,0.013648784,0.011400499,0.008810087,0.00020525698,0.004817964,0.10201378],"genre_scores_gemma":[0.9643515,0.00067360536,0.03431522,0.00008829133,0.00009703061,0.00007995254,0.00009306788,0.000039412695,0.0002619487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9863674,0.011028296,0.00105157,0.0006838861,0.0004599211,0.00040889674],"domain_scores_gemma":[0.98888993,0.0048942543,0.00022790403,0.005720488,0.00014347826,0.00012394202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.022419218,0.00030092863,0.00048900454,0.0005786604,0.00035943004,0.0010168283,0.00324576,0.00014059954,0.000004450932],"category_scores_gemma":[0.00032863562,0.0003107959,0.000080275204,0.001490899,0.00020659236,0.0005235673,0.0015182382,0.0005414777,0.00015044682],"study_design_candidate":"design_other","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.00006423586,0.0017688414,0.0073315124,0.0007311238,0.0010012893,0.000109640416,0.029632665,0.0072005442,0.004466801,0.3439366,0.038269386,0.5654874],"study_design_scores_gemma":[0.0031248406,0.0002992001,0.43767664,0.004179298,0.000089721485,0.00006235273,0.0010068251,0.46004307,0.0014358994,0.008465654,0.08101177,0.002604717],"about_ca_topic_score_codex":0.0023470805,"about_ca_topic_score_gemma":0.0010690833,"teacher_disagreement_score":0.7136181,"about_ca_system_score_codex":0.00027047025,"about_ca_system_score_gemma":0.00010369612,"threshold_uncertainty_score":0.99993443},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1751126,0.011716249,0.4520092,0.12911662,0.014367916,0.01056178,0.00014792202,0.0028679776,0.20409973],"genre_scores_gemma":[0.76483965,0.00013408679,0.21338406,0.00003887754,0.001222816,0.0006344983,0.0000780667,0.00006200073,0.019605929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952332,0.0009300443,0.00034375075,0.0013134104,0.0014944262,0.00068520964],"domain_scores_gemma":[0.9963229,0.00021482253,0.000027844986,0.0022218756,0.0009883471,0.00022423283],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0032761872,0.00026858595,0.00033818863,0.0007795387,0.00065770175,0.005803164,0.0027543122,0.00044598186,0.00004714958],"category_scores_gemma":[0.00045830949,0.00024781429,0.0001568649,0.0011786114,0.00010752313,0.00041442734,0.008860954,0.0040580686,0.0016761778],"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.000008295284,0.00024092634,0.00023102365,0.001893942,0.00039258995,0.0005940954,0.010785415,0.25833583,0.025709182,0.5910538,0.084781036,0.025973892],"study_design_scores_gemma":[0.000085380765,0.00003594811,0.0001525837,0.00062718627,0.0000070740225,0.00003337283,0.0001018376,0.98430794,0.0012779459,0.004409424,0.008618534,0.00034279065],"about_ca_topic_score_codex":0.0014799301,"about_ca_topic_score_gemma":0.0006597569,"teacher_disagreement_score":0.7259721,"about_ca_system_score_codex":0.0005229618,"about_ca_system_score_gemma":0.0022448609,"threshold_uncertainty_score":0.99999744},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07596435,0.00069347204,0.90696895,0.00008737592,0.00052076427,0.00053623156,0.000009607509,0.0005423763,0.014676876],"genre_scores_gemma":[0.99220216,0.00011727005,0.0016956928,0.000039603154,0.00016089474,0.0000058501532,0.0000050754984,0.000022204444,0.005751271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980705,0.00019807885,0.00018229082,0.0012124558,0.000077646866,0.0002590683],"domain_scores_gemma":[0.99809265,0.00019928529,0.00013903911,0.0013142097,0.00008659535,0.00016819009],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059203076,0.00026213098,0.00026590994,0.0002618207,0.00012631722,0.00031504565,0.001345782,0.00024695162,0.000014765908],"category_scores_gemma":[0.000020480538,0.00028867827,0.00013073474,0.0005234971,0.00010656059,0.00023090429,0.0035551214,0.0005625377,0.0003948705],"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.0000041722824,0.000018927396,0.00016458494,0.00018226448,0.0000725622,0.00008909814,0.00019403634,0.008579565,0.000047607748,0.9886541,0.00012608725,0.0018670339],"study_design_scores_gemma":[0.00018382598,0.00002181824,0.00021107351,0.0002091463,0.00011161122,0.000024697218,0.00016975426,0.20669128,0.00014700115,0.78947926,0.002166682,0.0005838732],"about_ca_topic_score_codex":0.00007809857,"about_ca_topic_score_gemma":0.000008821612,"teacher_disagreement_score":0.9162378,"about_ca_system_score_codex":0.00012870309,"about_ca_system_score_gemma":0.0001735382,"threshold_uncertainty_score":0.99995655},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03704479,0.000101918726,0.9553801,0.000047176578,0.0001976123,0.00020116002,4.824418e-7,0.00047735602,0.00654943],"genre_scores_gemma":[0.8449721,0.000009029681,0.15000583,0.00001436899,0.00008065676,0.000006936542,0.000013858322,0.000023912422,0.004873345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763185,0.00015579026,0.00071511324,0.00059864647,0.0005185254,0.0003801027],"domain_scores_gemma":[0.9987085,0.00020405547,0.00019581316,0.0006334414,0.00013781778,0.000120409946],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011606741,0.00022151173,0.00049915415,0.0009840612,0.00014462815,0.0003912833,0.00039880478,0.00009724193,0.00023143651],"category_scores_gemma":[0.000046009005,0.00020018814,0.00029601497,0.003254257,0.000036591042,0.0008873251,0.00026706548,0.00016917007,0.00033127173],"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.000002074361,0.000014378469,0.000031800286,0.00004927835,0.0006571343,0.00037372776,0.000765349,0.96382123,0.027368518,0.0034665836,0.00004174368,0.0034081747],"study_design_scores_gemma":[0.00007956711,0.000057176454,0.000025801879,0.000119832745,0.00041078276,0.00024785125,0.000071386676,0.99710315,0.0015824033,0.00005543384,0.000030522733,0.00021606694],"about_ca_topic_score_codex":0.0015687004,"about_ca_topic_score_gemma":0.000005458021,"teacher_disagreement_score":0.80792725,"about_ca_system_score_codex":0.00021566048,"about_ca_system_score_gemma":0.000113938215,"threshold_uncertainty_score":0.8163435},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44616872,0.0003669657,0.5528259,0.00017600507,0.0001074843,0.00022684479,1.8833938e-7,0.000015343043,0.00011250261],"genre_scores_gemma":[0.98797816,0.000086395274,0.011804328,0.000032063,0.000029006109,0.00003766828,0.000014807361,0.0000035503842,0.000014015574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886346,0.00026020713,0.00043605347,0.0001938228,0.0001497552,0.00009673052],"domain_scores_gemma":[0.99913895,0.00019571921,0.00018964363,0.0003190478,0.00014406096,0.0000125765455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094138493,0.0000723587,0.0001202537,0.00013426674,0.000102103426,0.00008101355,0.00019840061,0.00008036009,6.5676096e-7],"category_scores_gemma":[0.00013512911,0.00006546473,0.000025143656,0.00078528136,0.000024584813,0.0005060635,0.000036937065,0.00009970749,0.0000010781264],"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.000023178498,0.00009116005,0.0073881084,0.00013730131,0.000039506143,3.0173865e-7,0.006390753,0.6672058,0.10330086,0.045651764,0.000039684313,0.1697316],"study_design_scores_gemma":[0.00029977266,0.000034585482,0.036286775,0.00016952545,0.000016061205,0.000002160256,0.00019062776,0.93911916,0.022571621,0.0011452071,0.00008020764,0.000084270985],"about_ca_topic_score_codex":0.00006775219,"about_ca_topic_score_gemma":0.00024194275,"teacher_disagreement_score":0.54180944,"about_ca_system_score_codex":0.000040832652,"about_ca_system_score_gemma":0.00003858859,"threshold_uncertainty_score":0.26695743},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.7572423e-7,0.00034257237,0.0004982226,0.00024976616,0.00002569793,0.00068939687,0.000026976577,0.00073190645,0.9974352],"genre_scores_gemma":[0.000002027031,6.97898e-7,0.004798454,0.00006457356,0.00079275155,0.000033849217,0.00003330709,0.00015567742,0.9941187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960745,0.00006810661,0.00082667725,0.0013494937,0.00093650544,0.00074470346],"domain_scores_gemma":[0.9964993,0.00015986335,0.00033941228,0.0023197674,0.00018186505,0.00049978204],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004926399,0.00079536333,0.00091694325,0.0005166343,0.00017357877,0.0005138873,0.0027367035,0.00057480537,0.97601247],"category_scores_gemma":[0.000033685257,0.0008240522,0.00036586777,0.0001740383,0.000072536786,0.00050019566,0.0006853051,0.0006212017,0.9980855],"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.00002074046,0.000023553812,6.7128143e-9,0.000044951637,0.000117105614,0.00013914009,0.0000514209,0.00017952002,0.000021829566,0.001756446,0.18829612,0.8093492],"study_design_scores_gemma":[0.00020577424,0.0001604227,5.2043464e-7,0.00034194728,0.000034469645,0.00011790582,1.9755707e-7,0.0013611707,0.000026679716,0.00079899706,0.9960488,0.0009031113],"about_ca_topic_score_codex":0.00004652107,"about_ca_topic_score_gemma":4.1780876e-7,"teacher_disagreement_score":0.80844605,"about_ca_system_score_codex":0.00021134195,"about_ca_system_score_gemma":0.00023783016,"threshold_uncertainty_score":0.99942106},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010899932,0.00052240986,0.9763974,0.007827776,0.0030361041,0.0010836726,0.000020594052,0.00014765438,0.00006447574],"genre_scores_gemma":[0.87187046,0.000048911625,0.12748916,0.00013278855,0.00004442368,0.00017305186,0.000028524366,0.000010603066,0.00020205745],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988952,0.00006646642,0.0003608717,0.0002705073,0.00020945992,0.00019746153],"domain_scores_gemma":[0.9991543,0.000106390275,0.00018298074,0.0004338551,0.000111029316,0.000011432618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003203447,0.0001330589,0.00018422205,0.00017231675,0.00011446988,0.00004384909,0.0007769274,0.00010239324,4.854534e-7],"category_scores_gemma":[0.000052034564,0.00008512529,0.00011269946,0.00083278643,0.00008248096,0.00024723823,0.000010001789,0.00018932478,3.1962705e-7],"study_design_candidate":"design_other","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.00027926452,0.00015632287,0.051880885,0.0006594667,0.00036921565,0.0000050281965,0.03999383,0.16914284,0.0029394045,0.09407752,0.028942075,0.61155415],"study_design_scores_gemma":[0.0042503807,0.00018713006,0.53542054,0.00084946316,0.00020881559,0.0000025356592,0.014357427,0.15560585,0.0791196,0.15880857,0.050320346,0.0008693129],"about_ca_topic_score_codex":0.000022743137,"about_ca_topic_score_gemma":0.00019801714,"teacher_disagreement_score":0.86097056,"about_ca_system_score_codex":0.00007002737,"about_ca_system_score_gemma":0.00009790152,"threshold_uncertainty_score":0.34713086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014796785,0.0010728318,0.994319,0.00028201542,0.002190022,0.0011821483,0.000028697497,0.00019538414,0.0005819393],"genre_scores_gemma":[0.15495557,0.00002943975,0.8441572,0.00020941434,0.00021565931,0.000101278965,0.000025991452,0.000032069853,0.0002733733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99454725,0.00013676695,0.0012262365,0.00207676,0.0011332757,0.0008797379],"domain_scores_gemma":[0.9951641,0.0015131852,0.0005599966,0.0019278362,0.0006675643,0.00016731421],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029555904,0.00063948345,0.0013977976,0.002896746,0.0003015155,0.0016633219,0.003111807,0.00065385376,0.000006544192],"category_scores_gemma":[0.00059783674,0.00060253375,0.00039282805,0.0040035024,0.00028416704,0.0006829187,0.0007647371,0.0011041324,0.0000065376853],"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.00001511072,0.000023976745,0.00030356273,0.0001531335,0.00014248338,0.000054859374,0.0006047057,0.800895,0.00002989392,0.1571674,0.000008575017,0.040601354],"study_design_scores_gemma":[0.00030501615,0.00006691925,0.000049705293,0.0019734048,0.000063963904,0.000008088643,0.0000010554238,0.8873836,0.00013767637,0.1090649,0.00041898593,0.0005267045],"about_ca_topic_score_codex":0.00019780232,"about_ca_topic_score_gemma":0.0002246666,"teacher_disagreement_score":0.1548076,"about_ca_system_score_codex":0.0010487702,"about_ca_system_score_gemma":0.0012998574,"threshold_uncertainty_score":0.9996426},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11586477,0.00010646998,0.87559354,0.0005264234,0.00073048664,0.0006208818,0.000025239953,0.00077174196,0.0057604224],"genre_scores_gemma":[0.98669714,0.000013771275,0.011645699,0.00006625991,0.00024575062,0.000024778474,0.00005055046,0.00003119959,0.0012248397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761635,0.00017077287,0.000446294,0.0009248871,0.00053147663,0.00031022652],"domain_scores_gemma":[0.99834746,0.00020608962,0.00011061428,0.0010899346,0.00011038921,0.00013552376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079442625,0.00022233836,0.00034236387,0.00036080103,0.00010382462,0.00070776534,0.0008798907,0.00004735919,0.000009748933],"category_scores_gemma":[0.000019637366,0.00020291374,0.000038587204,0.00089282007,0.000036004258,0.0012124126,0.00130806,0.00007406465,0.00008473815],"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.000024180514,0.0002787685,0.00044961768,0.0038179758,0.0011887412,0.00056713814,0.019931188,0.07926885,0.07117362,0.77703685,0.016468387,0.029794674],"study_design_scores_gemma":[0.00012917521,0.0000862888,0.00043372993,0.001055699,0.000037884038,0.000032696018,0.0006390886,0.99571234,0.0013587555,0.00010623494,0.00015759633,0.00025052548],"about_ca_topic_score_codex":0.00032009653,"about_ca_topic_score_gemma":0.0000016638419,"teacher_disagreement_score":0.91644347,"about_ca_system_score_codex":0.00009248524,"about_ca_system_score_gemma":0.000053063024,"threshold_uncertainty_score":0.8274582},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6738129,0.0015427178,0.0005844502,0.029603887,0.0015704351,0.0069716284,0.000082951185,0.0156082185,0.27022275],"genre_scores_gemma":[0.9763142,0.00015091132,0.019817077,0.0024790086,0.00012426352,0.00044826523,0.000012741461,0.00009541999,0.0005581548],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9917967,0.0008451216,0.0019305745,0.002302884,0.0012378902,0.0018868278],"domain_scores_gemma":[0.9943659,0.0017716545,0.00042187076,0.002759054,0.000207389,0.0004741859],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017854406,0.0011196623,0.0018074029,0.0007889167,0.0004582518,0.00046823706,0.00353573,0.0010202527,0.00017835852],"category_scores_gemma":[0.0016979838,0.0009886349,0.0006702298,0.00239781,0.00089676527,0.00076993194,0.0010627406,0.0018622074,0.00021618044],"study_design_candidate":"observational","study_design_consensus":null,"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.00023720575,0.00034026307,0.00032071432,0.00008620536,0.00008939716,0.0001836493,0.00009826137,0.00039039575,0.94811624,0.043900277,0.0013035513,0.004933866],"study_design_scores_gemma":[0.0024807565,0.00070063357,0.98164225,0.001078561,0.000063558095,0.0001137202,0.0000590776,0.00002258565,0.00037903618,0.007771144,0.004682175,0.0010065305],"about_ca_topic_score_codex":0.0003386647,"about_ca_topic_score_gemma":0.021875339,"teacher_disagreement_score":0.9813215,"about_ca_system_score_codex":0.0009931226,"about_ca_system_score_gemma":0.00046498337,"threshold_uncertainty_score":0.99925643},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01041585,0.00039013952,0.98209226,0.0020416437,0.0009793211,0.0009138675,0.000010743283,0.00027210964,0.0028840757],"genre_scores_gemma":[0.97383493,0.000003210957,0.025055483,0.0003657332,0.000049239454,0.00020999576,0.0000022511165,0.000007347517,0.0004717867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976882,0.00022893128,0.0005817815,0.0007340782,0.00029255255,0.0004744772],"domain_scores_gemma":[0.99793375,0.0006329003,0.000048927956,0.0008433732,0.00035283228,0.00018824993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011375273,0.00019649672,0.00036654712,0.00006687364,0.00021608555,0.00061024394,0.0006173831,0.000109128065,0.0000062872973],"category_scores_gemma":[0.00036415434,0.00017463154,0.00008065887,0.0002094871,0.000109345005,0.00034926255,0.00035509147,0.00008691747,0.000011623098],"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.000017404886,0.00015511003,0.0014737519,0.0018157177,0.000089226625,0.000021921076,0.0001068595,0.00023441984,0.0024942332,0.98548996,0.0024279645,0.005673412],"study_design_scores_gemma":[0.0015213004,0.00029173438,0.0023979705,0.00074073626,0.00007109649,0.00010261404,0.00040869534,0.9314576,0.021913854,0.035174005,0.005024855,0.00089556555],"about_ca_topic_score_codex":0.0003127149,"about_ca_topic_score_gemma":0.000024123505,"teacher_disagreement_score":0.9634191,"about_ca_system_score_codex":0.000099635305,"about_ca_system_score_gemma":0.00011849722,"threshold_uncertainty_score":0.7121268},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018110804,0.005152809,0.97335815,0.000065531094,0.0014215044,0.0014798507,0.0000065931918,0.00010525045,0.00029947728],"genre_scores_gemma":[0.94839764,0.00006924271,0.051144253,0.000044142904,0.000081002974,0.00021150275,0.0000063682905,0.000010167463,0.000035706802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977912,0.00019607437,0.0009242665,0.0005671764,0.00024695785,0.0002743251],"domain_scores_gemma":[0.99809414,0.0009139243,0.00028384043,0.00046519842,0.00018929708,0.000053624783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095099444,0.00021969044,0.0005240299,0.00031489556,0.00010837748,0.0003113239,0.0005616255,0.0000773515,3.030063e-7],"category_scores_gemma":[0.0000139716685,0.00019666424,0.00007073392,0.0004424487,0.000040506096,0.0005473783,0.00013789476,0.00006853351,0.0000019807146],"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.00008752719,0.00039097146,0.006485367,0.014500078,0.00020578761,0.000053673957,0.0007994708,0.46421984,0.007688617,0.31537384,0.00017752923,0.19001731],"study_design_scores_gemma":[0.0010517907,0.00020076337,0.00061048934,0.002208764,0.000012938657,0.000006945103,0.00021380704,0.990465,0.003654317,0.0003759789,0.0009910666,0.0002081438],"about_ca_topic_score_codex":0.000057607434,"about_ca_topic_score_gemma":0.000015375737,"teacher_disagreement_score":0.9302868,"about_ca_system_score_codex":0.00010197838,"about_ca_system_score_gemma":0.0000473338,"threshold_uncertainty_score":0.8019735},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024541155,0.00071342284,0.9682859,0.0003043109,0.0013789698,0.0028692132,0.000017447777,0.00043696747,0.0014525997],"genre_scores_gemma":[0.97390705,0.000032209737,0.024400368,0.000015234348,0.00010360195,0.0006971826,0.000004192618,0.000038602742,0.00080153666],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99596405,0.00053908903,0.0016286416,0.0008517832,0.00036317986,0.0006532713],"domain_scores_gemma":[0.9932147,0.0034671968,0.00063141825,0.0021716498,0.00040386477,0.00011116781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022586288,0.00037568356,0.00069891656,0.0005908658,0.0010506873,0.00053383555,0.0017750359,0.0002068389,9.462549e-7],"category_scores_gemma":[0.0001073426,0.00032536965,0.0002335713,0.001550616,0.00008387524,0.00038233033,0.000061745544,0.00035630912,0.000017321017],"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.000087362176,0.00048881234,0.00010293023,0.002403242,0.0007095117,0.00017006138,0.0061440975,0.81862986,0.013713043,0.04130362,0.0004303479,0.11581709],"study_design_scores_gemma":[0.001033278,0.00008693489,0.00003771876,0.0012772084,0.00006266581,0.00035507506,0.0034823103,0.9914516,0.001182421,0.0003694254,0.00030488227,0.00035648036],"about_ca_topic_score_codex":0.001816701,"about_ca_topic_score_gemma":0.000047397345,"teacher_disagreement_score":0.9493659,"about_ca_system_score_codex":0.0003075547,"about_ca_system_score_gemma":0.00026509172,"threshold_uncertainty_score":0.99991983},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030655418,0.0016179446,0.8327267,0.00012272758,0.0018581267,0.0016501629,0.000009112466,0.00060348934,0.16138105],"genre_scores_gemma":[0.04392744,0.000114140596,0.9450206,0.00012133151,0.0008569993,0.0000902035,0.000018405557,0.00033568242,0.009515163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99205005,0.00018554872,0.0013565685,0.00229086,0.0025133076,0.0016036932],"domain_scores_gemma":[0.99298257,0.0012661923,0.000663667,0.0032233822,0.0013050896,0.0005591185],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["research_integrity"],"category_scores_codex":[0.0033712757,0.0009673579,0.0013006832,0.0017681237,0.00031107018,0.00066376285,0.0029869282,0.0015654927,0.000018491579],"category_scores_gemma":[0.00071493315,0.001043593,0.00022510177,0.00062303554,0.0003122908,0.0008447119,0.0005694078,0.004644379,0.00024146806],"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.00003837612,0.00009972662,0.000013424708,0.00024126662,0.000039251798,0.00031060746,0.00062900153,0.32159504,0.000048747843,0.6656646,0.0000070188626,0.011312927],"study_design_scores_gemma":[0.006533324,0.0023029814,0.0016153546,0.026778527,0.0002279361,0.00026795093,0.00355941,0.17090687,0.0019072869,0.7391586,0.03355283,0.013188939],"about_ca_topic_score_codex":0.00012556637,"about_ca_topic_score_gemma":0.00008234041,"teacher_disagreement_score":0.15186588,"about_ca_system_score_codex":0.0024790699,"about_ca_system_score_gemma":0.0011151665,"threshold_uncertainty_score":0.9997307},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002192168,0.00022742797,0.9917209,0.0005438499,0.00010454628,0.0020260874,0.0000032119658,0.0001601571,0.0030216193],"genre_scores_gemma":[0.15183726,0.00000569266,0.846788,0.00017554393,0.00003796134,0.0009834351,0.0000053872313,0.000015293324,0.00015143749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983093,0.00005384761,0.00057819864,0.00047337092,0.00026946055,0.00031582417],"domain_scores_gemma":[0.9983239,0.0003997967,0.00020233165,0.0008124562,0.00016509458,0.000096423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010148927,0.00020911626,0.00031762943,0.00016889055,0.00023011319,0.0003696714,0.0006363296,0.00009671962,0.0000063610464],"category_scores_gemma":[0.00016662251,0.0001931453,0.000091115595,0.00033885872,0.000093564675,0.00022613704,0.0003180461,0.0001350222,0.000009503975],"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.0000059742006,0.0005559526,0.00006003132,0.0046902923,0.0002154263,0.0000013026357,0.0024219619,0.11306377,0.0051066712,0.86587274,0.00022523955,0.007780618],"study_design_scores_gemma":[0.0003512969,0.000024521263,0.0000078373105,0.0004384069,0.000033304226,0.000007845307,0.0014610848,0.9710936,0.006034945,0.020093944,0.00026174198,0.0001914809],"about_ca_topic_score_codex":0.0000051182906,"about_ca_topic_score_gemma":9.775624e-7,"teacher_disagreement_score":0.85802984,"about_ca_system_score_codex":0.00011139119,"about_ca_system_score_gemma":0.00017932402,"threshold_uncertainty_score":0.7876237},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1500399,0.0040069004,0.7432248,0.0020692816,0.025212439,0.0021385115,0.0000025645918,0.0005417952,0.07276384],"genre_scores_gemma":[0.96113867,0.00008402078,0.0052512656,0.00010175895,0.00009160468,0.00008068517,0.0000022445497,0.000038670707,0.033211056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9923292,0.00096988,0.0026236232,0.0020183995,0.00062080467,0.0014380828],"domain_scores_gemma":[0.99588484,0.0006802669,0.0006303514,0.002141554,0.0003635522,0.00029941066],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0027857486,0.0007965017,0.0012595422,0.0013296563,0.0003072353,0.0030788344,0.0031824172,0.00062268355,0.000090412825],"category_scores_gemma":[0.00073360803,0.00079052197,0.00025074856,0.0037658778,0.00024918342,0.002021138,0.0020669585,0.0013488028,0.00065141165],"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.00022168565,0.0012467236,0.098966956,0.0047487067,0.00095231086,0.00092897593,0.054491404,0.03644871,0.018337121,0.7300249,0.004643139,0.04898942],"study_design_scores_gemma":[0.0014174446,0.00013759467,0.0023572617,0.010756824,0.000030312542,0.00008105735,0.003998049,0.97866654,0.0008434687,0.0004310076,0.00053462526,0.0007457991],"about_ca_topic_score_codex":0.004588753,"about_ca_topic_score_gemma":0.0005280433,"teacher_disagreement_score":0.9422178,"about_ca_system_score_codex":0.001251382,"about_ca_system_score_gemma":0.00069515005,"threshold_uncertainty_score":0.99945456},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015693016,0.0010167513,0.97709763,0.0013704916,0.001966969,0.0022857664,0.0000129601885,0.00023363494,0.0003227822],"genre_scores_gemma":[0.3494814,0.000018641515,0.6478998,0.00017327862,0.00007816903,0.00012732291,0.000013095713,0.000025545065,0.0021827535],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959767,0.00019688647,0.0015594041,0.00115322,0.0004812189,0.0006325695],"domain_scores_gemma":[0.99590546,0.0008910442,0.00061337766,0.0015291965,0.000893381,0.00016752462],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012235732,0.0005485802,0.0008912156,0.0006310752,0.0003316521,0.00036964394,0.0014909955,0.00041719727,0.00002794616],"category_scores_gemma":[0.0016954648,0.0004802559,0.000523628,0.0014639936,0.00018250663,0.00054362376,0.0005115747,0.0004510174,0.000021947722],"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.00024980737,0.0006076106,0.0007768012,0.0020646222,0.00034238645,0.0000072229345,0.01229767,0.010512103,0.107826374,0.10679624,0.0011810269,0.7573381],"study_design_scores_gemma":[0.0026949476,0.00040119299,0.0007944694,0.0013741477,0.00010695847,0.000021736205,0.00035615588,0.943381,0.03516831,0.0144357,0.0007194934,0.0005458994],"about_ca_topic_score_codex":0.00091124064,"about_ca_topic_score_gemma":0.00050168054,"teacher_disagreement_score":0.9328689,"about_ca_system_score_codex":0.00026907926,"about_ca_system_score_gemma":0.0010048673,"threshold_uncertainty_score":0.9997649},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955635,0.00051353645,0.28803894,0.009468368,0.0019386193,0.0025319385,0.000114806084,0.0041014096,0.09772889],"genre_scores_gemma":[0.7386569,0.00020273551,0.23609044,0.00028973355,0.00014259956,0.0000036447627,0.0000804629,0.00009371043,0.024439778],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99540573,0.0003273183,0.00045160056,0.0017250078,0.00090104324,0.0011893209],"domain_scores_gemma":[0.9950314,0.00015774663,0.0009034486,0.0024901412,0.0005367124,0.0008805255],"candidate_categories":["metaepi_narrow","open_science","insufficient_payload"],"consensus_categories":["open_science"],"category_scores_codex":[0.0006278684,0.0007291078,0.001256544,0.0015679466,0.0009265011,0.0002250159,0.005384425,0.00093553064,0.00061963254],"category_scores_gemma":[0.00005346858,0.0010205519,0.00063440873,0.0016311196,0.0001745486,0.0013550799,0.011242773,0.00084017945,0.0010118843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0005138442,0.0012742147,0.006851779,0.0053251106,0.005139903,0.005419929,0.21733099,0.09293903,0.09529043,0.05682047,0.47271436,0.040379915],"study_design_scores_gemma":[0.0043757833,0.00056445104,0.03109565,0.0026909665,0.00039829686,0.00032550306,0.024794655,0.76059324,0.00129032,0.0020508443,0.16683519,0.0049851146],"about_ca_topic_score_codex":0.008771635,"about_ca_topic_score_gemma":0.0002899639,"teacher_disagreement_score":0.6676542,"about_ca_system_score_codex":0.0015897253,"about_ca_system_score_gemma":0.000559985,"threshold_uncertainty_score":0.9999969},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26024756,0.00007419254,0.6311356,0.000045617722,0.00020392943,0.00025102263,6.710466e-7,0.00058208674,0.10745937],"genre_scores_gemma":[0.66686004,0.000023139724,0.33164144,0.000049763006,0.00005364831,0.000011438791,8.174805e-7,0.000017418555,0.001342309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825954,0.0000753101,0.0004135168,0.00056509057,0.00027264375,0.00041389884],"domain_scores_gemma":[0.99867254,0.000062382234,0.00009375361,0.00082882686,0.000117583884,0.00022488742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005791653,0.00020851867,0.00027100887,0.00013578705,0.00011940632,0.0002149061,0.00074639224,0.00010615309,0.00010648847],"category_scores_gemma":[0.00004069472,0.00017866887,0.000061661805,0.0002484896,0.000029622473,0.0011421508,0.00041480904,0.00010881243,0.00045120416],"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.00021270977,0.00078237616,0.0037358198,0.0004432815,0.0006228307,0.00055407523,0.09930762,0.014150785,0.26963973,0.31981888,0.004352472,0.28637943],"study_design_scores_gemma":[0.00026305698,0.000047371774,0.00013366238,0.0000338522,0.0000067679375,0.00006107061,0.00011321328,0.9926935,0.0036545799,0.0027034972,0.000018201818,0.00027126618],"about_ca_topic_score_codex":0.0011813303,"about_ca_topic_score_gemma":0.000020052099,"teacher_disagreement_score":0.9785427,"about_ca_system_score_codex":0.00003079985,"about_ca_system_score_gemma":0.00007497646,"threshold_uncertainty_score":0.7285905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91684586,0.00064690295,0.044379994,0.0027251102,0.0007835928,0.001781569,0.0005279986,0.0014722861,0.030836694],"genre_scores_gemma":[0.95681906,0.00056004716,0.036254693,0.00005591253,0.00007667263,0.0000027500275,0.00015855096,0.0000739125,0.005998374],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950813,0.00085468485,0.00063201674,0.001439408,0.0010401089,0.00095247454],"domain_scores_gemma":[0.9939849,0.0004457019,0.0018523573,0.0027509949,0.00053441635,0.00043163754],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011853077,0.0007344415,0.0015578583,0.00059998943,0.0008952669,0.00014787697,0.005327392,0.00087788387,0.00020107604],"category_scores_gemma":[0.00005631603,0.00082789187,0.0008874158,0.0010546373,0.00053401414,0.0010487597,0.009334882,0.0008401391,0.00013470625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.00094127096,0.00091808126,0.004442155,0.006255131,0.008073237,0.0014107075,0.2226771,0.03825742,0.43243298,0.0064984537,0.26481038,0.013283091],"study_design_scores_gemma":[0.0033305387,0.00037801894,0.009317072,0.0016065865,0.00081785064,0.00023372327,0.020447118,0.9479321,0.0016368757,0.0004195397,0.011405605,0.002474935],"about_ca_topic_score_codex":0.025273945,"about_ca_topic_score_gemma":0.00026366045,"teacher_disagreement_score":0.9096747,"about_ca_system_score_codex":0.0010504179,"about_ca_system_score_gemma":0.00047649603,"threshold_uncertainty_score":0.9994172},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09670356,0.00014842414,0.89398426,0.0002004572,0.0014709482,0.0041236226,0.00019100003,0.00047276655,0.0027049403],"genre_scores_gemma":[0.8097537,0.000028316656,0.18634805,0.00019845323,0.00019714155,0.0009419521,0.00034561876,0.000057937355,0.0021288448],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99681175,0.000107448475,0.0014046697,0.00052060076,0.00039342354,0.00076209387],"domain_scores_gemma":[0.99707305,0.00055915344,0.0006599416,0.0008870852,0.0006243229,0.0001964562],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001382658,0.0004532544,0.00066910876,0.0004285623,0.00069598976,0.001019494,0.00072939484,0.0003077292,0.0000038167473],"category_scores_gemma":[0.0003038628,0.00042759767,0.00021523447,0.00042933144,0.00011400381,0.0025190318,0.00035185998,0.0002497002,0.000040530555],"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.0025289615,0.003965872,0.069555394,0.04545721,0.0073462464,0.00005343337,0.27020022,0.119363435,0.06157406,0.23887144,0.040237065,0.14084665],"study_design_scores_gemma":[0.003971208,0.00014055899,0.0035815632,0.00070975645,0.00006764646,0.000036372665,0.0016843425,0.9846821,0.002065244,0.0003785567,0.0021897263,0.0004929318],"about_ca_topic_score_codex":0.00014054061,"about_ca_topic_score_gemma":0.00002220777,"teacher_disagreement_score":0.86531866,"about_ca_system_score_codex":0.0002892708,"about_ca_system_score_gemma":0.00016415188,"threshold_uncertainty_score":0.9998176},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59774315,0.000068834146,0.26233843,0.00799519,0.0025879599,0.007932263,0.0010388488,0.00785921,0.11243613],"genre_scores_gemma":[0.97260696,0.000024192634,0.014446966,0.00027854953,0.0004623398,0.0000013219842,0.00047614725,0.0016255233,0.010077992],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978953,0.0002677546,0.0004345233,0.00060493517,0.00031963259,0.0004778424],"domain_scores_gemma":[0.99796313,0.0000734708,0.00013986461,0.00084149826,0.0007982074,0.00018382007],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014061508,0.00013572222,0.00021149428,0.00056936376,0.00039330148,0.00056406675,0.0018310021,0.00007531994,0.0005048228],"category_scores_gemma":[0.0029602947,0.00014697967,0.00005581525,0.0015005124,0.00005844951,0.00044897018,0.0015800577,0.00015277026,0.0022773098],"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.00053214445,0.0006556563,0.00030790464,0.00079017505,0.00019845857,0.00008042747,0.041612323,0.0062995837,0.18336166,0.07622088,0.30665997,0.3832808],"study_design_scores_gemma":[0.0008056599,0.0005592665,0.0029129598,0.0000577275,0.0000042131433,0.000016664577,0.0002753561,0.009905995,0.0023149606,0.00014675049,0.98276204,0.00023838971],"about_ca_topic_score_codex":0.00005919123,"about_ca_topic_score_gemma":0.0000027805045,"teacher_disagreement_score":0.6761021,"about_ca_system_score_codex":0.000107124,"about_ca_system_score_gemma":0.00001133133,"threshold_uncertainty_score":0.9984995},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005035475,0.00022205144,0.95236635,0.0010847321,0.00012744083,0.0003869271,0.0000343111,0.0022962044,0.038446505],"genre_scores_gemma":[0.786402,0.00003382842,0.20924178,0.00016474274,0.000038738846,0.00000294884,0.000035177833,0.000049328046,0.0040314724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655133,0.0001523297,0.0003240583,0.0013582631,0.00086266635,0.0007513246],"domain_scores_gemma":[0.9972306,0.00024381813,0.00017066016,0.0017238552,0.0002615591,0.00036954033],"candidate_categories":["metaepi_narrow","bibliometrics"],"consensus_categories":["bibliometrics"],"category_scores_codex":[0.000617132,0.00051853014,0.0005948744,0.0113521945,0.00041769925,0.00092978776,0.002773728,0.00028762824,0.00017429322],"category_scores_gemma":[0.000014726059,0.00049372803,0.00039732337,0.025502646,0.00021931819,0.008571529,0.0005446359,0.0005501377,0.00019249412],"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.0001951704,0.00030510296,0.001063544,0.00029476304,0.0047793523,0.0044069183,0.0022113675,0.26597688,0.0074110725,0.6998658,0.00886387,0.0046261447],"study_design_scores_gemma":[0.00076192524,0.00016556194,0.00006316845,0.00017450194,0.0010261496,0.000042291795,0.00036140016,0.9850876,0.0012188692,0.000774183,0.009580765,0.0007436291],"about_ca_topic_score_codex":0.00024582067,"about_ca_topic_score_gemma":0.00009140314,"teacher_disagreement_score":0.7813665,"about_ca_system_score_codex":0.00040853955,"about_ca_system_score_gemma":0.0008804045,"threshold_uncertainty_score":0.9998533},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000059115508,0.000011463954,0.00075011246,0.00021411254,0.0018564677,0.00038614136,0.99608266,0.0005345555,0.00010535154],"genre_scores_gemma":[0.0000051260645,0.000030354928,0.000033546516,0.00022366346,0.0000028318423,0.00000610896,0.9996981,1.8942306e-8,2.5686387e-7],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974678,0.00012261028,0.0006058856,0.00043307367,0.00090494397,0.00046569272],"domain_scores_gemma":[0.9975508,0.000050513798,0.0004901172,0.0013278514,0.00034686681,0.00023387595],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069675606,0.00035718895,0.00037876703,0.00018622182,0.00034364295,0.0007442544,0.002367698,0.0004147619,0.00008679063],"category_scores_gemma":[0.0002517589,0.000372099,0.00019910299,0.000982721,0.00010122506,0.0034550796,0.0014047023,0.00035003663,0.7093785],"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.0000053713475,0.000013454394,0.00013370193,0.00016627752,0.000026443087,0.0000066957236,0.00005360781,0.00004443072,4.126154e-8,9.133402e-7,0.99819344,0.0013555927],"study_design_scores_gemma":[0.00022976112,0.0000263017,0.000088377135,0.000007347091,0.00001668752,0.000011353794,0.000064726955,0.000011048532,0.00000221729,0.000003146023,0.9991664,0.00037259987],"about_ca_topic_score_codex":0.0017267575,"about_ca_topic_score_gemma":0.000019726707,"teacher_disagreement_score":0.7092917,"about_ca_system_score_codex":0.00042814636,"about_ca_system_score_gemma":0.00028248384,"threshold_uncertainty_score":0.9998731},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064951032,0.000025008545,0.98013914,0.0013891141,0.0011045772,0.0035484752,0.0002877023,0.00039995697,0.006610927],"genre_scores_gemma":[0.6725411,0.00000883304,0.32071507,0.0022974475,0.00027274553,0.0032495772,0.00039128886,0.000040133473,0.00048382042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966685,0.00006027393,0.001522426,0.00047993194,0.0004671298,0.0008017054],"domain_scores_gemma":[0.9968705,0.0004473734,0.00037949238,0.0012779128,0.0008188105,0.00020590192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011808176,0.00039282165,0.0005098599,0.00032446143,0.0006390271,0.0009163471,0.0012274509,0.00029529782,0.0000048602033],"category_scores_gemma":[0.00027541176,0.00038608987,0.0003280544,0.00057775417,0.00008979224,0.0021514283,0.0003967002,0.00032079333,0.000094756855],"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.000023603654,0.00020554903,0.00010317707,0.00086134236,0.00010987568,7.41389e-7,0.0009998471,0.00005444651,0.0004095929,0.990284,0.0020330288,0.0049147527],"study_design_scores_gemma":[0.005378291,0.00033805825,0.00042884483,0.00042411027,0.00016674605,0.00007790561,0.0017684442,0.6962191,0.016381856,0.20190848,0.07564669,0.0012614881],"about_ca_topic_score_codex":0.000021938058,"about_ca_topic_score_gemma":0.000022979502,"teacher_disagreement_score":0.78837556,"about_ca_system_score_codex":0.00020346233,"about_ca_system_score_gemma":0.00025546618,"threshold_uncertainty_score":0.9998591},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000032319044,0.0011789132,0.00004116511,0.000019009482,0.00007222309,0.00028604595,0.99829185,0.0000485038,0.00005908332],"genre_scores_gemma":[0.00005803266,0.0000031291443,0.0051620966,0.000018808843,0.000121730154,0.0004446806,0.9940992,0.000029161172,0.000063188956],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970415,0.0001931766,0.000923416,0.00070376555,0.00078530586,0.00035282125],"domain_scores_gemma":[0.9961423,0.0015073268,0.0011798582,0.00084033736,0.0001965483,0.00013357738],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00020694172,0.00036202592,0.0006283498,0.00028767932,0.00017373683,0.00012924551,0.0014725196,0.00022690154,0.9889298],"category_scores_gemma":[0.0019712853,0.00040290362,0.0001952373,0.00041464614,0.00003012316,0.0005062593,0.00068106287,0.0005658579,0.00016630115],"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.0000017896061,0.0000344108,4.1241222e-8,0.0015474916,0.00004963329,0.00008346964,0.0001633038,0.000023827639,0.001321809,0.0000075820662,0.9920713,0.0046953405],"study_design_scores_gemma":[0.0001165247,0.000055665143,0.000012137198,0.0049549113,0.000015461474,0.00004916666,0.00007024507,0.0029932112,0.0014031876,0.00010134899,0.9898601,0.0003680515],"about_ca_topic_score_codex":0.00004669563,"about_ca_topic_score_gemma":0.0000066874345,"teacher_disagreement_score":0.9887635,"about_ca_system_score_codex":0.000062993415,"about_ca_system_score_gemma":0.00035514432,"threshold_uncertainty_score":0.9998423},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020736804,0.001295448,0.00012172882,0.0000017736043,0.00024938426,0.0012437024,0.996686,0.000013990804,0.00018062255],"genre_scores_gemma":[0.0026259515,0.00020802123,0.0016100754,0.000033485496,0.00003520389,0.000014757538,0.99456334,0.000090373425,0.00081877277],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9949815,0.00057858636,0.0012691773,0.001122014,0.0012436251,0.00080506504],"domain_scores_gemma":[0.9959692,0.00046520127,0.0008045666,0.0020203956,0.00013593529,0.00060473965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014537246,0.00056629314,0.0014304612,0.00021286288,0.000038058788,0.00013756257,0.001354857,0.00023513183,0.00016388546],"category_scores_gemma":[0.00012943237,0.00052382896,4.647396e-7,0.00037624474,0.00027514788,0.00026105606,0.0010495492,0.00032307726,0.000001591972],"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.0001811978,0.00007491538,0.0009210765,0.0006518851,0.00022929942,0.00020008752,0.00006058869,0.00005407238,0.0000121273215,0.00014438528,0.9972672,0.00020317567],"study_design_scores_gemma":[0.0013334235,0.00035864228,0.0015459583,0.00026173753,0.0002555932,0.000094053816,0.0003243282,0.00070473395,6.856139e-7,1.837641e-7,0.9945472,0.0005734967],"about_ca_topic_score_codex":0.99962175,"about_ca_topic_score_gemma":0.98925495,"teacher_disagreement_score":0.010366804,"about_ca_system_score_codex":0.0001557381,"about_ca_system_score_gemma":0.0031020693,"threshold_uncertainty_score":0.99972135},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75941926,0.12535332,0.0002541629,0.003999946,0.0020515004,0.009933956,0.013600297,0.0016214041,0.08376613],"genre_scores_gemma":[0.9857245,0.000086492575,0.0010159897,0.00004301061,0.00015917917,0.000104171035,0.000778515,0.00012368448,0.01196447],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.9980545,0.00025876478,0.00037040206,0.0004842931,0.00054945936,0.00028259063],"domain_scores_gemma":[0.99809283,0.00035020415,0.00075534696,0.00064866705,0.00008193339,0.00007100852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045445416,0.0003489908,0.0004571084,0.00025068386,0.00044525845,0.00034766973,0.0007089212,0.000118546304,0.0001542214],"category_scores_gemma":[0.00023001176,0.00014598349,0.000055970133,0.0016961918,0.00005590668,0.00021152025,0.00029326836,0.00040882034,0.000043834294],"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.000037795005,0.00006595288,0.21106623,0.003236746,0.00095285545,0.000013945618,0.008116602,0.0039503626,0.00003644109,0.00013572144,0.7339652,0.03842213],"study_design_scores_gemma":[0.0002539474,0.00013637717,0.9404356,0.0026073433,0.000019573565,0.00004744231,0.00005417376,0.052665606,0.0000023034142,0.000019457922,0.0035047752,0.00025342926],"about_ca_topic_score_codex":0.00084491057,"about_ca_topic_score_gemma":0.00022485407,"teacher_disagreement_score":0.73046046,"about_ca_system_score_codex":0.00005514405,"about_ca_system_score_gemma":0.00007052185,"threshold_uncertainty_score":0.5953034},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2042228,0.000031074804,0.3997272,0.0026407405,0.0009189853,0.0006575238,0.000023119968,0.0045293267,0.38724923],"genre_scores_gemma":[0.98518014,0.0000035893218,0.0136053655,0.000097214244,0.0001682965,2.004987e-8,0.00005758021,0.0005548361,0.0003329393],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984222,0.00020226753,0.00021954864,0.00044640992,0.00036459457,0.00034499285],"domain_scores_gemma":[0.9983575,0.000023335986,0.00009169839,0.00091831555,0.00040635478,0.00020283299],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00091549027,0.000115113595,0.00011163889,0.00016654626,0.001402254,0.0019479077,0.0024786205,0.00006626582,0.0020530005],"category_scores_gemma":[0.0004140362,0.000118807366,0.000046929603,0.0005290586,0.00008477253,0.0006643975,0.0021790843,0.00038753555,0.012783854],"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.000018699218,0.0002252323,0.000028648572,0.00007798507,0.000053561762,0.00005748777,0.0037628424,0.00022559316,0.20867027,0.3507209,0.07576351,0.36039525],"study_design_scores_gemma":[0.00036561658,0.00011498863,0.0014875727,0.000017163982,0.000004011272,0.0003765106,0.00009183946,0.014383211,0.004188851,0.0016713716,0.977033,0.00026581765],"about_ca_topic_score_codex":0.0000172593,"about_ca_topic_score_gemma":2.5967987e-7,"teacher_disagreement_score":0.90126956,"about_ca_system_score_codex":0.00003944325,"about_ca_system_score_gemma":0.0000047258004,"threshold_uncertainty_score":0.9998978},"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":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033281004,0.005322886,0.38606468,0.00024337042,0.002356736,0.0017238857,0.6028276,0.0007775026,0.00035053462],"genre_scores_gemma":[0.018629251,0.00023569638,0.21188375,0.00043994247,0.0023050029,0.00081481383,0.7638999,0.0010470282,0.00074460404],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99061155,0.0006211973,0.0022971695,0.00333405,0.0011856097,0.0019503996],"domain_scores_gemma":[0.9873218,0.0056315903,0.0017456288,0.004299372,0.00038929266,0.00061232084],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017158238,0.0017518259,0.0030319947,0.0016575495,0.00030164604,0.0007119581,0.0052648303,0.0021523468,0.00085090974],"category_scores_gemma":[0.0027929328,0.001687764,0.0013138778,0.0016248794,0.0005309485,0.00057664345,0.001862214,0.0012553945,0.0001537912],"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.00009743334,0.00044288905,0.0027254974,0.002222008,0.0040946943,0.000063475636,0.003252998,0.00022212199,0.00013450965,0.012803705,0.9660197,0.007920986],"study_design_scores_gemma":[0.0025804986,0.00050812383,0.00068005547,0.0014276302,0.0011547231,0.000055341192,0.0005527763,0.0024535712,0.0013156064,0.030838214,0.9553449,0.0030885513],"about_ca_topic_score_codex":0.85907066,"about_ca_topic_score_gemma":0.3096092,"teacher_disagreement_score":0.5494615,"about_ca_system_score_codex":0.00049049547,"about_ca_system_score_gemma":0.00086397136,"threshold_uncertainty_score":0.99952275},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9928574,0.000029671244,0.00006111942,0.0000570174,0.0025344344,0.0017090475,0.00037752412,0.000264558,0.0021092393],"genre_scores_gemma":[0.9920156,0.00003532822,0.004827552,0.00059258024,0.00003982069,0.00074305787,0.0015519606,0.00004309944,0.00015099312],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9949121,0.00031283195,0.0017452777,0.0007532966,0.0013732845,0.00090321613],"domain_scores_gemma":[0.9961962,0.00031414887,0.0012302961,0.0011393254,0.00064140634,0.00047861243],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007135192,0.00072126824,0.00082802074,0.0011596893,0.00063706416,0.0007879632,0.001194114,0.00032232446,0.000015012429],"category_scores_gemma":[0.0004813594,0.0007588465,0.000106531144,0.0018322661,0.000009832486,0.025329132,0.0002161472,0.0011752204,0.000084119565],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024236113,0.000077273384,0.005908123,0.0025864937,0.00024772578,0.000024606552,0.0015237888,0.009121521,0.0001364313,0.005662674,0.00006373176,0.9744053],"study_design_scores_gemma":[0.007912425,0.00065994164,0.81167555,0.043089956,0.00015867065,0.000014612196,0.028073413,0.026934927,0.036455467,0.0010997866,0.03669833,0.007226942],"about_ca_topic_score_codex":0.820054,"about_ca_topic_score_gemma":0.9206336,"teacher_disagreement_score":0.96717834,"about_ca_system_score_codex":0.0047340244,"about_ca_system_score_gemma":0.0013222663,"threshold_uncertainty_score":0.99948627},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42875838,0.00008323194,0.5692011,0.00012724055,0.0005247904,0.0006057729,0.000011040901,0.0005272322,0.00016118104],"genre_scores_gemma":[0.98771995,0.000009056757,0.011034617,0.00012776912,0.00023575581,0.000009824896,0.0000076238525,0.00006784355,0.0007875375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9962869,0.00026377768,0.00056775386,0.0012228652,0.0006448797,0.0010137907],"domain_scores_gemma":[0.99727446,0.00021378236,0.00043504566,0.0012615424,0.00035204383,0.00046309936],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011402268,0.0005122618,0.00065583497,0.0007332318,0.0006385868,0.0010690055,0.002528389,0.00030694934,0.0000014646216],"category_scores_gemma":[0.00003656766,0.00058090704,0.0003498781,0.00076420815,0.00007252416,0.005049458,0.00041908486,0.00049467664,0.00022427361],"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.00044137565,0.00043030764,0.3743615,0.0015840937,0.00074959494,0.0021614388,0.003128864,0.4874218,0.007662916,0.11901416,0.0000011748876,0.0030427815],"study_design_scores_gemma":[0.18045852,0.0074151736,0.44758844,0.03519549,0.003918813,0.0088413535,0.012934499,0.13171107,0.099046715,0.023960596,0.01629025,0.032639075],"about_ca_topic_score_codex":0.00001612563,"about_ca_topic_score_gemma":0.00009134883,"teacher_disagreement_score":0.5589616,"about_ca_system_score_codex":0.00096188695,"about_ca_system_score_gemma":0.00026151343,"threshold_uncertainty_score":0.999968},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88810325,0.00032769138,0.10541016,0.0009289474,0.0010575432,0.0016087895,0.0004913824,0.00046071736,0.0016115115],"genre_scores_gemma":[0.7803841,0.0026789873,0.1830968,0.000011746544,0.00017553021,1.4314196e-7,0.00068833574,0.00009640339,0.032867968],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9964717,0.00031970424,0.0004913124,0.0010609896,0.000978862,0.0006774045],"domain_scores_gemma":[0.9933908,0.0014275779,0.0021235673,0.0015000588,0.00131601,0.00024196734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010132215,0.0006180453,0.0015760623,0.00091430283,0.0011831857,0.000053142052,0.0051565156,0.0012112187,0.00010215284],"category_scores_gemma":[0.0001574213,0.0007816725,0.0007578918,0.0014379614,0.00061367603,0.0010059667,0.0007826516,0.0009979747,0.0000604518],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","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.012959216,0.0036600803,0.0041482295,0.03372437,0.009304502,0.0006118064,0.46075934,0.34898353,0.019909352,0.042838965,0.007820533,0.05528008],"study_design_scores_gemma":[0.007012842,0.0017775251,0.014165048,0.013567208,0.002478068,0.00002756213,0.59030765,0.36107224,0.00093848427,0.00092490145,0.0045765345,0.0031519434],"about_ca_topic_score_codex":0.012386075,"about_ca_topic_score_gemma":0.001978997,"teacher_disagreement_score":0.1295483,"about_ca_system_score_codex":0.00024182386,"about_ca_system_score_gemma":0.0006740973,"threshold_uncertainty_score":0.99946344},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18561837,0.016529877,0.10445405,0.0019072692,0.17193638,0.03894294,0.006772635,0.019706484,0.45413202],"genre_scores_gemma":[0.9774188,0.00013285273,0.014799795,0.00034137678,0.0006883423,0.0009838871,0.0010997594,0.00048103693,0.004054165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9905245,0.0008936907,0.0023206351,0.0028933722,0.0015807992,0.0017870218],"domain_scores_gemma":[0.9929637,0.0017950645,0.00096121494,0.0020468873,0.0011591226,0.001074035],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0021210455,0.0014252453,0.0019885297,0.00044862152,0.0018865995,0.0010496541,0.0037792567,0.0017439614,0.000023810579],"category_scores_gemma":[0.0015662981,0.0015588752,0.00088690314,0.0012528426,0.00008319314,0.002267285,0.00047540522,0.002396522,0.0004352919],"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.00022701266,0.00014605036,0.000005311581,0.0022519045,0.00034973407,0.00020151495,0.00002667986,0.0021805018,0.005215916,0.92638266,0.00005176865,0.06296093],"study_design_scores_gemma":[0.0057971515,0.0016472196,0.00024179932,0.009610295,0.0011288299,0.000647856,0.0013273618,0.5566331,0.025674429,0.029479608,0.35696426,0.010848086],"about_ca_topic_score_codex":0.00025370243,"about_ca_topic_score_gemma":0.00016003204,"teacher_disagreement_score":0.89690304,"about_ca_system_score_codex":0.0009563709,"about_ca_system_score_gemma":0.00021884574,"threshold_uncertainty_score":0.99998736},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025338367,8.1259105e-7,0.10658877,0.0002986315,0.00054864783,0.00036312453,0.0000023185926,0.0007049435,0.8661544],"genre_scores_gemma":[0.9281002,0.0017288977,0.069190696,0.00022928602,0.00046740854,0.0000022151983,0.0000030229353,0.00003572931,0.0002425406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979733,0.00019770348,0.00021974008,0.0007076603,0.00036329497,0.00053829123],"domain_scores_gemma":[0.9983614,0.0000970798,0.00018801054,0.0009332461,0.00028072245,0.00013954949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043414498,0.00024150066,0.00024803902,0.007023572,0.0003180016,0.00021879874,0.001765358,0.00012746986,0.000025135532],"category_scores_gemma":[0.000088068744,0.0002561864,0.0001280199,0.010020787,0.00012821273,0.001456019,0.00066107634,0.00018442995,0.00046174595],"study_design_candidate":"not_applicable","study_design_consensus":null,"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.00026617822,0.0012185229,0.009176652,0.00049092923,0.0009023187,0.0029978452,0.10645844,0.00014135777,0.003182902,0.5153918,0.018769305,0.3410037],"study_design_scores_gemma":[0.00049950805,0.00015597869,0.000113064365,0.000051525276,0.0000156711,0.00003774509,0.0001842779,0.0053141676,0.0029820334,0.000003987604,0.9903197,0.0003223392],"about_ca_topic_score_codex":0.03587107,"about_ca_topic_score_gemma":0.003980252,"teacher_disagreement_score":0.9715504,"about_ca_system_score_codex":0.00020083168,"about_ca_system_score_gemma":0.00038729058,"threshold_uncertainty_score":0.99998903},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015008011,0.0014297201,0.0048174188,0.00019955797,0.005709937,0.0017975016,0.000011349296,0.0014671128,0.9695594],"genre_scores_gemma":[0.0872411,0.00013337105,0.001793186,0.0000147710325,0.00020353652,0.000013074796,0.000060945888,0.000094899326,0.9104451],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99612045,0.00040334242,0.0006952437,0.0012774765,0.00074913964,0.00075435906],"domain_scores_gemma":[0.997777,0.00033711526,0.0006008017,0.000907646,0.00016156385,0.00021588456],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006128684,0.00057110103,0.0007908156,0.0014599215,0.0001612669,0.0005093372,0.002381602,0.000397454,0.0029086927],"category_scores_gemma":[0.000045126188,0.00066823885,0.00022892901,0.0027985938,0.00002802875,0.0015106042,0.00038724137,0.00076245953,0.0007275639],"study_design_candidate":"design_other","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.00035079254,0.00021961724,0.003027323,0.004430618,0.00061427354,0.006669464,0.03336349,0.006744752,0.00085598574,0.023054287,0.003235683,0.91743374],"study_design_scores_gemma":[0.0076456005,0.0010257408,0.016058316,0.051763307,0.00058727677,0.00014200177,0.12717208,0.13384236,0.00082894176,0.00060976914,0.65095335,0.009371267],"about_ca_topic_score_codex":0.0013594701,"about_ca_topic_score_gemma":0.009045897,"teacher_disagreement_score":0.90806246,"about_ca_system_score_codex":0.0005470774,"about_ca_system_score_gemma":0.00038901163,"threshold_uncertainty_score":0.99957687},"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":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000017463354,0.00042601404,0.000067800764,0.00019409072,0.00096805603,0.00043686197,0.00003166001,0.00041655576,0.9974572],"genre_scores_gemma":[0.00018661456,0.00014852254,0.012920848,0.00011190046,0.0003072644,0.00001611633,0.00003464981,0.00010653254,0.98616755],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978845,0.00009731969,0.0006234354,0.00035044146,0.0006345322,0.00040973682],"domain_scores_gemma":[0.9965388,0.00008439244,0.0013794637,0.0016561501,0.00017210409,0.00016908089],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004639186,0.00040976529,0.00057264866,0.00012259134,0.00013383964,0.00036248643,0.0021053015,0.0004970261,0.08824542],"category_scores_gemma":[0.00017185825,0.00039975566,0.00021175538,0.0000061320757,0.0001167663,7.965359e-7,0.00039884652,0.00030289963,0.04302351],"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.0000058200903,0.000016310065,9.181747e-7,0.0003194305,0.00005000273,0.000028203043,0.000081572274,0.00007615049,3.236123e-7,0.0002177792,0.99482614,0.0043773283],"study_design_scores_gemma":[0.00032898397,0.00006144242,0.000004147371,0.0005316703,0.000018336352,0.00011495163,0.000012550439,0.00021020621,0.000010233678,0.000017284166,0.9982871,0.0004031395],"about_ca_topic_score_codex":0.008148344,"about_ca_topic_score_gemma":0.00078859285,"teacher_disagreement_score":0.04522191,"about_ca_system_score_codex":0.00005078441,"about_ca_system_score_gemma":0.00007480191,"threshold_uncertainty_score":0.99984545},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060415823,0.00094270776,0.14624247,0.008049022,0.01702039,0.010086243,0.00069907116,0.0035766233,0.75296766],"genre_scores_gemma":[0.45662868,0.0006990512,0.01233991,0.0015369876,0.002081099,0.00008232651,0.0005710984,0.0017026521,0.52435815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9844567,0.0029067593,0.0019646955,0.0051469337,0.0024602152,0.0030646685],"domain_scores_gemma":[0.98999846,0.00061882555,0.0023065228,0.004658255,0.00058554433,0.001832365],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.0015928162,0.0024571721,0.0025917771,0.0028933457,0.0021955124,0.0012819178,0.006713945,0.0009527982,0.025513213],"category_scores_gemma":[0.00037371964,0.002994475,0.0011654502,0.0030294633,0.0005063957,0.0025659676,0.005218351,0.0033428832,0.0029749973],"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.0031875346,0.008000428,0.040320378,0.0064262054,0.014089407,0.042758975,0.13605845,0.010462047,0.0076485034,0.08555902,0.62626696,0.019222097],"study_design_scores_gemma":[0.007193695,0.0011313809,0.0048461733,0.0009839933,0.0009512094,0.00031448927,0.02662202,0.013767849,0.0005212357,0.0002614077,0.9370015,0.006404997],"about_ca_topic_score_codex":0.0022279476,"about_ca_topic_score_gemma":0.0008486561,"teacher_disagreement_score":0.39621288,"about_ca_system_score_codex":0.0017764366,"about_ca_system_score_gemma":0.0023254533,"threshold_uncertainty_score":0.99975485},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33821037,0.00007964049,0.657468,0.0014303027,0.00022085906,0.0007049984,0.00004191469,0.0005009703,0.0013429022],"genre_scores_gemma":[0.8506518,0.00001356128,0.14837898,0.00022614081,0.00020506447,7.1355475e-7,0.00002613402,0.00003822825,0.00045938173],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997041,0.00014856824,0.0005398621,0.0010019593,0.0005901697,0.00067845156],"domain_scores_gemma":[0.99694103,0.00065828906,0.00066779804,0.0007796268,0.00046703027,0.00048625324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006525549,0.00038245862,0.00084169756,0.0002490111,0.00048017112,0.00011042119,0.0017955241,0.00023944164,0.00005430621],"category_scores_gemma":[0.0002228786,0.0004721732,0.00042476295,0.0007865859,0.00019769461,0.00087340426,0.00062367105,0.0002269941,0.00019515443],"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.00073523325,0.0009130833,0.004950908,0.001262942,0.0011628891,0.0006546008,0.11375504,0.040582024,0.62178975,0.09710135,0.03169747,0.08539469],"study_design_scores_gemma":[0.0026219685,0.0010572067,0.0015281078,0.00025727766,0.000083596875,0.000025903959,0.004450932,0.9825653,0.003108534,0.0007684116,0.0025689746,0.00096377794],"about_ca_topic_score_codex":0.0007583529,"about_ca_topic_score_gemma":0.000043544063,"teacher_disagreement_score":0.9419833,"about_ca_system_score_codex":0.00015118124,"about_ca_system_score_gemma":0.00016875613,"threshold_uncertainty_score":0.999773},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020727532,0.00012779838,0.95299953,0.00013528412,0.00020959637,0.00038430293,0.000008498015,0.00013164812,0.025275793],"genre_scores_gemma":[0.8029967,0.000002383057,0.1890426,0.0000026619578,0.000110876215,0.00002301692,0.000024263441,0.00001081367,0.0077867173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869823,0.000043370244,0.00051898666,0.00029591424,0.00027391658,0.00016955895],"domain_scores_gemma":[0.9988527,0.00023702753,0.0002569274,0.00041115866,0.00020713975,0.000035025565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006306729,0.00009989295,0.00017376884,0.00009064865,0.00004796484,0.00007823009,0.00038570113,0.000071911905,0.00000998711],"category_scores_gemma":[0.000022597567,0.000091167385,0.00005428141,0.00018735201,0.000024542074,0.00043425898,0.00004728693,0.000035907044,0.00007414505],"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.000009447995,0.00006295422,0.00030469117,0.000062979096,0.000016154096,2.4419717e-7,0.00008238493,0.010241533,0.3066825,0.6550497,0.026803127,0.0006843373],"study_design_scores_gemma":[0.00041132572,0.00007039064,0.0023348918,0.00007056465,0.0000058960272,0.0000120066115,0.000053845717,0.9184602,0.070838094,0.0025233221,0.00498105,0.0002383972],"about_ca_topic_score_codex":0.00054253975,"about_ca_topic_score_gemma":0.0000033137917,"teacher_disagreement_score":0.9082187,"about_ca_system_score_codex":0.00006256147,"about_ca_system_score_gemma":0.00002506843,"threshold_uncertainty_score":0.3717698},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60845965,0.001114751,0.15232392,0.017387355,0.0043074465,0.019206513,0.00007593389,0.007641741,0.18948269],"genre_scores_gemma":[0.68128383,0.000039396837,0.27672282,0.00050078233,0.0009266231,0.00040666628,0.00002389974,0.00012172826,0.039974257],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940311,0.000522398,0.001297975,0.0015314496,0.0014083936,0.0012086999],"domain_scores_gemma":[0.99636,0.00056453934,0.00034843414,0.0015326159,0.0005098668,0.00068454933],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036874623,0.0006673257,0.00085194694,0.00043499918,0.0005519104,0.0018800847,0.00095681165,0.00042018713,0.00018662914],"category_scores_gemma":[0.00029338626,0.0005442695,0.000105426865,0.0006791322,0.00006722815,0.0013849507,0.0004969647,0.0005784517,0.0011989695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0006343185,0.001186953,0.028216464,0.00096243963,0.0010397362,0.0004414031,0.20552504,0.025427787,0.100029565,0.026731389,0.088625394,0.5211795],"study_design_scores_gemma":[0.0039849347,0.0045518237,0.023687817,0.0026107675,0.00018435944,0.000940929,0.008851592,0.7088946,0.044143792,0.00014929747,0.19597085,0.0060292366],"about_ca_topic_score_codex":0.025746237,"about_ca_topic_score_gemma":0.002114916,"teacher_disagreement_score":0.6834668,"about_ca_system_score_codex":0.0003966118,"about_ca_system_score_gemma":0.00020668514,"threshold_uncertainty_score":0.9997009},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9225093,0.000634236,0.039246168,0.00019497272,0.0011396796,0.0017042508,0.000020339985,0.00040788893,0.03414316],"genre_scores_gemma":[0.9789353,0.00034045556,0.0008765854,0.00004868482,0.00008584754,0.0000030314443,0.000005799061,0.00003613873,0.019668126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914577,0.002481838,0.0013202506,0.0030818256,0.00030433325,0.0013540266],"domain_scores_gemma":[0.9939374,0.0015176723,0.00067138753,0.0027066306,0.00060307543,0.0005638473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0048602214,0.0008520004,0.0014988855,0.0011141853,0.0005584496,0.0009035617,0.002291551,0.00080208114,0.00012305047],"category_scores_gemma":[0.00077877176,0.001036753,0.00027482276,0.003962956,0.00067741657,0.0022636557,0.0019764104,0.0012854266,0.0007004341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"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.0017420761,0.0025532616,0.2234507,0.0060740463,0.001641399,0.00588341,0.017504482,0.13657025,0.046894033,0.54910177,0.0036074186,0.004977137],"study_design_scores_gemma":[0.0019301905,0.00013722044,0.010132632,0.0016875969,0.000118059506,0.000029530152,0.00068080483,0.98208594,0.00030084868,0.0015969034,0.00041355297,0.0008867278],"about_ca_topic_score_codex":0.006737075,"about_ca_topic_score_gemma":0.00016536971,"teacher_disagreement_score":0.84551567,"about_ca_system_score_codex":0.00121062,"about_ca_system_score_gemma":0.0008810864,"threshold_uncertainty_score":0.99987715},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03583983,0.0006058229,0.9469651,0.0065396866,0.00040363733,0.002575238,0.0000697996,0.00029144238,0.0067094453],"genre_scores_gemma":[0.64932024,0.000026604832,0.19342552,0.0009909093,0.0003755587,0.0014761718,0.00005748408,0.000052173094,0.15427534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99399287,0.0006926974,0.0015254135,0.0020679622,0.00061441323,0.0011066301],"domain_scores_gemma":[0.99390507,0.0011813747,0.00050311076,0.0033768772,0.0006270306,0.00040654928],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025554802,0.00063321774,0.0011740366,0.0018818323,0.00076015573,0.0012839139,0.0027776433,0.00035853463,0.00024451854],"category_scores_gemma":[0.00019735635,0.00064144534,0.0010466704,0.0074100797,0.00020794867,0.0007863062,0.0007702093,0.00027172355,0.00041376817],"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.0028941554,0.0028478925,0.025029149,0.0015163552,0.03146611,0.00007165259,0.008555289,0.18683499,0.19341384,0.18923108,0.058982972,0.29915652],"study_design_scores_gemma":[0.000877227,0.00012802632,0.008758603,0.000059619586,0.0012235306,0.0000070397887,0.00020232417,0.96199584,0.003944776,0.00055698724,0.021545598,0.0007004274],"about_ca_topic_score_codex":0.00036953582,"about_ca_topic_score_gemma":0.00005937128,"teacher_disagreement_score":0.77516085,"about_ca_system_score_codex":0.0003545836,"about_ca_system_score_gemma":0.00093040644,"threshold_uncertainty_score":0.9997528},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11223596,0.00095138233,0.87563896,0.0027546436,0.0029421458,0.0024293957,0.000025912848,0.0004453819,0.0025762198],"genre_scores_gemma":[0.77754134,0.000022861968,0.21715732,0.0017810926,0.00033523768,0.00028235334,0.000009947319,0.00005660532,0.0028132547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931247,0.0004925995,0.0020301887,0.0020651168,0.00063504046,0.0016523304],"domain_scores_gemma":[0.9942473,0.0022881734,0.00053739,0.0020714218,0.00044420655,0.00041147257],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001526462,0.00089634716,0.0010527634,0.0010697002,0.0012616245,0.001334851,0.0019198762,0.0003481265,0.00005439434],"category_scores_gemma":[0.0012196432,0.0008665755,0.000665863,0.0015088328,0.00017186035,0.00030796346,0.0005851774,0.000643055,0.00021027941],"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.0002576601,0.00061876606,0.00007548524,0.0016362802,0.0007277437,0.00005534193,0.0038727438,0.7607087,0.10111114,0.055842232,0.00054609735,0.074547805],"study_design_scores_gemma":[0.0015147377,0.0004973576,0.000047699636,0.001589922,0.00014040791,0.00004821653,0.0003039341,0.86367434,0.11990272,0.010626703,0.00080468535,0.0008492948],"about_ca_topic_score_codex":0.00029088513,"about_ca_topic_score_gemma":0.00027425337,"teacher_disagreement_score":0.6653054,"about_ca_system_score_codex":0.00039905403,"about_ca_system_score_gemma":0.000979106,"threshold_uncertainty_score":0.99970186},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018586155,0.00023342087,0.9342824,0.043650184,0.0009938194,0.0006062549,0.0000016884073,0.00034914914,0.0012969202],"genre_scores_gemma":[0.73640347,0.0000023534983,0.24107833,0.021772355,0.00020834611,0.000074700714,0.0000017506904,0.000025421865,0.00043327798],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99723417,0.0003913112,0.000492945,0.0007524651,0.00046560384,0.00066353125],"domain_scores_gemma":[0.99645334,0.0012202217,0.00017636745,0.0019461096,0.000071691575,0.0001322669],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007411155,0.0003347248,0.0004560124,0.00026708675,0.00020317768,0.00041613093,0.0029114634,0.000118886244,0.00001617247],"category_scores_gemma":[0.0005116603,0.00030607797,0.00016773671,0.0006367618,0.0000787371,0.00043723817,0.00041236627,0.00039880304,0.00012764],"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.00015333465,0.00013368661,0.0039984123,0.00022755838,0.00070194213,0.00073103205,0.0020844487,0.057044707,0.6530563,0.01352055,0.16917062,0.09917736],"study_design_scores_gemma":[0.03021549,0.0012304328,0.031002928,0.004298858,0.00072435336,0.000992201,0.0007825281,0.21681948,0.30763513,0.06648091,0.32937807,0.01043964],"about_ca_topic_score_codex":0.00017122636,"about_ca_topic_score_gemma":0.000009581603,"teacher_disagreement_score":0.7178173,"about_ca_system_score_codex":0.00010846682,"about_ca_system_score_gemma":0.00015542588,"threshold_uncertainty_score":0.99993914},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013396134,0.00010160381,0.93902755,0.0046929456,0.0010375392,0.00029374455,8.0132713e-7,0.0016292117,0.039820492],"genre_scores_gemma":[0.8622057,0.0000063502607,0.13449587,0.0014424598,0.00051670166,0.00004464954,0.0000024582905,0.000047914928,0.0012379073],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99731666,0.00016512639,0.0004917912,0.0008042867,0.00053308066,0.00068903755],"domain_scores_gemma":[0.9973724,0.00020446083,0.00020658455,0.0019309954,0.000080229525,0.00020536559],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009994787,0.00032813745,0.00037206186,0.00028412047,0.00020075923,0.00051188405,0.0022338883,0.0002862783,0.00008037375],"category_scores_gemma":[0.00013152706,0.00030131693,0.00015586958,0.00090274715,0.00007070312,0.00084869115,0.0005417306,0.0005044634,0.0018823703],"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.000021283548,0.00022632827,0.0030737522,0.00013738858,0.00012594207,0.000121801924,0.0010915772,0.0017666174,0.041058425,0.29696232,0.096815996,0.5585986],"study_design_scores_gemma":[0.0014261408,0.0002747285,0.0043003727,0.00037588365,0.000030054636,0.00028118267,0.000045542558,0.21219356,0.019140726,0.019026896,0.7410671,0.0018378069],"about_ca_topic_score_codex":0.000059354566,"about_ca_topic_score_gemma":0.0000070732162,"teacher_disagreement_score":0.84880954,"about_ca_system_score_codex":0.00006883634,"about_ca_system_score_gemma":0.000041474814,"threshold_uncertainty_score":0.9999439},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26347128,0.00071517506,0.72921765,0.0011621305,0.0011021513,0.00038717818,0.000019203886,0.00013291549,0.0037923113],"genre_scores_gemma":[0.8601567,0.0000027712622,0.1389471,0.000039879586,0.0006813606,0.0000063211837,0.000002850209,0.000039792594,0.00012323019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"case_report","domain_scores_codex":[0.9957379,0.00048390345,0.0011576975,0.000424008,0.0016675624,0.0005289318],"domain_scores_gemma":[0.99607986,0.00020952402,0.0013393067,0.0007020678,0.001018746,0.00065047335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017622048,0.00039506351,0.0008094469,0.00045054164,0.00017505334,0.0005819803,0.0014628076,0.00016919068,0.000010893806],"category_scores_gemma":[0.000086339605,0.00026873796,0.00021329538,0.00057853817,0.00008986417,0.0010860581,0.00016937591,0.00072094117,0.000061802595],"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.0005758738,0.000434132,0.009287066,0.000850696,0.0018480945,0.0051130936,0.020489518,0.6793612,0.24090247,0.035914697,0.0028250571,0.0023980897],"study_design_scores_gemma":[0.047569547,0.030966576,0.048712548,0.052001122,0.0011364638,0.3952039,0.014062507,0.3109018,0.021918386,0.04911904,0.0129974615,0.015410679],"about_ca_topic_score_codex":0.00013030357,"about_ca_topic_score_gemma":0.0000045928377,"teacher_disagreement_score":0.5966854,"about_ca_system_score_codex":0.0002671522,"about_ca_system_score_gemma":0.0008076424,"threshold_uncertainty_score":0.99997646},"labels":[],"label_agreement":null}]}