{"meta":{"query_hash":"2a00556b0200","filters":{"venue":"Parallel and Distributed Processing Techniques and Applications"},"cohort_total":12,"direct_labels_cover":0,"predictions_cover":12,"exported":12,"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/2a00556b0200","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+and+Distributed+Processing+Techniques+and+Applications"},"results":[{"id":"W110399080","doi":"","title":"Network Performance in High Performance Linux Clusters.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Interconnection Networks and 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":"Western University","funders":"","keywords":"Myrinet; Gigabit Ethernet; Computer science; Operating system; Supercomputer; Gigabit; Network interface controller; Ethernet; Network performance; Process (computing); Computer network; Local area network; Embedded system; Distributed computing; Message passing; Telecommunications","score_opus":0.011638721391826007,"score_gpt":0.2378320049602438,"score_spread":0.22619328356841778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W110399080","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.9381044,0.003620831,0.030829636,0.0007813816,0.000267188,0.000050803737,0.0005483414,0.0016750323,0.024122357],"genre_scores_gemma":[0.9956285,0.00040527736,0.0024585791,0.000020993004,0.000019843485,0.00001742083,0.00039032838,0.00006710135,0.0009920035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99833184,0.00041220928,0.0000559946,0.00023302421,0.0007830358,0.00018377737],"domain_scores_gemma":[0.9974542,0.0010492074,0.00032765133,0.00029234219,0.0006803281,0.00019613752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017009695,0.00040325912,0.00023982242,0.00071659527,0.0008592027,0.0011109435,0.00064789795,0.0004154132,0.0016377744],"category_scores_gemma":[0.007762887,0.0001489748,0.00015804995,0.0016401886,0.0005505334,0.0018465301,0.00077280257,0.0004288183,0.0005206182],"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.0013097541,0.00039429523,0.1381291,0.00070916215,0.00020144135,0.0012851804,0.0021488694,0.5822344,0.04533723,0.03872182,0.021396745,0.16813214],"study_design_scores_gemma":[0.000090633075,0.0011088031,0.11473822,0.000118776676,0.00012598251,0.0013144264,0.001575712,0.7600614,0.051966228,0.031530205,0.037230086,0.00013952293],"about_ca_topic_score_codex":0.006366957,"about_ca_topic_score_gemma":0.002683561,"teacher_disagreement_score":0.006366957,"about_ca_system_score_codex":0.0013444754,"about_ca_system_score_gemma":0.00071937154,"threshold_uncertainty_score":0.012659788},"labels":[],"label_agreement":null},{"id":"W118959728","doi":"","title":"Parallel Unstructured Grids Package for the solution of CFD problems on parallel computers","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Polygon mesh; Grid; Computational science; Parallel computing; Set (abstract data type); Fortran; Hexahedron; Node (physics); Mesh generation; Computational fluid dynamics; Construct (python library); Unstructured grid; Finite element method; Programming language; Computer graphics (images); Engineering; Geometry","score_opus":0.015014379517050088,"score_gpt":0.2657034489336531,"score_spread":0.250689069416603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W118959728","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.0012846825,0.0023574142,0.8429294,0.0011450468,0.0015235185,0.0007764188,0.021024935,0.06664103,0.062317405],"genre_scores_gemma":[0.014195863,0.0027409666,0.8356581,0.00089477346,0.0006259994,0.0038842882,0.044792663,0.02402252,0.07318494],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989354,0.00024652615,0.00007161339,0.00008964377,0.0005530812,0.00010375521],"domain_scores_gemma":[0.99845886,0.00044655814,0.00009667716,0.0003813376,0.00047006347,0.00014659284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013924238,0.0018758534,0.0021999164,0.0016142074,0.0007163013,0.0018739214,0.0029940398,0.0011793127,0.13957027],"category_scores_gemma":[0.0038262897,0.0010031506,0.0012349738,0.0018896798,0.0006367566,0.002110498,0.002794746,0.004396467,0.08523193],"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.00012601199,0.00011692287,0.00037435984,0.00077487057,0.0001410121,0.00023445438,0.00017015602,0.012139246,0.004434389,0.09294976,0.70271355,0.18582521],"study_design_scores_gemma":[0.00033353388,0.00006238413,0.00059440196,0.00017859101,0.000054784647,0.00033354043,0.000026217564,0.06649722,0.0039929156,0.047612257,0.8802484,0.00006570498],"about_ca_topic_score_codex":0.0020189246,"about_ca_topic_score_gemma":0.0017786463,"teacher_disagreement_score":0.13957027,"about_ca_system_score_codex":0.0006903053,"about_ca_system_score_gemma":0.0020913521,"threshold_uncertainty_score":0.46690905},"labels":[],"label_agreement":null},{"id":"W1517869332","doi":"","title":"Leader Election in Rings with Nonunique Labels.","year":2003,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Asynchronous communication; Leader election; Upper and lower bounds; Ring (chemistry); Computer science; Node (physics); Combinatorics; Time complexity; Binary logarithm; Identifier; Discrete mathematics; Theoretical computer science; Algorithm; Mathematics; Computer network","score_opus":0.009252120761576041,"score_gpt":0.2432098328081127,"score_spread":0.23395771204653665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1517869332","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.08772923,0.0014381357,0.90080357,0.0011769724,0.0002098237,0.0001687303,0.00010424996,0.00052252994,0.007846798],"genre_scores_gemma":[0.60645103,0.0011666188,0.38033623,0.0002107822,0.0002898305,0.00031055213,0.00025066145,0.00008789592,0.010896406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983323,0.00071500463,0.000059919777,0.0003103747,0.0002725066,0.00030993336],"domain_scores_gemma":[0.9947149,0.0035745532,0.00071866007,0.00046124944,0.00027095678,0.00025961245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00242355,0.00048930274,0.00090004056,0.00040935646,0.0015794255,0.0014265234,0.0015799995,0.0012179287,0.0021179595],"category_scores_gemma":[0.005653482,0.00041266458,0.00052576297,0.0006872686,0.0011116883,0.0040385304,0.0016397131,0.0011231697,0.0008535246],"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.001478937,0.00035695583,0.0030792344,0.0008005651,0.00012408699,0.0011203405,0.0010763586,0.4563,0.022888292,0.3597689,0.010627328,0.14237903],"study_design_scores_gemma":[0.00027060538,0.00032839086,0.00049970415,0.000029088766,0.00005426087,0.00037016728,0.00031712084,0.78561115,0.009967062,0.18982425,0.012688161,0.000040060084],"about_ca_topic_score_codex":0.00045211948,"about_ca_topic_score_gemma":0.00061613537,"teacher_disagreement_score":0.00242355,"about_ca_system_score_codex":0.00055109884,"about_ca_system_score_gemma":0.00052182155,"threshold_uncertainty_score":0.012817144},"labels":[],"label_agreement":null},{"id":"W1554697736","doi":"","title":"Management of Mobile Agent Systems: Learning from the Ants","year":2002,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Mobile Agent-Based Network Management","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":"Carleton University","funders":"","keywords":"Mobile agent; Upgrade; Computer science; Server; Distributed computing; Software agent; Multi-agent system; Intelligent agent; Mobile computing; Computer security; Computer network; Artificial intelligence; Operating system","score_opus":0.020335341947469374,"score_gpt":0.24438441612806677,"score_spread":0.22404907418059739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1554697736","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.025893802,0.0044628754,0.9506761,0.005461741,0.00020095122,0.00010019864,0.000016998252,0.00040671346,0.012780647],"genre_scores_gemma":[0.45352796,0.006277609,0.53226876,0.0005636356,0.00044023094,0.0002658464,0.0000473326,0.00013938041,0.0064692176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907035,0.00045785782,0.00004442184,0.00011733132,0.00025048325,0.000059580783],"domain_scores_gemma":[0.9950735,0.0031716465,0.0004781506,0.00047893217,0.0004634607,0.00033429658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018917063,0.0005647654,0.00075365586,0.00068534305,0.00096280675,0.0026355756,0.0021778843,0.0015948708,0.0009883723],"category_scores_gemma":[0.01050624,0.0004705792,0.0004962679,0.00062185526,0.004019673,0.004539873,0.0024338784,0.002892454,0.00034039625],"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.000095419375,0.00016301687,0.0022485477,0.0004246432,0.00010263085,0.00019079534,0.0015323645,0.3292644,0.0017536833,0.4378992,0.005950032,0.22037522],"study_design_scores_gemma":[0.00004776411,0.00006523726,0.0002540637,0.00007141737,0.000022433353,0.00010062132,0.00022117308,0.560158,0.0010288992,0.41893783,0.019065902,0.000026609618],"about_ca_topic_score_codex":0.001481604,"about_ca_topic_score_gemma":0.0021123888,"teacher_disagreement_score":0.0026355756,"about_ca_system_score_codex":0.0008153524,"about_ca_system_score_gemma":0.0012095533,"threshold_uncertainty_score":0.010004401},"labels":[],"label_agreement":null},{"id":"W172647862","doi":"","title":"Managing Distributed MARF's Nodes with SNMP.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Scientific Computing and Data Management","field":"Decision Sciences","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Simple Network Management Protocol; Computer network; Distributed computing; Network management","score_opus":0.06243017987076573,"score_gpt":0.33524536489934187,"score_spread":0.27281518502857616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W172647862","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.15956716,0.0032055806,0.73751044,0.0024118559,0.0013810269,0.00089764065,0.0015672834,0.02809888,0.06536013],"genre_scores_gemma":[0.5391613,0.000810362,0.4294383,0.00028268705,0.00029132163,0.00045889843,0.0023819623,0.0008876292,0.026287554],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987967,0.00028425915,0.00006718878,0.00015607654,0.00045013728,0.00024555245],"domain_scores_gemma":[0.9975005,0.00059685577,0.00013803667,0.00086576963,0.0006448701,0.00025401323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020528194,0.0006751997,0.0006467717,0.00065288617,0.0014041121,0.001880209,0.0035225162,0.0012011868,0.008655913],"category_scores_gemma":[0.0062448387,0.0003903321,0.00039480912,0.0006628462,0.00041842775,0.0030554377,0.0020863197,0.0009241381,0.0029841338],"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.0021459733,0.0005045505,0.010817915,0.0008000919,0.000260966,0.0011823492,0.0008849106,0.14123113,0.028257921,0.08396533,0.14431687,0.585632],"study_design_scores_gemma":[0.00027618106,0.000455649,0.0020316353,0.0001178215,0.00009617321,0.0006534481,0.00033945296,0.75829595,0.026050156,0.040931463,0.17064314,0.000108938504],"about_ca_topic_score_codex":0.004489043,"about_ca_topic_score_gemma":0.0059175193,"teacher_disagreement_score":0.008655913,"about_ca_system_score_codex":0.000817352,"about_ca_system_score_gemma":0.001640365,"threshold_uncertainty_score":0.02895689},"labels":[],"label_agreement":null},{"id":"W17338413","doi":"","title":"Distributed Models of Thread Level Speculation.","year":2005,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":12,"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; Western University","funders":"","keywords":"Speculation; Computer science; Speculative multithreading; Thread (computing); Parallel computing; Exploit; Multithreading; Distributed computing; Task parallelism; Operating system; Parallelism (grammar); Computer security","score_opus":0.03433359730238873,"score_gpt":0.283452634085353,"score_spread":0.24911903678296426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W17338413","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.13859804,0.0011157497,0.8411887,0.001379077,0.00031452172,0.00013216826,0.00012034632,0.001431503,0.015719857],"genre_scores_gemma":[0.936344,0.0002442183,0.05843344,0.00012128982,0.00009826462,0.0001478552,0.00006544312,0.000074446936,0.004471115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860257,0.00058773457,0.000059964816,0.0001971454,0.00040598473,0.00014667842],"domain_scores_gemma":[0.9943575,0.0029446217,0.00045586776,0.001408143,0.00061114464,0.00022268033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020797944,0.00046780516,0.0005490245,0.00033191562,0.0008284982,0.0018542673,0.0016166175,0.0011909816,0.0037715305],"category_scores_gemma":[0.0062508513,0.00043318752,0.0004924996,0.00046642573,0.001679135,0.0027442663,0.0013557064,0.0017343698,0.00045832078],"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.0005367832,0.00020663618,0.003758756,0.00012062215,0.00007922417,0.0005724235,0.0004491911,0.6702146,0.009760295,0.28247428,0.0033121656,0.02851504],"study_design_scores_gemma":[0.000043810738,0.00005156921,0.000112044945,0.0000063686794,0.000014751695,0.000051391195,0.000019824995,0.951659,0.0014079906,0.044413853,0.0022123333,0.0000070729334],"about_ca_topic_score_codex":0.0022899474,"about_ca_topic_score_gemma":0.0018749001,"teacher_disagreement_score":0.0037715305,"about_ca_system_score_codex":0.0014941016,"about_ca_system_score_gemma":0.0014598825,"threshold_uncertainty_score":0.012617052},"labels":[],"label_agreement":null},{"id":"W194313425","doi":"","title":"Distributed Model for Collaborative Computing.","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi; Université du Québec","funders":"","keywords":"Computer science; Distributed computing; Architecture; Mobile computing; Mobile device; Autonomic computing; Utility computing; Computer network; Cloud computing; Operating system","score_opus":0.018027021602120035,"score_gpt":0.28322158380977014,"score_spread":0.2651945622076501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W194313425","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.0017833522,0.0057244855,0.87141603,0.0057505555,0.0018507638,0.0005421309,0.00045172518,0.0007932391,0.11168776],"genre_scores_gemma":[0.24271002,0.010198229,0.6148845,0.004204411,0.0028423984,0.0037965039,0.001810267,0.00045579774,0.119097896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99513596,0.0014628936,0.00044458878,0.0010935616,0.0014971867,0.00036571888],"domain_scores_gemma":[0.99798644,0.0005465591,0.00017628823,0.000655472,0.00038362015,0.00025156097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027134793,0.0013869413,0.001267641,0.0014622756,0.0024237058,0.005968524,0.0039329594,0.0044189487,0.01144913],"category_scores_gemma":[0.0042490475,0.00056876807,0.0017901635,0.0021398815,0.0037871574,0.006695534,0.0045697326,0.0042250827,0.005383858],"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.000011713228,0.000017320408,0.000064205626,0.000085274856,0.000019367142,0.0001414784,0.00014478156,0.0042884373,0.0002869495,0.98110723,0.00558881,0.008244454],"study_design_scores_gemma":[0.000060960614,0.00003579536,0.0000843674,0.00009745613,0.00003907634,0.0004310847,0.00008678582,0.047912717,0.00042686035,0.74565333,0.20513827,0.000033288634],"about_ca_topic_score_codex":0.004112637,"about_ca_topic_score_gemma":0.003353968,"teacher_disagreement_score":0.01144913,"about_ca_system_score_codex":0.0037443726,"about_ca_system_score_gemma":0.0033036312,"threshold_uncertainty_score":0.03830117},"labels":[],"label_agreement":null},{"id":"W203320341","doi":"","title":"Design and Implementation of Demand Migration Systems in GIPSY.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science","score_opus":0.022530965238812786,"score_gpt":0.28360645260097994,"score_spread":0.2610754873621672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203320341","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.14205517,0.0005556028,0.8038209,0.0007446062,0.00024328071,0.0010737948,0.0005836571,0.01568677,0.035236258],"genre_scores_gemma":[0.5883893,0.00033712722,0.39129347,0.00036863177,0.00004369065,0.0006880164,0.0013437257,0.0009688495,0.016567107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996209,0.00011421384,0.000023601591,0.000058353642,0.000109951776,0.000072875235],"domain_scores_gemma":[0.9995999,0.00008188864,0.000032178337,0.0001208259,0.00012539056,0.000039939718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064837915,0.0003662015,0.00025450825,0.00027517206,0.00038096527,0.0010835062,0.0017572657,0.0006028558,0.00509702],"category_scores_gemma":[0.0013517296,0.0003096584,0.00029159017,0.00022451418,0.0003098427,0.00067385647,0.00072437176,0.0006471672,0.0016427226],"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.002158516,0.0008908007,0.011927764,0.0014679503,0.00031661722,0.0013084317,0.0015775122,0.21326931,0.27906477,0.0789253,0.0479025,0.36119056],"study_design_scores_gemma":[0.0005760317,0.001104355,0.0044971826,0.0001193526,0.00020871143,0.00049778534,0.00035682193,0.6872355,0.16912203,0.016019301,0.120193906,0.00006896041],"about_ca_topic_score_codex":0.0022682145,"about_ca_topic_score_gemma":0.003669689,"teacher_disagreement_score":0.00509702,"about_ca_system_score_codex":0.000615747,"about_ca_system_score_gemma":0.001151557,"threshold_uncertainty_score":0.01705128},"labels":[],"label_agreement":null},{"id":"W52060701","doi":"","title":"Characterizing the Sort Operation on Multithreaded Architectures.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","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 Calgary; University of British Columbia","funders":"","keywords":"Multithreading; Computer science; sort; Parallel computing; Simultaneous multithreading; Parallelism (grammar); Computer architecture; Thread (computing); Operating system","score_opus":0.022304633844523372,"score_gpt":0.26700604677388384,"score_spread":0.24470141292936048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W52060701","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.31102195,0.0032696298,0.66042775,0.0004341444,0.00031158826,0.00022164243,0.0006848939,0.002867473,0.020760894],"genre_scores_gemma":[0.82954925,0.0017568239,0.1585234,0.00017933304,0.000105801955,0.00020768426,0.0011520175,0.0005605604,0.007964981],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924916,0.00008535528,0.000043124597,0.0001122097,0.00037496877,0.00013509615],"domain_scores_gemma":[0.9984627,0.0005703325,0.0002300669,0.00031312116,0.0003663771,0.00005745598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064566865,0.0005166144,0.00035976787,0.00074314105,0.00053645583,0.0014688161,0.00076889974,0.00044876325,0.0031416574],"category_scores_gemma":[0.0032236162,0.00026129818,0.00035615178,0.0013683275,0.0007498661,0.003255586,0.0005003409,0.0006952527,0.0008122757],"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.0011945813,0.00025550142,0.02036699,0.0011438129,0.00020056944,0.00049834856,0.0007502249,0.18394104,0.21414632,0.25966087,0.013903681,0.3039381],"study_design_scores_gemma":[0.00008544856,0.00041883116,0.007242746,0.000068330424,0.00012016061,0.000889796,0.00033144077,0.59856105,0.19607908,0.13646786,0.059654817,0.00008035613],"about_ca_topic_score_codex":0.0012992071,"about_ca_topic_score_gemma":0.0014806738,"teacher_disagreement_score":0.0031416574,"about_ca_system_score_codex":0.0006068092,"about_ca_system_score_gemma":0.0008406234,"threshold_uncertainty_score":0.010509908},"labels":[],"label_agreement":null},{"id":"W56413504","doi":"","title":"Dynamic Aspect-Oriented Load Balancing in Java RMI.","year":2008,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Advanced Software Engineering Methodologies","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 Waterloo","funders":"","keywords":"Computer science; Java; Load balancing (electrical power); Distributed computing; Remote procedure call; Server; Operating system; Overhead (engineering); Distributed object; Process (computing); Round-robin DNS; Common Object Request Broker Architecture; The Internet; Grid","score_opus":0.017591507990102055,"score_gpt":0.2850240331736653,"score_spread":0.26743252518356325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W56413504","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.063748084,0.0014259599,0.86400145,0.0005748547,0.00026714496,0.00059150177,0.0002846549,0.033289608,0.035816777],"genre_scores_gemma":[0.32382512,0.0008646242,0.6573661,0.00046343025,0.000118742326,0.0005724461,0.00089259155,0.0039432333,0.011953716],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847466,0.00035339355,0.000085379936,0.00014732564,0.0007785206,0.00016075902],"domain_scores_gemma":[0.9981142,0.00069028133,0.0003086352,0.0005442291,0.00024723026,0.00009541616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020164445,0.0006597281,0.00052306376,0.00042614512,0.0006073163,0.0014707526,0.0017382693,0.000855654,0.001955143],"category_scores_gemma":[0.0042218617,0.00055081764,0.0005248924,0.00071674684,0.00075834553,0.0020721466,0.0010972975,0.0018724415,0.0013972524],"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.0017719289,0.001417312,0.0076043457,0.0010816482,0.00024959943,0.0015331176,0.0016728388,0.1257585,0.18130207,0.1275125,0.037053015,0.5130431],"study_design_scores_gemma":[0.00045352674,0.00038554458,0.004406031,0.000101535676,0.00018868754,0.0013916651,0.00012384243,0.6648619,0.102546535,0.028084721,0.1972892,0.00016672768],"about_ca_topic_score_codex":0.002155452,"about_ca_topic_score_gemma":0.0020411701,"teacher_disagreement_score":0.002155452,"about_ca_system_score_codex":0.00057947636,"about_ca_system_score_gemma":0.0008956651,"threshold_uncertainty_score":0.010664105},"labels":[],"label_agreement":null},{"id":"W61637013","doi":"","title":"Linear Algorithm for Broadcasting in Networks With No Intersecting Cycles.","year":2009,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Algorithm; Computer network","score_opus":0.008955295327775486,"score_gpt":0.252350391834217,"score_spread":0.2433950965064415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W61637013","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.024216175,0.0010652414,0.9487448,0.001173842,0.00014068765,0.00022955121,0.0005281312,0.002646351,0.021255188],"genre_scores_gemma":[0.3237367,0.0008169927,0.6447072,0.0006279196,0.0001836729,0.0008501709,0.0014801983,0.00038684567,0.027210297],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922824,0.0002496609,0.000036302674,0.00013430345,0.0001731879,0.00017826965],"domain_scores_gemma":[0.99830306,0.0010406524,0.00009903205,0.00023099432,0.00024378813,0.0000824699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007376876,0.0006132331,0.00072825234,0.00087871077,0.0009479175,0.0013613384,0.0018082253,0.00097254023,0.012265259],"category_scores_gemma":[0.0052392567,0.00037132687,0.00037184192,0.0013651476,0.0009248362,0.0025395756,0.0019123635,0.0013736384,0.0032952386],"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.0014309611,0.0004809754,0.0010121344,0.00069217116,0.00014631917,0.000121757075,0.00059307617,0.2681045,0.0057713585,0.18041962,0.05322827,0.48799893],"study_design_scores_gemma":[0.00049054757,0.00021565579,0.0002439288,0.00005145594,0.00004939954,0.00009575857,0.0001669739,0.8492265,0.0032585606,0.13615964,0.010010884,0.000030746905],"about_ca_topic_score_codex":0.008624855,"about_ca_topic_score_gemma":0.013132718,"teacher_disagreement_score":0.012265259,"about_ca_system_score_codex":0.0017615579,"about_ca_system_score_gemma":0.002777423,"threshold_uncertainty_score":0.04103142},"labels":[],"label_agreement":null},{"id":"W75423781","doi":"","title":"Broadcasting in Hierarchical Tree Cluster Network.","year":2010,"lang":"en","type":"article","venue":"Parallel and Distributed Processing Techniques and Applications","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Cluster (spacecraft); Tree (set theory); Computer network; Mathematics","score_opus":0.011236856114837518,"score_gpt":0.26429368911717793,"score_spread":0.2530568330023404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W75423781","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.21169838,0.0047791223,0.72198844,0.0016335129,0.0004882802,0.00028269086,0.0009709936,0.0034439901,0.054714605],"genre_scores_gemma":[0.8757274,0.001593151,0.10343602,0.00015716408,0.00013798187,0.00015420098,0.00074300007,0.00015065062,0.017900424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996244,0.0001209866,0.000014199416,0.000057641668,0.00011334693,0.00006942867],"domain_scores_gemma":[0.99926716,0.0002488975,0.00006125897,0.00010372921,0.0002306921,0.00008819576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040807851,0.00016702297,0.00039509413,0.00051848305,0.0009620907,0.0006750379,0.000838867,0.00041098625,0.002605058],"category_scores_gemma":[0.0015785408,0.00018388448,0.00015585478,0.00082345825,0.00033403363,0.0010243264,0.000570948,0.0003613616,0.0007781208],"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.0013672479,0.00022994568,0.005628174,0.0008717497,0.00013805606,0.0009102624,0.0013234519,0.2900151,0.056462184,0.2258053,0.07464073,0.34260786],"study_design_scores_gemma":[0.00010592065,0.00019281132,0.0020933393,0.000043768334,0.00009617815,0.00034786493,0.0004302625,0.89446455,0.012121092,0.058235686,0.031831764,0.000036697893],"about_ca_topic_score_codex":0.008050746,"about_ca_topic_score_gemma":0.008330104,"teacher_disagreement_score":0.008050746,"about_ca_system_score_codex":0.001072366,"about_ca_system_score_gemma":0.00086729525,"threshold_uncertainty_score":0.016007781},"labels":[],"label_agreement":null}]}