{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":4,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":4,"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":"414d11673c31","filters":{"venue":"International Journal of Grid and Utility Computing"}},"results":[{"id":"W1996846884","doi":"10.1504/ijguc.2013.056257","title":"FASER (Formal and Automatic Security Enforcement by Rewriting) by BPA algebra with test","year":2013,"lang":"en","type":"article","venue":"International Journal of Grid and Utility Computing","topic":"Formal Methods in Verification","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Rewriting; Computer science; Process calculus; Enforcement; Security policy; Computer security model; Process (computing); Theoretical computer science; Computer security; Programming language; Algebra over a field; Mathematics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.007587784069551583,"gpt":0.2514395864404241,"spread":0.2438518023708725,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009443726,0.0001244533,0.0001688008,0.00007829798,0.0001222439,0.0003469663,0.0004962812,0.00003892519,0.00002450983],"category_scores_gemma":[0.0002112556,0.00009884679,0.00003226688,0.00008215797,0.00009136709,0.001248561,0.000248621,0.0002266088,0.000002210358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004882431,"about_ca_system_score_gemma":0.00003932635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005635407,"about_ca_topic_score_gemma":8.884633e-7,"domain_scores_codex":[0.99858,0.0000716673,0.0005074651,0.0001792132,0.0004696693,0.0001920041],"domain_scores_gemma":[0.998611,0.0002242886,0.0004418102,0.0001246427,0.0004786414,0.0001196603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005673122,0.0005291742,0.07072842,0.0001499295,0.0002869533,0.00002859582,0.004045918,0.00006972437,0.00303971,0.01607368,0.02528806,0.8797031],"study_design_scores_gemma":[0.001183112,0.0004452638,0.04619522,0.0002486265,0.00001478149,0.0006314377,0.0003029577,0.9399607,0.004650155,0.001921007,0.004178503,0.0002682174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7282741,0.0001679074,0.2698847,0.0005702707,0.000587403,0.00009473853,0.000005760777,0.00002747007,0.00038768],"genre_scores_gemma":[0.9167109,0.00002292223,0.08275886,0.0002844265,0.0002035996,0.000001093855,0.000003421978,0.0000043941,0.00001036566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.939891,"threshold_uncertainty_score":0.4030855,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2043594377","doi":"10.1504/ijguc.2012.047766","title":"Allocating replicas in large-scale data grids using a QoS-aware distributed technique with workload constraints","year":2012,"lang":"en","type":"article","venue":"International Journal of Grid and Utility Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Replica; Distributed computing; Quality of service; Grid; Workload; Replication (statistics); Latency (audio); Grid computing; Greedy algorithm; Data grid; Computer network; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0426641551763584,"gpt":0.3189883153439103,"spread":0.2763241601675518,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002865599,0.0001912,0.0003418381,0.0001700369,0.0001295395,0.0002370742,0.001573487,0.00007827212,0.000004224578],"category_scores_gemma":[0.0001504539,0.0001618895,0.00005684542,0.0003428801,0.0001156843,0.0008267948,0.0009149052,0.0004425176,8.553387e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000108883,"about_ca_system_score_gemma":0.0001665598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004646332,"about_ca_topic_score_gemma":0.00001499493,"domain_scores_codex":[0.9976966,0.0001875448,0.0008089856,0.0003489734,0.0005378025,0.0004201383],"domain_scores_gemma":[0.998087,0.0002419222,0.0006412836,0.0004520116,0.0004039425,0.0001738122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002200059,0.001238924,0.919425,0.0001486051,0.0004633705,0.0004638659,0.005135298,0.01092856,0.000764988,0.001254636,0.001248322,0.05870849],"study_design_scores_gemma":[0.001822255,0.0001114553,0.08777712,0.002388994,0.00002758548,0.005380409,0.001037018,0.8976256,0.0002751244,0.0001196666,0.002948584,0.0004861666],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2390061,0.0002654015,0.7589771,0.0002173126,0.001249554,0.000111096,0.00006572974,0.00003590096,0.00007181226],"genre_scores_gemma":[0.9631526,0.000007271105,0.03558012,0.00007513338,0.001139753,6.174564e-7,0.00003530343,0.000007862636,0.000001276045],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8866971,"threshold_uncertainty_score":0.6601663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117535601","doi":"10.1504/ijguc.2014.062935","title":"Resource information sharing in multi-domain optical grids","year":2014,"lang":"en","type":"article","venue":"International Journal of Grid and Utility Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Abstraction; Interoperability; Distributed computing; Grid; Information sharing; Resource (disambiguation); Representation (politics); Scheduling (production processes); Shared resource; Computer security; Computer network; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01785100657880455,"gpt":0.2678287718085769,"spread":0.2499777652297724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088628,0.0001072695,0.0002042097,0.0002246013,0.00006513145,0.0003364559,0.0008989701,0.00005099787,0.000001711185],"category_scores_gemma":[0.0002466086,0.00009712109,0.00007041825,0.0001467164,0.00004198185,0.0006560549,0.0003986982,0.0002774502,0.000004068041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005867325,"about_ca_system_score_gemma":0.00003847824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001947097,"about_ca_topic_score_gemma":0.000002921639,"domain_scores_codex":[0.9984096,0.0000959749,0.0007343838,0.0001527711,0.0004229453,0.0001843641],"domain_scores_gemma":[0.9989725,0.0002046816,0.0003491421,0.0001274082,0.0002521207,0.00009408678],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001931539,0.0004886924,0.264744,0.0001320551,0.0002037915,0.0001380491,0.01225345,0.03362785,0.0002114749,0.09855331,0.002275259,0.5871789],"study_design_scores_gemma":[0.001198218,0.00006689158,0.1050996,0.0002490084,0.00000236469,0.0003315895,0.0001461424,0.8656402,0.00003348355,0.001140553,0.02595409,0.0001378504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3201708,0.00003298389,0.6769777,0.0005709552,0.00124028,0.00003244254,0.000001314724,0.00002098887,0.0009525446],"genre_scores_gemma":[0.9766576,0.000002279051,0.0226061,0.000205447,0.0005172797,1.743679e-7,0.000004172773,0.000002641408,0.000004339507],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8320123,"threshold_uncertainty_score":0.3960483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4245523477","doi":"10.1504/ijguc.2020.110910","title":"Efficient variant transaction injection protocols and adaptive policy optimisation for decentralised ledger systems","year":2020,"lang":"en","type":"article","venue":"International Journal of Grid and Utility Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Bottleneck; Knapsack problem; Database transaction; Cryptocurrency; Protocol (science); Latency (audio); Distributed computing; Robustness (evolution); Probabilistic logic; Computer network; Computer security; Embedded system; Database","retraction":null,"screen_n_in":null,"score":{"opus":0.03003568775676526,"gpt":0.2950264084799361,"spread":0.2649907207231709,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506287,0.00008177305,0.000143377,0.0001146322,0.0001198304,0.0001292504,0.0002595498,0.00006147818,6.394882e-7],"category_scores_gemma":[0.00008406022,0.00007417101,0.00004741889,0.000134769,0.00004436177,0.0001116494,0.00005418012,0.0001478855,1.851104e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005692694,"about_ca_system_score_gemma":0.00008336833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002052216,"about_ca_topic_score_gemma":6.802264e-7,"domain_scores_codex":[0.9991164,0.00004937772,0.0003611272,0.0001851828,0.0001845804,0.0001032817],"domain_scores_gemma":[0.9990479,0.0001025675,0.0002937414,0.00006670879,0.0004117133,0.0000773045],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001084463,0.000710102,0.002030339,0.000233878,0.0005137808,0.00002953559,0.01226862,0.1103708,0.003815278,0.2884015,0.0007069487,0.5798347],"study_design_scores_gemma":[0.0007883075,0.0002020294,0.002296718,0.00005117941,0.000007500201,0.0001931515,0.000117428,0.9938316,0.0004035041,0.0009330839,0.001106306,0.00006912951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09493506,0.00006452174,0.8991786,0.004323571,0.0003391306,0.001098554,0.000006473523,0.00003400856,0.00002010289],"genre_scores_gemma":[0.9837152,0.000006483989,0.01557493,0.0001330552,0.0005275153,0.00003764023,0.000001037699,0.00000325741,8.662232e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8887802,"threshold_uncertainty_score":0.3024606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}