{"meta":{"query_hash":"0e3d1d99c5d6","filters":{"venue":"Parallel Computing"},"cohort_total":17,"direct_labels_cover":0,"predictions_cover":17,"exported":17,"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/0e3d1d99c5d6","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+Computing"},"results":[{"id":"W1964212654","doi":"10.1016/j.parco.2015.03.009","title":"Scalable connectionless RDMA over unreliable datagrams","year":2015,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Advanced Scientific Computing Research; National Science Foundation of Sri Lanka; Office of Science; Natural Sciences and Engineering Research Council of Canada; Savannah River Operations Office, U.S. Department of Energy; Ontario Innovation Trust; U.S. Department of Energy","keywords":"Remote direct memory access; InfiniBand; Datagram; Computer science; Connectionless communication; Scalability; Operating system; Computer network; The Internet; Network packet","score_opus":0.04617615889508019,"score_gpt":0.29136573708861596,"score_spread":0.24518957819353576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964212654","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.17907844,0.0022920137,0.7985768,0.00072839594,0.0007645053,0.000306957,0.00038326578,0.010972322,0.0068973997],"genre_scores_gemma":[0.90898263,0.0003129714,0.08530876,0.0001403302,0.0002634345,0.00011225334,0.00023163385,0.00021478781,0.004433262],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99763167,0.00048367033,0.00020565047,0.0003629974,0.0009362978,0.000379698],"domain_scores_gemma":[0.9894935,0.0035742423,0.0006082961,0.004464586,0.001523733,0.0003356155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025194976,0.0010127611,0.0016353686,0.0013248507,0.0020241297,0.0025375022,0.003056077,0.001004983,0.0037805478],"category_scores_gemma":[0.010765427,0.0006717431,0.00037039348,0.0016912273,0.0010381755,0.00353966,0.00314853,0.0015836594,0.0007222394],"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.0053743166,0.0005319563,0.0038737315,0.0007309449,0.0002787641,0.0009102761,0.0007627586,0.3097124,0.12882383,0.06179071,0.021520838,0.46568936],"study_design_scores_gemma":[0.00010961246,0.00018884183,0.00035467377,0.000022344218,0.00005883808,0.00013849443,0.00007667977,0.96179837,0.01673575,0.016853752,0.003624916,0.00003777939],"about_ca_topic_score_codex":0.004002154,"about_ca_topic_score_gemma":0.0041927486,"teacher_disagreement_score":0.004002154,"about_ca_system_score_codex":0.0014191754,"about_ca_system_score_gemma":0.0017941728,"threshold_uncertainty_score":0.013324559},"labels":[],"label_agreement":null},{"id":"W1966773917","doi":"10.1016/j.parco.2005.02.008","title":"Interactive parallel visualization of large particle datasets","year":2005,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Computer Graphics and Visualization Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"McMaster University","keywords":"Rendering (computer graphics); Visualization; Computer science; Volume rendering; Interactive visualization; Computer graphics (images); Scientific visualization; Frame rate; Data visualization; Computational science; Data mining; Artificial intelligence","score_opus":0.023035292925563267,"score_gpt":0.3434211950819711,"score_spread":0.32038590215640783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966773917","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.14579393,0.00088068837,0.772054,0.0033154995,0.000648309,0.00031049183,0.0040081255,0.04550326,0.027485572],"genre_scores_gemma":[0.49556985,0.0011611446,0.48025852,0.0003897157,0.00026678003,0.0003493757,0.0037621837,0.006226514,0.01201584],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997198,0.00005200692,0.000014510412,0.000027592127,0.00015014526,0.00003592924],"domain_scores_gemma":[0.9987073,0.0007038153,0.00004972557,0.00019126474,0.00018908351,0.00015884027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007130543,0.0011223444,0.0010587565,0.001114667,0.0009795914,0.002439321,0.0012999845,0.0008869028,0.022063838],"category_scores_gemma":[0.0022978506,0.00063666614,0.00077685725,0.001403177,0.000507669,0.0013036721,0.002714793,0.0021898358,0.0012624573],"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.003207501,0.0007819571,0.0040154853,0.0014702932,0.0006738102,0.0024956793,0.001948807,0.27522823,0.14038129,0.051284563,0.19104537,0.327467],"study_design_scores_gemma":[0.0005203592,0.00007843126,0.0023161871,0.00005303079,0.00006956343,0.0003979909,0.00019358846,0.9079638,0.02560144,0.033519868,0.02921602,0.00006975049],"about_ca_topic_score_codex":0.0034545872,"about_ca_topic_score_gemma":0.006146624,"teacher_disagreement_score":0.022063838,"about_ca_system_score_codex":0.00057944376,"about_ca_system_score_gemma":0.0010224988,"threshold_uncertainty_score":0.073810935},"labels":[],"label_agreement":null},{"id":"W1980816411","doi":"10.1016/j.parco.2010.10.004","title":"Scheduling of tasks in the parareal algorithm","year":2010,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Scheduling (production processes); Parallel computing; Algorithm; Scaling; Rate of convergence; Execution time; Convergence (economics); Domain decomposition methods; Distributed computing; Mathematical optimization; Mathematics","score_opus":0.06867852865311079,"score_gpt":0.3808681107767238,"score_spread":0.312189582123613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980816411","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.109058246,0.000471867,0.8634689,0.00082474045,0.0003136322,0.00012796363,0.00022204482,0.0022136674,0.023298908],"genre_scores_gemma":[0.54316413,0.0002963821,0.43535888,0.00020646019,0.00010081863,0.00018401306,0.00034660308,0.0004894191,0.0198533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992723,0.00026561297,0.000026232263,0.00011400026,0.00019642233,0.00012548534],"domain_scores_gemma":[0.9989324,0.00041362835,0.000072345334,0.00029579407,0.00017929888,0.00010640466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012084881,0.00037650217,0.00058541744,0.0003845946,0.0008589833,0.0011642833,0.0024247332,0.0005523912,0.0114920605],"category_scores_gemma":[0.002977789,0.00034956605,0.00033312247,0.0006275654,0.0007941974,0.0013561732,0.0011000701,0.0008819494,0.0017249804],"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.0032231715,0.00030780805,0.0014498658,0.0003073295,0.000056307592,0.00018218972,0.0002513259,0.5513096,0.01379378,0.19879487,0.013792757,0.21653096],"study_design_scores_gemma":[0.00020184467,0.00011784807,0.00018153733,0.0000063373386,0.000009463413,0.000027128306,0.000036000052,0.9663921,0.0027269726,0.024738355,0.005547686,0.000014770868],"about_ca_topic_score_codex":0.0060262345,"about_ca_topic_score_gemma":0.010720952,"teacher_disagreement_score":0.0114920605,"about_ca_system_score_codex":0.0010882828,"about_ca_system_score_gemma":0.0019786826,"threshold_uncertainty_score":0.038444817},"labels":[],"label_agreement":null},{"id":"W1994064073","doi":"10.1016/j.parco.2006.08.007","title":"Quasi-atomic recovery for distributed agents","year":2006,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":14,"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; Correctness; Distributed computing; Asynchronous communication; Protocol (science); Overhead (engineering); Two-phase commit protocol; Simple (philosophy); Locality; Computer network; Algorithm; Operating system; Distributed transaction; Transaction processing; Database transaction; Programming language","score_opus":0.017657913512586824,"score_gpt":0.2589437906140779,"score_spread":0.24128587710149108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994064073","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.042297784,0.0003319054,0.9480565,0.00081250985,0.00026979964,0.000072181785,0.00003442121,0.00095689687,0.007167852],"genre_scores_gemma":[0.78561383,0.00027997055,0.19678357,0.0002770999,0.00017043503,0.0001851052,0.0001207813,0.00027384455,0.01629521],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909794,0.0002676413,0.000046592904,0.00012201074,0.00029533173,0.00017044958],"domain_scores_gemma":[0.99654716,0.001202076,0.00022252611,0.0013234052,0.0004778875,0.00022693495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021514713,0.0003472066,0.0007209205,0.00041148352,0.0014649134,0.0015278951,0.0020218329,0.0010067486,0.0048005404],"category_scores_gemma":[0.0061900676,0.00048239523,0.00054242404,0.00046989784,0.0020381517,0.002626705,0.0026578724,0.0024198913,0.00067766325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007926669,0.0001483286,0.00068068353,0.00017842211,0.000047951275,0.00024028994,0.00053763937,0.06810389,0.010672412,0.84054697,0.0063386536,0.07171211],"study_design_scores_gemma":[0.00012300373,0.00010491589,0.00029543764,0.000014004496,0.000036762267,0.00008828925,0.00010037166,0.52263784,0.003653638,0.46781066,0.005112098,0.000022956105],"about_ca_topic_score_codex":0.002125843,"about_ca_topic_score_gemma":0.002258133,"teacher_disagreement_score":0.0048005404,"about_ca_system_score_codex":0.00075617264,"about_ca_system_score_gemma":0.0013643237,"threshold_uncertainty_score":0.016059339},"labels":[],"label_agreement":null},{"id":"W2011629644","doi":"10.1016/s0167-8191(02)00109-6","title":"Parallel codebook design for vector quantization on a message passing MIMD architecture","year":2002,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Scheme for Promotion of Academic and Research Collaboration","keywords":"Codebook; MIMD; Vector quantization; Linde–Buzo–Gray algorithm; Computer science; Pipeline (software); Computation; Image compression; Quantization (signal processing); Parallel computing; Algorithm; Data compression; Computer engineering; Image (mathematics); Artificial intelligence; Image processing; Theoretical computer science","score_opus":0.059519953608185044,"score_gpt":0.2954016781205356,"score_spread":0.23588172451235054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011629644","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.015584369,0.00026577694,0.9800439,0.00015317593,0.000099416495,0.000071924514,0.0000925166,0.0013706406,0.0023182607],"genre_scores_gemma":[0.38113642,0.00025127854,0.6119761,0.00015698081,0.00008708904,0.00027024743,0.00034118505,0.00013460808,0.0056460085],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996132,0.000079631514,0.00003220179,0.000054651027,0.00017493167,0.000045418994],"domain_scores_gemma":[0.9993765,0.00013567635,0.000037982398,0.00014071693,0.00027344615,0.000035691744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005099482,0.00039195453,0.0006080374,0.0005121847,0.0006026258,0.00087882247,0.0014245808,0.00044779113,0.004788636],"category_scores_gemma":[0.0014741401,0.00024656503,0.00023061795,0.0010221598,0.00034631783,0.0010797544,0.0007031675,0.00053695845,0.0011459608],"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.0012048132,0.00021004894,0.0013350549,0.0003493057,0.000092872004,0.00020287586,0.00018545151,0.172826,0.076586686,0.094247,0.020264791,0.632495],"study_design_scores_gemma":[0.00009643612,0.0001940313,0.00019873625,0.000012615126,0.000021902151,0.0000961962,0.000035529585,0.948074,0.027487662,0.017523881,0.006236549,0.000022587425],"about_ca_topic_score_codex":0.0026928564,"about_ca_topic_score_gemma":0.0057595256,"teacher_disagreement_score":0.004788636,"about_ca_system_score_codex":0.0008286672,"about_ca_system_score_gemma":0.0012536693,"threshold_uncertainty_score":0.016019583},"labels":[],"label_agreement":null},{"id":"W2019783787","doi":"10.1016/s0167-8191(03)00022-x","title":"The maximum flow problem: a real-time approach","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Flow (mathematics); Computer science; Mechanics; Physics","score_opus":0.019048448547801702,"score_gpt":0.24641333936502036,"score_spread":0.22736489081721867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019783787","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.0023098185,0.0008359822,0.9917856,0.00057727017,0.00016028012,0.000044366046,0.000053963387,0.0001916161,0.004041168],"genre_scores_gemma":[0.17729072,0.0024147457,0.8082588,0.00025466806,0.0008759289,0.0002948091,0.00022353095,0.00048309864,0.009903747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845755,0.0006465754,0.00005510525,0.00029862634,0.0003952231,0.000146935],"domain_scores_gemma":[0.99680614,0.0023739627,0.00022856165,0.00018056693,0.00027978088,0.00013106455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035254816,0.0021789873,0.0021900816,0.0015119778,0.0008750883,0.0033849236,0.004040203,0.0028697485,0.0085184965],"category_scores_gemma":[0.009711384,0.001196929,0.0012798157,0.0022416764,0.0019682634,0.0060015074,0.0016947291,0.0036024477,0.00095251016],"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.0002570028,0.0001328595,0.0002444786,0.00051769055,0.00007459326,0.00014182448,0.00012399632,0.6497263,0.0015126646,0.2302904,0.009206596,0.10777164],"study_design_scores_gemma":[0.00003211255,0.000024382809,0.000042409152,0.000021199328,0.000018398177,0.000045613597,0.000021899234,0.92707986,0.0004019049,0.06870968,0.0035914655,0.000011022732],"about_ca_topic_score_codex":0.002253678,"about_ca_topic_score_gemma":0.0022231995,"teacher_disagreement_score":0.0085184965,"about_ca_system_score_codex":0.0013172445,"about_ca_system_score_gemma":0.0013088225,"threshold_uncertainty_score":0.02849716},"labels":[],"label_agreement":null},{"id":"W2029783178","doi":"10.1016/j.parco.2012.03.002","title":"Criticality guided energy aware speculation for speculative multithreaded processors","year":2012,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","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":"Advanced Micro Devices (Canada)","funders":"","keywords":"Criticality; Computer science; Thread (computing); Energy consumption; Speculative execution; Computation; Embedded system; Execution model; Architecture; Efficient energy use; Speculation; Parallel computing; Computer architecture; Distributed computing; Operating system; Engineering","score_opus":0.055119393897003634,"score_gpt":0.33282130491433304,"score_spread":0.2777019110173294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029783178","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.49227107,0.0031310825,0.49162102,0.0009941355,0.00042592367,0.00010398275,0.00016652644,0.0031603805,0.00812585],"genre_scores_gemma":[0.9597571,0.00018369615,0.038296007,0.000078219455,0.000035496345,0.000025779333,0.000059495727,0.00010130365,0.001463031],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000056515484,0.000017945407,0.00003548483,0.000100529476,0.00005966015],"domain_scores_gemma":[0.9988423,0.0004958931,0.00010710944,0.00024787962,0.00024929162,0.000057448677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005686437,0.0004821998,0.0004062461,0.00040967407,0.00055953546,0.00072176434,0.0009418803,0.0003151111,0.0018534748],"category_scores_gemma":[0.002354263,0.00034595813,0.00023725425,0.0003765467,0.00044499143,0.0009203663,0.0007114164,0.0006800853,0.00015815969],"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.0034829222,0.00043169636,0.0108952755,0.00050528935,0.00019212623,0.00064011425,0.00080637727,0.44851092,0.16017991,0.057172604,0.010952928,0.30622998],"study_design_scores_gemma":[0.00003978556,0.0001462812,0.00047326772,0.000013953677,0.000040360137,0.00004711536,0.0000646108,0.9598052,0.021350807,0.01641467,0.001589819,0.000014187914],"about_ca_topic_score_codex":0.0014242607,"about_ca_topic_score_gemma":0.004735706,"teacher_disagreement_score":0.0018534748,"about_ca_system_score_codex":0.00051218906,"about_ca_system_score_gemma":0.0013163296,"threshold_uncertainty_score":0.006200433},"labels":[],"label_agreement":null},{"id":"W2030615194","doi":"10.1016/j.parco.2009.04.001","title":"A distributed Key Message algorithm to optimize the communication in clusters","year":2009,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; University of Alberta","funders":"","keywords":"Computer science; Key (lock); Distributed computing; Message passing; Algorithm; Computer security","score_opus":0.014883835777013717,"score_gpt":0.2570849466904719,"score_spread":0.24220111091345817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030615194","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.015623413,0.0002958212,0.98003846,0.00023992751,0.00013611338,0.0000748676,0.00005965199,0.0011083841,0.0024232955],"genre_scores_gemma":[0.30681333,0.00022620948,0.68659145,0.00014476538,0.00011670203,0.00031379674,0.0002363479,0.00039000605,0.005167394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995765,0.00012483602,0.000025067482,0.00006311937,0.00014466615,0.00006582752],"domain_scores_gemma":[0.9993979,0.00027119825,0.000039029703,0.00010551698,0.00014996828,0.000036335718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007095203,0.00071611325,0.0011459052,0.0006758496,0.0009917855,0.0007403698,0.0014879756,0.0009209513,0.003079939],"category_scores_gemma":[0.0025934181,0.00038820948,0.000451489,0.0011404749,0.000554365,0.0013374973,0.0011236453,0.0009512745,0.0007099257],"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.00062734104,0.00016146783,0.0005627961,0.00014326269,0.000079572616,0.00007439291,0.00014087746,0.6554799,0.010535549,0.038305957,0.013157304,0.28073165],"study_design_scores_gemma":[0.00008133499,0.00005306973,0.00008306702,0.000004023082,0.000013768923,0.000016019352,0.000015556903,0.98428404,0.0018758489,0.0119846985,0.0015795351,0.000008973958],"about_ca_topic_score_codex":0.0032564434,"about_ca_topic_score_gemma":0.003902836,"teacher_disagreement_score":0.0032564434,"about_ca_system_score_codex":0.00088961923,"about_ca_system_score_gemma":0.0015344693,"threshold_uncertainty_score":0.010303438},"labels":[],"label_agreement":null},{"id":"W2043803280","doi":"10.1016/s0167-8191(03)00041-3","title":"Parallel computing in logistics","year":2003,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Intuitionistic Fuzzy Systems Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Computer science; Representation (politics); Relevance (law); Space (punctuation); Theoretical computer science; Information exchange; Mechanism (biology); Complex system; Distributed computing; Artificial intelligence","score_opus":0.029854203686776003,"score_gpt":0.2766728664270141,"score_spread":0.24681866274023812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043803280","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.0577745,0.03221465,0.71241367,0.012769024,0.0032579533,0.00012653913,0.0002472018,0.00094099547,0.18025552],"genre_scores_gemma":[0.7845181,0.014681669,0.13802975,0.0007573973,0.001887784,0.00013358546,0.0003141021,0.00017941942,0.059498254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994791,0.00015983208,0.00003167059,0.000094666306,0.00016963974,0.000065005086],"domain_scores_gemma":[0.9994342,0.00020943693,0.00003212842,0.00014385412,0.00013611342,0.000044226956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007742838,0.0005449121,0.00084625074,0.00059618586,0.0010926662,0.003012584,0.00072880357,0.0008733673,0.0071828407],"category_scores_gemma":[0.0021435888,0.00039632746,0.00065352337,0.0023155084,0.0014259877,0.0033674047,0.0009345484,0.0017269745,0.0011215813],"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.0001328527,0.000062770014,0.00030866326,0.00016929988,0.00004910738,0.000114727976,0.00012416912,0.07975478,0.0010526349,0.8181978,0.016257498,0.08377571],"study_design_scores_gemma":[0.000021152244,0.000015849251,0.00018828623,0.00002289844,0.000019527512,0.00006396318,0.00005143308,0.13594477,0.00068978005,0.8351751,0.027797798,0.000009504469],"about_ca_topic_score_codex":0.004092734,"about_ca_topic_score_gemma":0.002657458,"teacher_disagreement_score":0.0071828407,"about_ca_system_score_codex":0.0016947356,"about_ca_system_score_gemma":0.0014353947,"threshold_uncertainty_score":0.024028957},"labels":[],"label_agreement":null},{"id":"W2044596392","doi":"10.1016/s0167-8191(01)00103-x","title":"A dynamic model and parallel tabu search heuristic for real-time ambulance relocation","year":2001,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":448,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Université de Montréal","funders":"","keywords":"Tabu search; Relocation; Heuristic; Computer science; Humanities; Operations research; Algorithm; Engineering; Artificial intelligence; Operating system","score_opus":0.030283164666858178,"score_gpt":0.27209584665239456,"score_spread":0.24181268198553638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044596392","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.056406047,0.0007814112,0.9247028,0.0007172698,0.00024257922,0.0001913908,0.000368914,0.0008395148,0.015749972],"genre_scores_gemma":[0.77283424,0.00051660725,0.21676975,0.0001915965,0.00009085124,0.0004666194,0.00037139506,0.00022726579,0.008531588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995146,0.00017758843,0.000014994667,0.00007821179,0.000115011586,0.00009958322],"domain_scores_gemma":[0.9992539,0.00045103187,0.00006351424,0.00003908017,0.00014643156,0.00004600371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008516841,0.0007571999,0.001782595,0.001150677,0.00080675754,0.001463963,0.0025152268,0.001752215,0.006809692],"category_scores_gemma":[0.002391053,0.0010951671,0.00082052103,0.0018317238,0.0007999006,0.0015439375,0.00082566694,0.0011554329,0.00069821975],"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.000019859688,0.000014790408,0.0000340843,0.000011087766,0.0000057189513,0.000008075527,0.000005440931,0.99462897,0.000050745755,0.001346905,0.00031908747,0.003555244],"study_design_scores_gemma":[0.000007956307,0.000006367601,0.000013041655,0.0000013864927,0.0000022022236,0.0000020503974,0.0000026153102,0.99914026,0.00002060867,0.0006970491,0.000104728744,0.0000016600666],"about_ca_topic_score_codex":0.036992576,"about_ca_topic_score_gemma":0.021214802,"teacher_disagreement_score":0.036992576,"about_ca_system_score_codex":0.0020118437,"about_ca_system_score_gemma":0.0028286737,"threshold_uncertainty_score":0.073554516},"labels":[],"label_agreement":null},{"id":"W2618636670","doi":"10.1016/j.parco.2017.05.003","title":"Proteus: Exploiting precision variability in deep neural networks","year":2017,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Neural Network Applications","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Memory footprint; Inference; Convolutional neural network; Artificial neural network; Proteus; Efficient energy use; Floating point; Computer engineering; Real-time computing; Algorithm; Artificial intelligence","score_opus":0.029956903295596044,"score_gpt":0.30042314322613595,"score_spread":0.2704662399305399,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2618636670","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.09607545,0.0013470724,0.8671866,0.00060351426,0.00046470182,0.000086037144,0.000967367,0.027954627,0.0053145885],"genre_scores_gemma":[0.6078084,0.00038748275,0.38193583,0.0003486695,0.00017131165,0.00017219977,0.0015867546,0.0026370748,0.0049523558],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937856,0.0001611011,0.000027135457,0.00014159062,0.0002203762,0.00007118137],"domain_scores_gemma":[0.9988092,0.000539218,0.00007667605,0.00032950373,0.00018015584,0.00006526878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015828303,0.0011022746,0.0008714188,0.0007841883,0.00053600734,0.0012112441,0.0020672714,0.000941433,0.0035955308],"category_scores_gemma":[0.0053659775,0.000772165,0.0006116833,0.0009903867,0.00063162955,0.0023874443,0.0019816756,0.0019064659,0.0009912362],"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.0011117382,0.00029846973,0.003457347,0.00029391877,0.00033345053,0.00017246763,0.00015559403,0.43146867,0.01622213,0.032720562,0.025888896,0.4878767],"study_design_scores_gemma":[0.000033813994,0.000044579174,0.00017222924,0.0000080919035,0.000014550085,0.00001443084,0.000007925046,0.98196757,0.0034089815,0.013089235,0.0012301388,0.000008361995],"about_ca_topic_score_codex":0.004853653,"about_ca_topic_score_gemma":0.008671984,"teacher_disagreement_score":0.004853653,"about_ca_system_score_codex":0.0007595967,"about_ca_system_score_gemma":0.0013973468,"threshold_uncertainty_score":0.012028277},"labels":[],"label_agreement":null},{"id":"W2971516936","doi":"10.1016/j.parco.2019.102547","title":"A dynamic, unified design for dedicated message matching engines for collective and point-to-point communications","year":2019,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"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; National Nuclear Security Administration; Government of Ontario; University of Toronto; Canada Foundation for Innovation; Ontario Research Foundation; U.S. Department of Energy","keywords":"Message queue; Computer science; Queue; Point-to-point; Message passing; Message Passing Interface; Scalability; Speedup; Computer network; Distributed computing; Matching (statistics); Priority queue; Queueing theory; Point (geometry); Parallel computing; Operating system","score_opus":0.027555898189565452,"score_gpt":0.2919306506323945,"score_spread":0.26437475244282904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971516936","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.018127391,0.00052924186,0.96927625,0.00015716393,0.00017282624,0.0002606226,0.00011151161,0.0063617225,0.0050032404],"genre_scores_gemma":[0.45471618,0.00045960984,0.53140074,0.0003781116,0.00014302543,0.0005497173,0.0005646318,0.0008245252,0.010963448],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985672,0.00016341699,0.00012593178,0.00035350252,0.000521689,0.0002681791],"domain_scores_gemma":[0.9984869,0.00020977226,0.00015405013,0.00048328648,0.0005559973,0.00011000702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012323675,0.0009472553,0.0011882591,0.0012733485,0.0011820485,0.0028970717,0.0049740453,0.0010739957,0.005412206],"category_scores_gemma":[0.0021406626,0.0007457244,0.00078010134,0.00096825033,0.0006862833,0.0026288147,0.0019101569,0.001475355,0.0029309066],"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.0014741734,0.0009351254,0.0031554361,0.0008773467,0.0003951017,0.00034769115,0.0005193985,0.16715312,0.20570546,0.12149653,0.027953148,0.46998742],"study_design_scores_gemma":[0.00013036958,0.00064459315,0.00054786494,0.00006571405,0.00025840144,0.00027580056,0.000114391456,0.78855973,0.14985572,0.01893619,0.040502906,0.000108240456],"about_ca_topic_score_codex":0.0020904567,"about_ca_topic_score_gemma":0.0033420634,"teacher_disagreement_score":0.005412206,"about_ca_system_score_codex":0.0015265893,"about_ca_system_score_gemma":0.0027923617,"threshold_uncertainty_score":0.018105567},"labels":[],"label_agreement":null},{"id":"W3033979988","doi":"10.1016/j.parco.2020.102663","title":"AIR: Iterative refinement acceleration using arbitrary dynamic precision","year":2020,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Iterative refinement; Computer science; Algorithm; Granularity; Iterative method; Acceleration; Double-precision floating-point format; Arbitrary-precision arithmetic; Floating point","score_opus":0.058257262045882184,"score_gpt":0.32999513388837365,"score_spread":0.2717378718424915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033979988","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.0048377146,0.00028563672,0.9662061,0.00017154221,0.0005223075,0.00007979257,0.00027983807,0.014667306,0.012949674],"genre_scores_gemma":[0.10673672,0.0003141173,0.86538607,0.00025536556,0.0001546646,0.0002342231,0.0009271202,0.0058707865,0.020120887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991516,0.00014034743,0.00003835561,0.00008744766,0.0004986829,0.000083555344],"domain_scores_gemma":[0.9989661,0.00031736988,0.000046487385,0.00031091427,0.00028737407,0.00007185914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630847,0.0012158002,0.0008617357,0.0009916433,0.0006740399,0.0011561755,0.0022953225,0.0009249877,0.023348158],"category_scores_gemma":[0.003369998,0.00062804046,0.000773043,0.0012568561,0.00073393225,0.0014620605,0.0026681316,0.0025394654,0.007468829],"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.0011731188,0.00019049598,0.0011268863,0.0006911052,0.00019320323,0.00026702936,0.0004250617,0.10815545,0.022919072,0.11354751,0.07685387,0.6744572],"study_design_scores_gemma":[0.00027754516,0.00014697234,0.00039523,0.00009372167,0.0000577971,0.00020082263,0.000055958797,0.86873037,0.025249904,0.031096874,0.07363851,0.000056306446],"about_ca_topic_score_codex":0.0027294608,"about_ca_topic_score_gemma":0.0043807602,"teacher_disagreement_score":0.023348158,"about_ca_system_score_codex":0.00046479105,"about_ca_system_score_gemma":0.0009986669,"threshold_uncertainty_score":0.07810736},"labels":[],"label_agreement":null},{"id":"W4308487050","doi":"10.1016/j.parco.2022.102984","title":"Efficient parallel branch-and-bound approaches for exact graph edit distance problem","year":2022,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Graph Theory and Algorithms","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":"Université de Sherbrooke","funders":"Direction Générale de la Recherche Scientifique et du Développement Technologique","keywords":"Computer science; Speedup; Search tree; Pruning; Branch and bound; Theoretical computer science; Graph; Parallel computing; Algorithm; Search algorithm","score_opus":0.026937644813734955,"score_gpt":0.2351926344659796,"score_spread":0.20825498965224465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308487050","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.042974167,0.002379293,0.938783,0.0010711666,0.00020003409,0.0003892776,0.00030957902,0.0029159174,0.010977667],"genre_scores_gemma":[0.26852107,0.00073628087,0.72365254,0.0003375548,0.00017691002,0.0006319877,0.0010093522,0.00059529685,0.004338992],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771094,0.0005686238,0.00012330497,0.0005021398,0.00064293103,0.00045202792],"domain_scores_gemma":[0.9962618,0.0023120353,0.00022872021,0.00048627338,0.00043857004,0.00027253022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022755773,0.0022450138,0.0026621681,0.0018055077,0.0014928714,0.0028166173,0.0032659417,0.0015749909,0.0073016407],"category_scores_gemma":[0.005927112,0.0007772134,0.0012565952,0.0027109447,0.00089095393,0.0035382444,0.0027743357,0.0023185473,0.0014516659],"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.0007608481,0.00060199754,0.0010374312,0.00050297054,0.00015588879,0.0002274871,0.00026579504,0.629071,0.0054716896,0.032800227,0.012842819,0.31626192],"study_design_scores_gemma":[0.00008554394,0.000061602004,0.00010678919,0.000009259888,0.000021635973,0.000038383114,0.000044761142,0.9809132,0.0007185286,0.016698087,0.0012950319,0.000007263306],"about_ca_topic_score_codex":0.006131713,"about_ca_topic_score_gemma":0.007897889,"teacher_disagreement_score":0.0073016407,"about_ca_system_score_codex":0.0016962603,"about_ca_system_score_gemma":0.003861676,"threshold_uncertainty_score":0.0244264},"labels":[],"label_agreement":null},{"id":"W4367397470","doi":"10.1016/j.parco.2023.103024","title":"A lightweight semi-centralized strategy for the massive parallelization of branching algorithms","year":2023,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Programmer; Vertex cover; Bounded function; Algorithm; Branching (polymer chemistry); Parallel computing; Vertex (graph theory); Theoretical computer science; Graph; Approximation algorithm; Mathematics; Programming language","score_opus":0.05154537697838242,"score_gpt":0.30494632123818965,"score_spread":0.25340094425980725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367397470","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.012422202,0.00014718069,0.979081,0.00028361185,0.00009502871,0.000100986916,0.00008494946,0.0036205372,0.004164591],"genre_scores_gemma":[0.36176476,0.0001649858,0.6299503,0.00030772566,0.00023031107,0.00045689658,0.0004143639,0.0008990485,0.005811573],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975988,0.00063307816,0.00013133412,0.00044277965,0.00087201124,0.00032199497],"domain_scores_gemma":[0.99495304,0.0011599746,0.00025868812,0.0024788287,0.0007088065,0.0004406556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017798964,0.0009875073,0.0014611997,0.0011069614,0.0015360732,0.0021758636,0.003417651,0.0009034149,0.006993963],"category_scores_gemma":[0.006548,0.00064841955,0.00083271717,0.0016106403,0.001443767,0.002679999,0.004385677,0.0023414474,0.0033192288],"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.0021771076,0.00073479797,0.0019465834,0.00045918894,0.0001859397,0.00034825513,0.0005189442,0.14920023,0.09675451,0.21732719,0.032813873,0.49753338],"study_design_scores_gemma":[0.00019377934,0.00015894708,0.0003655302,0.000021616646,0.00004595426,0.000107013075,0.00005723902,0.87922037,0.015239098,0.09918648,0.005365611,0.00003832134],"about_ca_topic_score_codex":0.0020535502,"about_ca_topic_score_gemma":0.004221062,"teacher_disagreement_score":0.006993963,"about_ca_system_score_codex":0.0012370634,"about_ca_system_score_gemma":0.0034272203,"threshold_uncertainty_score":0.023397088},"labels":[],"label_agreement":null},{"id":"W4411297543","doi":"10.1016/j.parco.2025.103146","title":"Using Java to create and analyze models of parallel computing systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Java; Parallel computing; Programming language; Distributed computing","score_opus":0.043149527632393096,"score_gpt":0.3005110870569721,"score_spread":0.257361559424579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411297543","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.008612902,0.000063130865,0.97374606,0.00021477918,0.000059871174,0.00018198857,0.00047445044,0.013723641,0.0029232774],"genre_scores_gemma":[0.12305855,0.00027800453,0.8663055,0.00015660709,0.00003972397,0.0005456588,0.0019101761,0.0049905702,0.002715199],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.0003469674,0.0001454922,0.00020012908,0.0005130521,0.000126408],"domain_scores_gemma":[0.99608237,0.002296407,0.0002531437,0.00082365953,0.00041177575,0.00013268708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023055892,0.0011539409,0.0007997371,0.0012876017,0.0010709419,0.004808689,0.0026111943,0.0010416539,0.004292502],"category_scores_gemma":[0.00939208,0.0014813873,0.002749615,0.0008694557,0.0011210269,0.0051349197,0.002003645,0.0027109215,0.0012259195],"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.00034744552,0.0005161276,0.010281718,0.00091592263,0.00040820488,0.0008794585,0.0015668147,0.5092099,0.012684019,0.3045216,0.02061923,0.13804963],"study_design_scores_gemma":[0.000074714386,0.00002984097,0.00036173715,0.000069410984,0.00008056578,0.00014554129,0.00010467731,0.8689053,0.006311444,0.098846614,0.025028318,0.00004181659],"about_ca_topic_score_codex":0.006256722,"about_ca_topic_score_gemma":0.008384195,"teacher_disagreement_score":0.006256722,"about_ca_system_score_codex":0.0016179843,"about_ca_system_score_gemma":0.0023574536,"threshold_uncertainty_score":0.014359832},"labels":[],"label_agreement":null},{"id":"W4416746178","doi":"10.1016/j.parco.2025.103165","title":"Butterfly factorization for vision transformers on multi-IPU systems","year":2025,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Advanced Memory and Neural Computing","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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Butterfly; Memory footprint; Transformer; Factorization; Computation","score_opus":0.022138228545259982,"score_gpt":0.2953664193748585,"score_spread":0.27322819082959854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416746178","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.14336833,0.0005923475,0.8362958,0.0005381671,0.0001387478,0.00009624602,0.00036753414,0.005931061,0.012671677],"genre_scores_gemma":[0.6857207,0.00026112952,0.30768594,0.00020646017,0.00003000981,0.00009766365,0.00055473886,0.00027780797,0.0051656435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979275,0.00003514542,0.000011645649,0.00004456946,0.00007863839,0.000037253354],"domain_scores_gemma":[0.9996728,0.00011959927,0.000024659343,0.000083474966,0.00007454435,0.000024919487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029457128,0.0005826548,0.0004080151,0.00038658435,0.00034939012,0.0007315825,0.00092190166,0.00053714117,0.006463278],"category_scores_gemma":[0.0015546927,0.00027136074,0.00046014116,0.00046318027,0.00042328052,0.0014597622,0.0006346143,0.00083329144,0.0012030699],"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.0005581754,0.00012655993,0.0030630457,0.00027162998,0.00007392391,0.00056873757,0.00026915962,0.5436905,0.036403216,0.050913557,0.016305534,0.34775594],"study_design_scores_gemma":[0.000010489611,0.000040048977,0.00020366207,0.000006958632,0.000004857677,0.00004338019,0.00003180671,0.9857449,0.0058474084,0.005690284,0.0023709643,0.0000053035255],"about_ca_topic_score_codex":0.0077824504,"about_ca_topic_score_gemma":0.011354357,"teacher_disagreement_score":0.0077824504,"about_ca_system_score_codex":0.00096468366,"about_ca_system_score_gemma":0.0009903399,"threshold_uncertainty_score":0.021621883},"labels":[],"label_agreement":null}]}