{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Guangye Sui","is_ca":true},{"name":"Mohamed Mejri","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003482827,0.0006979692,0.0009237274,0.001234887,0.0007868726,0.001911381,0.001845853,0.001033616,0.004525471],"category_scores_gemma":[0.007418166,0.0005325945,0.002943129,0.0009838049,0.00378887,0.002922504,0.001964892,0.002715721,0.00186785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001004016,"about_ca_system_score_gemma":0.001924426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002886077,"about_ca_topic_score_gemma":0.001429668,"domain_scores_codex":[0.9934397,0.002019084,0.0005084312,0.001069889,0.002477907,0.0004850213],"domain_scores_gemma":[0.9955179,0.002122944,0.0004136381,0.0009117459,0.0008479175,0.0001858882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002184643,0.0001537911,0.0008106434,0.0003914618,0.0001144497,0.0008424898,0.0005940137,0.07002414,0.01550798,0.8250031,0.003026874,0.08331268],"study_design_scores_gemma":[0.0001164762,0.000186972,0.0002246274,0.00008086002,0.0001212152,0.0005768655,0.00008196968,0.3005307,0.02528112,0.6480874,0.02461143,0.0001003616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007718243,0.0001687901,0.985009,0.0002566014,0.00009696442,0.0001156177,0.0001770426,0.00220231,0.00425541],"genre_scores_gemma":[0.3545472,0.000519103,0.6325975,0.0005139816,0.0003104943,0.0004576328,0.000676189,0.00100247,0.009375446],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004525471,"threshold_uncertainty_score":0.01841921,"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","authors":[{"name":"Mohammad Shorfuzzaman","is_ca":true},{"name":"Peter Graham","is_ca":true},{"name":"Rasit Eskicioglu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009076033,0.0005245903,0.0006130636,0.0002742253,0.0009195094,0.0007769849,0.001449777,0.0006170127,0.0007752093],"category_scores_gemma":[0.002524684,0.0003740377,0.0003279327,0.0006523964,0.0004946733,0.001222605,0.0009168364,0.0005351625,0.0002609295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000540303,"about_ca_system_score_gemma":0.0009388095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002137082,"about_ca_topic_score_gemma":0.003188948,"domain_scores_codex":[0.999568,0.0001321989,0.00002942709,0.00009174598,0.000129039,0.00004956905],"domain_scores_gemma":[0.9988255,0.0004811946,0.0001317577,0.0002907597,0.0001681069,0.0001025596],"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.0002817687,0.0001341178,0.001948665,0.0001052635,0.00003029149,0.0002075118,0.0002545697,0.7949344,0.03703566,0.01164855,0.001537531,0.1518817],"study_design_scores_gemma":[0.00002765344,0.00004930916,0.0001870484,0.000003331714,0.000006979501,0.00006937233,0.00006458761,0.9891472,0.005102436,0.004382838,0.000951939,0.000007309734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06636278,0.0001692329,0.9316803,0.0001631503,0.00003191357,0.0000597653,0.00002170333,0.0004496277,0.001061623],"genre_scores_gemma":[0.5833616,0.000117617,0.4148645,0.00005811725,0.00002819231,0.00009110061,0.00006458775,0.00008173343,0.001332478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002137082,"threshold_uncertainty_score":0.004799902,"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","authors":[{"name":"Mohamed Abouelela","is_ca":true},{"name":"Mohamed El-Darieby","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001397204,0.0003391542,0.0004370425,0.0007582848,0.0007983973,0.001434868,0.001303817,0.000375573,0.0007768309],"category_scores_gemma":[0.003151724,0.0002401618,0.0003617405,0.001311356,0.0007745295,0.003033098,0.001549383,0.0004302951,0.0001294949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001293494,"about_ca_system_score_gemma":0.0009828621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003734872,"about_ca_topic_score_gemma":0.002843786,"domain_scores_codex":[0.9989433,0.000337805,0.0000729223,0.000119612,0.0003765541,0.0001498895],"domain_scores_gemma":[0.9985274,0.0005570437,0.0002015556,0.000417844,0.0002377279,0.00005847717],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004592644,0.0001109866,0.003422025,0.0001124168,0.00006979013,0.0003974841,0.0003762805,0.7504504,0.01057012,0.07637104,0.001683786,0.1559763],"study_design_scores_gemma":[0.00001736005,0.00004771073,0.0003956704,0.00000793196,0.00001553091,0.00006604091,0.00008799137,0.9657413,0.005197994,0.02670464,0.001701398,0.00001645383],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1657678,0.0005092291,0.8276811,0.0003902024,0.00005183676,0.00006646944,0.00008330182,0.0005952452,0.004854931],"genre_scores_gemma":[0.9566543,0.0001323931,0.04226922,0.00003572247,0.00001318532,0.00002872613,0.0000461169,0.00001799887,0.0008023384],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003734872,"threshold_uncertainty_score":0.00938499,"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","authors":[{"name":"Bruno Andriamanalimanana","is_ca":false},{"name":"Chen Fu Chiang","is_ca":false},{"name":"Jorge Novillo","is_ca":false},{"name":"Sam Sengupta","is_ca":false},{"name":"Ali Tekeoglu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004376243,0.0004450137,0.0008959046,0.0004593136,0.0006194143,0.001679387,0.001815303,0.001031173,0.00276349],"category_scores_gemma":[0.008363826,0.0003710733,0.0004506963,0.0007972023,0.002485043,0.003005063,0.002542614,0.002203091,0.0003864622],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001477151,"about_ca_system_score_gemma":0.001578777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009990233,"about_ca_topic_score_gemma":0.001171407,"domain_scores_codex":[0.9965407,0.001349168,0.0002316142,0.0005168273,0.0009220744,0.0004394817],"domain_scores_gemma":[0.9942157,0.002773641,0.00066504,0.001637101,0.0004300204,0.0002786124],"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.0005923042,0.0001806581,0.0007952937,0.000148966,0.00005216372,0.0002363344,0.0004317786,0.6788733,0.01449716,0.2413706,0.0009675848,0.0618538],"study_design_scores_gemma":[0.00005513545,0.00007858562,0.00008161044,0.00001108739,0.000008509616,0.00005792882,0.00004290838,0.9350413,0.00575169,0.05761579,0.001235495,0.00001992189],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04215076,0.0001376191,0.954055,0.0001726142,0.00002595799,0.0001452592,0.00003675873,0.0006328115,0.002643156],"genre_scores_gemma":[0.8163661,0.0001088344,0.1806674,0.00005646783,0.00001809794,0.0001531685,0.00007601331,0.00008244921,0.002471397],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004376243,"threshold_uncertainty_score":0.02314407,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}