{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011683654,0.0003487127,0.9810965,0.0003904897,0.00090941874,0.00015749325,0.000004304672,0.0017477506,0.003661665],"genre_scores_gemma":[0.5278034,0.000008074553,0.47151005,0.00027675007,0.000096221,0.0000060844477,0.000018743507,0.000015900596,0.00026476217],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981046,0.000052485677,0.00029898967,0.0006348265,0.00036411852,0.00054497947],"domain_scores_gemma":[0.99814606,0.00017409804,0.00016220193,0.001236837,0.0001307166,0.00015007441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050905335,0.0002101406,0.00025045493,0.00012416008,0.00022707727,0.0002675197,0.0017666102,0.00009518159,0.000007776088],"category_scores_gemma":[0.0003732002,0.00020463915,0.00004167659,0.00070418057,0.00009477613,0.0011650973,0.001828644,0.0002693671,0.00029109645],"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.000030593063,0.0002650162,0.006910679,0.000053736192,0.00007642418,0.00017523437,0.0009913227,0.20698296,0.00045507203,0.54297316,0.10314164,0.13794418],"study_design_scores_gemma":[0.0010680229,0.000110272325,0.0005128049,0.00005194997,0.0000063231296,0.00008227063,0.00023223666,0.8737125,0.0006591465,0.03986403,0.08314854,0.000551928],"about_ca_topic_score_codex":0.00012560893,"about_ca_topic_score_gemma":0.000010389074,"teacher_disagreement_score":0.6667295,"about_ca_system_score_codex":0.00013205025,"about_ca_system_score_gemma":0.00008273298,"threshold_uncertainty_score":0.8344942},"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":"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.016974635,0.00013829759,0.9816846,0.00019899121,0.00011511012,0.00018923957,0.000008512752,0.00036519274,0.00032539334],"genre_scores_gemma":[0.8925535,0.000023501045,0.1068138,0.0004419013,0.00008716444,0.000005205425,0.000048198723,0.00001203681,0.000014684591],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982962,0.00013553804,0.00052549003,0.00041042094,0.00029347307,0.00033885677],"domain_scores_gemma":[0.9987754,0.00013855271,0.0003074056,0.0005318537,0.00015644953,0.00009030445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245121,0.00017126185,0.0002380988,0.00014804522,0.00015778579,0.00012923373,0.00078227755,0.00005525183,0.000017713186],"category_scores_gemma":[0.000045576762,0.00017492988,0.00008511836,0.0005944907,0.000031955606,0.0006661509,0.00065339985,0.000105826985,0.00002232379],"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.000011115969,0.00036083392,0.003477229,0.00002608117,0.000034851528,0.0000032571188,0.0021170871,0.002935462,0.00022148968,0.97092956,0.0027554976,0.017127525],"study_design_scores_gemma":[0.00047894518,0.00007794829,0.0025504853,0.00005056246,0.0000052338764,0.000006987964,0.00002381145,0.983658,0.0031202438,0.0020658253,0.0077548623,0.00020710516],"about_ca_topic_score_codex":0.000017015973,"about_ca_topic_score_gemma":0.000010845845,"teacher_disagreement_score":0.98072255,"about_ca_system_score_codex":0.000030475368,"about_ca_system_score_gemma":0.0000340927,"threshold_uncertainty_score":0.7133434},"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":"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.32534,0.0000104064375,0.6732562,0.00012994006,0.00016366245,0.00014732714,0.0000014992023,0.000028402565,0.0009225461],"genre_scores_gemma":[0.4728379,4.4073056e-7,0.5270488,0.000023512657,0.000071426344,0.0000034386271,0.0000014862615,0.000007471352,0.0000054897105],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881107,0.00019866144,0.00039326597,0.00015075914,0.00022379789,0.00022243783],"domain_scores_gemma":[0.9976957,0.0017590274,0.00017508437,0.00029233997,0.000045062243,0.000032792504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001066124,0.00010471939,0.00022272173,0.00006419899,0.000084278385,0.000023446544,0.0003305376,0.00006317584,0.00002780879],"category_scores_gemma":[0.00091071316,0.00007607093,0.0000781528,0.00025538236,0.00006289816,0.000037718928,0.00007540496,0.0003849411,0.0000064390474],"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.00001649776,0.0007229013,0.005414313,0.00014025182,0.00006770194,0.000013210731,0.0075151715,0.0017137736,0.0061406526,0.26697996,0.00008049381,0.71119505],"study_design_scores_gemma":[0.0005237914,0.00004109567,0.0069775456,0.000050877716,0.000029095763,0.0000144925,0.000458277,0.26717257,0.00038777836,0.72399306,0.0001602789,0.0001911402],"about_ca_topic_score_codex":0.00006194445,"about_ca_topic_score_gemma":0.00003415376,"teacher_disagreement_score":0.7110039,"about_ca_system_score_codex":0.000007503522,"about_ca_system_score_gemma":0.000020848767,"threshold_uncertainty_score":0.31020823},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03296838,0.0002156236,0.9638891,0.00041395682,0.0010164843,0.00035481717,0.000060681756,0.00031226003,0.000768666],"genre_scores_gemma":[0.9482287,0.0000017387341,0.050898213,0.00020831548,0.000314346,0.000020200243,0.00014211626,0.0000143037205,0.00017202045],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819297,0.0000571452,0.00047830783,0.00051297474,0.00022047042,0.00053814915],"domain_scores_gemma":[0.99895495,0.00016803348,0.00022452831,0.00046200582,0.00011270591,0.00007775579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003770552,0.00020296659,0.00029124806,0.0000586641,0.00029172184,0.00029195193,0.0007891442,0.00008019467,0.0000026322532],"category_scores_gemma":[0.00003775909,0.0002036857,0.0001632594,0.00031855394,0.00002256492,0.0002637028,0.00017573054,0.00010320513,0.000051711446],"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.0001709731,0.0017290614,0.014334144,0.0004957834,0.0001959656,0.00009323308,0.00051360804,0.22707939,0.00072583096,0.2537564,0.357627,0.14327861],"study_design_scores_gemma":[0.0010682762,0.00011749145,0.008652646,0.00005851294,0.000006614216,0.000020673877,0.000011083145,0.92887455,0.00008663593,0.0066511407,0.054088943,0.00036340207],"about_ca_topic_score_codex":0.00012851688,"about_ca_topic_score_gemma":0.000011111129,"teacher_disagreement_score":0.9152604,"about_ca_system_score_codex":0.000084396524,"about_ca_system_score_gemma":0.000037362865,"threshold_uncertainty_score":0.8306062},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021875407,0.00028116058,0.99503255,0.0010682166,0.00023320779,0.0009388028,0.0000058929545,0.0011821118,0.0010393094],"genre_scores_gemma":[0.30921102,0.000014363441,0.68984073,0.00058200245,0.00011955433,0.000058427628,0.000010697154,0.000034078108,0.00012910953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973947,0.00025897194,0.0004858574,0.00084549206,0.0003953357,0.00061963964],"domain_scores_gemma":[0.997519,0.0010048889,0.00032817246,0.00090064487,0.00010699813,0.00014026796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004378784,0.00035702737,0.00036890153,0.0002087694,0.00052919326,0.00027976194,0.0012738502,0.00012260438,0.000017120454],"category_scores_gemma":[0.00021830738,0.00032931694,0.00012968923,0.00033087764,0.00005610792,0.00037650936,0.0002951544,0.00030512168,0.00004290431],"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.00014151754,0.00041734258,0.00007661615,0.0001446098,0.00006762214,0.00004843968,0.0027483623,0.5793704,0.0054619415,0.13003346,0.034390505,0.24709919],"study_design_scores_gemma":[0.000704589,0.00022292345,0.00007965916,0.00020516169,0.000007317268,0.000019308194,0.000008031398,0.9723363,0.0030150465,0.015760433,0.0071980124,0.0004432134],"about_ca_topic_score_codex":0.000003499308,"about_ca_topic_score_gemma":9.797142e-7,"teacher_disagreement_score":0.3929659,"about_ca_system_score_codex":0.00007883965,"about_ca_system_score_gemma":0.000024482708,"threshold_uncertainty_score":0.9999159},"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":"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.00015057749,0.00007564414,0.8349217,0.00047316847,0.000099636105,0.0003152537,2.098393e-7,0.00027950015,0.16368431],"genre_scores_gemma":[0.03147786,0.000053931093,0.9663239,0.00017593731,0.00004627435,0.000018165703,0.000003381214,0.00001708291,0.0018834538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980055,0.00034134727,0.0003119646,0.00041789186,0.00035017144,0.0005731177],"domain_scores_gemma":[0.9988549,0.00022355077,0.000108145876,0.00057058316,0.00011275779,0.00013008594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013766312,0.00016024626,0.00015661241,0.00005578987,0.00078002876,0.00052945607,0.00095169165,0.000051825173,0.000014663213],"category_scores_gemma":[0.00007787036,0.00011584512,0.000072484996,0.00049405027,0.00006149858,0.0002036286,0.00025941269,0.00020140015,0.00020838139],"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.000006282436,0.00014955217,0.00022433368,0.000034484012,0.000046360146,0.000008350929,0.0022434832,0.58598495,0.00015002243,0.36191416,0.006561696,0.042676356],"study_design_scores_gemma":[0.00030289305,0.000029231558,0.000056294113,0.000009674127,0.0000017337812,0.000024441117,0.000030403284,0.98020244,0.000013689921,0.008826457,0.010337709,0.00016502896],"about_ca_topic_score_codex":0.000013791258,"about_ca_topic_score_gemma":0.0000010728164,"teacher_disagreement_score":0.39421752,"about_ca_system_score_codex":0.000038740924,"about_ca_system_score_gemma":0.00010035584,"threshold_uncertainty_score":0.5999429},"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":"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.0027692325,0.00018009859,0.9923728,0.0005074986,0.0003401776,0.0003476223,0.0000024046087,0.0009940041,0.0024861246],"genre_scores_gemma":[0.56717855,0.0000033625704,0.43211833,0.00030194147,0.00025645585,0.000018239598,0.000017090433,0.00001561771,0.000090443704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767727,0.00015857644,0.00055885146,0.00053214544,0.00032590033,0.00074727513],"domain_scores_gemma":[0.9983093,0.00036062003,0.0002456107,0.0004800635,0.0003902908,0.00021407382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076712586,0.00028571064,0.00033212797,0.0001476794,0.00042267138,0.00017858943,0.00067625975,0.00012586548,0.000008598758],"category_scores_gemma":[0.00021033024,0.00028627634,0.00015397351,0.00043292678,0.00006064801,0.0006049773,0.00030859595,0.00013182433,0.000017558754],"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.00004833857,0.0007013424,0.010605168,0.00022482032,0.00014134195,0.0000058683872,0.0047339406,0.17026922,0.00040175032,0.7656099,0.00889927,0.038359027],"study_design_scores_gemma":[0.0005243667,0.000041235988,0.0024433506,0.00004886337,0.000011259047,0.000015244008,0.00002984352,0.9828248,0.0023450546,0.009084678,0.0022185186,0.000412792],"about_ca_topic_score_codex":0.00003264958,"about_ca_topic_score_gemma":0.0000015290793,"teacher_disagreement_score":0.81255555,"about_ca_system_score_codex":0.00010678196,"about_ca_system_score_gemma":0.000056027762,"threshold_uncertainty_score":0.99995893},"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":"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.0032499214,0.000140839,0.98728067,0.006752133,0.00024611206,0.00028318478,8.293762e-7,0.000120888886,0.0019254227],"genre_scores_gemma":[0.8716911,0.000005597126,0.1266665,0.0014913138,0.00006944427,0.0000068215713,0.000005314276,0.0000043077625,0.000059568996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985844,0.00030142796,0.00036292258,0.0002648911,0.00017873484,0.00030760403],"domain_scores_gemma":[0.9988965,0.00021667453,0.00010932972,0.0006492874,0.00006473721,0.000063520056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000980869,0.00012428475,0.00017855366,0.00007750981,0.0002637901,0.00027504502,0.001172542,0.000047711943,0.0000029042783],"category_scores_gemma":[0.000035792666,0.000096135605,0.000059020473,0.0005877792,0.000015575564,0.00016524289,0.00028206073,0.00022402902,0.000026088517],"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.000011015346,0.00007204667,0.00014208962,0.000003876215,0.000014490244,0.000011283752,0.007064181,0.821399,0.000009864484,0.015889196,0.006955778,0.14842719],"study_design_scores_gemma":[0.00029579387,0.000040733852,0.0024147502,0.00006983858,0.0000013149854,0.000018092003,0.00018369929,0.9937931,0.0000042639645,0.00063865876,0.0024124165,0.00012737773],"about_ca_topic_score_codex":0.00012600533,"about_ca_topic_score_gemma":0.000035154724,"teacher_disagreement_score":0.8684412,"about_ca_system_score_codex":0.0000795972,"about_ca_system_score_gemma":0.000016626733,"threshold_uncertainty_score":0.3920296},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004403088,0.00015433235,0.9637559,0.00028137368,0.00046085473,0.00037528883,0.0000011782864,0.00030637352,0.030261619],"genre_scores_gemma":[0.65204155,0.0000026325893,0.34755504,0.00022103313,0.0000820639,0.000009618129,0.0000036931242,0.000014125932,0.00007023908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972293,0.00026663658,0.0007546448,0.0006862072,0.00035660574,0.0007066319],"domain_scores_gemma":[0.99811625,0.00053805904,0.00026419343,0.0008081856,0.0001395132,0.00013380493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092923583,0.00026158497,0.00034966812,0.00018527833,0.00040073536,0.00028032513,0.0010003233,0.000112096815,0.000010667787],"category_scores_gemma":[0.0003276136,0.0002870664,0.0000831884,0.0007970523,0.000081321174,0.00016255207,0.00028921384,0.00035709265,0.00029147367],"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.000001362752,0.00008753671,0.0034783916,0.000028350945,0.000009912661,0.000028343147,0.00057782576,0.12791146,0.000036809462,0.8653671,0.00061445957,0.0018584179],"study_design_scores_gemma":[0.00084749213,0.00004034488,0.0057132393,0.00009805648,0.0000052277455,0.00012167493,0.00016306897,0.9525855,0.000033425684,0.034994263,0.0048721866,0.00052550616],"about_ca_topic_score_codex":0.00012536255,"about_ca_topic_score_gemma":0.000029391802,"teacher_disagreement_score":0.83037287,"about_ca_system_score_codex":0.00017798618,"about_ca_system_score_gemma":0.00014070394,"threshold_uncertainty_score":0.99995816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45099857,0.00012456537,0.53779685,0.002155775,0.00015671297,0.0008211658,0.0000023455248,0.00031261524,0.0076313876],"genre_scores_gemma":[0.97845787,0.0001456814,0.018214414,0.00060771283,0.0001799443,0.00003914623,0.000113632406,0.000030426094,0.0022111551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848855,0.000014011537,0.000381285,0.00046036334,0.00023075927,0.00042504707],"domain_scores_gemma":[0.9993791,0.000045729485,0.0000882089,0.00027644896,0.00018540425,0.000025099082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006151335,0.00020205785,0.00022263238,0.00017093662,0.00039093764,0.0001871259,0.000218975,0.000053071144,0.000045395136],"category_scores_gemma":[0.000088715584,0.00021503642,0.00006052158,0.00030837607,0.000047180263,0.00037201456,0.00018993864,0.00009442491,0.00024079288],"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.00011013714,0.00009258297,0.0021364654,0.00043515468,0.00003275235,0.0000025846407,0.00019788863,0.96761477,0.00018010392,0.016616704,0.0028035482,0.009777328],"study_design_scores_gemma":[0.00060784834,0.0000094972565,0.009826218,0.000037449874,0.000026914506,0.0000013350177,0.000105026375,0.9840817,2.4460334e-7,0.0026020713,0.0024545887,0.00024710482],"about_ca_topic_score_codex":0.00061275385,"about_ca_topic_score_gemma":0.00015215874,"teacher_disagreement_score":0.5274593,"about_ca_system_score_codex":0.00004973667,"about_ca_system_score_gemma":0.000018338462,"threshold_uncertainty_score":0.87689304},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041624006,0.000061286875,0.95503455,0.00068985875,0.00028486273,0.0006270588,1.7434643e-7,0.0002496583,0.0014285557],"genre_scores_gemma":[0.78866714,0.0000049038017,0.21094176,0.00010857617,0.00020814531,0.000045575478,0.0000013845012,0.000013170598,0.000009336859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765503,0.00022691899,0.0004944468,0.000788102,0.00023585756,0.00059964147],"domain_scores_gemma":[0.9970263,0.00066517293,0.00042208523,0.0016978701,0.00007401592,0.00011450636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012537807,0.00021294112,0.00026223456,0.00006114909,0.00097716,0.00044463738,0.0022870502,0.00008247695,0.0000032158325],"category_scores_gemma":[0.00054494163,0.00021480331,0.00007160731,0.00024298964,0.00007780045,0.00088151597,0.0015848835,0.0004514928,0.000014102962],"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.00000650558,0.000044817814,0.01214735,0.000007192277,0.0000029148375,0.000010833302,0.00020701862,0.61398464,0.00003838084,0.008765785,0.000015829624,0.3647687],"study_design_scores_gemma":[0.00029502442,0.00001737163,0.033797495,0.00003404182,0.0000014441705,0.0000115193825,0.0000075930234,0.9537714,0.00002299795,0.011731482,0.000095346244,0.00021427883],"about_ca_topic_score_codex":0.000029699759,"about_ca_topic_score_gemma":0.000023664632,"teacher_disagreement_score":0.74704313,"about_ca_system_score_codex":0.000075379794,"about_ca_system_score_gemma":0.000015449927,"threshold_uncertainty_score":0.87594247},"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":"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.0031237465,0.00021021962,0.9907514,0.0020372306,0.00015119048,0.002421171,0.00000646643,0.0007942066,0.0005043608],"genre_scores_gemma":[0.3417169,0.000015171215,0.6574879,0.0003668644,0.000014811988,0.00010239826,0.000014923418,0.000024204553,0.00025681584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809843,0.00018437022,0.00046025062,0.000613923,0.0001699324,0.00047310127],"domain_scores_gemma":[0.9964911,0.0018490438,0.00023729922,0.0008642004,0.00041367311,0.00014472986],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013706128,0.00026361182,0.0003909249,0.0002743854,0.00059143396,0.00027925058,0.001318698,0.0001104682,0.0000018397268],"category_scores_gemma":[0.0002444894,0.000273028,0.000088259185,0.0006020355,0.00004392894,0.00024669332,0.00073421095,0.00018543618,0.000012943145],"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.00021752749,0.00026526782,0.0002671575,0.00028516952,0.00024294117,0.0000022250874,0.012588535,0.8712105,0.0022726548,0.08667764,0.0060656224,0.019904742],"study_design_scores_gemma":[0.000929239,0.0002227359,0.00020089185,0.0001094207,0.000012949614,0.000010917511,0.000086863256,0.9820887,0.00023069556,0.015042053,0.0007252913,0.00034027552],"about_ca_topic_score_codex":0.000013026617,"about_ca_topic_score_gemma":0.000003776088,"teacher_disagreement_score":0.33859316,"about_ca_system_score_codex":0.00011381697,"about_ca_system_score_gemma":0.00015669077,"threshold_uncertainty_score":0.99997216},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02138542,0.00016399054,0.97511226,0.0022046615,0.00026118508,0.00017845581,8.128262e-7,0.00020365666,0.00048954086],"genre_scores_gemma":[0.33927292,0.0000036582212,0.65921044,0.0013739439,0.000120142045,0.0000015485763,0.0000022249894,0.000007703953,0.0000074243017],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983465,0.00021487586,0.00036429026,0.0005112402,0.00027924575,0.00028385263],"domain_scores_gemma":[0.9992176,0.00018827217,0.00015568454,0.00022880196,0.00006717674,0.00014246201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030744498,0.00017103885,0.00024159945,0.000046357807,0.00024961782,0.00019198292,0.00050711544,0.000042388165,0.00001106392],"category_scores_gemma":[0.00008916687,0.00015331543,0.000086533924,0.00044264254,0.000018700199,0.00037820387,0.00044075242,0.00021234331,0.00002727184],"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.000024567054,0.000104864856,0.00024241136,0.000043453674,0.00004643252,0.00004556455,0.0035521623,0.098179735,0.010822949,0.00868116,0.00019835099,0.8780584],"study_design_scores_gemma":[0.00024776068,0.000108390785,0.0007889515,0.000035726054,0.0000042985084,0.000006593259,0.00002442686,0.9953042,0.00043087662,0.0022247557,0.0006326674,0.00019133753],"about_ca_topic_score_codex":0.000009266889,"about_ca_topic_score_gemma":3.045621e-7,"teacher_disagreement_score":0.89712447,"about_ca_system_score_codex":0.00005145352,"about_ca_system_score_gemma":0.00004028184,"threshold_uncertainty_score":0.6252022},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036776904,0.0008940365,0.95943445,0.0005560673,0.0005853324,0.00068320916,0.000010901791,0.00026255794,0.00079654745],"genre_scores_gemma":[0.8554273,0.0000032486967,0.14391162,0.0001980455,0.00015957457,0.00013907666,0.000011032536,0.000020695084,0.00012939173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975506,0.00020732229,0.0003914862,0.0008139585,0.00038977386,0.0006468395],"domain_scores_gemma":[0.99874556,0.00038047848,0.00022007286,0.0004763651,0.00004198747,0.00013554502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0012987772,0.0002741078,0.00031692238,0.00014202116,0.001518219,0.00024570455,0.0010483899,0.00004060306,0.0000074606105],"category_scores_gemma":[0.00002235006,0.0002731057,0.00017670372,0.00053648464,0.000117972304,0.00011560842,0.00081357337,0.00030935387,0.000004379294],"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.000044359742,0.00019406101,0.00028868509,0.00008220553,0.000048519916,0.000007740065,0.0026072701,0.53334326,0.000030034373,0.43440917,0.000352142,0.028592547],"study_design_scores_gemma":[0.0009636956,0.00015679158,0.0006711162,0.000019778567,0.000011295039,0.00004473568,0.00018607652,0.89365107,0.000014891006,0.10065828,0.0032190802,0.00040317758],"about_ca_topic_score_codex":0.000007725949,"about_ca_topic_score_gemma":0.0000014451039,"teacher_disagreement_score":0.8186504,"about_ca_system_score_codex":0.00004607937,"about_ca_system_score_gemma":0.000045603643,"threshold_uncertainty_score":0.9999721},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00487021,0.0004253955,0.9915201,0.0012216204,0.000673504,0.00056573626,0.000007870176,0.00038587657,0.00032965594],"genre_scores_gemma":[0.8575309,0.00014484763,0.14153242,0.00018210862,0.00033954743,0.000041286152,0.000030561114,0.000026231992,0.00017208548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997997,0.000115186194,0.00051353534,0.00045810046,0.0003620221,0.0005541475],"domain_scores_gemma":[0.997798,0.0011405637,0.0002940293,0.00052679126,0.00016475824,0.00007586124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007429719,0.00021567233,0.0003100193,0.00016277168,0.00058346573,0.00019682175,0.0012379047,0.00007298361,0.000008065853],"category_scores_gemma":[0.00009143633,0.00016742692,0.00022111775,0.001142966,0.00008412222,0.00025506355,0.00038227128,0.00017628881,0.000016063155],"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.000031283256,0.0001024341,0.00041822452,0.00014694438,0.00019463873,0.000013985316,0.0037953416,0.5200233,0.00035555506,0.31214136,0.0032774834,0.15949944],"study_design_scores_gemma":[0.0008136015,0.000063761036,0.0019400539,0.000062446656,0.000014723465,0.0000064413152,0.00012516168,0.9692965,0.00027907937,0.024761114,0.0024280425,0.00020906531],"about_ca_topic_score_codex":0.000038402934,"about_ca_topic_score_gemma":0.000006268788,"teacher_disagreement_score":0.8526607,"about_ca_system_score_codex":0.000024139386,"about_ca_system_score_gemma":0.00007067649,"threshold_uncertainty_score":0.6827471},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1255164,0.0015905985,0.86609584,0.00021161641,0.0008655164,0.00058397424,0.0000072252806,0.0003372894,0.0047915075],"genre_scores_gemma":[0.84333116,0.000008585223,0.15613633,0.00020993796,0.00012812637,0.0000035816681,0.000006789697,0.000022661168,0.00015283568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956146,0.00040478836,0.00138166,0.0011308605,0.0005297572,0.0009383561],"domain_scores_gemma":[0.9972074,0.0005453135,0.00056224904,0.0010068692,0.0003861922,0.00029197035],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015299565,0.00051834027,0.0010713213,0.0005808597,0.000538443,0.00052617583,0.0015626634,0.00017948673,0.0000011242465],"category_scores_gemma":[0.000093310984,0.0005290983,0.0001911618,0.0016334452,0.00011598161,0.0003566065,0.0015456388,0.00031868496,0.000011001611],"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.000017807284,0.00005944648,0.0031281654,0.00027061484,0.00013560185,0.000015850272,0.0014252365,0.91079324,0.0001796373,0.08081853,0.0005262865,0.002629553],"study_design_scores_gemma":[0.000752525,0.000067449626,0.0015065213,0.00096702523,0.000038260878,0.000055436136,0.0002313759,0.9934151,0.000025960846,0.0017948978,0.0006585617,0.00048684233],"about_ca_topic_score_codex":0.00084154255,"about_ca_topic_score_gemma":0.0000064155643,"teacher_disagreement_score":0.71781474,"about_ca_system_score_codex":0.00013435254,"about_ca_system_score_gemma":0.00019208924,"threshold_uncertainty_score":0.99971604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10883948,0.0002034833,0.8877846,0.000030897485,0.001322174,0.00043804754,0.0000036085964,0.00043897456,0.000938706],"genre_scores_gemma":[0.9952077,0.000011772752,0.0043452857,0.0000686771,0.0001306005,0.000010643484,0.000017528924,0.000026632746,0.00018114995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907684,0.000022734292,0.00029112882,0.00022667304,0.00008344954,0.00029918758],"domain_scores_gemma":[0.9995359,0.00024128896,0.000037434485,0.0001078632,0.000035871766,0.00004162121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012991052,0.00018180236,0.00020234103,0.00010806131,0.00021796983,0.00004948065,0.000112315916,0.000068848996,9.2631336e-7],"category_scores_gemma":[0.000020013049,0.00018198203,0.00007329116,0.00017240724,0.000010981583,0.00009654484,0.000015656296,0.00015480207,0.000007539858],"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.000022306835,0.000012118295,0.000062491374,0.00024681972,0.00002611559,9.906117e-7,0.00016541641,0.97330284,0.010422021,0.0006837048,0.00013898333,0.01491617],"study_design_scores_gemma":[0.000779792,0.000060572314,0.0004424994,0.00027753302,0.000013050629,0.0000013621635,0.0000848399,0.9890133,0.006896189,0.0000746138,0.0021577452,0.00019846225],"about_ca_topic_score_codex":0.0000024325661,"about_ca_topic_score_gemma":8.3378274e-7,"teacher_disagreement_score":0.8863682,"about_ca_system_score_codex":0.00007123905,"about_ca_system_score_gemma":0.000009202425,"threshold_uncertainty_score":0.7421012},"labels":[],"label_agreement":null}]}