{"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32030556,0.0003641401,0.66938245,0.00021416578,0.00024533932,0.000104294275,0.000051153907,0.0025956887,0.0067372234],"genre_scores_gemma":[0.9815425,0.000052572857,0.017272303,0.000019084566,0.0000245043,0.000046056113,0.000017380158,0.00002599286,0.0009996337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998597,0.000024860052,0.000009516767,0.000043346237,0.00003539211,0.000027146605],"domain_scores_gemma":[0.9994698,0.00020985866,0.00007607583,0.00007458389,0.00011067045,0.000058915364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043844263,0.00026056453,0.00030439266,0.00026448158,0.00045068876,0.00060249335,0.000755994,0.00027327397,0.0021865969],"category_scores_gemma":[0.0010993519,0.00013995812,0.00020578106,0.0001244632,0.0004343801,0.0003732759,0.0003371403,0.0004024419,0.000223345],"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.002538892,0.00056612695,0.0033895213,0.00043734015,0.000101648846,0.0013716876,0.0011115879,0.4192704,0.29696995,0.050682608,0.005166708,0.21839358],"study_design_scores_gemma":[0.00009639038,0.0002519872,0.00074165146,0.000011697171,0.00003204721,0.000093955496,0.00003327089,0.9629825,0.027714245,0.0059943125,0.0020324227,0.000015481612],"about_ca_topic_score_codex":0.001172033,"about_ca_topic_score_gemma":0.0020417473,"teacher_disagreement_score":0.0021865969,"about_ca_system_score_codex":0.00026629883,"about_ca_system_score_gemma":0.00083494117,"threshold_uncertainty_score":0.0073149204},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028112782,0.00021869484,0.8857873,0.0001316568,0.00024230892,0.0006793645,0.00087035226,0.066969246,0.016988236],"genre_scores_gemma":[0.33274275,0.00033620722,0.57128507,0.0008436907,0.0005210598,0.0013674041,0.0031725618,0.009801905,0.07992933],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939096,0.000110610235,0.000058798014,0.00011625819,0.00022253163,0.00010081016],"domain_scores_gemma":[0.9982855,0.00035775447,0.00013221524,0.0005437502,0.0004972683,0.00018351892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010913085,0.00096858985,0.00069290446,0.0017657846,0.0006257384,0.00092749414,0.002588666,0.00079903525,0.03835375],"category_scores_gemma":[0.0028964642,0.00063942233,0.00045064086,0.0010952298,0.00032588045,0.001163132,0.0010461146,0.00092727185,0.012746669],"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.0038258482,0.0007431897,0.008835358,0.0009642404,0.00022641291,0.00056800357,0.0006166238,0.0047283852,0.3401512,0.022510547,0.07158946,0.54524064],"study_design_scores_gemma":[0.0008823472,0.0017945847,0.008553351,0.0001382998,0.00055686,0.0020110481,0.00012987902,0.14274634,0.5505701,0.004109722,0.2882986,0.00020891748],"about_ca_topic_score_codex":0.0014097367,"about_ca_topic_score_gemma":0.0010409635,"teacher_disagreement_score":0.03835375,"about_ca_system_score_codex":0.0006589059,"about_ca_system_score_gemma":0.00065635686,"threshold_uncertainty_score":0.12830603},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67953974,0.0035062702,0.30274296,0.00053164427,0.00029100894,0.00010965001,0.00025611106,0.005752147,0.0072706146],"genre_scores_gemma":[0.9685896,0.000291835,0.027026704,0.00005332495,0.000036919857,0.000033277105,0.00011980448,0.00019295409,0.0036555335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986455,0.0004092747,0.0000924381,0.00017358911,0.00040750767,0.0002718335],"domain_scores_gemma":[0.9914573,0.004718761,0.0005045778,0.0018917671,0.0009007184,0.0005269459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014921302,0.00058519153,0.0009816085,0.0010967201,0.0016420707,0.0020719455,0.0017027443,0.0012560483,0.0037229853],"category_scores_gemma":[0.011836578,0.0009213305,0.00026665276,0.0023743606,0.0011258449,0.0032641338,0.0016921478,0.00078059616,0.00045741838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010049872,0.0010078627,0.027750134,0.00048150143,0.00019558659,0.0016530926,0.002447499,0.4633168,0.058958616,0.0587592,0.017004311,0.35837558],"study_design_scores_gemma":[0.00011509914,0.00016304498,0.0022286915,0.000026310236,0.000065926404,0.00027838952,0.00027575984,0.96298724,0.01420341,0.017218454,0.0023997317,0.000037892736],"about_ca_topic_score_codex":0.011639679,"about_ca_topic_score_gemma":0.017453577,"teacher_disagreement_score":0.011639679,"about_ca_system_score_codex":0.0012953202,"about_ca_system_score_gemma":0.0015078663,"threshold_uncertainty_score":0.023143888},"labels":[],"label_agreement":null},{"id":"W1978574312","doi":"10.1007/s11241-013-9183-3","title":"Implementation and evaluation of global and partitioned scheduling in a real-time OS","year":2013,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Real-time operating system; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Embedded system; Thread (computing); Operating system; Earliest deadline first scheduling; Dynamic priority scheduling; Parallel computing; Distributed computing; Real-time computing; Rate-monotonic scheduling; Engineering","score_opus":0.023422941526555253,"score_gpt":0.307505476957824,"score_spread":0.2840825354312687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978574312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7837619,0.0006366347,0.18582,0.0003343886,0.00038113823,0.00042521558,0.00034734057,0.015817434,0.012475941],"genre_scores_gemma":[0.9002195,0.00016561277,0.09560745,0.00009366587,0.000021446986,0.0000911752,0.0003683409,0.0006631411,0.002769682],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872154,0.00032497273,0.00009849381,0.0001968465,0.00036452568,0.0002935993],"domain_scores_gemma":[0.99601537,0.0012047171,0.00020158588,0.00097577897,0.0012205418,0.00038190524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019314361,0.00101222,0.00059493195,0.00053878536,0.0004810124,0.0011580548,0.0023145778,0.0005274028,0.0046078567],"category_scores_gemma":[0.0052916245,0.0005464179,0.00038065034,0.0005199215,0.0008444215,0.0012907616,0.00076332793,0.00092804345,0.00066807744],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012796399,0.003360653,0.021182064,0.0012318899,0.00044148567,0.0009087051,0.001627238,0.3693329,0.17430562,0.011519356,0.01144869,0.391845],"study_design_scores_gemma":[0.0013494408,0.0036725146,0.0056071007,0.00004519933,0.00025744803,0.0002050361,0.00051712524,0.8380983,0.13808142,0.0020257272,0.010063136,0.000077564786],"about_ca_topic_score_codex":0.0062170667,"about_ca_topic_score_gemma":0.0056480137,"teacher_disagreement_score":0.0062170667,"about_ca_system_score_codex":0.0008711275,"about_ca_system_score_gemma":0.0020976719,"threshold_uncertainty_score":0.015414834},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009310525,0.000043467346,0.9885847,0.000024319663,0.00009196483,0.000059561276,0.00022003223,0.008155924,0.0018890683],"genre_scores_gemma":[0.05990761,0.00030104368,0.92082006,0.00015459409,0.000089441055,0.00051690097,0.0017999702,0.0061749304,0.010235437],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985916,0.00028565808,0.000118472395,0.00033575838,0.00057829183,0.00009026668],"domain_scores_gemma":[0.99911374,0.00041923719,0.00003990366,0.00024417537,0.0001565343,0.000026416448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088730897,0.0011993941,0.00079841027,0.0011910837,0.00063947507,0.0016568855,0.0015759359,0.00079205364,0.014417756],"category_scores_gemma":[0.0026107607,0.00085752225,0.0027443315,0.00082097657,0.0007727812,0.0016867482,0.0018979512,0.002193857,0.0050949263],"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.0007063535,0.0003883587,0.0014852581,0.0016787994,0.00043164857,0.0014080404,0.0010072095,0.04050696,0.076417215,0.21428505,0.03311598,0.62856907],"study_design_scores_gemma":[0.00024690598,0.00027345878,0.0006922273,0.00024892035,0.0003421496,0.0017993586,0.00016975655,0.3043228,0.23508215,0.17426705,0.28236142,0.000193832],"about_ca_topic_score_codex":0.00068942853,"about_ca_topic_score_gemma":0.00070546905,"teacher_disagreement_score":0.014417756,"about_ca_system_score_codex":0.0004399312,"about_ca_system_score_gemma":0.0009320355,"threshold_uncertainty_score":0.048232257},"labels":[],"label_agreement":null},{"id":"W2061663604","doi":"10.1007/s11241-012-9158-9","title":"Memory-centric scheduling for multicore hard real-time systems","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Bottleneck; Scheduling (production processes); Two-level scheduling; Uniform memory access; Parallel computing; Distributed computing; Schedule; Dynamic priority scheduling; Embedded system; Memory management; Operating system; Semiconductor memory; Engineering","score_opus":0.02522899895287399,"score_gpt":0.2600384088994585,"score_spread":0.2348094099465845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061663604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34818512,0.00521723,0.62515306,0.0009452576,0.00069960556,0.00019480505,0.00022511827,0.001974127,0.017405616],"genre_scores_gemma":[0.9265469,0.00037273657,0.06964372,0.00012400254,0.00009472391,0.000058948724,0.000117212956,0.0001079032,0.0029338377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994741,0.00012769223,0.00003605704,0.00007909294,0.00013769766,0.00014532651],"domain_scores_gemma":[0.99902976,0.00025613402,0.00012543838,0.0002339081,0.00022949876,0.00012536961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009146821,0.0004926933,0.00046745926,0.00047073982,0.00096540817,0.0010650718,0.0014142428,0.0003432455,0.0021812143],"category_scores_gemma":[0.0019601171,0.00033359,0.0002553497,0.00080297375,0.00034464334,0.00087123865,0.0008630884,0.00071490667,0.00026139859],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018642318,0.00039260817,0.002667347,0.0004629089,0.00014191467,0.00024549165,0.00034540723,0.65764374,0.04157452,0.03309243,0.013248348,0.24832103],"study_design_scores_gemma":[0.000081764185,0.00023752851,0.0007435671,0.000018019318,0.000050198945,0.00007488756,0.00007501494,0.97047687,0.012010904,0.010887196,0.0053266003,0.00001750581],"about_ca_topic_score_codex":0.0027472982,"about_ca_topic_score_gemma":0.0090529965,"teacher_disagreement_score":0.0027472982,"about_ca_system_score_codex":0.0009160378,"about_ca_system_score_gemma":0.0021284483,"threshold_uncertainty_score":0.00729686},"labels":[],"label_agreement":null},{"id":"W2107330110","doi":"10.1007/s11241-012-9151-3","title":"State-based scheduling with tree schedules: analysis and evaluation","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arbitration; Distributed computing; Scheduling (production processes); Stateless protocol; Tree (set theory); Bounded function; Flexibility (engineering); State (computer science); Mathematical optimization; Algorithm","score_opus":0.017540417479876745,"score_gpt":0.26053523740452855,"score_spread":0.2429948199246518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107330110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48942378,0.0017548312,0.49731913,0.00035566592,0.00018205371,0.00035493978,0.0004038129,0.002611526,0.0075943805],"genre_scores_gemma":[0.9347498,0.00045008893,0.06359716,0.00003636985,0.000032139193,0.00009702077,0.00026728524,0.00012407108,0.00064613123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979284,0.0008662295,0.00008637675,0.00013367427,0.0007853334,0.00019996715],"domain_scores_gemma":[0.9850557,0.011542586,0.0008314954,0.0008875931,0.0013207723,0.0003617641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005533947,0.0008637094,0.0010186582,0.00140474,0.000530574,0.00084857066,0.0013669104,0.00068617635,0.0024096395],"category_scores_gemma":[0.012710399,0.00039216978,0.00066021713,0.0017576254,0.0007341663,0.001957834,0.0006342947,0.0006609761,0.0002120693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009185657,0.00026162498,0.0010610084,0.000138432,0.00005580691,0.000021463711,0.000057867637,0.941886,0.0018142102,0.0064656297,0.0008078546,0.046511635],"study_design_scores_gemma":[0.000034005952,0.00019182834,0.00022332648,0.000003846137,0.000021322736,0.0000073876367,0.000010612904,0.997006,0.00061392295,0.0017578674,0.00012535714,0.0000045304655],"about_ca_topic_score_codex":0.007935148,"about_ca_topic_score_gemma":0.005814188,"teacher_disagreement_score":0.007935148,"about_ca_system_score_codex":0.0021632933,"about_ca_system_score_gemma":0.0025549338,"threshold_uncertainty_score":0.029266655},"labels":[],"label_agreement":null},{"id":"W2138536237","doi":"10.1007/s11241-007-9024-3","title":"Scoped types and aspects for real-time Java memory management","year":2007,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Memory model; Programming language; Real time Java; Operating system; Shared memory","score_opus":0.011582332532636267,"score_gpt":0.2500236681188539,"score_spread":0.23844133558621763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138536237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007885411,0.0007047957,0.97405565,0.000372777,0.0003126525,0.000110544126,0.00021938352,0.011400989,0.0049378974],"genre_scores_gemma":[0.20537218,0.0011661648,0.76985097,0.0009715185,0.00049208326,0.00042831802,0.00096847647,0.011581147,0.009169132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586487,0.00083960925,0.0008679457,0.00050545495,0.0015070874,0.00041508157],"domain_scores_gemma":[0.9909719,0.0031265463,0.00074292195,0.0038286191,0.000910392,0.00041966885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005197397,0.0012534509,0.0012030831,0.0016083453,0.0010492022,0.0042129406,0.004325791,0.0021320395,0.007925758],"category_scores_gemma":[0.013150064,0.0026499638,0.002155178,0.002032918,0.002719719,0.011961887,0.004718199,0.0049934015,0.0020865707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001107696,0.00017121236,0.0034838517,0.0010525861,0.00013930874,0.0006761046,0.0022255692,0.0089485515,0.021325137,0.67958134,0.022012115,0.2592766],"study_design_scores_gemma":[0.0002699412,0.00021309912,0.0013004536,0.00058407785,0.00039500787,0.0014280672,0.00037070824,0.1054436,0.036315866,0.65627545,0.19713856,0.00026514518],"about_ca_topic_score_codex":0.0013341175,"about_ca_topic_score_gemma":0.0021182208,"teacher_disagreement_score":0.007925758,"about_ca_system_score_codex":0.0011443006,"about_ca_system_score_gemma":0.0015453927,"threshold_uncertainty_score":0.027486742},"labels":[],"label_agreement":null},{"id":"W2155277639","doi":"10.1007/s11241-015-9239-7","title":"Response time analysis for fixed priority real-time systems with energy-harvesting","year":2015,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Energy consumption; Energy (signal processing); Response time; Task (project management); Earliest deadline first scheduling; Monotonic function; Real-time computing; Mathematical optimization; Set (abstract data type); Dynamic priority scheduling; Algorithm; Mathematics; Rate-monotonic scheduling; Schedule; Engineering; Statistics; Operating system","score_opus":0.02365917445607611,"score_gpt":0.2518750639337293,"score_spread":0.22821588947765323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155277639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15030771,0.002070983,0.83593136,0.0011265803,0.00025114685,0.00012957271,0.00016014093,0.0005078951,0.00951455],"genre_scores_gemma":[0.9822104,0.0004520669,0.012811817,0.00012511248,0.00010398425,0.00005184401,0.000063930274,0.00012515008,0.0040557617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803084,0.0005028126,0.00005879543,0.00026721778,0.0005164752,0.0006238635],"domain_scores_gemma":[0.99178183,0.0060947468,0.0005679767,0.00030666776,0.0009519306,0.00029673835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036405812,0.0012501129,0.001213236,0.0010088009,0.0005322534,0.0015614406,0.0016882634,0.00087063207,0.0058250492],"category_scores_gemma":[0.012106921,0.00047585386,0.00078605156,0.0010501242,0.0010501136,0.0014823137,0.00081576465,0.0015555345,0.00051877875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007467523,0.00012615634,0.00086064916,0.0002828897,0.000087037035,0.00016474756,0.00015968474,0.93987244,0.008495725,0.030494511,0.0015958108,0.017113557],"study_design_scores_gemma":[0.000007639777,0.000027256514,0.00015166971,0.0000043662776,0.0000104646,0.000014420215,0.000023939823,0.996256,0.0004160445,0.0029846176,0.00009918135,0.0000044183694],"about_ca_topic_score_codex":0.0066037276,"about_ca_topic_score_gemma":0.0027416418,"teacher_disagreement_score":0.0066037276,"about_ca_system_score_codex":0.0023771534,"about_ca_system_score_gemma":0.0018143153,"threshold_uncertainty_score":0.019486725},"labels":[],"label_agreement":null},{"id":"W2336850053","doi":"10.1023/a:1008198310125","title":"Priority Scheduling Versus Pre-Run-Time Scheduling","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; York University","funders":"","keywords":"Computer science; Earliest deadline first scheduling; Scheduling (production processes); Deadline-monotonic scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Distributed computing; Real-time computing; Operations management; Engineering; Schedule; Operating system","score_opus":0.014735158770347787,"score_gpt":0.2555779986494441,"score_spread":0.2408428398790963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336850053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312303,0.0092770895,0.9135572,0.0017760784,0.0028002192,0.00016391916,0.00012579332,0.0012575188,0.022729918],"genre_scores_gemma":[0.7923431,0.004141996,0.18962365,0.0004960855,0.001958281,0.00009990291,0.00015834629,0.00048154348,0.010697221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977744,0.0007801366,0.00013362292,0.00032970807,0.00064386416,0.00033834146],"domain_scores_gemma":[0.99296135,0.00400498,0.000426516,0.0010731684,0.0010498853,0.00048407048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004254058,0.00086046517,0.0009944058,0.0007539636,0.0006948019,0.0020516485,0.0015162193,0.00076530204,0.0065400177],"category_scores_gemma":[0.009615004,0.00036239848,0.00046417164,0.00103978,0.00068056665,0.0034725496,0.0006550758,0.0018699337,0.0011405786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042053973,0.00036472495,0.0017103584,0.0009895812,0.00014734645,0.00017428817,0.00028221039,0.083110526,0.025099328,0.35607854,0.008889387,0.5189483],"study_design_scores_gemma":[0.0005136819,0.0026089756,0.002032287,0.00016870657,0.00041764555,0.0006078814,0.00033317064,0.6632813,0.038836163,0.2492545,0.04183663,0.000109085544],"about_ca_topic_score_codex":0.0012196457,"about_ca_topic_score_gemma":0.0015862997,"teacher_disagreement_score":0.0065400177,"about_ca_system_score_codex":0.000985028,"about_ca_system_score_gemma":0.001819699,"threshold_uncertainty_score":0.022497892},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053256424,0.00024952425,0.9901945,0.00009187963,0.00007738686,0.000056175708,0.00005993896,0.0006634132,0.0032815961],"genre_scores_gemma":[0.3701069,0.0008939705,0.61520064,0.00021528688,0.0001368628,0.00023599931,0.00036200797,0.00042983217,0.012418522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991652,0.0001643691,0.000051532472,0.00012379953,0.00040444345,0.00009056849],"domain_scores_gemma":[0.99916005,0.00036809008,0.00004281755,0.00026985237,0.00013739851,0.000021775704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008267337,0.00067440997,0.00069856615,0.0008739654,0.0005754763,0.00079836545,0.0011080655,0.00037584093,0.0043572555],"category_scores_gemma":[0.0013771016,0.0004736346,0.0016103175,0.00058134866,0.0008387575,0.0012983134,0.00091847277,0.0020870962,0.0009615115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034609175,0.0002266285,0.00044479192,0.00085049344,0.00016841656,0.0006029254,0.00049436366,0.12084923,0.10044508,0.51108027,0.0054346356,0.25905702],"study_design_scores_gemma":[0.00016148231,0.0003373817,0.0004827378,0.00009871536,0.00027070628,0.00071994396,0.00010170721,0.5127249,0.13174285,0.3123645,0.040889967,0.00010511083],"about_ca_topic_score_codex":0.001510791,"about_ca_topic_score_gemma":0.0023694097,"teacher_disagreement_score":0.0043572555,"about_ca_system_score_codex":0.0006922639,"about_ca_system_score_gemma":0.0012761621,"threshold_uncertainty_score":0.014576435},"labels":[],"label_agreement":null},{"id":"W2973123143","doi":"10.1007/s11241-019-09338-8","title":"Reduced latency DRAM for multi-core safety-critical real-time systems","year":2019,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Memory controller; Computer science; Dram; CAS latency; Latency (audio); Embedded system; Registered memory; Interleaved memory; Multi-core processor; Dynamic random-access memory; Static random-access memory; Parallel computing; Memory management; Semiconductor memory; Operating system; Computer hardware; Telecommunications","score_opus":0.030438748299913297,"score_gpt":0.2935015980062963,"score_spread":0.26306284970638305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973123143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52818966,0.013400982,0.40898082,0.0014958943,0.0014464095,0.00016887499,0.00078743,0.012586864,0.03294302],"genre_scores_gemma":[0.9633884,0.00048918545,0.030138683,0.0001448692,0.00008212374,0.000031377018,0.0002061551,0.00013834158,0.00538084],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99961555,0.000071455645,0.000023310575,0.000053905147,0.000106203304,0.00012958517],"domain_scores_gemma":[0.9994854,0.00012321307,0.000050397128,0.00015021086,0.00014610162,0.000044745975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032384502,0.00062896527,0.00040697015,0.0006175066,0.0005234628,0.0006583582,0.001355858,0.00026707177,0.007108534],"category_scores_gemma":[0.0010689236,0.00019025635,0.00019918104,0.00046818657,0.00024880562,0.0008598263,0.00065558666,0.0005960543,0.00084623386],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044631236,0.00057830586,0.002979746,0.0011400568,0.00021160216,0.00049953646,0.000294028,0.2214494,0.28050926,0.041398644,0.033086225,0.41339004],"study_design_scores_gemma":[0.00024211901,0.0014501022,0.0019248492,0.000058370046,0.00019648013,0.00037001574,0.00023483211,0.78839236,0.17212899,0.012340435,0.02260359,0.00005787611],"about_ca_topic_score_codex":0.0015867505,"about_ca_topic_score_gemma":0.0046734596,"teacher_disagreement_score":0.007108534,"about_ca_system_score_codex":0.0006605441,"about_ca_system_score_gemma":0.0012093057,"threshold_uncertainty_score":0.023780406},"labels":[],"label_agreement":null}]}