{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":12,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":12,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"3eab624c381f","filters":{"venue":"Real-Time Systems"}},"results":[{"id":"W2336850053","doi":"10.1023/a:1008198310125","title":"Priority Scheduling Versus Pre-Run-Time Scheduling","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University; York University","funders":"","keywords":"Computer science; Earliest deadline first scheduling; Scheduling (production processes); Deadline-monotonic scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Fixed-priority pre-emptive scheduling; Distributed computing; Real-time computing; Operations management; Engineering; Schedule; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01473515877034779,"gpt":0.2555779986494441,"spread":0.2408428398790963,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003052412,0.0009699436,0.001475866,0.000443395,0.0007298173,0.001691924,0.002977578,0.0006154356,0.0006386522],"category_scores_gemma":[0.0002503794,0.0009768726,0.0004808415,0.001610177,0.0001468257,0.00253019,0.000453511,0.0007104764,0.01481564],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006007502,"about_ca_system_score_gemma":0.0005800998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002213391,"about_ca_topic_score_gemma":0.000008125487,"domain_scores_codex":[0.9915032,0.0009478774,0.001880254,0.002070914,0.001736718,0.001861051],"domain_scores_gemma":[0.994193,0.0007433057,0.0006867265,0.003152875,0.0004000976,0.0008239874],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001508638,0.001556144,0.002043343,0.002750924,0.002593077,0.001231926,0.01057578,0.5121921,0.3143225,0.03780198,0.004530232,0.1088934],"study_design_scores_gemma":[0.003016772,0.0003777348,0.0006499846,0.0009885149,0.00008965865,0.0003734407,0.0001312637,0.9835441,0.001647871,0.000134986,0.007297688,0.001747985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7981673,0.001825952,0.03899543,0.0003744805,0.004285762,0.003084203,0.00002797069,0.004513459,0.1487254],"genre_scores_gemma":[0.8742175,0.0002358483,0.1012959,0.0000450943,0.002517957,0.0002335018,0.00004877472,0.0002531385,0.02115233],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.471352,"threshold_uncertainty_score":0.9993444,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061663604","doi":"10.1007/s11241-012-9158-9","title":"Memory-centric scheduling for multicore hard real-time systems","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Multi-core processor; Bottleneck; Scheduling (production processes); Two-level scheduling; Uniform memory access; Parallel computing; Distributed computing; Schedule; Dynamic priority scheduling; Embedded system; Memory management; Operating system; Semiconductor memory; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02522899895287399,"gpt":0.2600384088994585,"spread":0.2348094099465845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005654891,0.001242537,0.002210167,0.0008566672,0.0007911909,0.001661,0.002823394,0.0007768833,0.00005700316],"category_scores_gemma":[0.0005223179,0.001166298,0.0006913376,0.001577866,0.0001288519,0.003020106,0.0006025049,0.0004687571,0.00542563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009672857,"about_ca_system_score_gemma":0.0004425063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168256,"about_ca_topic_score_gemma":0.000002472063,"domain_scores_codex":[0.9893615,0.001152299,0.002592677,0.001908734,0.001799662,0.003185115],"domain_scores_gemma":[0.991261,0.001451194,0.001608455,0.00335571,0.0008828788,0.001440736],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003442861,0.002125761,0.007285749,0.01085349,0.002605051,0.000273214,0.01117165,0.1006312,0.753956,0.05916192,0.04376543,0.007826285],"study_design_scores_gemma":[0.0029549,0.0002819564,0.0008423481,0.001631813,0.0002157663,0.0008691946,0.0008014533,0.9792756,0.003198083,0.00003592842,0.007629708,0.002263261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4383273,0.01140492,0.408774,0.0005415745,0.03067767,0.02308287,0.0003266369,0.009694889,0.07717023],"genre_scores_gemma":[0.9082565,0.0002350493,0.06314315,0.00003550016,0.005788147,0.001499678,0.0001429351,0.0004335002,0.02046557],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8786444,"threshold_uncertainty_score":0.9993753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1978574312","doi":"10.1007/s11241-013-9183-3","title":"Implementation and evaluation of global and partitioned scheduling in a real-time OS","year":2013,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Real-time operating system; Scheduling (production processes); Fixed-priority pre-emptive scheduling; Embedded system; Thread (computing); Operating system; Earliest deadline first scheduling; Dynamic priority scheduling; Parallel computing; Distributed computing; Real-time computing; Rate-monotonic scheduling; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02342294152655525,"gpt":0.307505476957824,"spread":0.2840825354312687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003149621,0.0002725846,0.0005555031,0.0001836303,0.000108994,0.0003800154,0.0002968786,0.0001492471,0.00007340889],"category_scores_gemma":[0.0000781791,0.0002698919,0.00005244968,0.0006169274,0.0000638905,0.001419645,0.0001739753,0.00008193761,0.0001608004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003178429,"about_ca_system_score_gemma":0.0002212292,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01514173,"about_ca_topic_score_gemma":0.000101298,"domain_scores_codex":[0.9960892,0.0008309733,0.001055289,0.0006703407,0.0008994552,0.0004547161],"domain_scores_gemma":[0.9980332,0.0001696066,0.0005474751,0.0005755891,0.0004839793,0.0001901306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006438231,0.000381817,0.1720792,0.00177172,0.0004408412,0.00002823484,0.006586601,0.02416743,0.6898836,0.03982947,0.001482574,0.06328409],"study_design_scores_gemma":[0.002076517,0.0001462921,0.1110552,0.0004606663,0.00005379134,0.0001057126,0.0007587025,0.8826782,0.0009278903,0.001326084,0.00001129281,0.0003996152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9891391,0.0003076381,0.003521801,0.0001651857,0.000167293,0.002114931,0.0000103617,0.000143849,0.004429797],"genre_scores_gemma":[0.9916369,0.00006726561,0.007824453,0.0000056123,0.00008413546,0.0002898543,0.0000184469,0.00001894286,0.00005441498],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8585108,"threshold_uncertainty_score":0.9999753,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1562548608","doi":"10.1023/a:1020207328508","title":"Real-Time Supervisory Control of a Processor for Non-Preemptive Execution of Periodic Tasks","year":2002,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Distributed computing; Versa; Dual (grammatical number); Task (project management); Computational complexity theory; Execution time; Parallel computing; Algorithm; Mathematical optimization; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0261588559585239,"gpt":0.2431467582058805,"spread":0.2169879022473566,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001331646,0.0003685336,0.001166585,0.000367437,0.000139389,0.00009649632,0.001239316,0.0002585928,0.00003684492],"category_scores_gemma":[0.000141055,0.0003459738,0.0002809467,0.0006576063,0.0001193201,0.0005508941,0.000134055,0.0001130506,0.0001288563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001803088,"about_ca_system_score_gemma":0.0001562011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006396773,"about_ca_topic_score_gemma":0.00000196806,"domain_scores_codex":[0.9962584,0.0002841572,0.001337441,0.0007497314,0.00077496,0.0005953274],"domain_scores_gemma":[0.9964615,0.0004602706,0.0009176631,0.001194522,0.0007971372,0.0001689262],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001973188,0.0005515041,0.000485427,0.004215997,0.00043747,0.00001990968,0.01168301,0.007889341,0.963927,0.003222301,0.004878497,0.002492286],"study_design_scores_gemma":[0.001825961,0.0004638743,0.0001348812,0.0008938495,0.00005561684,0.0000565006,0.0001830161,0.9924139,0.003325989,0.00004780333,0.0002329074,0.0003656862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2567177,0.001612449,0.7089393,0.0001576021,0.001069569,0.006150332,0.0004453548,0.0006260965,0.02428172],"genre_scores_gemma":[0.9906844,0.00008889102,0.006186526,0.000007451983,0.0001907263,0.0003539831,0.00001235601,0.00004719863,0.002428451],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9845245,"threshold_uncertainty_score":0.9998992,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138536237","doi":"10.1007/s11241-007-9024-3","title":"Scoped types and aspects for real-time Java memory management","year":2007,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Java; Memory model; Programming language; Real time Java; Operating system; Shared memory","retraction":null,"screen_n_in":null,"score":{"opus":0.01158233253263627,"gpt":0.2500236681188539,"spread":0.2384413355862176,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003939285,0.0005535854,0.0009107079,0.0004971884,0.0003499689,0.000655754,0.001156209,0.0002640073,0.000034144],"category_scores_gemma":[0.00006672757,0.000520171,0.0001858343,0.000689776,0.00009186271,0.0007905567,0.0004422541,0.0001529554,0.001142126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002804296,"about_ca_system_score_gemma":0.0001148662,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001165492,"about_ca_topic_score_gemma":0.00001820732,"domain_scores_codex":[0.9953048,0.0002429201,0.00115011,0.001297374,0.0008248786,0.001179882],"domain_scores_gemma":[0.9965733,0.0005702013,0.0005314464,0.001581976,0.0002683804,0.0004747418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005869966,0.0008831461,0.000834642,0.009746946,0.002847254,0.001987951,0.006671641,0.003759275,0.4666275,0.3621392,0.06755287,0.07636252],"study_design_scores_gemma":[0.02046659,0.003615581,0.01679492,0.009709426,0.001150229,0.003953311,0.003787449,0.8101223,0.04407159,0.006668299,0.06788635,0.01177397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.08513961,0.001542391,0.1445085,0.000361527,0.003032789,0.00770021,0.00003012512,0.00246235,0.7552225],"genre_scores_gemma":[0.7918983,0.0004943209,0.1272933,0.00009909285,0.002141029,0.0004768262,0.00006294553,0.0003238992,0.07721023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.806363,"threshold_uncertainty_score":0.999725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1563308903","doi":"10.1023/a:1008150426963","title":"A Network Time Interface M-Module for Distributing GPS-Time over LANs","year":2000,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Ethernet; Computer science; Interface (matter); Synchronization (alternating current); Embedded system; Clock synchronization; Local area network; Network interface; Global Positioning System; Very-large-scale integration; Controller (irrigation); Real-time computing; State (computer science); Clock drift; Computer hardware; Operating system; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.007299551411717456,"gpt":0.2279022945298835,"spread":0.2206027431181661,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007602059,0.0003724561,0.0005897218,0.00009050225,0.0003203688,0.0004316163,0.001538675,0.0002627151,0.000875478],"category_scores_gemma":[0.00006990708,0.0003567966,0.0001409197,0.0008875796,0.00008668094,0.0005086338,0.0003191336,0.00017274,0.005412004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002441435,"about_ca_system_score_gemma":0.0000856383,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009920651,"about_ca_topic_score_gemma":0.000001693447,"domain_scores_codex":[0.9970326,0.0001641849,0.0006594541,0.000805364,0.0003729361,0.0009654025],"domain_scores_gemma":[0.9978231,0.000332829,0.0002777183,0.001300713,0.0001326416,0.0001330306],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007369612,0.0002086566,0.0005450586,0.0002479862,0.0003155136,0.0000343093,0.0003279491,0.1461686,0.008397146,0.01127733,0.7675149,0.0648889],"study_design_scores_gemma":[0.0005752098,0.0001730403,0.00009980047,0.0002866736,0.00002223575,0.00004917627,0.000007046154,0.9098196,0.0006753279,0.0007715046,0.08695715,0.0005632026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02632858,0.001547344,0.9116346,0.0009681446,0.001142132,0.003709534,0.0002606261,0.008250407,0.04615861],"genre_scores_gemma":[0.6866649,0.0001618982,0.06244737,0.0001959835,0.003338803,0.0006867218,0.0005373274,0.0003343341,0.2456327],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8491873,"threshold_uncertainty_score":0.9998884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155277639","doi":"10.1007/s11241-015-9239-7","title":"Response time analysis for fixed priority real-time systems with energy-harvesting","year":2015,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Computer science; Scheduling (production processes); Computation; Energy consumption; Energy (signal processing); Response time; Task (project management); Earliest deadline first scheduling; Monotonic function; Real-time computing; Mathematical optimization; Set (abstract data type); Dynamic priority scheduling; Algorithm; Mathematics; Rate-monotonic scheduling; Schedule; Engineering; Statistics; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02365917445607611,"gpt":0.2518750639337293,"spread":0.2282158894776532,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01139206,0.001177079,0.002800722,0.001386589,0.0005863365,0.002221892,0.002646345,0.000605085,0.00002256952],"category_scores_gemma":[0.0008374011,0.001021074,0.0006304678,0.004206002,0.0001700686,0.001979203,0.0005084266,0.0003176248,0.001161995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001144563,"about_ca_system_score_gemma":0.001457593,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01402294,"about_ca_topic_score_gemma":0.00004614801,"domain_scores_codex":[0.9875727,0.003434054,0.002377586,0.002431436,0.002270883,0.001913399],"domain_scores_gemma":[0.9885555,0.002475885,0.001946742,0.003831285,0.001777913,0.001412681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005989123,0.001290909,0.009655625,0.002675231,0.01351867,0.001505568,0.009465713,0.4734877,0.4091317,0.02322328,0.04808848,0.001967976],"study_design_scores_gemma":[0.002323608,0.0009242642,0.0006445976,0.0007583239,0.0006130783,0.0005211986,0.0003350727,0.9845278,0.0006709295,0.00003922286,0.007019869,0.001622088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3289635,0.001417918,0.5865999,0.0006998352,0.003210984,0.008676131,0.0003897683,0.007395262,0.06264665],"genre_scores_gemma":[0.8391923,0.00003389949,0.05039344,0.0000373995,0.001724657,0.001370748,0.0003061873,0.0004341553,0.1065072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5362065,"threshold_uncertainty_score":0.9996157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2973123143","doi":"10.1007/s11241-019-09338-8","title":"Reduced latency DRAM for multi-core safety-critical real-time systems","year":2019,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Memory controller; Computer science; Dram; CAS latency; Latency (audio); Embedded system; Registered memory; Interleaved memory; Multi-core processor; Dynamic random-access memory; Static random-access memory; Parallel computing; Memory management; Semiconductor memory; Operating system; Computer hardware; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0304387482999133,"gpt":0.2935015980062963,"spread":0.2630628497063831,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004064054,0.001199226,0.002466556,0.0006220459,0.0005802272,0.001483581,0.002863487,0.0009056745,0.0001080346],"category_scores_gemma":[0.0005671617,0.001121891,0.000698255,0.001207085,0.0001714004,0.001851601,0.0005845149,0.0005228603,0.009897322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007916935,"about_ca_system_score_gemma":0.000679441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003168274,"about_ca_topic_score_gemma":0.000005485593,"domain_scores_codex":[0.9894485,0.0009700922,0.002894601,0.002665692,0.001648158,0.00237298],"domain_scores_gemma":[0.9911684,0.001801178,0.001008545,0.00392365,0.001127017,0.0009712576],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003313077,0.0008912676,0.001170162,0.006454305,0.0008334955,0.0002825542,0.002836214,0.01140735,0.8059422,0.1499163,0.01840218,0.001532654],"study_design_scores_gemma":[0.002869213,0.0006140087,0.0005887268,0.00219584,0.0001040793,0.0007171567,0.0003576294,0.9841346,0.0008879799,0.0001384083,0.005562289,0.00183011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3153262,0.004203934,0.3313298,0.002043626,0.04669701,0.04479859,0.0009468385,0.01470461,0.2399494],"genre_scores_gemma":[0.8621157,0.000208891,0.06366239,0.00005897641,0.002767873,0.001475253,0.0002613253,0.0005966821,0.06885286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9727272,"threshold_uncertainty_score":0.999553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1744407750","doi":"10.1023/a:1011199405471","title":"Object Caching and Prefetching in Distributed Virtual Walkthrough","year":2001,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01363695135265794,"gpt":0.2673937596894742,"spread":0.2537568083368163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005972183,0.0001648562,0.0002669082,0.000217468,0.0001206834,0.0003606676,0.000406664,0.00008386132,0.000002788588],"category_scores_gemma":[0.0000208194,0.0001560997,0.00004031353,0.0006402272,0.00002230173,0.0004739106,0.0002492757,0.0001234515,0.000007519296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006144678,"about_ca_system_score_gemma":0.00003563083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001809439,"about_ca_topic_score_gemma":0.00002845159,"domain_scores_codex":[0.9985058,0.0001949314,0.0003757608,0.0004114458,0.0002311438,0.0002809595],"domain_scores_gemma":[0.999225,0.0001133757,0.0001193982,0.0004070312,0.00004960351,0.00008554698],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002348656,0.0003112966,0.03979879,0.0001897957,0.00008288037,0.0002602748,0.007082433,0.002454032,0.004831999,0.9154828,0.002405536,0.02707666],"study_design_scores_gemma":[0.0004638123,0.0001736087,0.009870105,0.0003244271,0.000004805914,0.000173118,0.00006742759,0.982492,0.0001971978,0.001531839,0.004283714,0.0004179405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1915319,0.0001612797,0.805653,0.00005827879,0.0002023049,0.0003106334,0.000005829295,0.0005397997,0.001537026],"genre_scores_gemma":[0.998587,0.0002156139,0.0009196597,0.00002206134,0.00007211987,0.00002144052,0.00001502289,0.00001299262,0.000134114],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.980038,"threshold_uncertainty_score":0.6365562,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2775713557","doi":"10.1007/s11241-017-9297-0","title":"Delay-dependent partial order reduction technique for real time systems","year":2017,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Reachability; Partial order reduction; Convex hull; Reduction (mathematics); Petri net; Regular polygon; Context (archaeology); Set (abstract data type); Computer science; State space; Automaton; State (computer science); Hull; Identity (music); Order (exchange); Mathematics; Model checking; Algorithm; Theoretical computer science; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03138281613212452,"gpt":0.3137023800549307,"spread":0.2823195639228062,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003224339,0.0003067014,0.0005102637,0.0001583742,0.0007492058,0.0009298772,0.001705695,0.0003357474,0.00001050602],"category_scores_gemma":[0.0002354842,0.0002892568,0.0001206783,0.000174155,0.00009945252,0.001168628,0.0002488107,0.0001640213,0.0004613],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003127849,"about_ca_system_score_gemma":0.000175477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002205073,"about_ca_topic_score_gemma":0.000001738675,"domain_scores_codex":[0.9968378,0.0004439098,0.0007809312,0.0007950319,0.0005753252,0.0005670067],"domain_scores_gemma":[0.9958003,0.00009140161,0.0009378262,0.002527168,0.0004611691,0.0001821206],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001634673,0.0002321968,0.00008697319,0.0008366015,0.0001964397,0.00003015827,0.0007638953,0.003374652,0.8131806,0.1618146,0.0122976,0.007022883],"study_design_scores_gemma":[0.001040689,0.0005850955,0.0002833181,0.0005510785,0.00007536676,0.001019818,0.0000853917,0.9309486,0.04875293,0.0004868155,0.01511348,0.001057393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004179784,0.00007293246,0.9648207,0.0001109632,0.004518135,0.003670096,0.0000350754,0.0007557434,0.02183652],"genre_scores_gemma":[0.4502581,0.0001750212,0.5057326,0.000009088963,0.003685222,0.005066744,0.00007600263,0.0001821944,0.03481503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.927574,"threshold_uncertainty_score":0.999956,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006984763","doi":"10.1007/s11241-010-9103-8","title":"SetExp: a method of transformation of timed automata into finite state automata","year":2010,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval; Université de Sherbrooke","funders":"","keywords":"Timed automaton; Automaton; Quantum finite automata; ω-automaton; Computer science; Continuous spatial automaton; Finite-state machine; Discrete event dynamic system; Event (particle physics); State space; Automata theory; Supervisory control; Theoretical computer science; Transformation (genetics); Nondeterministic finite automaton; Algorithm; Discrete system; Mathematics; Control (management); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01358559386440762,"gpt":0.2798338881276556,"spread":0.266248294263248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003204229,0.0002608715,0.0007384896,0.0004255259,0.00007580363,0.0001008973,0.001451046,0.0001826558,0.00001492461],"category_scores_gemma":[0.0001267561,0.000237953,0.0001461285,0.0008107972,0.00005747248,0.0008387143,0.0001820046,0.0002003186,0.0001130045],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005984334,"about_ca_system_score_gemma":0.0002205411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00137574,"about_ca_topic_score_gemma":0.00001906383,"domain_scores_codex":[0.9964944,0.0004456872,0.00139702,0.0004511452,0.0008385986,0.0003731387],"domain_scores_gemma":[0.9965465,0.0005494076,0.000798344,0.001628209,0.0003314387,0.0001460862],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005164884,0.0002344621,0.00005214479,0.003069279,0.0002472738,0.00002524662,0.02169003,0.03215855,0.8555318,0.01335235,0.0009607334,0.07262646],"study_design_scores_gemma":[0.0006239365,0.00009461475,0.00006894122,0.0003044255,0.00001633307,0.0001040103,0.00005271417,0.9820766,0.01506491,0.0003954162,0.0009695104,0.000228545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04971669,0.00005274101,0.9395994,0.00007131053,0.0009460328,0.0007428666,0.00007205984,0.0005280114,0.008270886],"genre_scores_gemma":[0.8276838,0.00001952042,0.1718123,0.000005660807,0.00005526025,0.00004219186,0.00002040806,0.00002914353,0.0003316869],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9499181,"threshold_uncertainty_score":0.970344,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107330110","doi":"10.1007/s11241-012-9151-3","title":"State-based scheduling with tree schedules: analysis and evaluation","year":2012,"lang":"en","type":"article","venue":"Real-Time Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Arbitration; Distributed computing; Scheduling (production processes); Stateless protocol; Tree (set theory); Bounded function; Flexibility (engineering); State (computer science); Mathematical optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01754041747987675,"gpt":0.2605352374045286,"spread":0.2429948199246518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004893536,0.0004591972,0.0008488075,0.0008425649,0.0002740159,0.0007376667,0.0006387119,0.0001694073,0.00002896861],"category_scores_gemma":[0.00009970053,0.0003754554,0.0001656676,0.002344002,0.00008643944,0.001720614,0.0001272669,0.0001962466,0.0002392419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002974648,"about_ca_system_score_gemma":0.0003262128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0014337,"about_ca_topic_score_gemma":0.00004663868,"domain_scores_codex":[0.9949962,0.0009283152,0.0008107295,0.0008580608,0.001488122,0.0009186005],"domain_scores_gemma":[0.9965855,0.0003639027,0.0006045959,0.001418963,0.0005032879,0.000523781],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001766537,0.0007364384,0.3835388,0.001317286,0.005195637,0.00005590279,0.005682685,0.5050999,0.0527458,0.01497435,0.0001500746,0.03032646],"study_design_scores_gemma":[0.001005896,0.0001138207,0.02109079,0.0002302966,0.0005078567,0.0000419705,0.0002167211,0.9747068,0.001429545,0.00002832043,0.00007157256,0.0005564159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5568168,0.000916454,0.4369352,0.00006663163,0.0002703707,0.0009688033,0.000005632212,0.0003922328,0.003627792],"genre_scores_gemma":[0.9299682,0.00001402898,0.06932514,0.00001501078,0.0002201318,0.0001667551,0.000029955,0.00004626775,0.0002144654],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4696069,"threshold_uncertainty_score":0.9998698,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}