{"meta":{"query_hash":"0cbaf240d14f","filters":{"venue":"International Journal of High Performance Computing and Networking"},"cohort_total":22,"direct_labels_cover":0,"predictions_cover":22,"exported":22,"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/0cbaf240d14f","api":"https://metacan.xera.ac/api/v1/cohort?venue=International+Journal+of+High+Performance+Computing+and+Networking"},"results":[{"id":"W1973814258","doi":"10.1504/ijhpcn.2006.013490","title":"Real-time minimum vertex cover for two-terminal series-parallel graphs","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Vertex cover; Vertex (graph theory); Cardinality (data modeling); Terminal (telecommunication); Algorithm; Edge cover; Parallel algorithm; Series and parallel circuits; Series (stratigraphy); Graph; Time complexity; Theoretical computer science","score_opus":0.009274216943470406,"score_gpt":0.2574695263585593,"score_spread":0.24819530941508888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973814258","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.17244595,0.0001221798,0.82379186,0.00028282148,0.000033184388,0.000069738824,0.000073639494,0.00027198961,0.0029085944],"genre_scores_gemma":[0.61454767,0.00015779222,0.38192883,0.00006425495,0.000044416724,0.0001698533,0.00025957424,0.00015472343,0.002672968],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994875,0.00012102658,0.000020532168,0.00010388406,0.00018939264,0.00007755184],"domain_scores_gemma":[0.99838626,0.0009864096,0.00020476489,0.00018267812,0.00014815526,0.00009173508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010898717,0.00049040536,0.0007994769,0.00074041606,0.00069121504,0.0007754475,0.0011057404,0.0006882417,0.0022330107],"category_scores_gemma":[0.0036265552,0.00030195402,0.00067673647,0.0008035881,0.0011541673,0.001910396,0.0012308699,0.0010402333,0.00021727702],"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.00038167494,0.00008501006,0.00098359,0.00016687377,0.00003349832,0.00022980008,0.00015824882,0.8787772,0.01323973,0.05975763,0.0013079263,0.044878703],"study_design_scores_gemma":[0.000018639701,0.000028450813,0.00009749633,0.0000039056217,0.0000030211927,0.00005308898,0.000022237113,0.96620166,0.0027993652,0.03030107,0.0004669813,0.0000041107774],"about_ca_topic_score_codex":0.0014853885,"about_ca_topic_score_gemma":0.0018350903,"teacher_disagreement_score":0.0022330107,"about_ca_system_score_codex":0.0009994459,"about_ca_system_score_gemma":0.00079144933,"threshold_uncertainty_score":0.007470131},"labels":[],"label_agreement":null},{"id":"W1986921363","doi":"10.1504/ijhpcn.2005.007863","title":"Optimal all-to-all personalised exchange in a novel optical multistage interconnection network","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Computer science; Computer network; Gigabit; Node (physics); Interconnection; Low latency (capital markets); Bandwidth (computing); Multistage interconnection networks; Distributed computing; Latency (audio); Transmission (telecommunications); Telecommunications","score_opus":0.023464152984837536,"score_gpt":0.27656840881214967,"score_spread":0.2531042558273121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986921363","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.32313675,0.00059010903,0.6628653,0.00036630937,0.0000770231,0.00008388004,0.00010837516,0.0004209104,0.012351393],"genre_scores_gemma":[0.88159424,0.0002443041,0.11333947,0.00006334449,0.000027900733,0.000051228842,0.000074330674,0.000020817579,0.0045844363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997681,0.000055577468,0.0000128634565,0.000058641024,0.00006623305,0.000038548125],"domain_scores_gemma":[0.99978536,0.00006100768,0.000052503456,0.000036054134,0.00004172887,0.000023264673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028030635,0.00026697095,0.0003627282,0.00022759126,0.00040984477,0.00048654494,0.0006860695,0.0004253415,0.001089154],"category_scores_gemma":[0.00043148588,0.00023790711,0.00022602412,0.00037083478,0.00031984394,0.0011591453,0.00045513082,0.0002860315,0.00017666798],"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.00078524573,0.00023824084,0.001363428,0.00025244872,0.00007269649,0.00057710643,0.00028001337,0.7010912,0.10617342,0.058216553,0.005261531,0.12568808],"study_design_scores_gemma":[0.000030053414,0.00016453558,0.0002719935,0.0000059537188,0.000015562791,0.00011692204,0.000018758494,0.9833682,0.006251246,0.007528098,0.0022132301,0.000015475456],"about_ca_topic_score_codex":0.000857517,"about_ca_topic_score_gemma":0.0023224463,"teacher_disagreement_score":0.001089154,"about_ca_system_score_codex":0.00060533994,"about_ca_system_score_gemma":0.00040114895,"threshold_uncertainty_score":0.0043920875},"labels":[],"label_agreement":null},{"id":"W1999537538","doi":"10.1504/ijhpcn.2006.013482","title":"Performance assessment of four cluster interconnects on identical hardware: hints for cluster builders","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Myrinet; Computer science; Gigabit Ethernet; Cluster (spacecraft); Popularity; Gigabit; Ethernet; Computer cluster; Computer architecture; Embedded system; Computer network; Distributed computing; Telecommunications; Message passing","score_opus":0.016719539479513337,"score_gpt":0.278292704617197,"score_spread":0.2615731651376837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999537538","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9849672,0.00021575295,0.0122809,0.00007559505,0.000014437781,0.000026564769,0.000055347096,0.00046492458,0.0018993912],"genre_scores_gemma":[0.98935986,0.00009147604,0.009643522,0.000010642614,0.0000074499426,0.000014705433,0.00013388449,0.00011769302,0.0006208019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99872714,0.0003698747,0.000065784574,0.00021166127,0.00043714343,0.00018829996],"domain_scores_gemma":[0.9924412,0.0033781307,0.0009211731,0.0012604845,0.0016512746,0.00034787905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019317119,0.0007548663,0.00053664023,0.0018511482,0.0006601215,0.000982291,0.0011857897,0.0005163591,0.0017796399],"category_scores_gemma":[0.011385177,0.00039000553,0.00036750216,0.0015007943,0.0005176471,0.0019808204,0.0008307224,0.00053973653,0.00030475418],"study_design_candidate":"bench_or_experimental","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.0045336173,0.00078776485,0.11004599,0.0005691096,0.00020226843,0.001384057,0.0008599733,0.49636662,0.22337198,0.007041113,0.0024200988,0.15241744],"study_design_scores_gemma":[0.000088147375,0.004036426,0.03845793,0.000044713368,0.00024174192,0.00057287066,0.0007006615,0.78113186,0.16914105,0.0029757207,0.0024982928,0.00011063309],"about_ca_topic_score_codex":0.0016132486,"about_ca_topic_score_gemma":0.0013474065,"teacher_disagreement_score":0.0019317119,"about_ca_system_score_codex":0.0010493802,"about_ca_system_score_gemma":0.00059079065,"threshold_uncertainty_score":0.010215998},"labels":[],"label_agreement":null},{"id":"W2035538419","doi":"10.1504/ijhpcn.2011.038708","title":"Leveraging many simple statistical models to adaptively monitor software systems","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":7,"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 Waterloo","funders":"","keywords":"Computer science; System monitoring; Context (archaeology); Software; Component (thermodynamics); Continuous monitoring; Fault detection and isolation; Data mining; Reliability engineering; Simple (philosophy); Real-time computing; Artificial intelligence","score_opus":0.0422950986400276,"score_gpt":0.2618850722666185,"score_spread":0.2195899736265909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035538419","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.06986227,0.00020996721,0.92799425,0.00034172446,0.000031250536,0.000053912932,0.0000739927,0.0007957036,0.0006369084],"genre_scores_gemma":[0.89790297,0.00034994094,0.10029515,0.00014607965,0.00009860705,0.00013061294,0.00014748758,0.00007966366,0.00084942806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979165,0.00075459515,0.0001317119,0.00044470787,0.00061194936,0.00014051016],"domain_scores_gemma":[0.9892211,0.006715443,0.0016226316,0.0016952376,0.0005708186,0.00017469855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032443732,0.001120571,0.00085929234,0.001257879,0.00043136496,0.0015628708,0.0014144516,0.0012296436,0.00055357977],"category_scores_gemma":[0.017408669,0.00078576553,0.000925112,0.00087645516,0.0012066949,0.0029401109,0.0012263795,0.0014903119,0.00024273939],"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.00008044668,0.0001228281,0.013055508,0.000050600436,0.00012445956,0.000118862576,0.00010005796,0.9361539,0.004998556,0.010174536,0.00037206206,0.034648217],"study_design_scores_gemma":[0.000004868518,0.000028435281,0.0006332452,0.000002114319,0.000010567986,0.000029470159,0.0000044743147,0.9934493,0.0005167286,0.005195915,0.00011550166,0.000009321805],"about_ca_topic_score_codex":0.0036276507,"about_ca_topic_score_gemma":0.004901885,"teacher_disagreement_score":0.0036276507,"about_ca_system_score_codex":0.0008051916,"about_ca_system_score_gemma":0.0008868014,"threshold_uncertainty_score":0.017158091},"labels":[],"label_agreement":null},{"id":"W2044923352","doi":"10.1504/ijhpcn.2005.009424","title":"A security system implementation using software agents","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Agent-Based Network Management","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":"Acadia University","funders":"","keywords":"Computer science; Guard (computer science); Implementation; Computer security; Architecture; Service (business); Encryption; Interface (matter); Operating system; Software engineering; Business","score_opus":0.016632771462892378,"score_gpt":0.28800289151732955,"score_spread":0.27137012005443717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044923352","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.018103786,0.00020048492,0.9453464,0.00062552764,0.00022958149,0.00054150185,0.00006888292,0.009811516,0.025072306],"genre_scores_gemma":[0.25985053,0.0005808906,0.70425504,0.00032474156,0.000082830644,0.00063961104,0.00037665092,0.0007121608,0.03317752],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986066,0.00037424464,0.00015451873,0.00015029163,0.0005908352,0.00012357868],"domain_scores_gemma":[0.9988154,0.00024921005,0.000074866184,0.00028870985,0.000454431,0.00011737031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014253916,0.00044454008,0.00040824775,0.00063261756,0.0011949423,0.0031161755,0.0013264946,0.0011165135,0.0068450836],"category_scores_gemma":[0.0026726935,0.00050887046,0.00061981357,0.00041199202,0.0007493097,0.002347926,0.0017295214,0.0015030303,0.0033774406],"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.0005732719,0.0007731841,0.005370185,0.0007666669,0.00025567444,0.0012385307,0.0027580236,0.058955956,0.061638106,0.35711175,0.028886067,0.4816726],"study_design_scores_gemma":[0.00022611547,0.00057940045,0.0013525756,0.00032885585,0.00020152942,0.00096611184,0.0003587532,0.41927865,0.056459963,0.052557096,0.4675641,0.00012680626],"about_ca_topic_score_codex":0.0019268602,"about_ca_topic_score_gemma":0.0014604623,"teacher_disagreement_score":0.0068450836,"about_ca_system_score_codex":0.0006263628,"about_ca_system_score_gemma":0.001791645,"threshold_uncertainty_score":0.022899091},"labels":[],"label_agreement":null},{"id":"W2063877455","doi":"10.1504/ijhpcn.2006.013487","title":"A parallel quasi-Monte Carlo approach to pricing multidimensional American options","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua; University of Waterloo","funders":"","keywords":"Computer science; Speedup; Scalability; Monte Carlo method; Parallel computing; Monte Carlo methods for option pricing; Recursion (computer science); Parallel algorithm; Mathematical optimization; Quasi-Monte Carlo method; Markov chain Monte Carlo; Algorithm; Hybrid Monte Carlo; Mathematics; Artificial intelligence","score_opus":0.02553075317867747,"score_gpt":0.29539776281512065,"score_spread":0.26986700963644317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063877455","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.0051622074,0.000091664755,0.9913935,0.00020462646,0.000065024105,0.000027551034,0.000024167715,0.00017776694,0.0028535766],"genre_scores_gemma":[0.19956678,0.00042149998,0.79278004,0.00020354011,0.00017102192,0.00027081248,0.00011267587,0.00021360989,0.0062599834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951494,0.00018279189,0.00001565654,0.00003904526,0.00021507336,0.000032587555],"domain_scores_gemma":[0.9991301,0.00041958725,0.000061837614,0.00015527586,0.00018358366,0.000049761802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000836431,0.00039074614,0.00056196033,0.00044766843,0.00065672264,0.00067936006,0.001197887,0.00077079725,0.0035319487],"category_scores_gemma":[0.0022940855,0.00031976373,0.0007254197,0.00065319805,0.00086202816,0.0010745729,0.0007300646,0.0011350564,0.0006203567],"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.000046786423,0.00006713572,0.0006025723,0.000057247285,0.000036963138,0.000095228,0.000059739996,0.7701063,0.0027595202,0.19329585,0.0017469336,0.0311257],"study_design_scores_gemma":[0.000010219604,0.000008156237,0.000043506585,0.0000020944312,0.0000026491346,0.000013221668,0.000003255506,0.98231184,0.00029335974,0.015799657,0.0015084192,0.000003693446],"about_ca_topic_score_codex":0.0040835235,"about_ca_topic_score_gemma":0.00418171,"teacher_disagreement_score":0.0040835235,"about_ca_system_score_codex":0.0006805949,"about_ca_system_score_gemma":0.001254668,"threshold_uncertainty_score":0.011815608},"labels":[],"label_agreement":null},{"id":"W2068518386","doi":"10.1504/ijhpcn.2010.037791","title":"A novel technique of recognising multi-stage attack behaviour","year":2010,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":8,"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; Audit; Computer security; Feature (linguistics); Data mining; Attack model","score_opus":0.034530444530666234,"score_gpt":0.3034008261695685,"score_spread":0.26887038163890226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068518386","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.016531218,0.00009486273,0.9811307,0.000053900843,0.000048328435,0.000073686584,0.00007976078,0.0011136293,0.000873891],"genre_scores_gemma":[0.22371015,0.00022249963,0.773179,0.000071470335,0.00006135446,0.000110756766,0.00026533238,0.00011746093,0.0022619206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991223,0.00011084108,0.00006171495,0.0002518862,0.0003626646,0.00009064237],"domain_scores_gemma":[0.99853694,0.00046380062,0.00024016439,0.00025363488,0.00040439563,0.00010108266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005792527,0.00078109914,0.00054558413,0.002866845,0.0003802445,0.00071937015,0.00084143283,0.00070886035,0.0014773028],"category_scores_gemma":[0.0022708685,0.00036855575,0.00079868047,0.0016330143,0.0004533099,0.0013652665,0.00085921574,0.0009355944,0.0010326254],"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.00027686832,0.0001838669,0.010367182,0.00026533037,0.00014018812,0.0005869153,0.0005301749,0.01966906,0.17745443,0.009981623,0.002912506,0.7776319],"study_design_scores_gemma":[0.000032720847,0.0006921595,0.023594942,0.00006485807,0.00015385695,0.0039821328,0.0003196121,0.8380861,0.10139966,0.011739531,0.019753277,0.00018107526],"about_ca_topic_score_codex":0.0010723303,"about_ca_topic_score_gemma":0.0018481611,"teacher_disagreement_score":0.002866845,"about_ca_system_score_codex":0.00025886684,"about_ca_system_score_gemma":0.00063779304,"threshold_uncertainty_score":0.0049420595},"labels":[],"label_agreement":null},{"id":"W2084175966","doi":"10.1504/ijhpcn.2011.038709","title":"A self-stabilising algorithm for 3-edge-connectivity","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Asynchronous communication; Enhanced Data Rates for GSM Evolution; Computation; Spanning tree; Distributed algorithm; Algorithm; Fault tolerance; Self-stabilization; Distributed minimum spanning tree; Minimum spanning tree; Tree (set theory); Distributed computing; Parallel computing; Mathematics; Discrete mathematics; Combinatorics; Computer network","score_opus":0.019761998359530346,"score_gpt":0.25083017889184356,"score_spread":0.2310681805323132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084175966","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.0191854,0.000107205284,0.97709435,0.0001364715,0.000029453411,0.000079223086,0.000034318044,0.0011087888,0.0022247913],"genre_scores_gemma":[0.40208113,0.00012559627,0.59384155,0.00013868512,0.000030347119,0.00021684085,0.00018617239,0.00014566297,0.0032340377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995363,0.000090133304,0.000036079375,0.00012019361,0.00015678564,0.000060494633],"domain_scores_gemma":[0.9989446,0.00038992567,0.0001280271,0.00024640877,0.00022661543,0.000064511456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004981333,0.0004748158,0.0004398557,0.00084141316,0.00073005,0.0006347683,0.0013168555,0.0010107784,0.0027722719],"category_scores_gemma":[0.0030524402,0.0002498752,0.00046684872,0.0006841583,0.00088075065,0.001448356,0.0017422496,0.00094822637,0.00077950605],"study_design_candidate":"theoretical_or_conceptual","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.00052531884,0.00018903166,0.0014794734,0.00024367073,0.00006532726,0.00033778633,0.0006686726,0.266962,0.066778705,0.1418853,0.0073143695,0.5135504],"study_design_scores_gemma":[0.000095930394,0.00020658181,0.00029231867,0.000026466842,0.000019548506,0.00028009652,0.00006450284,0.90241015,0.015550451,0.07397819,0.0070367716,0.000039020448],"about_ca_topic_score_codex":0.0011047312,"about_ca_topic_score_gemma":0.0012593769,"teacher_disagreement_score":0.0027722719,"about_ca_system_score_codex":0.00052414,"about_ca_system_score_gemma":0.00075393997,"threshold_uncertainty_score":0.009274185},"labels":[],"label_agreement":null},{"id":"W209015621","doi":"10.1504/ijhpcn.2006.013484","title":"MPI scalability of a large memory LES code","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Fluid Dynamics and Turbulent Flows","field":"Engineering","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":"Queen's University","funders":"","keywords":"Scalability; Parallel computing; Turbulence; Computer science; Computational science; Code (set theory); Finite volume method; Grid; Large eddy simulation; Reynolds number; Jet (fluid); Flow (mathematics); Visualization; Detached eddy simulation; Mechanics; Reynolds-averaged Navier–Stokes equations; Physics; Operating system; Geometry; Mathematics","score_opus":0.005598487294784071,"score_gpt":0.21727230263522315,"score_spread":0.21167381534043908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W209015621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6438206,0.0005714455,0.20768815,0.0011895015,0.00036670527,0.00051808584,0.005566493,0.038838122,0.101440884],"genre_scores_gemma":[0.9028667,0.00017811292,0.08251181,0.000096905664,0.000077380784,0.00051485427,0.004825358,0.0017007337,0.007228121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992848,0.00014842498,0.00005078797,0.000071992996,0.00033573905,0.00010837764],"domain_scores_gemma":[0.99786973,0.0008293475,0.00008789974,0.00038715667,0.00070915907,0.00011663607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011170417,0.0006852337,0.00053583493,0.0007079445,0.0009593625,0.0012326333,0.0017541369,0.000572698,0.00600334],"category_scores_gemma":[0.003804588,0.0002468812,0.00042695223,0.0011961586,0.00043900264,0.00085993565,0.00095063663,0.000877485,0.0012714142],"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.0013761368,0.00060454407,0.013218071,0.0003051451,0.00018112885,0.00089216663,0.00040813148,0.78257006,0.05012947,0.024192626,0.027488288,0.0986342],"study_design_scores_gemma":[0.00008771665,0.00005985151,0.0017540052,0.000011048434,0.000014326685,0.000044698685,0.00004243695,0.97422314,0.01800466,0.0016107635,0.0041271322,0.000020155598],"about_ca_topic_score_codex":0.0057998756,"about_ca_topic_score_gemma":0.0023374287,"teacher_disagreement_score":0.00600334,"about_ca_system_score_codex":0.0006317858,"about_ca_system_score_gemma":0.0010784304,"threshold_uncertainty_score":0.020083189},"labels":[],"label_agreement":null},{"id":"W2102000944","doi":"10.1504/ijhpcn.2006.010202","title":"A protocol independent energy saving technique for mobile ad hoc networks","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Mobile ad hoc network; Routing protocol; Node (physics); Protocol (science); Distributed computing; Optimized Link State Routing Protocol; Wireless ad hoc network; Energy (signal processing); Routing (electronic design automation); Telecommunications; Wireless","score_opus":0.008696791933068668,"score_gpt":0.2612928837494678,"score_spread":0.25259609181639914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102000944","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.021346686,0.008394222,0.9290433,0.00062402186,0.0013782273,0.00035254212,0.00011819531,0.0022384997,0.036504313],"genre_scores_gemma":[0.5114439,0.007930468,0.42465207,0.0013510677,0.00084137154,0.0005203644,0.0004605203,0.0004182234,0.05238201],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996025,0.00006186084,0.000020337535,0.000066389905,0.00021109213,0.00003791599],"domain_scores_gemma":[0.99961424,0.00011700187,0.000039940216,0.00014294073,0.000067716195,0.000018137987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036498773,0.00071227696,0.00042393708,0.00073380955,0.000633209,0.00061783654,0.0016942611,0.00048242533,0.003480575],"category_scores_gemma":[0.0010430019,0.00024003998,0.0006088402,0.0007141907,0.0005033771,0.0020535374,0.0013774289,0.0011625251,0.0014834667],"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.00027559567,0.0002653453,0.00072704366,0.00087163405,0.00016741791,0.00044389785,0.00028506975,0.023932751,0.121179655,0.066437975,0.010109521,0.7753041],"study_design_scores_gemma":[0.00016185675,0.002248092,0.0023087682,0.000356305,0.00046572305,0.005529797,0.00043083786,0.2586287,0.212877,0.06308198,0.45373926,0.00017163895],"about_ca_topic_score_codex":0.0001548924,"about_ca_topic_score_gemma":0.0003341674,"teacher_disagreement_score":0.003480575,"about_ca_system_score_codex":0.00021936675,"about_ca_system_score_gemma":0.0003213664,"threshold_uncertainty_score":0.011643708},"labels":[],"label_agreement":null},{"id":"W2103988755","doi":"10.1504/ijhpcn.2005.008033","title":"Flyover: a technique for achieving high performance in CORBA-based systems with limited heterogeneity","year":2005,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Common Object Request Broker Architecture; Computer science; Middleware (distributed applications); Workload; Distributed computing; Operability; Exploit; Operating system; Software engineering","score_opus":0.014768396179347396,"score_gpt":0.2491589364692765,"score_spread":0.23439054028992912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103988755","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.01822128,0.000085357766,0.967557,0.00023750844,0.000044359953,0.0002052066,0.00004904078,0.010736958,0.0028632132],"genre_scores_gemma":[0.32768685,0.00022881746,0.6624076,0.0003345071,0.000053931206,0.0004927911,0.00027669163,0.001712063,0.006806704],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988223,0.00022005134,0.00007941705,0.00015404928,0.0005487474,0.00017540091],"domain_scores_gemma":[0.9982918,0.00038780537,0.00016432133,0.000818194,0.00024648974,0.000091355025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016841255,0.00056573626,0.00048160358,0.0006020964,0.0010982644,0.0009487166,0.0014612281,0.00085994595,0.003242266],"category_scores_gemma":[0.003019825,0.00051254046,0.00047026397,0.0006644628,0.0010502401,0.0020879006,0.0018737618,0.0017299734,0.0009432511],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","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.0008598728,0.00035398215,0.0029824737,0.00072812114,0.0001935571,0.0015372207,0.0029351122,0.044515178,0.4502139,0.07517752,0.018822284,0.40168077],"study_design_scores_gemma":[0.00049214595,0.0008240956,0.0037572572,0.00015839777,0.00013897591,0.002520416,0.00053045206,0.35675618,0.38133663,0.07584533,0.17734784,0.00029237516],"about_ca_topic_score_codex":0.0020108216,"about_ca_topic_score_gemma":0.001820126,"teacher_disagreement_score":0.003242266,"about_ca_system_score_codex":0.0005202626,"about_ca_system_score_gemma":0.0007737424,"threshold_uncertainty_score":0.010846436},"labels":[],"label_agreement":null},{"id":"W2143374468","doi":"10.1504/ijhpcn.2006.013483","title":"Solving the Dynamic Plant Layout Problem using a new hybrid meta-heuristic algorithm","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":19,"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":"Mathematical optimization; Heuristic; Computer science; Quadratic assignment problem; Meta heuristic; Remainder; Quadratic equation; Algorithm; Optimization problem; Mathematics; Arithmetic","score_opus":0.012545693961710014,"score_gpt":0.22592398662088073,"score_spread":0.21337829265917072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143374468","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.034220003,0.00040660167,0.95399815,0.00021998052,0.00009637965,0.00011050961,0.00015584085,0.0010696356,0.009722875],"genre_scores_gemma":[0.20132084,0.00024098325,0.7926614,0.00015206031,0.000058703525,0.00037756946,0.00044629932,0.00012431211,0.004617855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997085,0.00007599775,0.000014702224,0.00006635111,0.00009287264,0.000041619867],"domain_scores_gemma":[0.9996624,0.0001793199,0.00003500187,0.00004448684,0.00005605105,0.000022794098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004243932,0.0007728603,0.0007489909,0.0009295213,0.0003810835,0.0008930818,0.0014040392,0.0012087207,0.0030868025],"category_scores_gemma":[0.0008271206,0.0005646098,0.001034175,0.0010372037,0.00030006116,0.0009202141,0.0006968434,0.0007892245,0.0005130862],"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.00007717928,0.00014106103,0.00046664928,0.00009631019,0.00009432901,0.00010369712,0.000052151237,0.88804865,0.0041524186,0.006565674,0.0023512112,0.09785058],"study_design_scores_gemma":[0.00003185028,0.00003538078,0.00007151451,0.0000053612507,0.000014483372,0.000033102126,0.0000093476365,0.9960218,0.00051883404,0.0015388151,0.0017131902,0.000006296773],"about_ca_topic_score_codex":0.0036137495,"about_ca_topic_score_gemma":0.005034238,"teacher_disagreement_score":0.0036137495,"about_ca_system_score_codex":0.0006511177,"about_ca_system_score_gemma":0.0009434929,"threshold_uncertainty_score":0.0103263855},"labels":[],"label_agreement":null},{"id":"W2165358822","doi":"10.1504/ijhpcn.2011.038704","title":"Grid resources valuation with fuzzy real option","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":7,"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; Grid; Valuation (finance); Fuzzy logic; Quality of service; Grid computing; Operations research; Mathematical optimization; Finance; Computer network; Economics; Artificial intelligence","score_opus":0.03691834865257854,"score_gpt":0.23003355509579598,"score_spread":0.19311520644321745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165358822","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.07984883,0.00083318376,0.8992694,0.0013490821,0.00014321507,0.000099688514,0.00013402407,0.00010774571,0.018214876],"genre_scores_gemma":[0.9433512,0.0004184468,0.04843239,0.00010145804,0.00007941191,0.00009959079,0.00006883916,0.000020021991,0.007428665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998841,0.0005693816,0.000045614313,0.00016215259,0.0002579155,0.00012399399],"domain_scores_gemma":[0.9981951,0.0012151826,0.0001888869,0.00007374913,0.00017202612,0.00015511503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022989344,0.0011080249,0.0012161059,0.0008894247,0.0006988351,0.0031525944,0.0015852011,0.0025246318,0.0039012493],"category_scores_gemma":[0.004541854,0.0006042298,0.0013503253,0.0012122049,0.0019245993,0.003595377,0.0010276639,0.002067376,0.00023312363],"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.00004528959,0.000042541982,0.00044682302,0.000028990919,0.000027088718,0.00017789977,0.000055375724,0.88202953,0.0003105531,0.11339978,0.00032640365,0.0031097662],"study_design_scores_gemma":[0.000008292175,0.000010712753,0.00004519947,0.0000034698214,0.000004605459,0.000014669601,0.00001264331,0.97797686,0.00005109579,0.021646943,0.00021942699,0.0000060650073],"about_ca_topic_score_codex":0.0077006402,"about_ca_topic_score_gemma":0.00401148,"teacher_disagreement_score":0.0077006402,"about_ca_system_score_codex":0.0027008718,"about_ca_system_score_gemma":0.0013762881,"threshold_uncertainty_score":0.019596219},"labels":[],"label_agreement":null},{"id":"W2293138419","doi":"10.1504/ijhpcn.2016.074656","title":"OCReM: OpenStack-based cloud datacentre resource monitoring and management scheme","year":2016,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Cloud computing; Computer science; Operating system; Virtual machine; Resource (disambiguation); Resource management (computing); Task (project management); Scheme (mathematics); Interface (matter); Open source; Distributed computing; Software; Database; Computer network; Systems engineering; Engineering","score_opus":0.014490261028686566,"score_gpt":0.2480292480325546,"score_spread":0.23353898700386805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293138419","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.27206472,0.0011591859,0.46048528,0.001209132,0.00070917344,0.0018505339,0.0028127804,0.19309868,0.06661056],"genre_scores_gemma":[0.92929435,0.0001647291,0.05566295,0.00045741416,0.00010727451,0.00033431035,0.002449985,0.0017939351,0.00973522],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981615,0.00023356175,0.00017291906,0.00041813543,0.00064537744,0.00036846573],"domain_scores_gemma":[0.99770916,0.00016745809,0.0002522905,0.0010947093,0.00046126486,0.0003151942],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012595989,0.0006467353,0.00058594835,0.001074294,0.00082848326,0.0015242079,0.002825023,0.00071388244,0.005737026],"category_scores_gemma":[0.002430263,0.00030322943,0.00040884834,0.0011149463,0.0006896448,0.0023765652,0.002202959,0.0009614465,0.0014207644],"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.0048667514,0.0015010706,0.015839493,0.0009133539,0.00030795208,0.0014464332,0.0013153099,0.09696905,0.17226085,0.061314993,0.15497112,0.48829356],"study_design_scores_gemma":[0.0003877089,0.00054746814,0.009774111,0.00006350262,0.000083479,0.00094301265,0.00016023008,0.7738695,0.08640416,0.009750646,0.1177922,0.00022392716],"about_ca_topic_score_codex":0.0035712335,"about_ca_topic_score_gemma":0.002172698,"teacher_disagreement_score":0.005737026,"about_ca_system_score_codex":0.0016440847,"about_ca_system_score_gemma":0.0014406767,"threshold_uncertainty_score":0.019192278},"labels":[],"label_agreement":null},{"id":"W230790256","doi":"10.1504/ijhpcn.2006.013476","title":"Performance evaluation of the Sun Fire Link SMP clusters","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Interconnection Networks and 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":"Queen's University","funders":"","keywords":"Computer science; Interconnection; Latency (audio); Link (geometry); Node (physics); Bandwidth (computing); Software; Remote direct memory access; Cluster (spacecraft); Computer network; Computer architecture; Operating system; Engineering; Telecommunications","score_opus":0.017392002779588564,"score_gpt":0.25291831189435254,"score_spread":0.23552630911476397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W230790256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966289,0.00035175087,0.007428639,0.00027624966,0.00009118675,0.00006023777,0.00071991154,0.003314778,0.021468187],"genre_scores_gemma":[0.9872012,0.00018080338,0.007976165,0.000039663522,0.00002756022,0.000036926107,0.0015233698,0.00020446329,0.002809848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99895644,0.00018588763,0.00003014506,0.00017337542,0.00049940764,0.00015476225],"domain_scores_gemma":[0.99861145,0.0003125755,0.00010571868,0.00018564436,0.0005658036,0.00021878257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927769,0.00048514866,0.0005964496,0.0006775974,0.0010299064,0.0007840758,0.0012255914,0.0004472528,0.0038975652],"category_scores_gemma":[0.0024644178,0.00024385168,0.00024493193,0.0015299399,0.00034324845,0.00088198384,0.00076499843,0.0004490448,0.00069883553],"study_design_candidate":"bench_or_experimental","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.0066733095,0.0011915398,0.042572454,0.0007490492,0.00038448177,0.00119289,0.0009230955,0.546233,0.07631073,0.00861614,0.07324036,0.24191293],"study_design_scores_gemma":[0.00033729337,0.0026466094,0.034676146,0.000031232983,0.00009282576,0.00040702577,0.0005007457,0.86851764,0.074720494,0.0014297327,0.016556222,0.00008399251],"about_ca_topic_score_codex":0.0062973215,"about_ca_topic_score_gemma":0.0047803214,"teacher_disagreement_score":0.0062973215,"about_ca_system_score_codex":0.0015286738,"about_ca_system_score_gemma":0.00069930154,"threshold_uncertainty_score":0.013038695},"labels":[],"label_agreement":null},{"id":"W234760897","doi":"10.1504/ijhpcn.2006.013478","title":"Performance evaluation for neutron transport application using message passing","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Nuclear reactor physics and engineering","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Solver; Computer science; Neutron transport; Message passing; Scalar (mathematics); Neutron; Iterative method; Software; Computational science; Parallel computing; Context (archaeology); Mathematical optimization; Distributed computing; Algorithm; Nuclear physics; Physics; Mathematics; Operating system; Geometry","score_opus":0.011055827884392227,"score_gpt":0.23528499911256034,"score_spread":0.22422917122816813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W234760897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79695785,0.00170086,0.17970589,0.0005179952,0.00025123023,0.00022403515,0.00038142386,0.010771512,0.009489209],"genre_scores_gemma":[0.9545909,0.0007076692,0.040421605,0.000032861753,0.00004540331,0.00009383421,0.00061054865,0.0005004363,0.0029967031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978662,0.00074347924,0.00010595236,0.00016455105,0.00082493236,0.00029482087],"domain_scores_gemma":[0.9948407,0.0027922457,0.0002488462,0.0004738001,0.0014701248,0.00017436866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029031273,0.0009203513,0.00080213364,0.0008079007,0.00078073156,0.001172651,0.0012111212,0.00081912265,0.002413371],"category_scores_gemma":[0.008493905,0.00020606712,0.00033765624,0.0016569811,0.0004183811,0.0012789718,0.00048631497,0.00060350256,0.0006369159],"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.005146237,0.00066773704,0.012670274,0.0014770711,0.0003352887,0.00067925017,0.00081677275,0.605333,0.10886861,0.008589251,0.007250074,0.24816647],"study_design_scores_gemma":[0.000055756766,0.00051520934,0.0022375889,0.000021147991,0.00007535779,0.00012325536,0.00013468396,0.91992545,0.07258264,0.00089430896,0.0034031624,0.000031531006],"about_ca_topic_score_codex":0.003745675,"about_ca_topic_score_gemma":0.0015821551,"teacher_disagreement_score":0.003745675,"about_ca_system_score_codex":0.00083240535,"about_ca_system_score_gemma":0.00086771435,"threshold_uncertainty_score":0.015353441},"labels":[],"label_agreement":null},{"id":"W2615460309","doi":"10.1504/ijhpcn.2017.10005140","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":1,"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 Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Computer hardware; Context (archaeology); Operating system; Transfer (computing)","score_opus":0.033200928290987794,"score_gpt":0.31594436080182037,"score_spread":0.28274343251083256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2615460309","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.18044688,0.0016216419,0.79321915,0.0002855794,0.00031377058,0.000251312,0.00010201844,0.0119543765,0.011805287],"genre_scores_gemma":[0.8280453,0.00037518967,0.16403644,0.0002666582,0.000052667096,0.0001024379,0.00013224252,0.00029068423,0.006698351],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99978656,0.000036045378,0.000011647465,0.000046531022,0.00006934298,0.000049790462],"domain_scores_gemma":[0.99979466,0.00003428142,0.000030139581,0.00006485468,0.000044101453,0.000031987547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020795765,0.0003808311,0.00020735494,0.00027116627,0.0002487499,0.0006226224,0.0015800189,0.00026776502,0.002556997],"category_scores_gemma":[0.00050573295,0.00023912989,0.00021752037,0.00018908984,0.0002682656,0.0006636692,0.00049116276,0.00065138744,0.000614113],"study_design_candidate":"bench_or_experimental","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.0015984643,0.00028635064,0.0075149834,0.0006187304,0.0001621689,0.0010727812,0.00045981057,0.053685557,0.41731647,0.02643875,0.015510301,0.4753357],"study_design_scores_gemma":[0.00018156832,0.002371717,0.0052420376,0.00010004488,0.00014915646,0.0023403408,0.000113061986,0.5640927,0.29010436,0.006232228,0.12894708,0.00012574627],"about_ca_topic_score_codex":0.0009040875,"about_ca_topic_score_gemma":0.0011455319,"teacher_disagreement_score":0.002556997,"about_ca_system_score_codex":0.00033201597,"about_ca_system_score_gemma":0.0004615416,"threshold_uncertainty_score":0.008554041},"labels":[],"label_agreement":null},{"id":"W2888279336","doi":"10.1504/ijhpcn.2019.097051","title":"Performance evaluation of OpenMP's target construct on GPUs - exploring compiler optimisations","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Compiler; CUDA; Parallel computing; Fortran; Programming language; Programming paradigm; Implementation; Construct (python library); Set (abstract data type); IBM; Supercomputer","score_opus":0.06125931175195404,"score_gpt":0.3097343786552617,"score_spread":0.24847506690330767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888279336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9535489,0.0013228288,0.017611474,0.00022096834,0.0001849481,0.00008426088,0.0009183806,0.011733929,0.0143742915],"genre_scores_gemma":[0.944616,0.00040526284,0.04740517,0.00009082462,0.000031480635,0.00010372082,0.003009618,0.0021925692,0.0021451227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983108,0.0004327998,0.000117432806,0.00026844922,0.0006018907,0.00026854934],"domain_scores_gemma":[0.99606067,0.0014103882,0.00016579752,0.0007005792,0.0014428076,0.00021977698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014347716,0.0010675326,0.00087859645,0.0009290746,0.00078780745,0.0012843559,0.0024376241,0.0009937698,0.0022465568],"category_scores_gemma":[0.0055752755,0.0004703841,0.00055497134,0.002027643,0.00073769846,0.0012684072,0.000926602,0.00095681107,0.00065721944],"study_design_candidate":"bench_or_experimental","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.007129985,0.0013186008,0.02563903,0.0019589956,0.0005014375,0.0011398394,0.0014089299,0.5663803,0.1252487,0.013216246,0.038184166,0.21787378],"study_design_scores_gemma":[0.00029481467,0.0009309601,0.0074382504,0.00008224419,0.00007850932,0.00015702081,0.00021664014,0.8773196,0.10238379,0.0016513264,0.009387992,0.000058799407],"about_ca_topic_score_codex":0.008981158,"about_ca_topic_score_gemma":0.005539387,"teacher_disagreement_score":0.008981158,"about_ca_system_score_codex":0.0013247258,"about_ca_system_score_gemma":0.0012476299,"threshold_uncertainty_score":0.01785779},"labels":[],"label_agreement":null},{"id":"W2904066832","doi":"10.1504/ijhpcn.2019.10018085","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; CUDA; Cache; Parallel computing; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904066832","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.27520543,0.0008826526,0.576892,0.0007778458,0.00035038666,0.00025187078,0.0012147654,0.09362575,0.050799362],"genre_scores_gemma":[0.596224,0.0002673724,0.38119224,0.00034109084,0.000041661977,0.0003797699,0.0026010172,0.005751741,0.013201202],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99904317,0.00015886307,0.00006973546,0.000117012896,0.00045434912,0.00015679828],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.00089637196,0.00013221789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081445556,0.00074258714,0.0005785884,0.00051879947,0.00071485154,0.0013843225,0.0027000823,0.00075687986,0.004731177],"category_scores_gemma":[0.0037626314,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.0010565604,0.0009401758,0.00120749,0.001974758],"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.0024711639,0.000675662,0.01667373,0.0007426224,0.00026528077,0.002029283,0.001818426,0.276409,0.1253023,0.055971555,0.12733805,0.39030293],"study_design_scores_gemma":[0.00019012112,0.0001827331,0.00320135,0.000061965286,0.000041710573,0.00024389042,0.0001288735,0.87837344,0.052810848,0.007663011,0.057019822,0.000082250604],"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.018474482,"teacher_disagreement_score":0.01284562,"about_ca_system_score_codex":0.0015545749,"about_ca_system_score_gemma":0.0025837547,"threshold_uncertainty_score":0.025541663},"labels":[],"label_agreement":null},{"id":"W321534596","doi":"10.1504/ijhpcn.2006.013481","title":"Adaptive time/space sharing with SCOJO","year":2006,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":8,"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 Windsor","funders":"","keywords":"Computer science; Computer multitasking; Distributed computing; Scheduling (production processes); Job scheduler; Flexibility (engineering); Shared resource; Time-sharing; Fragmentation (computing); Response time; Load sharing; Job shop scheduling; Parallel computing; Mathematical optimization; Operating system","score_opus":0.008127605547879013,"score_gpt":0.21660941623298005,"score_spread":0.20848181068510105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W321534596","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.24382237,0.00035515014,0.7369042,0.00032984593,0.00026461133,0.000259286,0.00016688071,0.0039566285,0.01394102],"genre_scores_gemma":[0.90048116,0.00010614996,0.09627108,0.0001340026,0.000049672737,0.0001113238,0.00011090131,0.0003077588,0.0024279053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994831,0.00009399217,0.000032241664,0.00009341686,0.00016254399,0.00013462488],"domain_scores_gemma":[0.9983292,0.0003923895,0.00016685796,0.0005939898,0.00025823293,0.00025931752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006969237,0.0005102871,0.00051037566,0.00054071797,0.0006262619,0.00093282305,0.0017495655,0.00046305734,0.0021030747],"category_scores_gemma":[0.0018776656,0.00021071383,0.00047599745,0.0008837702,0.0008438452,0.0011179082,0.0014708997,0.0007580406,0.00040017883],"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.0012466403,0.00070466864,0.0044340547,0.00022448796,0.00009188644,0.00030432976,0.00032693968,0.7645756,0.05043724,0.037161473,0.0053788936,0.13511372],"study_design_scores_gemma":[0.000055738226,0.00009126212,0.00026327936,0.0000057569528,0.000021027714,0.00004705331,0.000033122025,0.97808915,0.008367271,0.009757203,0.0032463984,0.000022763674],"about_ca_topic_score_codex":0.001996118,"about_ca_topic_score_gemma":0.0023462633,"teacher_disagreement_score":0.0021030747,"about_ca_system_score_codex":0.0005570246,"about_ca_system_score_gemma":0.001320962,"threshold_uncertainty_score":0.0070354342},"labels":[],"label_agreement":null},{"id":"W4231214464","doi":"10.1504/ijhpcn.2019.097047","title":"Efficient implementation of OpenACC cache directive on NVIDIA GPUs","year":2018,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Parallel Computing and Optimization Techniques","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 Victoria","funders":"","keywords":"Computer science; CUDA; Parallel computing; Cache; Compiler; Smart Cache; Cache algorithms; Operating system; Cache pollution; CPU cache","score_opus":0.01486184162275694,"score_gpt":0.3065057005190688,"score_spread":0.29164385889631184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231214464","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.27520543,0.0008826526,0.576892,0.0007778458,0.00035038666,0.00025187078,0.0012147654,0.09362575,0.050799362],"genre_scores_gemma":[0.596224,0.0002673724,0.38119224,0.00034109084,0.000041661977,0.0003797699,0.0026010172,0.005751741,0.013201202],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99904317,0.00015886307,0.00006973546,0.000117012896,0.00045434912,0.00015679828],"domain_scores_gemma":[0.9978638,0.0004221646,0.0001133564,0.0005721411,0.00089637196,0.00013221789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081445556,0.00074258714,0.0005785884,0.00051879947,0.00071485154,0.0013843225,0.0027000823,0.00075687986,0.004731177],"category_scores_gemma":[0.0037626314,0.0005003442,0.0005132728,0.0009728933,0.0005793397,0.0010565604,0.0009401758,0.00120749,0.001974758],"study_design_candidate":"bench_or_experimental","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.0024711639,0.000675662,0.01667373,0.0007426224,0.00026528077,0.002029283,0.001818426,0.276409,0.1253023,0.055971555,0.12733805,0.39030293],"study_design_scores_gemma":[0.00019012112,0.0001827331,0.00320135,0.000061965286,0.000041710573,0.00024389042,0.0001288735,0.87837344,0.052810848,0.007663011,0.057019822,0.000082250604],"about_ca_topic_score_codex":0.01284562,"about_ca_topic_score_gemma":0.018474482,"teacher_disagreement_score":0.01284562,"about_ca_system_score_codex":0.0015545749,"about_ca_system_score_gemma":0.0025837547,"threshold_uncertainty_score":0.025541663},"labels":[],"label_agreement":null},{"id":"W4253159728","doi":"10.1504/ijhpcn.2017.084246","title":"pvFPGA: paravirtualising an FPGA-based hardware accelerator towards general purpose computing","year":2017,"lang":"en","type":"article","venue":"International Journal of High Performance Computing and Networking","topic":"Embedded Systems Design Techniques","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 Ottawa","funders":"","keywords":"Computer science; Field-programmable gate array; Pipeline (software); Embedded system; Hardware acceleration; FPGA prototype; Direct memory access; Context (archaeology); Computer hardware; Operating system; Transfer (computing)","score_opus":0.03970748224866133,"score_gpt":0.3243428409415965,"score_spread":0.28463535869293516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253159728","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.18740885,0.0016992962,0.785976,0.00028572546,0.00031882973,0.0002610024,0.000101566555,0.012000776,0.011947944],"genre_scores_gemma":[0.834143,0.00038367457,0.15787704,0.00026688978,0.000052586656,0.00010200762,0.00012766944,0.0002831209,0.006763968],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997837,0.000036431855,0.00001209569,0.00004702661,0.000070277034,0.000050522096],"domain_scores_gemma":[0.9997888,0.000035160538,0.000031554453,0.00006655539,0.000045665704,0.000032240823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020785593,0.00038169522,0.00020485975,0.00027635228,0.00024906243,0.00061603467,0.0015621813,0.00027142777,0.0025029345],"category_scores_gemma":[0.00051332073,0.00023766972,0.00021324735,0.00018429874,0.00026501014,0.0006735133,0.0004885037,0.00064301665,0.000600934],"study_design_candidate":"bench_or_experimental","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.0015713769,0.0002761583,0.0074373274,0.000617927,0.00015427638,0.0010950532,0.00046890145,0.04751697,0.43167785,0.02545027,0.014558059,0.4691758],"study_design_scores_gemma":[0.00018228934,0.0025045455,0.0055433554,0.000106899075,0.00015707093,0.0025911431,0.00012052593,0.5271022,0.32088396,0.0060690264,0.13460833,0.00013064241],"about_ca_topic_score_codex":0.0008832975,"about_ca_topic_score_gemma":0.0011275375,"teacher_disagreement_score":0.0025029345,"about_ca_system_score_codex":0.00033045973,"about_ca_system_score_gemma":0.0004573837,"threshold_uncertainty_score":0.008373201},"labels":[],"label_agreement":null}]}