{"meta":{"query_hash":"3eab624c381f","filters":{"venue":"Real-Time Systems"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/3eab624c381f","api":"https://metacan.xera.ac/api/v1/cohort?venue=Real-Time+Systems"},"results":[{"id":"W1562548608","doi":"10.1023/a:1020207328508","title":"Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks","year":2002,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"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; Scheduling (production processes); Distributed computing; Versa; Dual (grammatical number); Task (project management); Computational complexity theory; Execution time; Parallel computing; Algorithm; Mathematical optimization; Mathematics","score_opus":0.0261588559585239,"score_gpt":0.2431467582058805,"score_spread":0.2169879022473566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562548608","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.25671765,0.001612449,0.70893925,0.0001576021,0.0010695694,0.006150332,0.0004453548,0.0006260965,0.02428172],"genre_scores_gemma":[0.9906844,0.00008889102,0.0061865263,0.0000074519826,0.00019072626,0.00035398305,0.000012356009,0.00004719863,0.0024284513],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962584,0.00028415723,0.0013374412,0.0007497314,0.00077496,0.00059532735],"domain_scores_gemma":[0.99646145,0.0004602706,0.0009176631,0.0011945221,0.00079713715,0.00016892624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013316461,0.00036853357,0.0011665853,0.000367437,0.00013938895,0.00009649632,0.001239316,0.00025859283,0.000036844922],"category_scores_gemma":[0.00014105503,0.00034597382,0.0002809467,0.00065760635,0.00011932014,0.0005508941,0.00013405501,0.00011305061,0.00012885629],"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.00019731879,0.00055150414,0.00048542698,0.004215997,0.00043747,0.000019909683,0.011683008,0.007889341,0.963927,0.003222301,0.0048784968,0.0024922856],"study_design_scores_gemma":[0.0018259606,0.0004638743,0.0001348812,0.00089384953,0.000055616838,0.000056500598,0.00018301612,0.99241394,0.0033259892,0.000047803325,0.00023290739,0.00036568617],"about_ca_topic_score_codex":0.0006396773,"about_ca_topic_score_gemma":0.0000019680597,"teacher_disagreement_score":0.98452455,"about_ca_system_score_codex":0.00018030881,"about_ca_system_score_gemma":0.00015620115,"threshold_uncertainty_score":0.9998992},"labels":[],"label_agreement":null},{"id":"W1563308903","doi":"10.1023/a:1008150426963","title":"A Network Time Interface M-Module for Distributing GPS-Time over LANs","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Ethernet; Computer science; Interface (matter); Synchronization (alternating current); Embedded system; Clock synchronization; Local area network; Network interface; Global Positioning System; Very-large-scale integration; Controller (irrigation); Real-time computing; State (computer science); Clock drift; Computer hardware; Operating system; Computer network","score_opus":0.007299551411717456,"score_gpt":0.22790229452988353,"score_spread":0.22060274311816608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563308903","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.026328579,0.0015473438,0.9116346,0.00096814457,0.0011421315,0.0037095337,0.00026062608,0.008250407,0.04615861],"genre_scores_gemma":[0.6866649,0.0001618982,0.06244737,0.00019598346,0.0033388028,0.00068672176,0.00053732743,0.00033433406,0.24563266],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703264,0.00016418491,0.00065945415,0.000805364,0.0003729361,0.0009654025],"domain_scores_gemma":[0.99782306,0.000332829,0.00027771833,0.0013007133,0.00013264164,0.00013303061],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007602059,0.0003724561,0.00058972184,0.00009050225,0.00032036877,0.00043161632,0.0015386746,0.00026271513,0.00087547797],"category_scores_gemma":[0.00006990708,0.00035679658,0.00014091966,0.00088757963,0.00008668094,0.0005086338,0.0003191336,0.00017274001,0.0054120044],"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.00007369612,0.00020865661,0.00054505863,0.00024798623,0.0003155136,0.0000343093,0.00032794906,0.14616859,0.008397146,0.011277327,0.7675149,0.0648889],"study_design_scores_gemma":[0.0005752098,0.00017304026,0.00009980047,0.00028667357,0.000022235754,0.000049176273,0.0000070461538,0.9098196,0.0006753279,0.0007715046,0.08695715,0.0005632026],"about_ca_topic_score_codex":0.00009920651,"about_ca_topic_score_gemma":0.0000016934473,"teacher_disagreement_score":0.84918725,"about_ca_system_score_codex":0.00024414354,"about_ca_system_score_gemma":0.0000856383,"threshold_uncertainty_score":0.9998884},"labels":[],"label_agreement":null},{"id":"W1744407750","doi":"10.1023/a:1011199405471","title":"Object Caching and Prefetching in Distributed Virtual Walkthrough","year":2001,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","score_opus":0.013636951352657935,"score_gpt":0.2673937596894742,"score_spread":0.2537568083368163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1744407750","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.1915319,0.00016127972,0.805653,0.00005827879,0.00020230493,0.0003106334,0.0000058292953,0.0005397997,0.0015370265],"genre_scores_gemma":[0.99858695,0.00021561385,0.0009196597,0.000022061344,0.00007211987,0.000021440523,0.000015022887,0.000012992624,0.00013411397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985058,0.00019493136,0.00037576084,0.0004114458,0.00023114383,0.0002809595],"domain_scores_gemma":[0.999225,0.000113375725,0.0001193982,0.00040703118,0.00004960351,0.000085546984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005972183,0.00016485617,0.0002669082,0.00021746795,0.000120683435,0.00036066762,0.00040666398,0.00008386132,0.000002788588],"category_scores_gemma":[0.000020819398,0.00015609973,0.00004031353,0.00064022717,0.000022301725,0.00047391056,0.00024927573,0.00012345151,0.000007519296],"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.00002348656,0.00031129664,0.03979879,0.00018979568,0.00008288037,0.00026027483,0.007082433,0.002454032,0.0048319986,0.9154828,0.0024055364,0.02707666],"study_design_scores_gemma":[0.00046381226,0.00017360871,0.009870105,0.00032442706,0.000004805914,0.00017311798,0.00006742759,0.982492,0.00019719783,0.0015318386,0.0042837136,0.00041794046],"about_ca_topic_score_codex":0.0018094388,"about_ca_topic_score_gemma":0.000028451594,"teacher_disagreement_score":0.980038,"about_ca_system_score_codex":0.00006144678,"about_ca_system_score_gemma":0.000035630834,"threshold_uncertainty_score":0.6365562},"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":"W2006984763","doi":"10.1007/s11241-010-9103-8","title":"SetExp: a method of transformation of timed automata into finite state automata","year":2010,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"","keywords":"Timed automaton; Automaton; Quantum finite automata; ω-automaton; Computer science; Continuous spatial automaton; Finite-state machine; Discrete event dynamic system; Event (particle physics); State space; Automata theory; Supervisory control; Theoretical computer science; Transformation (genetics); Nondeterministic finite automaton; Algorithm; Discrete system; Mathematics; Control (management); Artificial intelligence","score_opus":0.013585593864407622,"score_gpt":0.27983388812765564,"score_spread":0.26624829426324803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006984763","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.049716692,0.00005274101,0.9395994,0.00007131053,0.0009460328,0.0007428666,0.00007205984,0.0005280114,0.008270886],"genre_scores_gemma":[0.8276838,0.00001952042,0.17181231,0.0000056608073,0.000055260254,0.000042191863,0.000020408057,0.000029143534,0.0003316869],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964944,0.0004456872,0.0013970203,0.00045114517,0.0008385986,0.00037313867],"domain_scores_gemma":[0.9965465,0.00054940756,0.000798344,0.0016282093,0.00033143873,0.00014608618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032042293,0.00026087146,0.0007384896,0.00042552588,0.00007580363,0.00010089732,0.0014510461,0.00018265584,0.0000149246125],"category_scores_gemma":[0.00012675613,0.00023795296,0.00014612847,0.0008107972,0.000057472484,0.0008387143,0.00018200465,0.00020031864,0.00011300449],"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.00005164884,0.00023446213,0.000052144787,0.0030692788,0.00024727377,0.000025246622,0.021690033,0.03215855,0.8555318,0.013352347,0.0009607334,0.072626464],"study_design_scores_gemma":[0.00062393653,0.00009461475,0.00006894122,0.00030442548,0.000016333066,0.00010401034,0.000052714167,0.98207664,0.015064915,0.00039541622,0.00096951035,0.000228545],"about_ca_topic_score_codex":0.0013757402,"about_ca_topic_score_gemma":0.00001906383,"teacher_disagreement_score":0.9499181,"about_ca_system_score_codex":0.000059843343,"about_ca_system_score_gemma":0.00022054111,"threshold_uncertainty_score":0.970344},"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":"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":"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":"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":"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":"W2775713557","doi":"10.1007/s11241-017-9297-0","title":"Delay-dependent partial order reduction technique for real time systems","year":2017,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reachability; Partial order reduction; Convex hull; Reduction (mathematics); Petri net; Regular polygon; Context (archaeology); Set (abstract data type); Computer science; State space; Automaton; State (computer science); Hull; Identity (music); Order (exchange); Mathematics; Model checking; Algorithm; Theoretical computer science; Geometry; Physics","score_opus":0.03138281613212452,"score_gpt":0.3137023800549307,"score_spread":0.28231956392280616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775713557","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.0041797836,0.00007293246,0.96482074,0.000110963236,0.0045181355,0.0036700957,0.000035075398,0.0007557434,0.021836525],"genre_scores_gemma":[0.45025808,0.00017502121,0.5057326,0.000009088963,0.003685222,0.005066744,0.00007600263,0.00018219445,0.03481503],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968378,0.00044390978,0.00078093115,0.0007950319,0.00057532516,0.0005670067],"domain_scores_gemma":[0.9958003,0.000091401605,0.00093782623,0.0025271678,0.00046116905,0.00018212064],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032243389,0.00030670143,0.00051026366,0.00015837423,0.00074920576,0.00092987716,0.0017056952,0.0003357474,0.000010506018],"category_scores_gemma":[0.00023548424,0.00028925677,0.000120678254,0.00017415502,0.00009945252,0.0011686279,0.00024881065,0.0001640213,0.00046130005],"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.00016346732,0.00023219682,0.00008697319,0.00083660154,0.00019643974,0.00003015827,0.00076389534,0.0033746518,0.81318057,0.16181459,0.012297599,0.0070228833],"study_design_scores_gemma":[0.0010406893,0.0005850955,0.0002833181,0.00055107847,0.000075366755,0.0010198184,0.0000853917,0.9309486,0.048752926,0.00048681552,0.015113483,0.0010573927],"about_ca_topic_score_codex":0.0022050734,"about_ca_topic_score_gemma":0.0000017386751,"teacher_disagreement_score":0.927574,"about_ca_system_score_codex":0.0003127849,"about_ca_system_score_gemma":0.00017547702,"threshold_uncertainty_score":0.99995595},"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}]}