{"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":"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.007718243,0.00016879008,0.98500896,0.0002566014,0.000096964424,0.00011561773,0.00017704256,0.0022023104,0.0042554103],"genre_scores_gemma":[0.3545472,0.00051910296,0.6325975,0.00051398156,0.00031049433,0.00045763276,0.00067618897,0.0010024705,0.0093754465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99343973,0.0020190843,0.0005084312,0.0010698892,0.0024779066,0.0004850213],"domain_scores_gemma":[0.9955179,0.0021229438,0.00041363807,0.00091174594,0.0008479175,0.00018588825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003482827,0.0006979692,0.0009237274,0.0012348867,0.0007868726,0.0019113809,0.0018458528,0.0010336156,0.0045254705],"category_scores_gemma":[0.007418166,0.00053259445,0.002943129,0.0009838049,0.0037888703,0.0029225035,0.0019648916,0.0027157215,0.0018678496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","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.00021846428,0.00015379107,0.0008106434,0.00039146177,0.000114449685,0.00084248977,0.0005940137,0.07002414,0.015507978,0.8250031,0.0030268738,0.083312675],"study_design_scores_gemma":[0.00011647618,0.00018697204,0.00022462744,0.00008086002,0.00012121521,0.00057686545,0.00008196968,0.30053067,0.025281124,0.64808744,0.024611434,0.00010036165],"about_ca_topic_score_codex":0.0028860772,"about_ca_topic_score_gemma":0.0014296678,"teacher_disagreement_score":0.0045254705,"about_ca_system_score_codex":0.0010040164,"about_ca_system_score_gemma":0.0019244261,"threshold_uncertainty_score":0.018419206},"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":"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.066362776,0.00016923288,0.93168026,0.00016315031,0.000031913572,0.000059765298,0.000021703328,0.00044962773,0.001061623],"genre_scores_gemma":[0.5833616,0.00011761704,0.41486454,0.000058117254,0.000028192308,0.000091100614,0.00006458775,0.00008173343,0.0013324784],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956805,0.00013219888,0.000029427092,0.00009174598,0.000129039,0.000049569055],"domain_scores_gemma":[0.9988255,0.0004811946,0.00013175771,0.0002907597,0.00016810687,0.000102559585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076033,0.0005245903,0.00061306363,0.00027422528,0.00091950945,0.0007769849,0.0014497767,0.00061701273,0.0007752093],"category_scores_gemma":[0.0025246837,0.00037403766,0.00032793268,0.00065239635,0.00049467327,0.0012226048,0.0009168364,0.00053516246,0.00026092946],"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.00028176873,0.00013411784,0.0019486648,0.000105263476,0.000030291489,0.00020751175,0.0002545697,0.7949344,0.037035655,0.011648545,0.0015375309,0.15188174],"study_design_scores_gemma":[0.000027653445,0.000049309165,0.00018704843,0.0000033317142,0.000006979501,0.000069372334,0.000064587606,0.9891472,0.0051024356,0.0043828385,0.00095193903,0.0000073097335],"about_ca_topic_score_codex":0.0021370822,"about_ca_topic_score_gemma":0.0031889477,"teacher_disagreement_score":0.0021370822,"about_ca_system_score_codex":0.000540303,"about_ca_system_score_gemma":0.0009388095,"threshold_uncertainty_score":0.0047999024},"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":"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.16576779,0.00050922914,0.82768106,0.00039020236,0.000051836756,0.00006646944,0.00008330182,0.0005952452,0.0048549315],"genre_scores_gemma":[0.9566543,0.00013239309,0.04226922,0.00003572247,0.000013185324,0.00002872613,0.000046116904,0.000017998875,0.00080233836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99894327,0.00033780502,0.0000729223,0.00011961201,0.00037655412,0.00014988949],"domain_scores_gemma":[0.9985274,0.0005570437,0.00020155555,0.00041784396,0.00023772795,0.000058477166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013972038,0.00033915415,0.00043704247,0.00075828476,0.00079839735,0.0014348679,0.0013038167,0.000375573,0.00077683094],"category_scores_gemma":[0.0031517239,0.00024016175,0.00036174053,0.0013113562,0.00077452953,0.0030330976,0.0015493827,0.00043029513,0.00012949493],"study_design_candidate":"not_applicable","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.0004592644,0.0001109866,0.0034220251,0.00011241681,0.000069790134,0.00039748408,0.00037628046,0.75045043,0.010570125,0.076371044,0.0016837863,0.15597633],"study_design_scores_gemma":[0.000017360055,0.000047710728,0.00039567036,0.00000793196,0.000015530912,0.000066040906,0.00008799137,0.96574134,0.005197994,0.026704637,0.0017013976,0.000016453829],"about_ca_topic_score_codex":0.003734872,"about_ca_topic_score_gemma":0.0028437858,"teacher_disagreement_score":0.003734872,"about_ca_system_score_codex":0.0012934942,"about_ca_system_score_gemma":0.0009828621,"threshold_uncertainty_score":0.00938499},"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":"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.042150762,0.00013761914,0.954055,0.00017261424,0.000025957987,0.00014525917,0.000036758734,0.00063281145,0.0026431556],"genre_scores_gemma":[0.81636614,0.00010883441,0.18066743,0.00005646783,0.000018097944,0.0001531685,0.00007601331,0.00008244921,0.002471397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965407,0.0013491682,0.00023161425,0.00051682733,0.0009220744,0.00043948172],"domain_scores_gemma":[0.99421567,0.0027736414,0.00066504005,0.0016371009,0.00043002036,0.0002786124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004376243,0.0004450137,0.00089590455,0.00045931357,0.0006194143,0.001679387,0.0018153033,0.0010311729,0.0027634902],"category_scores_gemma":[0.008363826,0.0003710733,0.0004506963,0.00079720234,0.0024850434,0.003005063,0.0025426138,0.002203091,0.0003864622],"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.00059230416,0.00018065805,0.00079529366,0.00014896598,0.000052163716,0.00023633437,0.0004317786,0.6788733,0.014497162,0.24137062,0.0009675848,0.0618538],"study_design_scores_gemma":[0.000055135446,0.00007858562,0.00008161044,0.000011087386,0.000008509616,0.00005792882,0.000042908378,0.9350413,0.00575169,0.05761579,0.001235495,0.000019921887],"about_ca_topic_score_codex":0.0009990233,"about_ca_topic_score_gemma":0.0011714073,"teacher_disagreement_score":0.004376243,"about_ca_system_score_codex":0.0014771508,"about_ca_system_score_gemma":0.0015787769,"threshold_uncertainty_score":0.023144066},"labels":[],"label_agreement":null}]}