{"meta":{"query_hash":"414d11673c31","filters":{"venue":"International Journal of Grid and Utility Computing"},"cohort_total":4,"direct_labels_cover":0,"predictions_cover":4,"exported":4,"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/414d11673c31","api":"https://metacan.xera.ac/api/v1/cohort?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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007587784069551583,"score_gpt":0.2514395864404241,"score_spread":0.2438518023708725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996846884","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.7282741,0.00016790739,0.26988468,0.0005702707,0.00058740296,0.00009473853,0.0000057607767,0.000027470074,0.00038768002],"genre_scores_gemma":[0.9167109,0.000022922226,0.08275886,0.0002844265,0.00020359961,0.0000010938551,0.0000034219784,0.0000043940995,0.000010365658],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858,0.0000716673,0.0005074651,0.00017921315,0.0004696693,0.00019200414],"domain_scores_gemma":[0.998611,0.00022428861,0.0004418102,0.00012464273,0.0004786414,0.00011966031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009443726,0.0001244533,0.0001688008,0.00007829798,0.00012224387,0.0003469663,0.0004962812,0.000038925187,0.000024509834],"category_scores_gemma":[0.00021125561,0.00009884679,0.000032266882,0.000082157974,0.00009136709,0.0012485613,0.000248621,0.00022660878,0.0000022103577],"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.000056731224,0.00052917417,0.07072842,0.00014992952,0.00028695326,0.00002859582,0.0040459177,0.000069724374,0.0030397095,0.016073678,0.025288064,0.8797031],"study_design_scores_gemma":[0.0011831119,0.00044526378,0.04619522,0.0002486265,0.000014781491,0.0006314377,0.00030295766,0.9399607,0.0046501546,0.0019210066,0.004178503,0.0002682174],"about_ca_topic_score_codex":0.000056354067,"about_ca_topic_score_gemma":8.8846326e-7,"teacher_disagreement_score":0.939891,"about_ca_system_score_codex":0.00004882431,"about_ca_system_score_gemma":0.000039326354,"threshold_uncertainty_score":0.4030855},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0426641551763584,"score_gpt":0.31898831534391026,"score_spread":0.27632416016755185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043594377","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.23900606,0.00026540147,0.7589771,0.0002173126,0.0012495542,0.00011109596,0.00006572974,0.00003590096,0.00007181226],"genre_scores_gemma":[0.96315265,0.0000072711055,0.03558012,0.00007513338,0.001139753,6.174564e-7,0.000035303434,0.000007862636,0.000001276045],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976966,0.00018754484,0.00080898555,0.0003489734,0.0005378025,0.0004201383],"domain_scores_gemma":[0.99808705,0.00024192223,0.0006412836,0.00045201156,0.0004039425,0.00017381216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002865599,0.0001912,0.00034183814,0.00017003695,0.00012953946,0.00023707421,0.0015734871,0.00007827212,0.000004224578],"category_scores_gemma":[0.00015045394,0.0001618895,0.000056845423,0.00034288014,0.00011568427,0.00082679477,0.00091490516,0.00044251757,8.553387e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022000592,0.0012389239,0.91942495,0.00014860513,0.0004633705,0.00046386593,0.0051352982,0.010928559,0.00076498796,0.001254636,0.0012483223,0.058708485],"study_design_scores_gemma":[0.0018222551,0.0001114553,0.08777712,0.0023889942,0.000027585476,0.005380409,0.0010370179,0.8976256,0.00027512445,0.00011966657,0.002948584,0.00048616662],"about_ca_topic_score_codex":0.000046463323,"about_ca_topic_score_gemma":0.000014994935,"teacher_disagreement_score":0.88669705,"about_ca_system_score_codex":0.000108883025,"about_ca_system_score_gemma":0.00016655982,"threshold_uncertainty_score":0.66016626},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017851006578804552,"score_gpt":0.26782877180857695,"score_spread":0.2499777652297724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117535601","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.3201708,0.00003298389,0.6769777,0.0005709552,0.0012402796,0.000032442542,0.0000013147242,0.000020988875,0.0009525446],"genre_scores_gemma":[0.97665757,0.000002279051,0.022606105,0.00020544704,0.00051727967,1.7436794e-7,0.0000041727726,0.0000026414082,0.000004339507],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840957,0.0000959749,0.0007343838,0.00015277113,0.00042294533,0.00018436408],"domain_scores_gemma":[0.99897254,0.00020468156,0.00034914206,0.00012740822,0.00025212072,0.000094086776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002088628,0.00010726951,0.0002042097,0.00022460127,0.000065131455,0.00033645585,0.0008989701,0.000050997867,0.0000017111847],"category_scores_gemma":[0.00024660857,0.00009712109,0.000070418246,0.00014671641,0.00004198185,0.00065605494,0.00039869823,0.0002774502,0.000004068041],"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.00019315393,0.0004886924,0.26474398,0.00013205514,0.0002037915,0.00013804906,0.012253447,0.033627853,0.00021147492,0.09855331,0.002275259,0.58717895],"study_design_scores_gemma":[0.0011982183,0.00006689158,0.10509963,0.0002490084,0.0000023646899,0.0003315895,0.00014614237,0.86564016,0.00003348355,0.0011405529,0.025954088,0.00013785035],"about_ca_topic_score_codex":0.000019470972,"about_ca_topic_score_gemma":0.0000029216387,"teacher_disagreement_score":0.8320123,"about_ca_system_score_codex":0.00005867325,"about_ca_system_score_gemma":0.000038478236,"threshold_uncertainty_score":0.3960483},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030035687756765263,"score_gpt":0.2950264084799361,"score_spread":0.26499072072317087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245523477","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.09493506,0.00006452174,0.89917856,0.0043235715,0.00033913058,0.0010985542,0.0000064735227,0.00003400856,0.000020102889],"genre_scores_gemma":[0.98371524,0.000006483989,0.015574926,0.00013305517,0.00052751525,0.00003764023,0.0000010376995,0.0000032574103,8.662232e-7],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991164,0.00004937772,0.00036112723,0.00018518277,0.00018458044,0.00010328172],"domain_scores_gemma":[0.99904794,0.000102567516,0.00029374144,0.00006670879,0.00041171326,0.000077304496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045062866,0.00008177305,0.000143377,0.00011463223,0.00011983041,0.00012925043,0.00025954982,0.00006147818,6.3948823e-7],"category_scores_gemma":[0.00008406022,0.00007417101,0.000047418893,0.00013476897,0.00004436177,0.00011164943,0.000054180116,0.00014788551,1.8511037e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010844634,0.00071010203,0.002030339,0.00023387802,0.0005137808,0.000029535586,0.012268624,0.11037082,0.0038152777,0.2884015,0.00070694875,0.5798347],"study_design_scores_gemma":[0.00078830746,0.00020202936,0.0022967183,0.00005117941,0.000007500201,0.00019315151,0.000117428,0.99383163,0.00040350415,0.0009330839,0.0011063056,0.000069129506],"about_ca_topic_score_codex":0.000020522159,"about_ca_topic_score_gemma":6.802264e-7,"teacher_disagreement_score":0.8887802,"about_ca_system_score_codex":0.000056926943,"about_ca_system_score_gemma":0.00008336833,"threshold_uncertainty_score":0.3024606},"labels":[],"label_agreement":null}]}