{"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030967228,0.0013287684,0.9642467,0.0013508137,0.000019989002,0.0003580334,0.00000482644,0.0003234554,0.0014002213],"genre_scores_gemma":[0.96278393,0.00065664155,0.035593394,0.00018772781,0.00024814656,0.00040985722,0.00002079199,0.0000061117325,0.00009337097],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990844,0.000017054941,0.00026652656,0.00030683167,0.00008114416,0.00024401692],"domain_scores_gemma":[0.9995762,0.0000198266,0.000091695234,0.00019462281,0.000054632877,0.00006298273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002190672,0.00012828682,0.00015133207,0.000049492493,0.00032754886,0.00017905723,0.00022566055,0.00008536939,0.0000015820744],"category_scores_gemma":[0.0000015020754,0.00011394821,0.000013326205,0.00035386937,0.000052497635,0.00043066245,0.00011541341,0.0001478591,0.0000029468654],"study_design_candidate":"design_other","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.000018746287,0.00008292767,0.008968472,0.00015896249,0.0000051686748,0.0000010997346,0.00018877127,0.0072910483,0.000012202436,0.02941077,0.0011803693,0.9526815],"study_design_scores_gemma":[0.00037418865,0.00009150223,0.007977078,0.00022683166,0.0000064997357,0.0001015634,0.000026722564,0.80618554,0.00011665859,0.00278598,0.18174575,0.00036166236],"about_ca_topic_score_codex":0.000012524887,"about_ca_topic_score_gemma":0.000007710743,"teacher_disagreement_score":0.9523198,"about_ca_system_score_codex":0.000027453516,"about_ca_system_score_gemma":0.000022358106,"threshold_uncertainty_score":0.46466735},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028063104,0.00054835196,0.99470025,0.002234271,0.00003810459,0.0012376669,0.00006517937,0.000671282,0.0002242613],"genre_scores_gemma":[0.44332227,0.00036706272,0.5550108,0.00014480701,0.000089455636,0.0009168879,0.000105881874,0.000014826495,0.000028031369],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853796,0.00003189586,0.00041961388,0.0005236853,0.00018093536,0.00030589628],"domain_scores_gemma":[0.9985965,0.00020797046,0.00032422863,0.0005427604,0.00021809366,0.00011043636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035881915,0.00026022192,0.00027330747,0.00009582068,0.00075221853,0.00024874049,0.00068104913,0.00017616106,0.0000011252207],"category_scores_gemma":[0.000025720441,0.00019207556,0.00007484357,0.0003673617,0.00030369367,0.00020963232,0.0001969811,0.00028408522,4.983243e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009697615,0.00038248897,0.0004800578,0.00044627843,0.00006896771,0.0000012035832,0.00048636278,0.0056611034,0.003036664,0.46696636,0.0069698,0.51540375],"study_design_scores_gemma":[0.0015954671,0.0004962725,0.0019056031,0.00022744699,0.00009149768,0.00011657703,0.000057948808,0.71144915,0.00428192,0.17358884,0.10515674,0.0010325155],"about_ca_topic_score_codex":0.000023625707,"about_ca_topic_score_gemma":0.000005316549,"teacher_disagreement_score":0.7057881,"about_ca_system_score_codex":0.0000132255345,"about_ca_system_score_gemma":0.0000608613,"threshold_uncertainty_score":0.7832614},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024221225,0.0010480414,0.9932577,0.00046959706,0.0000037618597,0.00036387626,0.0000139533595,0.00026760547,0.002153343],"genre_scores_gemma":[0.9410978,0.00019182813,0.05780415,0.00007560683,0.00001553603,0.00069866225,0.000028378185,0.000007921276,0.0000801446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991149,0.00002518964,0.00019081435,0.0003654321,0.00009054884,0.00021315731],"domain_scores_gemma":[0.99955535,0.00001609767,0.00008518361,0.00018972153,0.00007773502,0.00007588439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016411259,0.00013918756,0.00015349878,0.000060942002,0.00021776506,0.00020084676,0.0001470128,0.00008008637,9.4942527e-7],"category_scores_gemma":[0.0000051167017,0.00011576745,0.000011840064,0.0005645222,0.00007087612,0.0003111789,0.000031560507,0.00013883894,8.6556895e-7],"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.000030080504,0.00043081303,0.013298321,0.00037526697,0.000018767934,0.000019026467,0.00047745282,0.00010343645,0.0011704349,0.7037564,0.0007405314,0.27957946],"study_design_scores_gemma":[0.0022425042,0.00036462178,0.009304209,0.000661566,0.000035046225,0.0009931707,0.00041396075,0.022220057,0.009437228,0.07212755,0.8805265,0.0016736288],"about_ca_topic_score_codex":0.000043858596,"about_ca_topic_score_gemma":0.00001647549,"teacher_disagreement_score":0.93867564,"about_ca_system_score_codex":0.00002264101,"about_ca_system_score_gemma":0.00004689355,"threshold_uncertainty_score":0.47208595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001089172,0.010258132,0.9863374,0.00024338247,0.000008562372,0.0007864098,0.00001747671,0.00024180964,0.0010176295],"genre_scores_gemma":[0.9642698,0.004488218,0.02905584,0.000042511158,0.00003900094,0.0019113483,0.000046463098,0.0000074350614,0.0001393846],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991292,0.00003446958,0.00023200452,0.00031083426,0.00013875942,0.00015476947],"domain_scores_gemma":[0.99939144,0.00004138397,0.0001543051,0.00032159907,0.000039500286,0.000051773965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487794,0.00011522147,0.00012831912,0.000023528733,0.00031595942,0.00017489109,0.00036074672,0.000034535227,0.0000050859994],"category_scores_gemma":[0.0000011245911,0.0000862569,0.00002126032,0.00028086404,0.00007041864,0.000111513546,0.00028144504,0.000084915264,0.0000025133195],"study_design_candidate":"design_other","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.0000036667016,0.00013701871,0.00075381267,0.00024748198,0.000049620176,0.0000080698765,0.00022541464,0.0021712058,0.000024132938,0.043468527,0.0026425323,0.9502685],"study_design_scores_gemma":[0.00046898046,0.00011759138,0.001340474,0.0004396702,0.00010390952,0.000015077596,0.000712632,0.40105566,0.00017405153,0.006446964,0.58868563,0.0004393567],"about_ca_topic_score_codex":0.000037541147,"about_ca_topic_score_gemma":4.966372e-7,"teacher_disagreement_score":0.9631806,"about_ca_system_score_codex":0.000017895987,"about_ca_system_score_gemma":0.000004216931,"threshold_uncertainty_score":0.35174543},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008435456,0.00072719343,0.9855947,0.0017998208,0.0000103016055,0.00036226353,0.00024886744,0.0003801901,0.0024412035],"genre_scores_gemma":[0.96317565,0.00029692997,0.03524776,0.000100161844,0.00006070759,0.00023656612,0.0004055286,0.000010945483,0.00046576993],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99811745,0.000033351535,0.00037354554,0.00075113005,0.00045687222,0.00026766275],"domain_scores_gemma":[0.9987723,0.00013550736,0.0001896905,0.0005515739,0.0002000905,0.00015082145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068583037,0.0001783078,0.00022006688,0.0001355628,0.0011244516,0.00052657595,0.00041763956,0.00005125414,0.000014574815],"category_scores_gemma":[0.00005627288,0.0001254253,0.000028602823,0.00095112453,0.00038246292,0.00027699693,0.0003077066,0.00011398473,0.00000888986],"study_design_candidate":"design_other","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.00012380857,0.00028583774,0.020377021,0.00009847655,0.00003226613,0.0000496915,0.0002998967,0.00036663536,0.00007043568,0.016348729,0.03342147,0.92852575],"study_design_scores_gemma":[0.00071227056,0.00012131076,0.017195588,0.00012332143,0.00006322193,0.0004840855,0.0009880501,0.027796319,0.00023006137,0.08712397,0.8644238,0.00073796435],"about_ca_topic_score_codex":0.000034178203,"about_ca_topic_score_gemma":0.000004529997,"teacher_disagreement_score":0.95474017,"about_ca_system_score_codex":0.000016250795,"about_ca_system_score_gemma":0.00003639749,"threshold_uncertainty_score":0.8648487},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003123923,0.0014817546,0.99511147,0.0009390841,0.0000032550756,0.00032262647,0.00011618369,0.0007256673,0.0009875874],"genre_scores_gemma":[0.50233436,0.00039413932,0.4968941,0.000045611567,0.000035446134,0.00013177325,0.00012889133,0.0000066391453,0.000029035498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988987,0.00002192661,0.00035974113,0.0003776197,0.00014603206,0.00019598292],"domain_scores_gemma":[0.9991476,0.000036876274,0.00020796624,0.00031519632,0.00019316058,0.00009917961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017128777,0.00017137865,0.00021299478,0.00008701266,0.00028356627,0.00013738837,0.00033851905,0.000101682075,0.000001598095],"category_scores_gemma":[0.000007909859,0.00015992463,0.00003611729,0.0004151928,0.00012659503,0.000456253,0.00019531295,0.00010665986,7.6707414e-7],"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.000013438913,0.00024728655,0.00050264917,0.000121740995,0.000017256103,0.0000010490529,0.00019051057,0.0128987115,0.00019487405,0.5882388,0.0013131641,0.39626053],"study_design_scores_gemma":[0.00036569085,0.00005836946,0.00065410073,0.000096022275,0.000023653203,0.000057039495,0.000021713864,0.7689244,0.003159457,0.19492897,0.03126926,0.0004413205],"about_ca_topic_score_codex":0.000016179027,"about_ca_topic_score_gemma":0.0000015279348,"teacher_disagreement_score":0.7560257,"about_ca_system_score_codex":0.000021268832,"about_ca_system_score_gemma":0.000045024513,"threshold_uncertainty_score":0.65215373},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001025585,0.0005059271,0.9944617,0.0010290464,0.000029577546,0.00095776055,0.00077137037,0.00083689706,0.00038213434],"genre_scores_gemma":[0.7440716,0.000044497676,0.25455865,0.00007656152,0.00011137467,0.00051226944,0.0005681862,0.000012975888,0.000043867727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845535,0.00002225875,0.00037543228,0.00063105003,0.00014261271,0.00037332854],"domain_scores_gemma":[0.9987003,0.0001130443,0.00022824977,0.00038998175,0.00036246484,0.00020594534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032012188,0.00026592636,0.00029507047,0.00006665204,0.0008251011,0.0005500494,0.00051454525,0.0001766291,6.3291765e-7],"category_scores_gemma":[0.000026225556,0.00024487622,0.000049345144,0.0005167668,0.00017611965,0.00026966017,0.00023062776,0.00024237386,0.0000011805994],"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.000046314664,0.00036440406,0.0007505263,0.00042514983,0.000048388443,0.000003539212,0.00071158295,0.0025248402,0.001406966,0.7206442,0.007407354,0.26566678],"study_design_scores_gemma":[0.00042763154,0.00005106659,0.00014573119,0.000039694303,0.000019775784,0.000054008924,0.000046018806,0.85476744,0.00017719873,0.037292458,0.10659473,0.00038422554],"about_ca_topic_score_codex":0.000008291211,"about_ca_topic_score_gemma":0.0000048047214,"teacher_disagreement_score":0.85224265,"about_ca_system_score_codex":0.000014959763,"about_ca_system_score_gemma":0.00012690456,"threshold_uncertainty_score":0.9985762},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024213824,0.0037399388,0.9710567,0.00019288114,0.000006492328,0.0005971238,0.000019929374,0.00012969303,0.000043423268],"genre_scores_gemma":[0.9586077,0.00084083684,0.040149815,0.000010226062,0.000019535077,0.00030145916,0.000058893544,0.0000045813304,0.0000069862363],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990624,0.00005502582,0.00033629572,0.00029335922,0.000102303085,0.00015060554],"domain_scores_gemma":[0.99948776,0.000051797677,0.00017467346,0.00014575316,0.00007808181,0.000061929444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027286384,0.00012219544,0.0001889118,0.00008472083,0.00021829782,0.00010240246,0.00013809177,0.000066465735,2.823532e-7],"category_scores_gemma":[0.0000031467057,0.00011332548,0.000011981013,0.00031611975,0.00008302655,0.00023252929,0.00007046337,0.000065339635,2.1335465e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001276148,0.0008577643,0.15208523,0.0032662882,0.00010850387,0.000050076986,0.010229039,0.008657579,0.0069590556,0.22796261,0.0039971466,0.5856991],"study_design_scores_gemma":[0.0035520038,0.00070907833,0.07051664,0.000860605,0.000080630816,0.0016936089,0.0015408485,0.8373769,0.004619038,0.025231324,0.052031863,0.0017874755],"about_ca_topic_score_codex":0.00020189614,"about_ca_topic_score_gemma":0.000005900327,"teacher_disagreement_score":0.9343938,"about_ca_system_score_codex":0.000012812567,"about_ca_system_score_gemma":0.00004661162,"threshold_uncertainty_score":0.4621279},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026674373,0.00043943743,0.992436,0.0023972394,0.000006166624,0.00042187882,0.0000123335785,0.0008634544,0.00075606065],"genre_scores_gemma":[0.85608214,0.00051368517,0.14215994,0.00055590324,0.000076069686,0.00048653924,0.00006069325,0.000009324782,0.00005569404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912053,0.00003323485,0.00019864751,0.00035055625,0.00012300868,0.00017399614],"domain_scores_gemma":[0.9994275,0.000047550715,0.00010223459,0.00029045215,0.00006400741,0.00006824786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014463784,0.0001530419,0.00012859555,0.000059188602,0.0010750307,0.0001920364,0.00031913232,0.00006830213,9.82302e-7],"category_scores_gemma":[0.000009392123,0.000107893844,0.000024757215,0.00022532087,0.00015005912,0.00012247,0.00012832653,0.00016949444,0.0000016762747],"study_design_candidate":"design_other","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.000054297983,0.0004337242,0.0016354867,0.00012859683,0.000034738678,0.000015921014,0.0022308815,0.0021864206,0.0024318602,0.13407412,0.0028100773,0.85396385],"study_design_scores_gemma":[0.0013366555,0.00048171714,0.013067449,0.00031120694,0.000048070335,0.001333646,0.0001206529,0.6105688,0.027783586,0.051121235,0.2919558,0.001871144],"about_ca_topic_score_codex":0.000012491218,"about_ca_topic_score_gemma":6.450863e-7,"teacher_disagreement_score":0.8534147,"about_ca_system_score_codex":0.000012538453,"about_ca_system_score_gemma":0.000034754066,"threshold_uncertainty_score":0.82683754},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024233975,0.002655664,0.99344426,0.00023634151,0.000007874167,0.0002220178,0.00000998402,0.00084859075,0.00015187661],"genre_scores_gemma":[0.3320298,0.0008268494,0.66680425,0.000023957044,0.000010584064,0.00025885826,0.00001707174,0.000006566332,0.00002206518],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991346,0.00001955799,0.00019005773,0.00034859582,0.000100191304,0.0002069779],"domain_scores_gemma":[0.99949867,0.00008833629,0.00006609316,0.00022162535,0.00006328644,0.000061973005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016445082,0.00013309045,0.00016085008,0.00006540413,0.00022395905,0.000043514272,0.00020517349,0.000068661735,4.0710412e-7],"category_scores_gemma":[0.000053583466,0.00012701948,0.000015313808,0.00044812437,0.00010081041,0.0002507265,0.00014548768,0.00014723372,7.158131e-7],"study_design_candidate":"design_other","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.000032912285,0.00030773395,0.008172218,0.0003475347,0.00001981837,0.00009093802,0.0014966183,0.005160642,0.0028826497,0.07194182,0.00034011522,0.909207],"study_design_scores_gemma":[0.0026398052,0.00035848512,0.057327848,0.0006897829,0.000036414873,0.002136484,0.0004531221,0.33116966,0.005792431,0.44696236,0.1492128,0.0032207954],"about_ca_topic_score_codex":0.000014299065,"about_ca_topic_score_gemma":0.0000030429528,"teacher_disagreement_score":0.9059862,"about_ca_system_score_codex":0.00005678304,"about_ca_system_score_gemma":0.00005314387,"threshold_uncertainty_score":0.5179704},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008359294,0.0012900056,0.99604297,0.000078847144,0.000003097758,0.00040581217,0.000014811202,0.0009935998,0.00033494114],"genre_scores_gemma":[0.31461284,0.00037156162,0.68446153,0.000020024294,0.0000693225,0.0003933713,0.0000523434,0.000013952791,0.0000050719977],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937975,0.0000024124295,0.00016667746,0.00019430809,0.000034161363,0.0002227108],"domain_scores_gemma":[0.9997541,0.00004082002,0.000034655517,0.000086464475,0.00004272124,0.000041241063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000056793044,0.00013416332,0.00014558357,0.000041500964,0.0001253997,0.000044336663,0.00007133401,0.00009514879,3.5782932e-7],"category_scores_gemma":[0.000008368316,0.000118399425,0.000011816618,0.00022623425,0.000066308115,0.00010149204,0.00002198842,0.000175034,1.4336771e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008205206,0.000017586359,0.00010551461,0.000040709754,0.0000030527824,0.0000011201973,0.00001174648,0.012220382,0.000043127176,0.0005618177,0.00003654891,0.98695016],"study_design_scores_gemma":[0.0002370601,0.00007941712,0.00013756815,0.00015896671,0.000009965774,0.00002141784,0.00007994301,0.98950666,0.000121972414,0.0044851224,0.0049432237,0.00021870696],"about_ca_topic_score_codex":0.0000015174451,"about_ca_topic_score_gemma":0.0000015586618,"teacher_disagreement_score":0.98673147,"about_ca_system_score_codex":0.000020809755,"about_ca_system_score_gemma":0.000004355083,"threshold_uncertainty_score":0.48281884},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068602017,0.00034491598,0.98519325,0.005221012,0.000012005658,0.0004013275,0.0000086326,0.00089034636,0.0010682801],"genre_scores_gemma":[0.56757045,0.000051408086,0.43151644,0.00018415468,0.00008692225,0.0005402233,0.000017791466,0.000007073547,0.00002556566],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988755,0.000014684288,0.00023163343,0.00044128185,0.00010167629,0.00033522496],"domain_scores_gemma":[0.99937564,0.000068629735,0.00006633264,0.0003282539,0.000048771813,0.000112382535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025120887,0.00014927721,0.00016294396,0.00009141461,0.00026201596,0.0002467787,0.00048301052,0.00014371648,7.5243554e-7],"category_scores_gemma":[0.00002767584,0.0001360637,0.000017116714,0.00068400084,0.00013046413,0.00019998985,0.00049525464,0.00038781267,0.0000015544152],"study_design_candidate":"design_other","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.000006346316,0.000045814108,0.0027177737,0.000023226512,0.0000021352485,0.0000032668884,0.0000571429,0.00008289614,0.00031790507,0.052286558,0.0012256437,0.9432313],"study_design_scores_gemma":[0.00073459005,0.00014194769,0.015944814,0.0002039323,0.000017415354,0.00030649581,0.00005072795,0.18266909,0.0007476742,0.40143055,0.39670846,0.0010443161],"about_ca_topic_score_codex":0.0000148053105,"about_ca_topic_score_gemma":0.000051941624,"teacher_disagreement_score":0.94218695,"about_ca_system_score_codex":0.000011171286,"about_ca_system_score_gemma":0.000029982948,"threshold_uncertainty_score":0.55485165},"labels":[],"label_agreement":null}]}