{"meta":{"query_hash":"4419edba72cf","filters":{"venue":"IEEE Transactions on Parallel and Distributed Systems"},"cohort_total":141,"direct_labels_cover":1,"predictions_cover":141,"exported":141,"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/4419edba72cf","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Parallel+and+Distributed+Systems"},"results":[{"id":"W1837798711","doi":"10.1109/tpds.2014.2329688","title":"Parallel Application Signature for Performance Analysis and Prediction","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Ciencia e Innovación; Ministerio de Economía y Competitividad; Mountain Equipment Co-operative","keywords":"Computer science; Signature (topology); Message passing; Performance prediction; Parallel computing; Supercomputer; Parallel processing; Distributed computing; Data mining; Simulation","score_opus":0.009504642863838113,"score_gpt":0.2248824556128849,"score_spread":0.21537781274904677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1837798711","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.08574498,0.00050375995,0.8834399,0.00025435627,0.00015150013,0.0003019435,0.0030202977,0.023543676,0.0030395668],"genre_scores_gemma":[0.54531616,0.00039318026,0.44545254,0.00011634895,0.000106827385,0.0004384365,0.0047959564,0.0006401866,0.0027403012],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842167,0.00024535003,0.00016150961,0.0002682878,0.0007897049,0.00011345784],"domain_scores_gemma":[0.9940708,0.0012197258,0.001098113,0.0015508931,0.0018542227,0.00020619889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012480809,0.0014043768,0.0009285436,0.0027699498,0.00042627717,0.0007843045,0.0010073963,0.00061478274,0.001729058],"category_scores_gemma":[0.009504261,0.00034547973,0.00055939466,0.0023961985,0.00034823903,0.0013514361,0.00079287146,0.0011169757,0.0014207318],"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.000872599,0.00040845855,0.03912833,0.00044273955,0.00017503065,0.00041257672,0.000213164,0.24320485,0.10336741,0.013849299,0.015815767,0.58210987],"study_design_scores_gemma":[0.00002040911,0.00014951908,0.0036539389,0.000017992263,0.000028690365,0.00020328313,0.000032312648,0.9317372,0.048681285,0.0069106175,0.008526856,0.000037920363],"about_ca_topic_score_codex":0.0027018583,"about_ca_topic_score_gemma":0.0018080935,"teacher_disagreement_score":0.0027699498,"about_ca_system_score_codex":0.00072291144,"about_ca_system_score_gemma":0.0016205882,"threshold_uncertainty_score":0.0066005588},"labels":[],"label_agreement":null},{"id":"W1968939070","doi":"10.1109/tpds.2012.135","title":"Microarchitecture of a Coarse-Grain Out-of-Order Superscalar Processor","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Microarchitecture; Parallel computing; Computer architecture; Scheduling (production processes); Out-of-order execution; Instruction-level parallelism; Overhead (engineering); Task parallelism; Field-programmable gate array; Embedded system; Parallelism (grammar); Operating system","score_opus":0.013775158719820492,"score_gpt":0.23382682806072283,"score_spread":0.22005166934090234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968939070","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.6250052,0.0004921787,0.35129672,0.00031119693,0.0000730498,0.00024610487,0.00017032356,0.0038020713,0.01860327],"genre_scores_gemma":[0.9114948,0.000107313994,0.08564313,0.0000851779,0.000015914473,0.0000728147,0.0001109302,0.00007020388,0.0023997389],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998554,0.00002092475,0.000008795314,0.000023718403,0.000063470165,0.000027599817],"domain_scores_gemma":[0.9997646,0.000069430665,0.000038839768,0.00004601221,0.00006278804,0.00001827292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014801549,0.00017719365,0.00015149976,0.00022747174,0.00019409189,0.0003820722,0.000458574,0.00020245947,0.0021317708],"category_scores_gemma":[0.0004539248,0.00013271542,0.00014659278,0.00016725309,0.00020025276,0.00035290222,0.00014311432,0.00031815722,0.00030860773],"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.000486957,0.00022323515,0.005554087,0.00025324628,0.000060476195,0.0003984625,0.00026415975,0.3962119,0.42540142,0.017363373,0.0034055598,0.15037711],"study_design_scores_gemma":[0.000088448556,0.000901666,0.0026909073,0.000014431313,0.00005537588,0.00015360347,0.000035184385,0.8741995,0.11101021,0.0019328302,0.00889361,0.000024223327],"about_ca_topic_score_codex":0.0023344117,"about_ca_topic_score_gemma":0.0031399166,"teacher_disagreement_score":0.0023344117,"about_ca_system_score_codex":0.00041722547,"about_ca_system_score_gemma":0.0006499998,"threshold_uncertainty_score":0.0071314573},"labels":[],"label_agreement":null},{"id":"W1969412326","doi":"10.1109/tpds.2015.2392760","title":"Achieving Optimal Traffic Engineering Using a Generalized Routing Framework","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science and Technology Entrepreneurship Development Board","keywords":"Multiprotocol Label Switching; Computer science; Open Shortest Path First; Traffic engineering; Constrained Shortest Path First; Mathematical optimization; Routing protocol; Computer network; Label switching; Path vector protocol; Equal-cost multi-path routing; Shortest path problem; Distributed computing; Routing (electronic design automation); Link-state routing protocol; Quality of service; Mathematics; Graph; K shortest path routing; Theoretical computer science","score_opus":0.029587908186772375,"score_gpt":0.24143042635176265,"score_spread":0.21184251816499028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969412326","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.009220306,0.00017792555,0.98700976,0.0001634282,0.000022881994,0.000030943924,0.00002414862,0.00011116726,0.0032394866],"genre_scores_gemma":[0.5634813,0.0010350349,0.42976528,0.00026238078,0.00015688225,0.00030509415,0.00014415807,0.00014803381,0.0047017727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986601,0.0006019428,0.000049384613,0.00019076024,0.00033732492,0.00016055781],"domain_scores_gemma":[0.99943095,0.00022237378,0.000066008586,0.00014263744,0.0001028165,0.00003520411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001650582,0.0011136445,0.00093945814,0.00072352076,0.00057712663,0.0013465367,0.0012803717,0.0009376187,0.0010213912],"category_scores_gemma":[0.0019755014,0.0003671404,0.001021711,0.0008812584,0.0017359235,0.0019994855,0.0018214424,0.0012693282,0.00014583378],"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.000014947389,0.000022048504,0.00008602678,0.000050913848,0.00001652409,0.000069924274,0.00005651974,0.6291731,0.003181794,0.3502368,0.0006773924,0.016413897],"study_design_scores_gemma":[0.000005674384,0.000018495795,0.000036275884,0.0000057100815,0.0000061012443,0.000023155359,0.000011048199,0.89210224,0.000502965,0.10602061,0.0012594761,0.000008231186],"about_ca_topic_score_codex":0.0024028632,"about_ca_topic_score_gemma":0.002807502,"teacher_disagreement_score":0.0024028632,"about_ca_system_score_codex":0.0017669515,"about_ca_system_score_gemma":0.0019740928,"threshold_uncertainty_score":0.012820184},"labels":[],"label_agreement":null},{"id":"W1970328709","doi":"10.1109/tpds.2011.51","title":"SCBXP: An Efficient CAM-Based XML Parsing Technique in Hardware Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Beirut Arab University","keywords":"Computer science; XML Signature; Streaming XML; Efficient XML Interchange; XML framework; Simple API for XML; XML database; XML Encryption; XML validation; Parsing; XML; Programming language; Operating system","score_opus":0.02618344522003093,"score_gpt":0.22542693635864888,"score_spread":0.19924349113861795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970328709","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.029123751,0.0003444778,0.95142555,0.000166686,0.00009354349,0.00017037833,0.00015188256,0.014390393,0.004133359],"genre_scores_gemma":[0.25593513,0.00020410282,0.73830557,0.00019838549,0.00004299734,0.00023551851,0.00042397252,0.0006584839,0.0039958325],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994924,0.00011171162,0.000038558523,0.00008282953,0.0002246264,0.000049816652],"domain_scores_gemma":[0.9990632,0.0003378175,0.000097451906,0.00029266303,0.0001824025,0.000026465794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394745,0.00051688036,0.00040786463,0.00070764165,0.0004957289,0.0007181998,0.0013700442,0.0005190832,0.002932631],"category_scores_gemma":[0.0016812626,0.00032112811,0.000317487,0.000777572,0.00056697836,0.0013550726,0.0007288581,0.00072590687,0.00077683316],"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.0007879525,0.0001474256,0.002264967,0.00057679124,0.00006661102,0.00071959046,0.00042567652,0.02534185,0.22112806,0.04069499,0.018987365,0.6888587],"study_design_scores_gemma":[0.00021724342,0.0008231543,0.002002461,0.00010566587,0.00008891461,0.0010217888,0.00013183583,0.45153603,0.47432214,0.015352219,0.05430063,0.000097926095],"about_ca_topic_score_codex":0.0012684882,"about_ca_topic_score_gemma":0.001508774,"teacher_disagreement_score":0.002932631,"about_ca_system_score_codex":0.00035465113,"about_ca_system_score_gemma":0.0010250414,"threshold_uncertainty_score":0.0098106265},"labels":[],"label_agreement":null},{"id":"W1973991062","doi":"10.1109/tpds.2011.287","title":"Relaxed Concurrency Control in Software Transactional Memory","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Serializability; Software transactional memory; Concurrency control; Optimistic concurrency control; Multiversion concurrency control; Transactional memory; Distributed computing; Concurrency; Parallel computing; Commit; Non-lock concurrency control; Distributed concurrency control; Database transaction; Operating system; Distributed transaction; Transaction processing; Programming language; Database","score_opus":0.023594969331914344,"score_gpt":0.21982452649761416,"score_spread":0.19622955716569981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973991062","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.086396456,0.0016855226,0.9061494,0.0003611077,0.00010065132,0.00012928904,0.00005136924,0.00253327,0.0025928828],"genre_scores_gemma":[0.77177894,0.00040268642,0.22517769,0.00018668972,0.00008275178,0.00024685357,0.00012162251,0.00025594598,0.0017468294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99187887,0.002605728,0.00074258563,0.0008804423,0.0033577087,0.0005347303],"domain_scores_gemma":[0.9893969,0.004263872,0.00094338285,0.0034998101,0.0016017715,0.00029423586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005967772,0.00071978057,0.00079064537,0.0010276258,0.00082684995,0.0024737725,0.0037823298,0.00076488656,0.0010926058],"category_scores_gemma":[0.015406756,0.0009207122,0.00061682373,0.0012521335,0.0022366438,0.0043437635,0.0024369643,0.0025249214,0.00031680608],"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.0018880877,0.0004950881,0.009303043,0.0007366444,0.00019807764,0.00053182384,0.0018328162,0.39029038,0.078257985,0.17127663,0.004490987,0.34069848],"study_design_scores_gemma":[0.00021275072,0.00026920665,0.00047896177,0.00004899528,0.000059632624,0.00022167178,0.00009187562,0.9006965,0.03036116,0.06222893,0.0052740667,0.000056269662],"about_ca_topic_score_codex":0.0017408229,"about_ca_topic_score_gemma":0.0017871701,"teacher_disagreement_score":0.005967772,"about_ca_system_score_codex":0.0010058365,"about_ca_system_score_gemma":0.001461181,"threshold_uncertainty_score":0.031560957},"labels":[],"label_agreement":null},{"id":"W1974138127","doi":"10.1109/tpds.2011.253","title":"Exploring Peer-to-Peer Locality in Multiple Torrent Environment","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"PlanetLab; Computer science; BitTorrent; Locality; BitTorrent tracker; Distributed computing; Upload; Peer-to-peer; Computer network; The Internet; File sharing; Overhead (engineering); World Wide Web; Artificial intelligence","score_opus":0.13945848239800604,"score_gpt":0.24331995977250498,"score_spread":0.10386147737449894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974138127","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.9216092,0.00024082742,0.076100275,0.00019439294,0.000013021254,0.000043739055,0.000041998264,0.00037803449,0.0013784424],"genre_scores_gemma":[0.99377257,0.000041778432,0.0060540233,0.0000119186,0.000004279429,0.00000935152,0.000014520982,0.0000064733963,0.00008503607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991375,0.00042496817,0.000018369474,0.00015314532,0.00014194092,0.0001239958],"domain_scores_gemma":[0.99736494,0.0014711019,0.00033216778,0.0003087287,0.00028431197,0.00023876576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012095281,0.0003415496,0.00060249964,0.0006417145,0.0010287076,0.0006426041,0.0012891969,0.0007508046,0.00033398648],"category_scores_gemma":[0.0049413815,0.0002617969,0.00022945987,0.00044556422,0.0011037041,0.00209584,0.0012344999,0.00067268644,0.00007778064],"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.0004326823,0.00058904284,0.032205716,0.00017758796,0.00014743255,0.0011551677,0.001082328,0.86057705,0.030576076,0.03113026,0.00182385,0.04010284],"study_design_scores_gemma":[0.000008938022,0.00007354689,0.0017987853,0.0000030584072,0.0000089605455,0.00010151057,0.00019695105,0.99125355,0.0024994568,0.0037668773,0.0002746534,0.000013667956],"about_ca_topic_score_codex":0.002977199,"about_ca_topic_score_gemma":0.0023515844,"teacher_disagreement_score":0.002977199,"about_ca_system_score_codex":0.0006019644,"about_ca_system_score_gemma":0.00058534014,"threshold_uncertainty_score":0.0063966513},"labels":[],"label_agreement":null},{"id":"W1977930421","doi":"10.1109/tpds.2013.37","title":"Enabling Trustworthy Service Evaluation in Service-Oriented Mobile Social Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of Waterloo","funders":"","keywords":"Computer science; Service provider; Computer security; Service (business); Sybil attack; Trusted Computing; Computer network; Internet privacy; World Wide Web; Wireless sensor network; Business","score_opus":0.019731673599230445,"score_gpt":0.24612073126391082,"score_spread":0.22638905766468037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977930421","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.105438925,0.0017535103,0.8829212,0.0009516869,0.00020470076,0.00053267874,0.00006666672,0.0030693433,0.005061317],"genre_scores_gemma":[0.93369,0.00030723048,0.064225495,0.00015776262,0.0001027682,0.00009481582,0.0000716667,0.00004642607,0.0013037816],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993737,0.0025393788,0.00036143343,0.00076625834,0.002200559,0.00039540394],"domain_scores_gemma":[0.9918057,0.0027746896,0.0013139056,0.0014027169,0.0021118026,0.00059126824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044496595,0.0009483272,0.0012949846,0.0012687637,0.0012318634,0.0021929187,0.0014991545,0.0013936224,0.00085938774],"category_scores_gemma":[0.01214538,0.00043655408,0.0006101171,0.0010027498,0.0011721641,0.0043935776,0.0030625127,0.001058923,0.0006220375],"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.0022368343,0.00066369603,0.024332007,0.0008813709,0.00048219666,0.0031523397,0.0023234277,0.20346908,0.06546304,0.09053419,0.011313573,0.5951482],"study_design_scores_gemma":[0.000051020157,0.0002541203,0.0013355012,0.000029381037,0.00005931115,0.00041354753,0.0002315891,0.96521944,0.008737228,0.014438784,0.009166089,0.00006410631],"about_ca_topic_score_codex":0.0030442048,"about_ca_topic_score_gemma":0.0019386903,"teacher_disagreement_score":0.0044496595,"about_ca_system_score_codex":0.0012564139,"about_ca_system_score_gemma":0.0013272978,"threshold_uncertainty_score":0.02353239},"labels":[],"label_agreement":null},{"id":"W1978252943","doi":"10.1109/tpds.2015.2425403","title":"Burstiness-Aware Resource Reservation for Server Consolidation in Computing Clouds","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"State Key Laboratory of Novel Software Technology; Nanjing University; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Burstiness; Computer science; Reservation; Distributed computing; Queue; Cloud computing; Virtualization; Virtual machine; Server; Energy consumption; Computer network; Real-time computing; Operating system","score_opus":0.04798110418448325,"score_gpt":0.2702338779129049,"score_spread":0.22225277372842162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978252943","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.08481672,0.0012034398,0.91189224,0.00025421038,0.000105505074,0.00006532032,0.00003373277,0.00061617227,0.001012713],"genre_scores_gemma":[0.9566714,0.00032231936,0.04227582,0.000086854234,0.00003866252,0.000026237974,0.00004190754,0.000041856376,0.0004948107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943584,0.00014371793,0.000046778587,0.00011436119,0.00013416568,0.00012506034],"domain_scores_gemma":[0.9989793,0.00044392995,0.00013652965,0.00010585105,0.00021052823,0.00012388089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086933223,0.00040999617,0.00059485517,0.00034751339,0.000505228,0.00086471287,0.0012110653,0.00039160755,0.00057791243],"category_scores_gemma":[0.0021452634,0.00025696235,0.00033843907,0.00049989874,0.00041418185,0.0011909764,0.0005483305,0.00071077293,0.00013661364],"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.00035926918,0.00023579947,0.004787899,0.0001511992,0.00008125242,0.00016990885,0.00024276633,0.79866356,0.035498388,0.019089876,0.0023554226,0.1383646],"study_design_scores_gemma":[0.000006892444,0.00002732665,0.00017301769,0.0000028727952,0.0000059514177,0.0000202718,0.000011592779,0.99635637,0.0014150755,0.0017219309,0.00025398456,0.0000047515227],"about_ca_topic_score_codex":0.004319023,"about_ca_topic_score_gemma":0.003382333,"teacher_disagreement_score":0.004319023,"about_ca_system_score_codex":0.00094057544,"about_ca_system_score_gemma":0.0013936243,"threshold_uncertainty_score":0.008587718},"labels":[],"label_agreement":null},{"id":"W1978518631","doi":"10.1109/tpds.2012.327","title":"Routing Metrics for Minimizing End-to-End Delay in Multiradio Multichannel Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Computer science; Computer network; End-to-end principle; Routing (electronic design automation); Wireless; Distributed computing; Telecommunications","score_opus":0.020955469517039433,"score_gpt":0.24073480808495146,"score_spread":0.219779338567912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978518631","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.034149997,0.002869714,0.96109,0.00017429997,0.000067881636,0.00007982294,0.000071390125,0.00013975629,0.0013571711],"genre_scores_gemma":[0.654422,0.0018665303,0.34213492,0.00006779124,0.000086787055,0.00021262639,0.0001551094,0.000095231255,0.0009590689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899703,0.00041880703,0.00007993979,0.00012266796,0.0003274632,0.00005410106],"domain_scores_gemma":[0.99780446,0.0011945223,0.0005082022,0.00011488096,0.0003127151,0.000065247536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018389234,0.0014247416,0.00080027804,0.0013010212,0.00040274547,0.00091313076,0.0009357839,0.0006186718,0.00055011245],"category_scores_gemma":[0.0063766786,0.00022949972,0.0002730497,0.00091149233,0.00055351306,0.0017453533,0.0008439348,0.00055109966,0.0001101154],"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.000045485984,0.00003965887,0.0010454735,0.00020812327,0.000050555675,0.000026129148,0.00007115514,0.9147514,0.008361599,0.019634685,0.00059379305,0.055171873],"study_design_scores_gemma":[0.0000056951853,0.0001388536,0.00039380798,0.000021215808,0.000018748275,0.0000422192,0.000032213986,0.98825,0.0033027867,0.0065357275,0.0012391253,0.000019494528],"about_ca_topic_score_codex":0.0008145494,"about_ca_topic_score_gemma":0.0011464664,"teacher_disagreement_score":0.0018389234,"about_ca_system_score_codex":0.0012245021,"about_ca_system_score_gemma":0.00075743074,"threshold_uncertainty_score":0.009725273},"labels":[],"label_agreement":null},{"id":"W1979014233","doi":"10.1109/tpds.2013.40","title":"Time Synchronization Based on Slow-Flooding in Wireless Sensor Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Time Synchronization Technologies","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fondation Pour La Conservation Du Saumon Atlantique","keywords":"Flooding (psychology); Computer science; Wireless sensor network; Scalability; Testbed; Real-time computing; Synchronization (alternating current); Clock synchronization; Computer network; Node (physics); Context (archaeology); Clock drift; Propagation delay; Distributed computing; Channel (broadcasting); Engineering","score_opus":0.007816026875732922,"score_gpt":0.196552661262533,"score_spread":0.18873663438680008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979014233","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.0818218,0.0021989131,0.91193426,0.0003231031,0.00013038558,0.00017731641,0.00007403317,0.000927353,0.0024128053],"genre_scores_gemma":[0.8994358,0.0014568621,0.09763026,0.000084155436,0.00008398578,0.00020955228,0.00012131669,0.00007151408,0.0009065112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895906,0.00034431933,0.00008368971,0.00015848926,0.00038198664,0.00007239157],"domain_scores_gemma":[0.9980258,0.0009381271,0.00039004657,0.00024947035,0.00033802236,0.000058673806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001410239,0.000558654,0.00059276645,0.00088278763,0.00068560895,0.0005539683,0.0008548631,0.00055763795,0.00046282695],"category_scores_gemma":[0.005571465,0.00031306437,0.00036115822,0.0010034298,0.00083952514,0.0017828479,0.0013877064,0.00059219834,0.000117900534],"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.0005171989,0.00008735334,0.0039065788,0.0008895251,0.00012672559,0.00057476765,0.0009624996,0.6507499,0.11120511,0.06658989,0.002464871,0.16192567],"study_design_scores_gemma":[0.000050473656,0.00028322646,0.0011417648,0.000036560014,0.00005416608,0.000286028,0.000112430884,0.95097095,0.021320185,0.020221082,0.005473978,0.000049115864],"about_ca_topic_score_codex":0.002027278,"about_ca_topic_score_gemma":0.0010236894,"teacher_disagreement_score":0.002027278,"about_ca_system_score_codex":0.00064175605,"about_ca_system_score_gemma":0.00078670395,"threshold_uncertainty_score":0.00745821},"labels":[],"label_agreement":null},{"id":"W1979748495","doi":"10.1109/tpds.2011.246","title":"Optimizing Techniques for Parallel Digital Logic Simulation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bottleneck; Correctness; Logic gate; Logic simulation; Digital electronics; Electronic circuit; Parallel computing; Algorithm; Embedded system; Electrical engineering","score_opus":0.16442425736207314,"score_gpt":0.3681253518143458,"score_spread":0.20370109445227266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979748495","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.006800739,0.00008257865,0.98975104,0.0000708076,0.000013552366,0.000046615212,0.000025417012,0.0007902373,0.0024190901],"genre_scores_gemma":[0.22053322,0.00021644178,0.77582574,0.00007503241,0.000024125537,0.0004025673,0.00012862297,0.0004331555,0.0023610955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936324,0.0001965534,0.000033000215,0.00008231346,0.00026796066,0.00005691669],"domain_scores_gemma":[0.9985839,0.00083064544,0.00011550702,0.00021066719,0.00022487299,0.00003445255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010413175,0.0008382897,0.0007190192,0.00080433453,0.00056958344,0.00065258634,0.0013447304,0.0005633727,0.0045018746],"category_scores_gemma":[0.003721447,0.0006543975,0.00086707954,0.00077444175,0.00067282846,0.0008972701,0.0009953276,0.0011174552,0.00083641347],"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.000037321915,0.000030828618,0.0004596895,0.000049973874,0.000025402449,0.000033391396,0.000043159704,0.941376,0.0038184363,0.015723413,0.0005476296,0.037854705],"study_design_scores_gemma":[0.0000066848056,0.0000067230885,0.00003059128,0.0000022014547,0.0000028634831,0.0000051284055,0.00000252702,0.9945844,0.00075486634,0.0038869255,0.0007155511,0.0000016206429],"about_ca_topic_score_codex":0.004645244,"about_ca_topic_score_gemma":0.0060974783,"teacher_disagreement_score":0.004645244,"about_ca_system_score_codex":0.0014517496,"about_ca_system_score_gemma":0.0013818187,"threshold_uncertainty_score":0.015060306},"labels":[],"label_agreement":null},{"id":"W1980392045","doi":"10.1109/tpds.2013.126","title":"Guest Editors' Introduction: Special Issue on Cloud Computing","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Cloud computing; Data science; Operating system","score_opus":0.0097201419331557,"score_gpt":0.21563600765614496,"score_spread":0.20591586572298926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980392045","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009720162,0.006012771,0.00025323604,0.01614979,0.9743756,0.000020401165,0.000079486395,0.00006819053,0.0029433526],"genre_scores_gemma":[0.00073971716,0.0077314707,0.00021401934,0.008625441,0.96883744,0.000029080173,0.00011563759,0.00008273362,0.01362456],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979096,0.00016299973,0.00029202108,0.00038590314,0.0009740963,0.00027542468],"domain_scores_gemma":[0.98682064,0.001832088,0.0009417102,0.00034877902,0.0070712506,0.0029855962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002910837,0.0028373566,0.002647437,0.0035543595,0.0018932266,0.007152897,0.0023060795,0.0052954336,0.036252934],"category_scores_gemma":[0.009732123,0.00080382585,0.0020265866,0.0021495936,0.0007530736,0.0037687514,0.0018973915,0.007830097,0.024683721],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003096189,0.00001704533,0.00008450979,0.00016968427,0.000008071071,0.000087240165,0.000007179024,0.000049998107,0.00012577222,0.00025523157,0.98413783,0.0150265],"study_design_scores_gemma":[0.000026639129,0.00004464513,0.00061976566,0.00025941242,0.000023897614,0.00041807577,0.00002898102,0.00023900293,0.00019612952,0.00068780704,0.99743444,0.000021157357],"about_ca_topic_score_codex":0.00083519454,"about_ca_topic_score_gemma":0.0022857874,"teacher_disagreement_score":0.036252934,"about_ca_system_score_codex":0.0015100468,"about_ca_system_score_gemma":0.0018548515,"threshold_uncertainty_score":0.12127817},"labels":[],"label_agreement":null},{"id":"W1981042585","doi":"10.1109/tpds.2011.229","title":"Analysis of Impact of TXOP Allocation on IEEE 802.11e EDCA under Variable Network Load","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Toronto Metropolitan University","funders":"Science and Engineering Research Board; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Network packet; Throughput; IEEE 802; Queueing theory; Network congestion; Frame (networking); Markov chain; IEEE 802.11; Real-time computing; Quality of service; Wireless; Telecommunications","score_opus":0.034545907072160015,"score_gpt":0.26639046151789053,"score_spread":0.23184455444573052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981042585","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.9827969,0.00026541203,0.015235505,0.0001042957,0.000011932972,0.000009649957,0.00002577721,0.000071144044,0.0014793046],"genre_scores_gemma":[0.99924976,0.000040324,0.0005918026,0.000006067657,0.000002487292,0.0000020198509,0.000008571813,0.000004324935,0.000094553194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992587,0.00019735399,0.000025944748,0.00008652102,0.00023431629,0.00019710851],"domain_scores_gemma":[0.9944484,0.0044766795,0.00032359496,0.00019447746,0.00046925715,0.00008757447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010830221,0.0003431876,0.00028142915,0.00040484368,0.0004001109,0.00065521436,0.00045783038,0.00037130067,0.00073616573],"category_scores_gemma":[0.006032587,0.00017001679,0.00014492084,0.00041637797,0.000672408,0.0010961582,0.00040563662,0.0003956221,0.000062371924],"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.0007883967,0.00014730827,0.014099787,0.00009193136,0.000053491876,0.00030949202,0.00015715271,0.917808,0.038276058,0.003800786,0.00032785189,0.024139669],"study_design_scores_gemma":[0.000014047956,0.00012933175,0.005801554,0.0000044589906,0.000023437287,0.000042395473,0.00007046482,0.9837467,0.009361072,0.00064902264,0.00014614176,0.000011340095],"about_ca_topic_score_codex":0.0029791202,"about_ca_topic_score_gemma":0.0025199268,"teacher_disagreement_score":0.0029791202,"about_ca_system_score_codex":0.00090539607,"about_ca_system_score_gemma":0.00039660768,"threshold_uncertainty_score":0.006569147},"labels":[],"label_agreement":null},{"id":"W1984473368","doi":"10.1109/tpds.2003.1247668","title":"Refactoring middleware with aspects","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Software Engineering Methodologies","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Middleware (distributed applications); Common Object Request Broker Architecture; Aspect-oriented programming; Code refactoring; Modularity (biology); Message oriented middleware; Distributed computing; Software engineering; Architecture; Abstraction; Separation of concerns; Adaptability; Process (computing); Programming paradigm; AspectJ; Software architecture; Programming language; Software","score_opus":0.034331226243169526,"score_gpt":0.24575906275621184,"score_spread":0.2114278365130423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984473368","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.13685483,0.00044066602,0.8532301,0.00026480865,0.00007406277,0.00020985342,0.000091905065,0.0047677816,0.0040658712],"genre_scores_gemma":[0.30203626,0.00040205868,0.6938173,0.0001342858,0.000030438925,0.00013874855,0.00045594384,0.0012824747,0.0017024919],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9963477,0.00085723714,0.0003788699,0.00046413738,0.0017009464,0.0002510545],"domain_scores_gemma":[0.989407,0.0028714433,0.0012691453,0.0045110644,0.0017625935,0.00017885814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003589386,0.0009783496,0.00046911713,0.0015208654,0.00044121928,0.001712758,0.0015571904,0.00074738736,0.00051458686],"category_scores_gemma":[0.012291277,0.00072550896,0.0011042141,0.0010797261,0.0010494671,0.002348194,0.0023097587,0.0016965193,0.00029094506],"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.00023025056,0.0003681956,0.03369667,0.0008071886,0.0002781434,0.0016255983,0.004496882,0.13825734,0.15180908,0.0832885,0.003934642,0.5812075],"study_design_scores_gemma":[0.00006798091,0.00053938216,0.010559841,0.0003927702,0.00046686587,0.0018680521,0.001151771,0.6033981,0.19282524,0.084257655,0.10429002,0.00018241956],"about_ca_topic_score_codex":0.0017509367,"about_ca_topic_score_gemma":0.0017431339,"teacher_disagreement_score":0.003589386,"about_ca_system_score_codex":0.0006263049,"about_ca_system_score_gemma":0.0012144286,"threshold_uncertainty_score":0.018982768},"labels":[],"label_agreement":null},{"id":"W1987354455","doi":"10.1109/tpds.2014.2362139","title":"Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Cloud computing; Distributed computing; Resource allocation; Resource management (computing); Resource (disambiguation); Heuristic; Computer network; Operating system","score_opus":0.01730674927728486,"score_gpt":0.23066126557970468,"score_spread":0.2133545163024198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987354455","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.19678721,0.0007600688,0.79681253,0.00042344685,0.00010925995,0.00012680434,0.00005540363,0.00020306472,0.004722236],"genre_scores_gemma":[0.96376073,0.00014582025,0.035024602,0.000058447113,0.00003592217,0.000043871074,0.000021623353,0.000029098066,0.00087980914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980447,0.0007789561,0.000074712014,0.0002751821,0.0003919733,0.0004343684],"domain_scores_gemma":[0.9975836,0.0013937706,0.00027642632,0.0002523074,0.00023286557,0.00026110164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034456763,0.0006320637,0.0009948385,0.0006102892,0.0013005739,0.001713527,0.00159167,0.00067733624,0.0009758143],"category_scores_gemma":[0.0053209653,0.000390513,0.00046554802,0.00087721157,0.0013305899,0.002008314,0.0012918906,0.000707247,0.0001454272],"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.00011690754,0.000058320493,0.0007158512,0.000036091693,0.00003422412,0.00015766834,0.00005803631,0.96675235,0.002016782,0.021530818,0.0003820971,0.008140873],"study_design_scores_gemma":[0.000012019928,0.00001596821,0.00012288503,0.0000017755808,0.0000061769406,0.000012980626,0.000017906994,0.99270415,0.00043657984,0.006396812,0.00026842018,0.0000043718896],"about_ca_topic_score_codex":0.006717397,"about_ca_topic_score_gemma":0.004226834,"teacher_disagreement_score":0.006717397,"about_ca_system_score_codex":0.0019533322,"about_ca_system_score_gemma":0.0015290211,"threshold_uncertainty_score":0.01822269},"labels":[],"label_agreement":null},{"id":"W1987604403","doi":"10.1109/tpds.2011.53","title":"Analyzing the Resilience-Complexity Tradeoff of Network Coding in Dynamic P2P Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Linear network coding; Computer science; Coding (social sciences); Computer network; Distributed computing; Peer-to-peer; Theoretical computer science; Mathematics","score_opus":0.05830951086884093,"score_gpt":0.26508845983729284,"score_spread":0.20677894896845192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987604403","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.67404085,0.0009257226,0.31500027,0.001959295,0.00005256779,0.0000601231,0.00013851948,0.00017926963,0.0076434202],"genre_scores_gemma":[0.9930703,0.00025122098,0.0061330507,0.000032101496,0.000018144301,0.000020766112,0.000024515735,0.000014762387,0.0004351332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921775,0.00030671703,0.000021400101,0.00007050355,0.00020662116,0.00017690174],"domain_scores_gemma":[0.98293835,0.014754031,0.0009925544,0.00055287505,0.00052757165,0.00023468456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001878176,0.000509826,0.00043860526,0.0009717613,0.0005074537,0.0007225715,0.0007065897,0.0009630155,0.00074495416],"category_scores_gemma":[0.015806777,0.00031567816,0.00032885157,0.00072959193,0.0016279977,0.0024725078,0.000986816,0.00091095694,0.00007404149],"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.000051904775,0.000031188356,0.00090847816,0.000031200227,0.0000132266005,0.00006288336,0.000058006714,0.9694937,0.0022394988,0.023799285,0.00023471133,0.0030759736],"study_design_scores_gemma":[0.000003571831,0.000015857744,0.00028935613,0.0000031446448,0.0000035471355,0.000019223058,0.000018905583,0.99092215,0.00040127613,0.00825551,0.00006209807,0.00000520416],"about_ca_topic_score_codex":0.0054648826,"about_ca_topic_score_gemma":0.0026845846,"teacher_disagreement_score":0.0054648826,"about_ca_system_score_codex":0.001944369,"about_ca_system_score_gemma":0.0009710912,"threshold_uncertainty_score":0.014107406},"labels":[],"label_agreement":null},{"id":"W1992217697","doi":"10.1109/tpds.2014.2339841","title":"Enabling customer-provided resources for cloud computing: Potentials,challenges, and implementation","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Hong Kong Polytechnic University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Provisioning; Utility computing; Context (archaeology); Resource (disambiguation); Flexibility (engineering); Lease; Distributed computing; Cloud testing; Service (business); Cloud computing security; Business; Computer network; Operating system; Marketing","score_opus":0.023365384828790563,"score_gpt":0.2589391901501493,"score_spread":0.23557380532135877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992217697","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.23799324,0.027366199,0.52062416,0.07403598,0.0007710937,0.00077412726,0.0002560068,0.0011304732,0.13704877],"genre_scores_gemma":[0.891542,0.00783871,0.096048735,0.0009516384,0.00026597088,0.00016080553,0.00011029311,0.00007952089,0.0030021751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976253,0.0008912148,0.00006267401,0.00021277533,0.0007447675,0.0004632864],"domain_scores_gemma":[0.9967168,0.0012721972,0.00017948616,0.00036967656,0.0006923865,0.0007694698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042196233,0.0006092193,0.00052104593,0.00054370775,0.0016080122,0.007623605,0.002754722,0.0027088095,0.005352174],"category_scores_gemma":[0.0049022525,0.00042849203,0.00044064096,0.0013337238,0.0019580985,0.007899888,0.0036071008,0.0029328943,0.0009943916],"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.00038838797,0.00056862156,0.005930201,0.0007958916,0.000048370017,0.0006079154,0.0007648254,0.058135875,0.010993915,0.62172407,0.012315619,0.2877263],"study_design_scores_gemma":[0.00012926472,0.0006420484,0.002299197,0.0004933003,0.000048666036,0.00077685417,0.0030696795,0.5867727,0.010255361,0.2961727,0.09920827,0.00013197788],"about_ca_topic_score_codex":0.0028401332,"about_ca_topic_score_gemma":0.0034258624,"teacher_disagreement_score":0.007623605,"about_ca_system_score_codex":0.0020481776,"about_ca_system_score_gemma":0.0041803718,"threshold_uncertainty_score":0.02231574},"labels":[],"label_agreement":null},{"id":"W1996124278","doi":"10.1109/tpds.2011.302","title":"A Cloud-Based Scheme for Protecting Source-Location Privacy against Hotspot-Locating Attack in Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Hotspot (geology); Computer network; Network packet; Cloud computing; Adversary; Wireless sensor network; Adversary model; Computer security","score_opus":0.04459131439947693,"score_gpt":0.2509897226617607,"score_spread":0.20639840826228373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996124278","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.05507568,0.0008998745,0.94081885,0.00041343787,0.00016204639,0.0001701469,0.00010808441,0.00050913607,0.001842711],"genre_scores_gemma":[0.9194709,0.00042525912,0.0786879,0.00014573599,0.00007404434,0.00009300537,0.00008958982,0.000026534144,0.0009869181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984686,0.00039273896,0.000105773135,0.00026150205,0.00047153357,0.0002997307],"domain_scores_gemma":[0.99672985,0.00070161396,0.0005691896,0.0012969917,0.00046813115,0.00023430622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015563441,0.0007034329,0.0012543519,0.0009622263,0.0019730614,0.0011609591,0.0023539627,0.001252044,0.00080890756],"category_scores_gemma":[0.0032298476,0.00027261378,0.0007886273,0.0016146816,0.0010199221,0.0034598638,0.0032636004,0.0010544815,0.0002800753],"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.0021956305,0.00043985114,0.00500815,0.0005153039,0.0004151395,0.0011796852,0.0009995317,0.41278315,0.10934564,0.16669449,0.008557856,0.29186553],"study_design_scores_gemma":[0.00007632184,0.00023427002,0.0006811892,0.000027192353,0.00009337861,0.0006854132,0.00010510961,0.94955015,0.024942435,0.017852385,0.005692043,0.00006012187],"about_ca_topic_score_codex":0.0015634826,"about_ca_topic_score_gemma":0.0012689426,"teacher_disagreement_score":0.0023539627,"about_ca_system_score_codex":0.0013343762,"about_ca_system_score_gemma":0.0014472476,"threshold_uncertainty_score":0.009681582},"labels":[],"label_agreement":null},{"id":"W1998618415","doi":"10.1109/71.914756","title":"Exploiting wavefront parallelism on large-scale shared-memory multiprocessors","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Information Technology Research Centre; University of Toronto; University of Michigan","keywords":"Computer science; Parallel computing; Locality; Scheduling (production processes); Task parallelism; Data parallelism; Wavefront; Locality of reference; Instruction-level parallelism; Shared memory; Distributed memory; Parallelism (grammar); Cache; Mathematics; Mathematical optimization","score_opus":0.019747412989845194,"score_gpt":0.24647045324170663,"score_spread":0.22672304025186144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998618415","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.75852615,0.0003850783,0.23243974,0.00026844858,0.00004209418,0.00006709882,0.000056180383,0.0018234527,0.006391738],"genre_scores_gemma":[0.9469059,0.00010055046,0.051753305,0.000032613025,0.000015582538,0.000048501868,0.00008842072,0.00008282232,0.00097232877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.000118604505,0.000021506146,0.000058956324,0.00013017326,0.00010014826],"domain_scores_gemma":[0.99862254,0.0005939989,0.00013431911,0.0003637645,0.00018186723,0.000103467915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057376205,0.00045930812,0.00044303975,0.00038284133,0.0007668812,0.000670593,0.0010028754,0.00032292225,0.0013249505],"category_scores_gemma":[0.0016929158,0.00035365397,0.00032334245,0.00070275145,0.00067589857,0.0012386516,0.00097321265,0.0005057009,0.00034266614],"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.00076166546,0.00032641066,0.0051700617,0.00019581568,0.000103502214,0.00068697595,0.0003351769,0.69671386,0.15616718,0.015873298,0.0030694199,0.120596536],"study_design_scores_gemma":[0.000086354215,0.00021928514,0.0012541306,0.0000067568026,0.00002266949,0.00007423879,0.00008020065,0.9507222,0.03385644,0.01173464,0.0019282292,0.0000148802355],"about_ca_topic_score_codex":0.0020044204,"about_ca_topic_score_gemma":0.0039106477,"teacher_disagreement_score":0.0020044204,"about_ca_system_score_codex":0.00052267825,"about_ca_system_score_gemma":0.0007988582,"threshold_uncertainty_score":0.00443238},"labels":[],"label_agreement":null},{"id":"W2002857293","doi":"10.1109/tpds.2014.2360194","title":"An Analysis of Hypermesh NoCs in FPGAs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hypercube; Computer science; Metric (unit); Set (abstract data type); Parallel computing; Field-programmable gate array; Algorithm; Computer hardware; Programming language","score_opus":0.012602488681938332,"score_gpt":0.23791153494039677,"score_spread":0.22530904625845843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002857293","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.4069444,0.0019003424,0.5593456,0.00032119144,0.00007144313,0.00006524442,0.00021608447,0.00067177904,0.030463848],"genre_scores_gemma":[0.95495486,0.00091043935,0.037354745,0.000044686894,0.00001670826,0.000059611655,0.00009922384,0.000052265652,0.0065074177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998129,0.000035364574,0.0000065108115,0.000023168555,0.000095679236,0.00002628553],"domain_scores_gemma":[0.999699,0.00015672235,0.00003756558,0.00003092301,0.00006691656,0.000008852258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022377324,0.0003725084,0.00024302724,0.0005645168,0.0002437803,0.00062974927,0.00046274957,0.00032142614,0.0029972957],"category_scores_gemma":[0.001110214,0.00021441272,0.00026622342,0.00049225765,0.0003415639,0.00089432375,0.00022824472,0.0002403441,0.0002507611],"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.00002715386,0.0000063692287,0.0005058012,0.00003926909,0.000010282115,0.00009627136,0.000027498214,0.9693821,0.0034369114,0.016371503,0.00028858983,0.009808185],"study_design_scores_gemma":[0.0000014938448,0.000019078463,0.00020968536,0.0000053665985,0.000002647791,0.00003063343,0.000010890276,0.99565375,0.00083712244,0.002402565,0.00082432054,0.0000024279334],"about_ca_topic_score_codex":0.0031305696,"about_ca_topic_score_gemma":0.0026144027,"teacher_disagreement_score":0.0031305696,"about_ca_system_score_codex":0.0011462147,"about_ca_system_score_gemma":0.00049775455,"threshold_uncertainty_score":0.010026991},"labels":[],"label_agreement":null},{"id":"W2003437631","doi":"10.1109/tpds.2014.2308201","title":"Cooperative Coverage Extension for Relay-Union Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Relay; Computer network; Bandwidth (computing); Distributed computing; Quality of service; Bandwidth allocation; Heuristic; Dynamic bandwidth allocation; The Internet","score_opus":0.0279010927372669,"score_gpt":0.25711513339742925,"score_spread":0.22921404066016235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003437631","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.038969535,0.0007984074,0.9544216,0.00015724376,0.000025007794,0.000047470487,0.000045406166,0.0003016733,0.0052336645],"genre_scores_gemma":[0.9305674,0.0006120382,0.06602723,0.000073094365,0.000042492964,0.00014148741,0.00007757508,0.000026960912,0.0024317086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921596,0.00036323146,0.000019117491,0.00012861694,0.00014725079,0.00012594534],"domain_scores_gemma":[0.99852896,0.0009327108,0.00016278715,0.00017648264,0.00012230122,0.000076752054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012181149,0.0005649081,0.00067582546,0.0005805574,0.00043790136,0.000600155,0.0014092791,0.000585329,0.0016733714],"category_scores_gemma":[0.002655008,0.00027064607,0.00043255067,0.00085733196,0.0009730944,0.0011780704,0.001339313,0.0005606907,0.0002849129],"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.00020339435,0.00007937776,0.0006212255,0.00011906379,0.00005138878,0.0002875419,0.00027955856,0.8300279,0.0063372706,0.093909174,0.0021476394,0.06593636],"study_design_scores_gemma":[0.000018144474,0.00008866416,0.00013796618,0.000011272909,0.000018776604,0.00008781792,0.00003045297,0.97518694,0.001294073,0.020617597,0.002496859,0.0000114104805],"about_ca_topic_score_codex":0.0017813805,"about_ca_topic_score_gemma":0.0017537051,"teacher_disagreement_score":0.0017813805,"about_ca_system_score_codex":0.0010522958,"about_ca_system_score_gemma":0.0005650325,"threshold_uncertainty_score":0.0076349378},"labels":[],"label_agreement":null},{"id":"W2010302109","doi":"10.1109/tpds.2014.2380373","title":"Secure and Verifiable Policy Update Outsourcing for Big Data Access Control in the Cloud","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Research Grants Council, University Grants Committee; National Science Foundation","keywords":"Computer science; Cloud computing; Access control; Encryption; Outsourcing; Overhead (engineering); Big data; Computer security; Data access; Construct (python library); Volume (thermodynamics); Database; Computer network; Distributed computing; Data mining; Operating system","score_opus":0.04324047064942231,"score_gpt":0.27921644252481265,"score_spread":0.23597597187539032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010302109","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.07404338,0.00065458403,0.9182714,0.00083292957,0.00017177076,0.00029593322,0.0001226633,0.0011161119,0.004491193],"genre_scores_gemma":[0.940041,0.0002733913,0.057420712,0.00013607918,0.0000831883,0.00009013374,0.00008190913,0.00004708825,0.0018266571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99458873,0.0011504034,0.00039811208,0.0006560711,0.0024017466,0.00080495665],"domain_scores_gemma":[0.993658,0.001363903,0.00080689724,0.0029659413,0.00083375635,0.00037145065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027223728,0.00041404527,0.0010475867,0.0005381831,0.0014183992,0.0023386476,0.001355299,0.00082070485,0.0012422906],"category_scores_gemma":[0.006435687,0.00035819225,0.0007039855,0.00093895436,0.0017831739,0.0044599245,0.0026193536,0.0018938468,0.00037642536],"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.0020819383,0.0007058939,0.0053074444,0.00034955665,0.00017944153,0.0014619273,0.001372657,0.16826716,0.06474643,0.46308786,0.008919095,0.2835206],"study_design_scores_gemma":[0.00010884536,0.00012509042,0.00080843014,0.000030567615,0.00004748875,0.00045015832,0.00015809866,0.8885769,0.03136373,0.0719734,0.006296277,0.000060963797],"about_ca_topic_score_codex":0.0026318142,"about_ca_topic_score_gemma":0.0016286892,"teacher_disagreement_score":0.0027223728,"about_ca_system_score_codex":0.001934461,"about_ca_system_score_gemma":0.0035997066,"threshold_uncertainty_score":0.014397442},"labels":[],"label_agreement":null},{"id":"W2011685880","doi":"10.1109/tpds.2012.205","title":"SyRaFa: Synchronous Rate and Frequency Adjustment for Utilization Control in Distributed Real-Time Embedded Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; University of Nebraska-Lincoln","keywords":"Computer science; Workload; Setpoint; Asynchronous communication; Frequency scaling; Task (project management); Synchronization (alternating current); Distributed computing; Multi-core processor; Quality of service; Real-time computing; Parallel computing; Computer network; Operating system; Energy consumption","score_opus":0.02285363525884347,"score_gpt":0.2558623161601467,"score_spread":0.23300868090130322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011685880","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.03057626,0.00042503915,0.96657234,0.00007893688,0.00008594199,0.000058321035,0.00002321092,0.0011783021,0.0010016504],"genre_scores_gemma":[0.91526514,0.00016263139,0.08343352,0.0000649111,0.00008037075,0.00007623818,0.000036171252,0.00005171957,0.0008292991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992206,0.00018434772,0.0000584815,0.00019612785,0.00024651704,0.0000938346],"domain_scores_gemma":[0.9989887,0.00032577995,0.00022873768,0.0002042466,0.00019294793,0.000059603193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011003315,0.0008247422,0.000771255,0.0004384947,0.0005329245,0.000595991,0.001119832,0.0004730742,0.0009811602],"category_scores_gemma":[0.002699883,0.0002353038,0.00036008318,0.00030556967,0.00049445336,0.0007485353,0.00062983215,0.0006415549,0.00031362125],"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.0006548192,0.00024445736,0.0014927235,0.00018448739,0.00007472007,0.00021143146,0.0003457325,0.56132627,0.06524066,0.0133155435,0.0025657828,0.35434344],"study_design_scores_gemma":[0.000041149222,0.00011988927,0.00021623392,0.000008211272,0.000009452134,0.000048546382,0.000008853744,0.9902519,0.0065228753,0.0016056887,0.0011519829,0.000015144624],"about_ca_topic_score_codex":0.0018816387,"about_ca_topic_score_gemma":0.0021894886,"teacher_disagreement_score":0.0018816387,"about_ca_system_score_codex":0.00041239653,"about_ca_system_score_gemma":0.0009554792,"threshold_uncertainty_score":0.0058192015},"labels":[],"label_agreement":null},{"id":"W2011704806","doi":"10.1109/tpds.2013.311","title":"Optimizing the Parallel Tree-Search for Finding Shortest-Span Error-Correcting CDO Codes","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Error Correcting Code Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Speedup; Notation; Algorithm; Function (biology); Tree (set theory); Theoretical computer science; Mathematics; Combinatorics; Parallel computing; Arithmetic","score_opus":0.04601219332185101,"score_gpt":0.2909916860146083,"score_spread":0.24497949269275726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011704806","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.09772272,0.00035722597,0.89070904,0.00024051272,0.000041130435,0.00007424294,0.00020334507,0.0027259418,0.007925873],"genre_scores_gemma":[0.28607658,0.00021035681,0.70926386,0.00009375558,0.000017317438,0.0001087839,0.00045870148,0.00028740676,0.0034831753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997136,0.00005221597,0.000017645434,0.000050522078,0.00011453182,0.00005148209],"domain_scores_gemma":[0.9994236,0.00029393294,0.00004077445,0.00007230115,0.00014431306,0.000025170097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003703843,0.0004161149,0.0005262558,0.0005794391,0.00037017974,0.00048449522,0.0005206113,0.0004887303,0.0025418738],"category_scores_gemma":[0.0022812744,0.00018319531,0.0003227342,0.0009854861,0.00037144226,0.000840921,0.0004931166,0.00043096527,0.00084032986],"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.00033271778,0.00011113366,0.0019110148,0.00028294418,0.00005171903,0.00015244984,0.00017707578,0.58620447,0.02545949,0.02771739,0.006342523,0.3512571],"study_design_scores_gemma":[0.000031730444,0.000025381742,0.00018013384,0.000005601461,0.000006781467,0.0000316439,0.00002312372,0.98767555,0.005938187,0.0049686157,0.00110773,0.0000055830506],"about_ca_topic_score_codex":0.008338053,"about_ca_topic_score_gemma":0.016946817,"teacher_disagreement_score":0.008338053,"about_ca_system_score_codex":0.0007979004,"about_ca_system_score_gemma":0.0024729418,"threshold_uncertainty_score":0.016579092},"labels":[],"label_agreement":null},{"id":"W2016888570","doi":"10.1109/tpds.2010.62","title":"hiCUDA: High-Level GPGPU Programming","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":219,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CUDA; Computer science; Porting; Compiler; General-purpose computing on graphics processing units; Parallel computing; Programmer; Graphics; Software portability; Code (set theory); Operating system; Programming language; Software","score_opus":0.021005041741563767,"score_gpt":0.2438634565018963,"score_spread":0.22285841476033255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016888570","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077095157,0.00020437273,0.92301553,0.000106061154,0.000072059534,0.00014052335,0.0005793137,0.061677434,0.006495206],"genre_scores_gemma":[0.09467957,0.000352485,0.8824304,0.00035398777,0.00006892813,0.0006515844,0.0027495916,0.010667163,0.008046381],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993837,0.00014783007,0.00005203457,0.00010945808,0.0002114043,0.00009563542],"domain_scores_gemma":[0.9990138,0.00029559762,0.00008338876,0.0002560562,0.0002753844,0.0000758167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009055604,0.0008282721,0.00062975136,0.0006198454,0.00057129445,0.0014165823,0.002764957,0.00093698653,0.006661736],"category_scores_gemma":[0.0026401056,0.0006671196,0.0007310023,0.0008831368,0.000796122,0.0012368578,0.0014448403,0.0019790921,0.0035576303],"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.0010433983,0.0003267907,0.0044604638,0.0010634991,0.00019573732,0.0008503592,0.0010656052,0.10228508,0.047072522,0.08340506,0.21062477,0.54760677],"study_design_scores_gemma":[0.0003077438,0.00025337332,0.001942665,0.00011382406,0.000057109366,0.0005671963,0.00008547399,0.68347585,0.079050295,0.029390937,0.20462611,0.00012943498],"about_ca_topic_score_codex":0.002544265,"about_ca_topic_score_gemma":0.0023915102,"teacher_disagreement_score":0.006661736,"about_ca_system_score_codex":0.00045667752,"about_ca_system_score_gemma":0.0012987049,"threshold_uncertainty_score":0.02228576},"labels":[],"label_agreement":null},{"id":"W2019462775","doi":"10.1109/tpds.2014.7","title":"VMThunder: Fast Provisioning of Large-Scale Virtual Machine Clusters","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Cloud computing; Scalability; Provisioning; Virtual machine; Cache; Operating system; Distributed computing; Server; Computer network","score_opus":0.008212394550054729,"score_gpt":0.21804972072934165,"score_spread":0.2098373261792869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019462775","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.49628428,0.0019095418,0.36566398,0.0009618528,0.0007300905,0.00068402843,0.0010525467,0.12195326,0.010760414],"genre_scores_gemma":[0.8846305,0.00023703577,0.111057594,0.00017373126,0.000060878952,0.00012033645,0.0011183516,0.0011117167,0.001489886],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99911934,0.0001953289,0.000043879587,0.00014740613,0.00027704073,0.00021699702],"domain_scores_gemma":[0.9981494,0.0003876295,0.00020326697,0.0006444668,0.00024127918,0.00037399714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158633,0.0007588888,0.00047807256,0.0006291191,0.00072117266,0.0010169593,0.002786923,0.0005145955,0.0017311282],"category_scores_gemma":[0.0039398735,0.00052242796,0.0002887281,0.0006125178,0.0005983536,0.0018835516,0.0022466956,0.0009304331,0.0004008275],"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.0041377516,0.00080521853,0.015218075,0.00060824055,0.00035011687,0.0008417848,0.00069366203,0.26416314,0.110952646,0.016398698,0.107908115,0.4779226],"study_design_scores_gemma":[0.0003069197,0.00049195817,0.003813352,0.000023789304,0.000034145964,0.00022308303,0.00014105515,0.92888147,0.041045584,0.0045794407,0.020367688,0.00009150674],"about_ca_topic_score_codex":0.00307898,"about_ca_topic_score_gemma":0.0028261917,"teacher_disagreement_score":0.00307898,"about_ca_system_score_codex":0.0007680883,"about_ca_system_score_gemma":0.0012344845,"threshold_uncertainty_score":0.0061275363},"labels":[],"label_agreement":null},{"id":"W2022358097","doi":"10.1109/tpds.2011.208","title":"An MDP-Based Dynamic Optimization Methodology for Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Node (physics); Markov decision process; Sensor node; Process (computing); Key distribution in wireless sensor networks; Wireless; Domain (mathematical analysis); Distributed computing; Markov process; Computer network; Wireless network; Telecommunications","score_opus":0.047113834955460565,"score_gpt":0.2665741528290346,"score_spread":0.21946031787357406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022358097","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.0015740345,0.00010659636,0.99721473,0.00010780279,0.000015433065,0.000040893647,0.000023720146,0.000065765365,0.00085094257],"genre_scores_gemma":[0.36294863,0.00068752246,0.632127,0.00020601877,0.00007686467,0.000901961,0.00016228485,0.00012241263,0.0027673594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904686,0.00045402683,0.000045932982,0.00012774346,0.0002454456,0.00007991779],"domain_scores_gemma":[0.9981458,0.0013743292,0.00017262601,0.00006962693,0.00017220114,0.00006537702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023350103,0.001114648,0.00095315796,0.00072543736,0.00054414483,0.0008724815,0.0014940418,0.0010816993,0.002430566],"category_scores_gemma":[0.0043235426,0.00058013346,0.0010054872,0.0007378676,0.0010423805,0.0010405302,0.0014178008,0.0015871434,0.00030132337],"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.000013580313,0.000015210128,0.00009288889,0.00003926623,0.0000150087,0.000022486167,0.000018168688,0.9742364,0.00032125998,0.016028255,0.00026807073,0.008929384],"study_design_scores_gemma":[0.000005346812,0.000011133144,0.00001079475,0.000004103216,0.0000026388464,0.00000462115,0.000002419351,0.99338293,0.00010482371,0.006148309,0.0003206214,0.0000023348089],"about_ca_topic_score_codex":0.0035456188,"about_ca_topic_score_gemma":0.0033431945,"teacher_disagreement_score":0.0035456188,"about_ca_system_score_codex":0.0012356272,"about_ca_system_score_gemma":0.0020908804,"threshold_uncertainty_score":0.01234889},"labels":[],"label_agreement":null},{"id":"W2028689663","doi":"10.1109/tpds.2013.208","title":"On Arbitrating the Power-Performance Tradeoff in SaaS Clouds","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cloud computing; Distributed computing; Benchmark (surveying); Scheduling (production processes); Robustness (evolution); Software as a service; Admission control; Revenue; Profit maximization; Profit (economics); Mathematical optimization; Software; Computer network; Quality of service; Operating system; Software development","score_opus":0.012132184929071888,"score_gpt":0.20873610657631972,"score_spread":0.19660392164724783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028689663","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.0364398,0.001183199,0.9476053,0.00095938664,0.000080508915,0.0000627254,0.000032549735,0.00016084049,0.013475747],"genre_scores_gemma":[0.968422,0.000880897,0.028638886,0.00010290517,0.000062568004,0.000046634792,0.000011681635,0.000045269182,0.0017891867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901104,0.0003145835,0.00003015148,0.0001301448,0.00031793313,0.00019615817],"domain_scores_gemma":[0.9988187,0.0007481033,0.00014757976,0.00006866527,0.00016705954,0.000049873168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016627682,0.0011703662,0.00074982253,0.0005056296,0.00075295556,0.002148012,0.0011405933,0.0008729863,0.0016520512],"category_scores_gemma":[0.0041221045,0.00042039785,0.00039319473,0.0007681784,0.0013879872,0.0021107853,0.0008608042,0.0011899519,0.00020169455],"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.000036837348,0.000038232007,0.00022340904,0.000055602526,0.000014281409,0.00006079183,0.00005734686,0.90832084,0.003925815,0.074643336,0.0004587246,0.012164769],"study_design_scores_gemma":[0.000002910621,0.000023749559,0.00006506377,0.000008131897,0.0000043670357,0.000012108117,0.00002217516,0.98521197,0.00056987774,0.013550578,0.0005233443,0.0000057045872],"about_ca_topic_score_codex":0.0038352024,"about_ca_topic_score_gemma":0.0030742823,"teacher_disagreement_score":0.0038352024,"about_ca_system_score_codex":0.0018295428,"about_ca_system_score_gemma":0.0018838753,"threshold_uncertainty_score":0.013274372},"labels":[],"label_agreement":null},{"id":"W2031708312","doi":"10.1109/tpds.2014.2308218","title":"Shared Authority Based Privacy-Preserving Authentication Protocol in Cloud Computing","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":98,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Cloud computing; Computer security; Access control; Authentication (law); Anonymity; Encryption; Data sharing; Information privacy; Cloud computing security; Internet privacy","score_opus":0.028446301739053395,"score_gpt":0.2812047719963714,"score_spread":0.252758470257318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031708312","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.01313931,0.00050755584,0.9781396,0.0006572829,0.00020890568,0.0002797451,0.00006424235,0.00057451177,0.006428847],"genre_scores_gemma":[0.85641927,0.000971269,0.13374789,0.0003086873,0.00022062528,0.0006325522,0.00017057739,0.00008076247,0.0074483263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99370486,0.0018068993,0.0006358457,0.001159166,0.0019556703,0.0007375588],"domain_scores_gemma":[0.99629253,0.0010824861,0.00045731693,0.0011495061,0.00078318664,0.00023492686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028054763,0.000666018,0.00097577524,0.0010100275,0.0025695844,0.0026051407,0.0020447215,0.001781227,0.0019400342],"category_scores_gemma":[0.0055015255,0.00045508574,0.0012064627,0.0019439501,0.0031875249,0.006544527,0.004482191,0.0028543577,0.00071220676],"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.0004616457,0.0001303006,0.000912717,0.0003394603,0.00008800888,0.0012911964,0.0012932982,0.050063606,0.022456918,0.8676467,0.0044452106,0.050870948],"study_design_scores_gemma":[0.00018116883,0.0002833329,0.00035106164,0.0001084455,0.00013741912,0.0014118872,0.00033038447,0.6145788,0.030365234,0.3166751,0.035395876,0.00018132993],"about_ca_topic_score_codex":0.0018329064,"about_ca_topic_score_gemma":0.00080622913,"teacher_disagreement_score":0.0028054763,"about_ca_system_score_codex":0.0015940722,"about_ca_system_score_gemma":0.0036970149,"threshold_uncertainty_score":0.014836907},"labels":[],"label_agreement":null},{"id":"W2035694933","doi":"10.1109/tpds.2013.69","title":"Temporal Load Balancing with Service Delay Guarantees for Data Center Energy Cost Optimization","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Workload; Data center; Cloud computing; Server; Schedule; Exploit; Queue; Operations research; Computer network; Computer security; Operating system; Engineering","score_opus":0.020677813610856903,"score_gpt":0.22504379624776744,"score_spread":0.20436598263691053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035694933","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.030222815,0.00044538028,0.9649523,0.00029728172,0.00006988067,0.00010143577,0.00008854965,0.0004078388,0.0034145575],"genre_scores_gemma":[0.9057671,0.00025367344,0.091720566,0.00011537524,0.00009134526,0.00012264987,0.00009978184,0.00010230389,0.0017271787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923706,0.0001799908,0.000035637855,0.0001203527,0.0002749869,0.00015194967],"domain_scores_gemma":[0.9989242,0.0005782663,0.0001614441,0.000060134076,0.0002024057,0.000073511546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014342258,0.0010404597,0.0008689256,0.00062428997,0.0005600349,0.0010819816,0.0013239016,0.0005338798,0.00224953],"category_scores_gemma":[0.0034426716,0.00033414032,0.00031041514,0.0010106156,0.00039369546,0.0010008486,0.0006754086,0.00081593456,0.0002590535],"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.00018584057,0.000098092896,0.00040413323,0.00006916951,0.0000235129,0.00002661778,0.000031725758,0.94771475,0.0042558624,0.0091319475,0.0012607588,0.036797605],"study_design_scores_gemma":[0.000006962997,0.000018141047,0.000047301484,0.0000013681566,0.0000028899697,0.0000048167194,0.000003467355,0.9979673,0.00037164098,0.0013857126,0.00018851289,0.0000018443791],"about_ca_topic_score_codex":0.003949655,"about_ca_topic_score_gemma":0.0046082507,"teacher_disagreement_score":0.003949655,"about_ca_system_score_codex":0.0017980274,"about_ca_system_score_gemma":0.0022402797,"threshold_uncertainty_score":0.013045728},"labels":[],"label_agreement":null},{"id":"W2051996845","doi":"10.1109/tpds.2014.2385697","title":"Optimal Online Multi-Instance Acquisition in IaaS Clouds","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Competitive analysis; Online algorithm; Purchasing; Randomized algorithm; Reservation; A priori and a posteriori; Term (time); Cloud computing; Service (business); Distributed computing; Mathematical optimization; Algorithm; Computer network; Upper and lower bounds","score_opus":0.058174685952497945,"score_gpt":0.3356706275550473,"score_spread":0.2774959416025493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051996845","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.25680178,0.0012781483,0.72319216,0.0013724747,0.00013510103,0.00052607595,0.00026903677,0.0033946699,0.013030523],"genre_scores_gemma":[0.84693813,0.00012507159,0.15065107,0.00020937782,0.000044868844,0.00013035152,0.00016096263,0.00013994094,0.0016002874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968342,0.0009633699,0.0001255662,0.0007028491,0.0004634597,0.0009105811],"domain_scores_gemma":[0.995093,0.0026806502,0.00053311326,0.000798641,0.00028509003,0.00060953735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003060488,0.001381974,0.0028522292,0.00064534135,0.0010401906,0.0023457555,0.003529481,0.0016718681,0.0037843285],"category_scores_gemma":[0.008208502,0.0011206939,0.0009971956,0.0015409507,0.0013616002,0.0042942753,0.0028028574,0.0021140107,0.00074135215],"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.0009463964,0.0006297746,0.0026130842,0.00011395754,0.000088467044,0.00013969747,0.00011137877,0.8613009,0.002636333,0.015763447,0.0036523596,0.11200423],"study_design_scores_gemma":[0.00004771782,0.000048356327,0.00020342453,0.000004074845,0.000010665607,0.00003366579,0.000026727119,0.99295264,0.0005400914,0.005839822,0.000284533,0.000008234232],"about_ca_topic_score_codex":0.006324539,"about_ca_topic_score_gemma":0.0059050256,"teacher_disagreement_score":0.006324539,"about_ca_system_score_codex":0.0021422582,"about_ca_system_score_gemma":0.00359919,"threshold_uncertainty_score":0.016185582},"labels":[],"label_agreement":null},{"id":"W2054092574","doi":"10.1109/tpds.2007.1016","title":"Design of Adaptive PI Rate Controller for Best-Effort Traffic in the Internet Based on Phase Margin","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; University of Ottawa","keywords":"Active queue management; Computer science; Router; Phase margin; Robustness (evolution); Controller (irrigation); Network congestion; Control theory (sociology); PID controller; Adaptive control; Queue; Real-time computing; Packet loss; Network packet; Computer network; Bandwidth (computing); Control engineering; Amplifier; Engineering; Control (management)","score_opus":0.03307635050854029,"score_gpt":0.2640754187643328,"score_spread":0.23099906825579253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054092574","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.009147059,0.00021180129,0.9876654,0.00010081224,0.000093618764,0.000079931866,0.000009725379,0.00079395913,0.0018976867],"genre_scores_gemma":[0.79535073,0.00040266427,0.20119666,0.00020899215,0.00018730164,0.00028891925,0.000051734314,0.000058557456,0.0022544542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958414,0.00005936747,0.000027620343,0.000108553904,0.00017989198,0.00004040291],"domain_scores_gemma":[0.99950707,0.00011986603,0.00007013415,0.000034435663,0.00024546828,0.000022950628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006012657,0.00054107164,0.00046892153,0.00044491634,0.00042257112,0.0007181677,0.0014833912,0.00066022214,0.0012616058],"category_scores_gemma":[0.0012332897,0.00025001794,0.0003166871,0.00023957652,0.00035090547,0.000628385,0.0003399176,0.0007557145,0.00038545078],"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.0005312025,0.00039258527,0.002301788,0.0005305646,0.00015832287,0.00058323995,0.0004564874,0.31052294,0.19286169,0.041629583,0.004843354,0.44518828],"study_design_scores_gemma":[0.00010157638,0.00020198178,0.00030958504,0.000011670989,0.000036936774,0.00013664085,0.00001248637,0.9776084,0.016202692,0.0022554863,0.0031006327,0.000021967327],"about_ca_topic_score_codex":0.0010710035,"about_ca_topic_score_gemma":0.0007415215,"teacher_disagreement_score":0.0014833912,"about_ca_system_score_codex":0.00036373918,"about_ca_system_score_gemma":0.00053671637,"threshold_uncertainty_score":0.004220426},"labels":[],"label_agreement":null},{"id":"W2054340180","doi":"10.1109/tpds.2011.72","title":"On the Market Power of Network Coding in P2P Content Distribution Systems","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stochastic game; Linear network coding; Market power; Coding (social sciences); Maximization; Microeconomics; Mathematical optimization; Economics; Computer security","score_opus":0.07201355426891218,"score_gpt":0.2416660465813466,"score_spread":0.16965249231243443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054340180","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.22986132,0.0020221805,0.6871213,0.006343255,0.00014603663,0.00018530063,0.00018649767,0.00014447587,0.07398967],"genre_scores_gemma":[0.9804545,0.0007530402,0.01560015,0.0001351335,0.00013100386,0.000083976505,0.000026986958,0.000039829785,0.002775405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977723,0.0012058326,0.000060675815,0.00021375023,0.00047074392,0.0002767002],"domain_scores_gemma":[0.98051065,0.016361972,0.0011287787,0.0007007392,0.0008315269,0.000466292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037811263,0.0007066739,0.0011675851,0.0010297697,0.0015098124,0.0040058903,0.0014741676,0.0018391913,0.004742282],"category_scores_gemma":[0.018813724,0.00065430393,0.0007476777,0.0011387788,0.005140506,0.008629373,0.0020288967,0.00224855,0.00032410814],"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.00006735927,0.00004617709,0.0004008346,0.00006863182,0.000020527496,0.00016539868,0.00017147316,0.15869653,0.0010446752,0.83169764,0.00084945915,0.006771339],"study_design_scores_gemma":[0.000029607032,0.000042112635,0.00022164472,0.000020821613,0.000011459682,0.0000801512,0.00008355401,0.5702423,0.00034828877,0.42782325,0.0010734053,0.00002339381],"about_ca_topic_score_codex":0.0024989685,"about_ca_topic_score_gemma":0.0017696376,"teacher_disagreement_score":0.004742282,"about_ca_system_score_codex":0.0024951962,"about_ca_system_score_gemma":0.0017232619,"threshold_uncertainty_score":0.019996762},"labels":[],"label_agreement":null},{"id":"W2054526666","doi":"10.1109/tpds.2014.2366113","title":"Exploiting Pipelined Encoding Process to Boost Erasure-Coded Data Archival","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Center for Scientific Review; National Key Research and Development Program of China; Canadian Psychological Association; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Computer science; Redundancy (engineering); Encoding (memory); Data redundancy; Erasure code; Theoretical computer science; Parallel computing; Algorithm; Decoding methods; Database; Artificial intelligence; Operating system","score_opus":0.04636769643603276,"score_gpt":0.28526109257458027,"score_spread":0.23889339613854751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054526666","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.1702848,0.00095068495,0.8116661,0.00055440434,0.00026596047,0.00023656906,0.00021915711,0.00995108,0.005871225],"genre_scores_gemma":[0.6880305,0.00040483318,0.30364186,0.00019035646,0.00011934126,0.00015169595,0.0004010045,0.00037498216,0.0066854837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875975,0.00017857495,0.00009714194,0.00023304562,0.0005211277,0.0002104063],"domain_scores_gemma":[0.99376935,0.0013230217,0.00048126097,0.0026992497,0.0014685661,0.0002586521],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016102568,0.0007880669,0.0006595989,0.0013510669,0.001238148,0.0015723596,0.0020003838,0.000620331,0.0030099556],"category_scores_gemma":[0.006054554,0.0005135013,0.00042930484,0.001400293,0.0009503057,0.004424942,0.0022872742,0.00124981,0.0010530264],"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.0018828283,0.00074409624,0.006338604,0.00043595734,0.000100283665,0.00054788834,0.0013385969,0.12741253,0.29571283,0.06083413,0.011449672,0.49320257],"study_design_scores_gemma":[0.0001580132,0.0007144973,0.0013680336,0.000046392488,0.00008358049,0.0004662755,0.00032825765,0.5659959,0.38252452,0.022882624,0.025316678,0.00011534272],"about_ca_topic_score_codex":0.0025391104,"about_ca_topic_score_gemma":0.0032720708,"teacher_disagreement_score":0.0030099556,"about_ca_system_score_codex":0.0012771831,"about_ca_system_score_gemma":0.002782376,"threshold_uncertainty_score":0.010069251},"labels":[],"label_agreement":null},{"id":"W2059178284","doi":"10.1109/tpds.2012.39","title":"A Distributed Constraint Satisfaction Problem Approach to Virtual Device Composition","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Constraint (computer-aided design); Mobile device; Node (physics); Composition (language); Upgrade; Mobile ad hoc network; Constraint satisfaction problem; Virtual machine; Adaptation (eye); Service (business); Computer network; Operating system","score_opus":0.016707945165814527,"score_gpt":0.23132944282671178,"score_spread":0.21462149766089725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059178284","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.003219094,0.00020886971,0.9915821,0.0004583109,0.00006907545,0.00013676459,0.000121095436,0.000109144254,0.0040955334],"genre_scores_gemma":[0.1770917,0.00064066664,0.8131806,0.00035340435,0.0002324919,0.0007399987,0.0004810896,0.00014747084,0.007132507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996912,0.0014618208,0.00014941489,0.00057007244,0.0006573161,0.00024932955],"domain_scores_gemma":[0.9954347,0.0034773117,0.00019321401,0.00023320242,0.00045781076,0.00020373047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030967128,0.0017078771,0.001626306,0.0009756716,0.0012405696,0.002217187,0.0029586905,0.0020357324,0.0065366174],"category_scores_gemma":[0.007540041,0.00078738073,0.001738462,0.0023597854,0.0016404251,0.0022283685,0.002588835,0.0028692246,0.000670248],"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.00007292753,0.00012544273,0.00027005828,0.00019424042,0.00009425291,0.0002516066,0.00012988148,0.8548932,0.00067749835,0.10549858,0.004280199,0.033512075],"study_design_scores_gemma":[0.000042440704,0.000032688222,0.00004280932,0.000010904915,0.000015117596,0.000048871785,0.00003854921,0.9559056,0.00024920798,0.04078272,0.0028207751,0.000010307565],"about_ca_topic_score_codex":0.008438554,"about_ca_topic_score_gemma":0.0077812835,"teacher_disagreement_score":0.008438554,"about_ca_system_score_codex":0.0017971531,"about_ca_system_score_gemma":0.0027069242,"threshold_uncertainty_score":0.021867096},"labels":[],"label_agreement":null},{"id":"W2066493245","doi":"10.1109/tpds.2013.260","title":"Expansion Properties of Topology for Networking of Information in Cloud","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Network topology; Distributed computing; Linear network coding; Computer network; Internet topology; The Internet; Information-centric networking; Network architecture; Reliability (semiconductor); World Wide Web","score_opus":0.03776056023272789,"score_gpt":0.24637992672485787,"score_spread":0.20861936649212998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066493245","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.057337526,0.00068038015,0.9271505,0.0009311941,0.00007578331,0.00012325787,0.00013731356,0.00023391594,0.013330144],"genre_scores_gemma":[0.8496623,0.0019614515,0.14234956,0.00024458708,0.00016669356,0.0003029077,0.00025289028,0.00015291979,0.0049067163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994623,0.00025052397,0.00001716485,0.0000653971,0.00015821744,0.000046358717],"domain_scores_gemma":[0.995596,0.003155427,0.00034111142,0.0004230691,0.00034623902,0.0001382348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008876269,0.00030497013,0.00038485316,0.0010032888,0.0007160651,0.0010110817,0.0006421807,0.0006473628,0.0021141598],"category_scores_gemma":[0.00827062,0.0002494755,0.00041779224,0.0007725592,0.001057956,0.0019312219,0.00090513896,0.0011273146,0.00024870888],"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.00008818408,0.000035345645,0.0008952296,0.00015212278,0.000017281198,0.00024679795,0.0002941225,0.42906752,0.00820588,0.52451146,0.0027889656,0.03369703],"study_design_scores_gemma":[0.00000889725,0.000028222788,0.00030102726,0.000018024142,0.000008796824,0.00019047684,0.000053512158,0.890533,0.0012855013,0.10460123,0.0029595061,0.000011843902],"about_ca_topic_score_codex":0.0019289007,"about_ca_topic_score_gemma":0.0016991113,"teacher_disagreement_score":0.0021141598,"about_ca_system_score_codex":0.0009923602,"about_ca_system_score_gemma":0.0005951483,"threshold_uncertainty_score":0.007200122},"labels":[],"label_agreement":null},{"id":"W2067583486","doi":"10.1109/tpds.2008.80","title":"Cooperative Secondary Authorization Recycling","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Authorization; Scalability; Server; Cache; Software deployment; Authorization certificate; Computer network; Distributed computing; Computer security; Operating system; Public-key cryptography; Certificate authority","score_opus":0.028073293452751984,"score_gpt":0.22803265951832696,"score_spread":0.199959366065575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067583486","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.22725879,0.0006624697,0.72378755,0.0005771621,0.0001653604,0.0011197331,0.0002521872,0.024490938,0.021685733],"genre_scores_gemma":[0.91152257,0.00014914385,0.073143356,0.00026969038,0.00008448586,0.00024028268,0.00033812204,0.00045044796,0.013801887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956831,0.0010286368,0.00031635858,0.0008484291,0.0014144836,0.00070900534],"domain_scores_gemma":[0.9778315,0.0034852386,0.0015780238,0.012018673,0.004091018,0.0009955034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037387596,0.0011112473,0.0017345755,0.0019268254,0.002318512,0.002414933,0.0034739033,0.0012887175,0.00602369],"category_scores_gemma":[0.009485149,0.00058595504,0.0009824801,0.0014062364,0.0017901235,0.0037981237,0.0044475477,0.00165746,0.002756939],"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.0035220499,0.002073428,0.0147876395,0.00065708155,0.00036446663,0.0016119308,0.0030667442,0.048307456,0.1917836,0.049986582,0.024066433,0.65977263],"study_design_scores_gemma":[0.00041892275,0.0017292707,0.0072263693,0.0001518649,0.00036343499,0.004744043,0.001160747,0.5618344,0.28029358,0.041805986,0.09986749,0.00040398113],"about_ca_topic_score_codex":0.0035737695,"about_ca_topic_score_gemma":0.0028188305,"teacher_disagreement_score":0.00602369,"about_ca_system_score_codex":0.0012135786,"about_ca_system_score_gemma":0.0028582609,"threshold_uncertainty_score":0.020151198},"labels":[],"label_agreement":null},{"id":"W2077573477","doi":"10.1109/tpds.2012.337","title":"Enabling Dynamic Data and Indirect Mutual Trust for Cloud Computing Storage Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Cloud computing; Outsourcing; Server; Cloud storage; Block (permutation group theory); File server; Service provider; Scheme (mathematics); Computer network; Computer security; Database; Distributed computing; Service (business); Operating system","score_opus":0.04211926559478843,"score_gpt":0.2794365580260815,"score_spread":0.2373172924312931,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077573477","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.09446979,0.0010571223,0.8898261,0.0020408733,0.0001541666,0.00033375283,0.00013620175,0.00090014667,0.011081786],"genre_scores_gemma":[0.93699974,0.00030488477,0.060174238,0.000100117235,0.000078907935,0.00011465652,0.0000628965,0.000052242078,0.0021123888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99408937,0.0016382876,0.0005232702,0.0004902698,0.0023149685,0.00094378996],"domain_scores_gemma":[0.98962796,0.002914299,0.0011214454,0.004237242,0.0015024105,0.00059665827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035097636,0.0004913679,0.000926113,0.0006410889,0.0025851242,0.0035770906,0.002142821,0.0013530079,0.0023014916],"category_scores_gemma":[0.010999178,0.00057555427,0.0006528694,0.0012501767,0.0025949664,0.009234997,0.008309092,0.002075173,0.00062996603],"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.001375898,0.00028805697,0.003942502,0.0005256023,0.00014882028,0.0011515771,0.002223295,0.15248805,0.042695545,0.64223635,0.009037121,0.14388728],"study_design_scores_gemma":[0.00015223271,0.00020637845,0.00073090725,0.000058026642,0.00007175536,0.0006837448,0.00039949056,0.7967336,0.024145523,0.15645638,0.020243345,0.00011859978],"about_ca_topic_score_codex":0.0026806516,"about_ca_topic_score_gemma":0.0027098171,"teacher_disagreement_score":0.0035770906,"about_ca_system_score_codex":0.002734426,"about_ca_system_score_gemma":0.0033985432,"threshold_uncertainty_score":0.019839704},"labels":[],"label_agreement":null},{"id":"W2081531839","doi":"10.1109/tpds.2011.179","title":"DCS: Distributed Asynchronous Clock Synchronization in Delay Tolerant Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Clock synchronization; Asynchronous communication; Computer science; Synchronization (alternating current); Clock drift; Convergence (economics); Self-clocking signal; Master clock; Protocol (science); Clock network; Network Time Protocol; Computer network; Distributed computing; Real-time computing; Clock skew; Clock signal; Time synchronization; Jitter","score_opus":0.023286434116356978,"score_gpt":0.21662416583012437,"score_spread":0.1933377317137674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081531839","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.010108407,0.00088237243,0.9833346,0.00028242663,0.00042230196,0.00012750001,0.00008436161,0.0006175134,0.0041404683],"genre_scores_gemma":[0.7156549,0.0021646104,0.27236336,0.00039946765,0.0004640197,0.00045205932,0.00039339587,0.000109414636,0.007998788],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994355,0.00014915192,0.000048566464,0.0001053255,0.00021313905,0.000048206348],"domain_scores_gemma":[0.9992611,0.0002574056,0.00009950652,0.000108440196,0.00021132898,0.000062222156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006070458,0.00042975976,0.00048348485,0.0005792232,0.00060626754,0.00087793113,0.0012364491,0.00046145977,0.0017351867],"category_scores_gemma":[0.0014708717,0.00013239031,0.00021552487,0.00096201454,0.00069486146,0.0011080867,0.00090404606,0.00066225644,0.0004209099],"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.00074549264,0.00011837163,0.0011740326,0.0008127247,0.00008649631,0.00040777173,0.0003438078,0.28163707,0.04548696,0.29108283,0.012621781,0.36548263],"study_design_scores_gemma":[0.00023016894,0.0003728607,0.00027248182,0.000067330555,0.00009094806,0.00039371985,0.00014666595,0.8191164,0.03271965,0.049583167,0.09693911,0.00006752352],"about_ca_topic_score_codex":0.0012355761,"about_ca_topic_score_gemma":0.0011974479,"teacher_disagreement_score":0.0017351867,"about_ca_system_score_codex":0.00069348013,"about_ca_system_score_gemma":0.0010251851,"threshold_uncertainty_score":0.005804777},"labels":[],"label_agreement":null},{"id":"W2085957933","doi":"10.1109/71.983940","title":"Performance of CORBA-based client-server architectures","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"University of Saskatchewan","keywords":"Common Object Request Broker Architecture; Computer science; Orb (optics); Object request broker; Server; Middleware (distributed applications); Operating system; Client–server model; Distributed computing; Workstation; Client; Distributed object","score_opus":0.019602157033652774,"score_gpt":0.21620264224521027,"score_spread":0.19660048521155749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085957933","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.85495496,0.0017653493,0.081003726,0.0007461402,0.0002779999,0.00035582695,0.0007963383,0.021249203,0.038850438],"genre_scores_gemma":[0.98186433,0.0003281159,0.012532589,0.000056161323,0.000020079437,0.00011952208,0.0009869026,0.00042670697,0.003665606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99073225,0.0020801937,0.00046945646,0.00061296934,0.0050840257,0.0010211508],"domain_scores_gemma":[0.9931391,0.0019168729,0.0003163741,0.0010627279,0.0032060826,0.00035890934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003997676,0.0013053854,0.0009100756,0.0014505639,0.0013210551,0.0028766994,0.0026364506,0.0012559516,0.0039409776],"category_scores_gemma":[0.010491873,0.00056623475,0.00042960656,0.0021874,0.00064521405,0.002012263,0.0011529168,0.0010902637,0.0023626217],"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.0057947454,0.0021093031,0.018958578,0.0010208264,0.00047403527,0.0006540564,0.0015503565,0.55220634,0.15826347,0.019990757,0.015964216,0.22301333],"study_design_scores_gemma":[0.00016343633,0.0007796896,0.012007247,0.00004200768,0.000093335984,0.00018719904,0.0003205762,0.9033305,0.07058363,0.0034915612,0.008885965,0.00011475037],"about_ca_topic_score_codex":0.011489948,"about_ca_topic_score_gemma":0.0034823436,"teacher_disagreement_score":0.011489948,"about_ca_system_score_codex":0.0025561992,"about_ca_system_score_gemma":0.0022094704,"threshold_uncertainty_score":0.022846162},"labels":[],"label_agreement":null},{"id":"W2088168088","doi":"10.1109/tpds.2012.106","title":"A Secure Payment Scheme with Low Communication and Processing Overhead for Multihop Wireless Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Cheating; Computer science; Computer network; Computer security; Overhead (engineering); Payment; Network packet; Cryptography; Node (physics)","score_opus":0.02406952966581572,"score_gpt":0.26031407644526167,"score_spread":0.23624454677944595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088168088","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.021800188,0.0007579963,0.97442484,0.00035069635,0.00022206764,0.0002600208,0.000059170306,0.00067595823,0.0014491784],"genre_scores_gemma":[0.68659765,0.0008641125,0.3073027,0.00021518786,0.00027554831,0.00047881267,0.0001353506,0.00007375957,0.0040567867],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975516,0.00073920324,0.00024102822,0.00025364038,0.0009787772,0.00023568001],"domain_scores_gemma":[0.9964149,0.0010193175,0.000729116,0.0010142215,0.00062840775,0.00019408607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445339,0.000733618,0.0011100507,0.0010398161,0.0014968186,0.0014514059,0.002229393,0.0012039486,0.001769982],"category_scores_gemma":[0.005539379,0.00044321147,0.0006933041,0.001235312,0.0010475282,0.004775721,0.0023310115,0.0015984921,0.0006771936],"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.0016435767,0.00049282855,0.0019609109,0.0007618021,0.00018611051,0.0010181675,0.00064222736,0.15200256,0.073355004,0.34553456,0.012049035,0.41035327],"study_design_scores_gemma":[0.0002613379,0.0007549489,0.0006475557,0.000057268277,0.000118710406,0.0009910305,0.00006548487,0.902867,0.01637264,0.057786867,0.019905807,0.00017132619],"about_ca_topic_score_codex":0.0005027065,"about_ca_topic_score_gemma":0.00035400174,"teacher_disagreement_score":0.002445339,"about_ca_system_score_codex":0.001003457,"about_ca_system_score_gemma":0.0014458329,"threshold_uncertainty_score":0.01293236},"labels":[],"label_agreement":null},{"id":"W2090546645","doi":"10.1109/tpds.2015.2417163","title":"Achieving Optimal Block Pipelining in Organized Network Coded Gossip","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Linear network coding; Gossip; Network topology; Block (permutation group theory); Permutation (music); Random permutation; Overhead (engineering); Theoretical computer science; Algorithm; Topology (electrical circuits); Combinatorics; Mathematics; Computer network","score_opus":0.048527948835656455,"score_gpt":0.26994644799408163,"score_spread":0.22141849915842518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090546645","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.18647473,0.0000864534,0.80938196,0.00016788655,0.000017974626,0.00007944979,0.00008043724,0.0005467155,0.0031643314],"genre_scores_gemma":[0.89301425,0.00007000876,0.10533749,0.000051623985,0.0000108014465,0.00010490985,0.00007309451,0.00005692574,0.0012808682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.00020931079,0.00002733396,0.00009264579,0.0001490062,0.000102373066],"domain_scores_gemma":[0.99696404,0.0018029662,0.00037835664,0.00045672132,0.00023024337,0.00016768143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440144,0.00038688647,0.00041544286,0.0003371165,0.00039240744,0.0004970547,0.00083808287,0.00046828634,0.00067429617],"category_scores_gemma":[0.00506294,0.0002562477,0.00021171189,0.00039155118,0.0010967551,0.0010447452,0.00071153644,0.0005022309,0.00019521496],"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.00039421843,0.00012801585,0.0007074128,0.00012796703,0.000028271046,0.00019509422,0.00028858532,0.81469136,0.047126796,0.0984711,0.0013113642,0.036529955],"study_design_scores_gemma":[0.000026615797,0.0000797663,0.00008374973,0.000004201755,0.000005803634,0.00002504387,0.000021900449,0.9757165,0.007835764,0.015791062,0.00040214707,0.0000074848695],"about_ca_topic_score_codex":0.0021437632,"about_ca_topic_score_gemma":0.0027572345,"teacher_disagreement_score":0.0021437632,"about_ca_system_score_codex":0.00081293576,"about_ca_system_score_gemma":0.0013793429,"threshold_uncertainty_score":0.005898297},"labels":[],"label_agreement":null},{"id":"W2092992358","doi":"10.1109/tpds.2011.192","title":"Distributed Throughput Optimization for ZigBee Cluster-Tree Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Council; Intel Corporation","keywords":"Computer science; Computer network; NeuRFon; Network topology; Wireless sensor network; Throughput; Wireless; Wireless network; Bandwidth (computing); Tree (set theory); Distributed computing; Key distribution in wireless sensor networks","score_opus":0.025922990963448383,"score_gpt":0.2233344299203935,"score_spread":0.19741143895694513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092992358","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.009936571,0.00027908702,0.987205,0.00012605342,0.000023122404,0.000052883413,0.000040698436,0.00014414644,0.0021923473],"genre_scores_gemma":[0.7204778,0.0008550872,0.27222937,0.00008195347,0.00006346634,0.0004277163,0.00019422533,0.00014526842,0.005525111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993267,0.0002307569,0.000017905184,0.00012642506,0.00020091093,0.0000974054],"domain_scores_gemma":[0.9991253,0.00055705314,0.000092571725,0.000036157213,0.00014720585,0.000041691655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016538823,0.00094674545,0.0008495876,0.0007093107,0.00070632313,0.0010154684,0.0015463032,0.0007583231,0.0017278007],"category_scores_gemma":[0.002830327,0.0004224199,0.00047321987,0.0013273566,0.00082883664,0.0012232461,0.00086408114,0.0008470111,0.00025848753],"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.000027949452,0.000020552226,0.00011759564,0.000032442622,0.000011589472,0.000018731478,0.00002260094,0.97675335,0.00064653985,0.012072651,0.00061866955,0.009657342],"study_design_scores_gemma":[0.000005859882,0.000008132601,0.000025856418,0.000001748481,0.000002468379,0.000004630935,0.0000040044133,0.9956839,0.0001553477,0.0038616995,0.00024469616,0.0000016671876],"about_ca_topic_score_codex":0.004109822,"about_ca_topic_score_gemma":0.0042843516,"teacher_disagreement_score":0.004109822,"about_ca_system_score_codex":0.002908412,"about_ca_system_score_gemma":0.0017083714,"threshold_uncertainty_score":0.02110207},"labels":[],"label_agreement":null},{"id":"W2096882815","doi":"10.1109/tpds.2006.125","title":"Localized Communication and Topology Protocols for Ad Hoc Networks-Part II: A Preface to the Special Section","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Wireless ad hoc network; Topology control; Distributed computing; Network topology; Wireless sensor network; Mobile ad hoc network; Node (physics); Overhead (engineering); Quality of service; Unicast; Neighbor Discovery Protocol; Routing (electronic design automation); Routing protocol; Key (lock); Wireless network; Key distribution in wireless sensor networks; Wireless; Telecommunications; Network packet; The Internet; Computer security","score_opus":0.01792305543460985,"score_gpt":0.2573540522969308,"score_spread":0.23943099686232097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096882815","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016821615,0.23614171,0.18972631,0.02399016,0.44689795,0.0008683462,0.0008176915,0.001330823,0.098544896],"genre_scores_gemma":[0.015975231,0.26416108,0.068390176,0.0140908295,0.43508452,0.001620045,0.00344521,0.0018566744,0.19537623],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99848574,0.00040071656,0.00014186821,0.0002904134,0.0005888911,0.00009247719],"domain_scores_gemma":[0.99504846,0.0022583504,0.00022274881,0.00044966876,0.0016137594,0.00040689597],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024112184,0.002325833,0.0014396618,0.0030389747,0.0010753133,0.0033388757,0.0017725588,0.0025442338,0.015636213],"category_scores_gemma":[0.0064766426,0.0008838148,0.001169669,0.003253283,0.0018993482,0.004606961,0.001619669,0.008220875,0.01730838],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00005770628,0.00017036004,0.00028250538,0.00093221397,0.000031126285,0.00020250137,0.0002222062,0.002346472,0.0012123402,0.03776225,0.73573726,0.22104302],"study_design_scores_gemma":[0.000010817838,0.00017467866,0.0006943193,0.00057415315,0.0000142590525,0.00047199824,0.00007231862,0.0018531911,0.00020850985,0.02269228,0.9732019,0.00003163491],"about_ca_topic_score_codex":0.001035955,"about_ca_topic_score_gemma":0.00071460055,"teacher_disagreement_score":0.015636213,"about_ca_system_score_codex":0.0015991757,"about_ca_system_score_gemma":0.0014159806,"threshold_uncertainty_score":0.05230832},"labels":[],"label_agreement":null},{"id":"W2100655507","doi":"10.1109/tpds.2013.206","title":"Optimal Transmission Scheduling of Cooperative Communications with a Full-Duplex Relay","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Relay; Scheduling (production processes); Wireless; Duplex (building); Transmission (telecommunications); Linearization; Mathematical optimization; Computer network; Nonlinear system; Telecommunications; Mathematics","score_opus":0.017249884311855354,"score_gpt":0.2251301752757231,"score_spread":0.20788029096386773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100655507","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.042495266,0.00045097788,0.9520595,0.00015482862,0.00003466158,0.00006171445,0.000072237635,0.0001477774,0.0045230556],"genre_scores_gemma":[0.8972387,0.00050017267,0.09911058,0.00007200595,0.00004292395,0.00017034293,0.00008066622,0.000055008586,0.0027297137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991843,0.00033730717,0.000029461726,0.00016120869,0.00014961984,0.00013809993],"domain_scores_gemma":[0.99840933,0.0010190777,0.00021472364,0.00007714218,0.00021122457,0.00006856542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012844066,0.00091580447,0.0011107984,0.0005056168,0.0004890984,0.0010625336,0.001051905,0.0007069703,0.0015629609],"category_scores_gemma":[0.0030904794,0.0006135339,0.0004206558,0.0008113768,0.0007496568,0.0011325673,0.00078848604,0.00061823946,0.00038355257],"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.00015177041,0.0000548774,0.00024403486,0.00011441054,0.000028300452,0.00012396522,0.0001311951,0.9522855,0.003946535,0.018352102,0.0010490409,0.02351822],"study_design_scores_gemma":[0.0000111025265,0.00003782612,0.000045821977,0.000004157543,0.0000054759903,0.000017373759,0.000020287858,0.99486226,0.0006748463,0.004038927,0.0002767203,0.0000051598954],"about_ca_topic_score_codex":0.003509989,"about_ca_topic_score_gemma":0.002802351,"teacher_disagreement_score":0.003509989,"about_ca_system_score_codex":0.0012091766,"about_ca_system_score_gemma":0.0016018838,"threshold_uncertainty_score":0.008773208},"labels":[],"label_agreement":null},{"id":"W2100852009","doi":"10.1109/tpds.2008.54","title":"An Efficient Adaptive Transmission Control Scheme for Large-Scale Distributed Simulation Systems","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Scheme (mathematics); Transmission (telecommunications); Grid; Protocol (science); Throughput; Scale (ratio); Implementation; Data transmission; Real-time computing; Computer network; Wireless; Operating system","score_opus":0.053182541838355246,"score_gpt":0.3564835591237506,"score_spread":0.3033010172853954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100852009","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.014314238,0.000068633184,0.98359597,0.00008065523,0.000036374553,0.00006625249,0.000021767515,0.0011326389,0.00068340544],"genre_scores_gemma":[0.83571714,0.00009734954,0.1628441,0.00006000083,0.000041978907,0.00017186583,0.00009475298,0.00006836331,0.0009044355],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897134,0.00029649984,0.00009319964,0.00020032242,0.00037044563,0.00006816005],"domain_scores_gemma":[0.99811363,0.0007249529,0.000295462,0.0004024523,0.00035383124,0.00010964996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018643448,0.00051651394,0.0005112957,0.0005976705,0.0005685643,0.0007028486,0.001655487,0.00057790166,0.0011349926],"category_scores_gemma":[0.0043855584,0.00020783574,0.00034548156,0.000512307,0.00059523113,0.0010834247,0.00096033316,0.0009448751,0.00022456361],"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.00038548777,0.00015874175,0.0019154038,0.0000962518,0.00005799711,0.00018544176,0.00031068787,0.77189165,0.03215175,0.03633791,0.0020777518,0.15443103],"study_design_scores_gemma":[0.000009560945,0.000023831926,0.00007172357,0.0000019563556,0.0000040397813,0.000015790656,0.0000032228438,0.99694073,0.0012637032,0.0012092866,0.00045098015,0.0000051678658],"about_ca_topic_score_codex":0.0028646295,"about_ca_topic_score_gemma":0.0017277909,"teacher_disagreement_score":0.0028646295,"about_ca_system_score_codex":0.0007220973,"about_ca_system_score_gemma":0.0008109895,"threshold_uncertainty_score":0.009859681},"labels":[],"label_agreement":null},{"id":"W2102714269","doi":"10.1109/tpds.2008.108","title":"Detecting Threats in Star Graphs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"University of Sydney; University of Glasgow","keywords":"Computer science; Star (game theory); Network topology; Interconnection; Distributed computing; Computer network; Star network; Software; Software-defined networking; Topology (electrical circuits); Operating system","score_opus":0.02119606659481043,"score_gpt":0.24409235923687436,"score_spread":0.22289629264206393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102714269","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.22403333,0.0012193703,0.76426977,0.0013151654,0.00011827196,0.0002686928,0.00038910436,0.0010124238,0.0073738047],"genre_scores_gemma":[0.86029506,0.000905651,0.1346053,0.00041252197,0.000091791786,0.00012614271,0.0006557446,0.00008472383,0.0028231516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997424,0.0009817557,0.00012254479,0.00054148916,0.0006333896,0.0002968412],"domain_scores_gemma":[0.98827446,0.006720233,0.0019031499,0.0011148803,0.0012811632,0.0007061056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020626846,0.000923043,0.001219259,0.002269054,0.0016345746,0.0018758676,0.0016714656,0.0023222598,0.001212902],"category_scores_gemma":[0.012550929,0.00071597815,0.00083933637,0.0015353682,0.001796285,0.0060608643,0.0036532225,0.0011864998,0.00044799477],"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.0011178805,0.00027961395,0.029416494,0.00076883275,0.00042594722,0.0023225467,0.0016901519,0.56119806,0.012222853,0.23159279,0.010454286,0.14851058],"study_design_scores_gemma":[0.00004240437,0.0002198992,0.0016123204,0.000047005804,0.00006664505,0.0008195011,0.00069853105,0.7737601,0.0037087188,0.21368013,0.0053097038,0.000035029094],"about_ca_topic_score_codex":0.001969923,"about_ca_topic_score_gemma":0.0015113673,"teacher_disagreement_score":0.0023222598,"about_ca_system_score_codex":0.0009357281,"about_ca_system_score_gemma":0.00077493413,"threshold_uncertainty_score":0.010908604},"labels":[],"label_agreement":null},{"id":"W2102724871","doi":"10.1109/tpds.2013.81","title":"Composing Kerberos and Multimedia Internet KEYing (MIKEY) for AuthenticatedTransport of Group Keys","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kerberos; Computer science; Group key; Public-key cryptography; Computer security; Authentication (law); Principal (computer security); Key (lock); Cryptography; Security association; Shared secret; Public key infrastructure; Computer network; Encryption","score_opus":0.0189407985006571,"score_gpt":0.24934331105993446,"score_spread":0.23040251255927735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102724871","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.04929382,0.00034389435,0.9359737,0.00061770837,0.00011282989,0.00033082726,0.000040264553,0.0033673653,0.009919613],"genre_scores_gemma":[0.5208453,0.0004029367,0.46529227,0.00043381235,0.00011187453,0.00045773244,0.00013441917,0.00089083676,0.011430815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924966,0.0023281788,0.0006241698,0.0009325441,0.0029663253,0.0006523333],"domain_scores_gemma":[0.99215394,0.0021560334,0.0010996326,0.0029865354,0.0012151491,0.00038880226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006346985,0.0008464725,0.0006552709,0.0009150064,0.0019190621,0.0031379606,0.0016524728,0.0012909116,0.0033203727],"category_scores_gemma":[0.013202449,0.0007834216,0.00083733845,0.00071842846,0.0037910666,0.009161269,0.0039532646,0.0025986838,0.0015215738],"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.0012450641,0.00034079375,0.0036852756,0.0006879865,0.00010319448,0.000748415,0.0033949947,0.017985119,0.055177435,0.75876725,0.0031485208,0.15471603],"study_design_scores_gemma":[0.0003962872,0.0014018618,0.0018602975,0.00025104414,0.00028816462,0.0027441704,0.0010068663,0.20438455,0.31472704,0.32205442,0.15060228,0.00028306223],"about_ca_topic_score_codex":0.0006271119,"about_ca_topic_score_gemma":0.00066395546,"teacher_disagreement_score":0.006346985,"about_ca_system_score_codex":0.001465214,"about_ca_system_score_gemma":0.0021170166,"threshold_uncertainty_score":0.033566475},"labels":[],"label_agreement":null},{"id":"W2103621877","doi":"10.1109/tpds.2010.95","title":"LBMP: A Logarithm-Barrier-Based Multipath Protocol for Internet Traffic Management","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Multipath propagation; Mathematical optimization; Logarithm; Multipath routing; Network packet; Convergence (economics); Routing protocol; Computer network; Distributed computing; Network congestion; Network topology; Link-state routing protocol; Mathematics","score_opus":0.01770175664185266,"score_gpt":0.2582322459100113,"score_spread":0.24053048926815865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103621877","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.013303885,0.00047410457,0.9798615,0.00040741908,0.000085658,0.0001412236,0.00011929546,0.002498986,0.0031079196],"genre_scores_gemma":[0.678422,0.00080300606,0.3148666,0.00032769924,0.000106923384,0.00068491325,0.00040576016,0.0003028186,0.004080253],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931526,0.00020458126,0.000038780905,0.00006859793,0.0002825853,0.00009013829],"domain_scores_gemma":[0.99914324,0.00030975766,0.0001244437,0.00015127756,0.00019820669,0.00007300355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013396875,0.0007059836,0.0005849723,0.0009307039,0.0006913468,0.0010798748,0.0018556471,0.00086569105,0.0015378351],"category_scores_gemma":[0.0036210096,0.00024084258,0.00041823596,0.000985065,0.0008861008,0.0016420361,0.0022868032,0.0019295877,0.00051300944],"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.00050238066,0.00025510933,0.0012874565,0.0002956683,0.000100689256,0.000499538,0.00030465724,0.48914114,0.046837274,0.16617826,0.016708087,0.27788976],"study_design_scores_gemma":[0.000042191226,0.00014077,0.0001737815,0.000017033797,0.00001966096,0.00016529266,0.0000303932,0.9580778,0.008412238,0.022328679,0.01054735,0.000044868833],"about_ca_topic_score_codex":0.0014739542,"about_ca_topic_score_gemma":0.0014673698,"teacher_disagreement_score":0.0018556471,"about_ca_system_score_codex":0.0010422574,"about_ca_system_score_gemma":0.0013742417,"threshold_uncertainty_score":0.0075621605},"labels":[],"label_agreement":null},{"id":"W2104279367","doi":"10.1109/tpds.2013.192","title":"Probabilistic vs. Sequence-Based Rendezvous in Channel-Hopping Cognitive Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Rendezvous; Computer science; Probabilistic logic; Cognitive radio; Sequence (biology); Channel (broadcasting); Computer network; Piconet; Mechanism (biology); Distributed computing; Artificial intelligence; Telecommunications; Wireless; Engineering","score_opus":0.02385497646577082,"score_gpt":0.23278388646730827,"score_spread":0.20892891000153746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104279367","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.1433518,0.0015850074,0.84528625,0.0005590798,0.0001039432,0.000055459637,0.00006430205,0.00019494149,0.008799213],"genre_scores_gemma":[0.98494905,0.000568482,0.0122468565,0.0000697693,0.00006414749,0.000049488754,0.000015780794,0.00002284864,0.002013682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987595,0.00038358205,0.00004592341,0.000171047,0.0003838287,0.0002561141],"domain_scores_gemma":[0.99507695,0.0031269626,0.0008516592,0.00035454088,0.00043237561,0.00015746211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021534818,0.00065953855,0.0005030394,0.0010325566,0.000501288,0.0011614254,0.0013111619,0.0010176852,0.0012173901],"category_scores_gemma":[0.008128906,0.00047786775,0.0006342524,0.00066485937,0.0019030356,0.0020856676,0.00096259307,0.0007262328,0.00022764271],"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.00011725662,0.000038307135,0.00081168744,0.00009576998,0.000030000705,0.00013480433,0.00015804777,0.74762654,0.005155583,0.23770103,0.00029668186,0.007834285],"study_design_scores_gemma":[0.000011870528,0.000075747725,0.00029156363,0.000011546828,0.000013106487,0.00010010502,0.000040782244,0.96343464,0.0007491048,0.034810137,0.00043768427,0.000023664099],"about_ca_topic_score_codex":0.0035695233,"about_ca_topic_score_gemma":0.002556491,"teacher_disagreement_score":0.0035695233,"about_ca_system_score_codex":0.0015421286,"about_ca_system_score_gemma":0.0011982014,"threshold_uncertainty_score":0.011388838},"labels":[],"label_agreement":null},{"id":"W2104443123","doi":"10.1109/tpds.2007.1052","title":"Bandwidth Management for Supporting Differentiated Service Aware Traffic Engineering","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Nortel (Canada)","funders":"","keywords":"Computer science; Preemption; Dynamic bandwidth allocation; Bandwidth (computing); Bandwidth management; Bandwidth allocation; Computer network; Distributed computing; Multiprotocol Label Switching; Quality of service; Operating system","score_opus":0.01171532534096999,"score_gpt":0.22612241421777904,"score_spread":0.21440708887680904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104443123","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.01885284,0.0009653415,0.9740108,0.0002434011,0.00008891774,0.00006903865,0.000039953953,0.0006540536,0.0050756196],"genre_scores_gemma":[0.5988497,0.0010161669,0.3967846,0.000191447,0.00015859364,0.00015456934,0.00018518591,0.00011808889,0.0025417488],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999265,0.00018078013,0.000041400705,0.00009308018,0.00033321982,0.0000864959],"domain_scores_gemma":[0.9990797,0.0003512543,0.00010375021,0.0001765012,0.000225924,0.00006283042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010659792,0.000529455,0.0004215353,0.000584979,0.0006374457,0.0013331764,0.0017183028,0.00067705644,0.0012852834],"category_scores_gemma":[0.0028117185,0.0002475652,0.00026779744,0.00050663354,0.00052794546,0.0016549117,0.00083415303,0.0009100114,0.00041610163],"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.000274662,0.00020493689,0.0012719417,0.00042983438,0.000051918014,0.0002987547,0.00035722647,0.17214085,0.07516893,0.36421254,0.0054410803,0.3801473],"study_design_scores_gemma":[0.0000418122,0.000098029406,0.00029079523,0.00005720001,0.000037170106,0.0002083886,0.00004568322,0.8972074,0.017570175,0.04896987,0.035442222,0.000031277923],"about_ca_topic_score_codex":0.0017380145,"about_ca_topic_score_gemma":0.0012020303,"teacher_disagreement_score":0.0017380145,"about_ca_system_score_codex":0.0008580809,"about_ca_system_score_gemma":0.0009819205,"threshold_uncertainty_score":0.006225884},"labels":[],"label_agreement":null},{"id":"W2105705286","doi":"10.1109/tpds.2003.1195413","title":"Dynamic querying of streaming data with the dQUOB system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Arkansas High Performance Computing Center, University of Arkansas; Canada Excellence Research Chairs, Government of Canada","keywords":"Computer science; Data stream mining; Query language; Visualization; Data visualization; Relational database; Abstraction; Data modeling; Database; Data mining; Distributed computing","score_opus":0.020018470121969317,"score_gpt":0.23588869305482593,"score_spread":0.21587022293285663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105705286","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.05656681,0.0009857714,0.763868,0.0013023003,0.00023788364,0.00051458826,0.0027660737,0.16028093,0.013477753],"genre_scores_gemma":[0.4539359,0.0008860003,0.51662976,0.0014224453,0.00018158754,0.00075793854,0.008927126,0.00807934,0.009179882],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955446,0.0010273757,0.0005037589,0.0009071536,0.0017064193,0.0003106678],"domain_scores_gemma":[0.9930328,0.0022332873,0.00027674538,0.0028330605,0.0010615636,0.00056241587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056704725,0.00086642714,0.0018051536,0.0018117755,0.0013776631,0.0050957627,0.0037861124,0.0015795887,0.0052917325],"category_scores_gemma":[0.0127535425,0.0009705376,0.00072821934,0.0023667486,0.0017732024,0.0052729086,0.0072450247,0.001903464,0.0027445208],"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.006684732,0.000876673,0.018232914,0.0014601125,0.0003464838,0.0018147426,0.0046849065,0.035504837,0.12682766,0.09821566,0.12762481,0.5777265],"study_design_scores_gemma":[0.0011722937,0.00035990385,0.0027322215,0.00015213202,0.000113284594,0.001061872,0.00061936374,0.72059673,0.054200433,0.045719102,0.17302914,0.00024349564],"about_ca_topic_score_codex":0.010923409,"about_ca_topic_score_gemma":0.00405668,"teacher_disagreement_score":0.010923409,"about_ca_system_score_codex":0.0013206248,"about_ca_system_score_gemma":0.0018598763,"threshold_uncertainty_score":0.029988706},"labels":[],"label_agreement":null},{"id":"W2108801243","doi":"10.1109/tpds.2008.105","title":"The Design of OpenMP Tasks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":387,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada)","funders":"","keywords":"Computer science; Scalability; Flexibility (engineering); Exploit; Human multitasking; Parallelism (grammar); Key (lock); Computer architecture; Set (abstract data type); Parallel computing; Distributed computing; Programming language; Operating system","score_opus":0.02456869289260105,"score_gpt":0.25362157293917215,"score_spread":0.2290528800465711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108801243","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.0069984207,0.00013225693,0.98377776,0.00019552218,0.000105804036,0.0002810779,0.00009932461,0.0016437077,0.006766204],"genre_scores_gemma":[0.16637294,0.00040058134,0.81720585,0.00036359899,0.00007565705,0.0017331919,0.0006115946,0.0012382831,0.011998379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99754983,0.00057039113,0.00028370725,0.00030255108,0.0010124227,0.00028097723],"domain_scores_gemma":[0.99735945,0.00065392174,0.00020682147,0.000752594,0.0008173682,0.00020978154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030732406,0.0006788196,0.0005155344,0.00042713626,0.0011490438,0.0028490154,0.0033746876,0.0014062136,0.0039999285],"category_scores_gemma":[0.0071310303,0.00096537085,0.0007829238,0.0004523801,0.0013311881,0.002976971,0.00280366,0.0024945352,0.0019171478],"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.00070875895,0.00019682763,0.0018692099,0.0010575313,0.0000803698,0.0004313234,0.0019140745,0.16896039,0.028517451,0.60093606,0.020360291,0.1749677],"study_design_scores_gemma":[0.00020438767,0.00032917518,0.0004068011,0.00020543531,0.00006861234,0.0004027963,0.00024895562,0.5708075,0.042668674,0.15936801,0.22519587,0.00009376139],"about_ca_topic_score_codex":0.0009189161,"about_ca_topic_score_gemma":0.0009490973,"teacher_disagreement_score":0.0039999285,"about_ca_system_score_codex":0.0008707594,"about_ca_system_score_gemma":0.002000798,"threshold_uncertainty_score":0.016253054},"labels":[],"label_agreement":null},{"id":"W2111814008","doi":"10.1109/tpds.2010.157","title":"ThriftStore: Finessing Reliability Trade-Offs in Replicated Storage Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Throughput; Bandwidth (computing); Reliability (semiconductor); Architecture; High availability; Computer data storage; Computer network; Distributed computing; Systems architecture; Embedded system; Operating system; Wireless","score_opus":0.0165005753718929,"score_gpt":0.24743473369973393,"score_spread":0.23093415832784103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111814008","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.44013727,0.002595962,0.5476012,0.00084033835,0.00008714838,0.0000975794,0.0000828227,0.0019101859,0.0066474234],"genre_scores_gemma":[0.9595732,0.0002827883,0.03895009,0.000045364253,0.000031352047,0.000028039543,0.00002921995,0.00008679369,0.0009731725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991393,0.0002879814,0.000036587004,0.00011808076,0.00028613163,0.00013191543],"domain_scores_gemma":[0.9970709,0.0015410692,0.0002386569,0.0007202678,0.00032385386,0.00010520505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018711736,0.00042086077,0.0005176019,0.0005744376,0.00071690505,0.001291855,0.0014263551,0.00075999746,0.001746989],"category_scores_gemma":[0.0060051093,0.0003259715,0.0003007565,0.00038153498,0.0007948471,0.00271768,0.0012140509,0.0007199541,0.0002511681],"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.0008442335,0.00026947065,0.0055792416,0.00037158447,0.00011351301,0.0006163655,0.0006440082,0.59976536,0.086220086,0.052808307,0.0032004826,0.24956734],"study_design_scores_gemma":[0.000068419664,0.0004851646,0.0013793954,0.000029570037,0.000049896276,0.0005283521,0.00012563654,0.9385366,0.028512891,0.025888491,0.004353299,0.000042422413],"about_ca_topic_score_codex":0.0010740581,"about_ca_topic_score_gemma":0.0016588751,"teacher_disagreement_score":0.0018711736,"about_ca_system_score_codex":0.0008251459,"about_ca_system_score_gemma":0.00048670312,"threshold_uncertainty_score":0.009895802},"labels":[],"label_agreement":null},{"id":"W2112110532","doi":"10.1109/tpds.2008.251","title":"Priority Random Linear Codes in Distributed Storage Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scalability; Node (physics); Server; Distributed computing; Salient; Computer network; Peer-to-peer; Database; Engineering","score_opus":0.019885062722108087,"score_gpt":0.2356521131636972,"score_spread":0.21576705044158911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112110532","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.05607601,0.0028776112,0.9289284,0.0012025341,0.00020446217,0.00019017591,0.0002199936,0.0012772136,0.009023523],"genre_scores_gemma":[0.8957859,0.0014353377,0.094245285,0.0002414485,0.00020956472,0.00028728528,0.00020620361,0.00010466267,0.007484274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981839,0.0005840651,0.000091941554,0.00017637003,0.0007384151,0.00022521893],"domain_scores_gemma":[0.9902947,0.006110787,0.0008366,0.00089637097,0.0015962345,0.00026530153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019345429,0.0006064938,0.000855824,0.00097155484,0.00080793386,0.0017645176,0.00097084837,0.0011448299,0.002767188],"category_scores_gemma":[0.011244608,0.0004321171,0.00027217536,0.0016280736,0.0016133001,0.0020552403,0.0011081288,0.0012049392,0.00071080646],"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.00034438886,0.00010288059,0.00087559497,0.00023490992,0.000027475317,0.00025385895,0.00024457966,0.6429956,0.0054559885,0.29629615,0.0042493427,0.048919298],"study_design_scores_gemma":[0.000056831293,0.00006358954,0.00010792936,0.000019728244,0.000007752239,0.000099232144,0.000032144762,0.90209687,0.0015112552,0.09425104,0.0017280683,0.000025559599],"about_ca_topic_score_codex":0.0036587198,"about_ca_topic_score_gemma":0.0023527325,"teacher_disagreement_score":0.0036587198,"about_ca_system_score_codex":0.0019405289,"about_ca_system_score_gemma":0.0018589125,"threshold_uncertainty_score":0.01407963},"labels":[],"label_agreement":null},{"id":"W2112311846","doi":"10.1109/tpds.2011.29","title":"Efficient Bidding in Dynamic Grid Markets","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Bidding; Computer science; Grid; Resource allocation; Resource management (computing); Distributed computing; Grid computing; Game theory; Term (time); Common value auction; Microeconomics; Computer network; Economics","score_opus":0.021542951897797532,"score_gpt":0.2267478758531482,"score_spread":0.20520492395535067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112311846","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.15105686,0.00028521463,0.82491165,0.0010012706,0.00006187783,0.00009623227,0.00008133874,0.00013700155,0.022368582],"genre_scores_gemma":[0.97173035,0.00017289574,0.023539618,0.00008771385,0.000028602972,0.00010126293,0.0000350167,0.00003465419,0.004269792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984515,0.00086112483,0.00003665203,0.00013170963,0.00025346616,0.00026548537],"domain_scores_gemma":[0.9971294,0.0018229432,0.00034403795,0.0001985261,0.00030907994,0.00019607102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022269026,0.00045129706,0.0007769357,0.00033746107,0.00065641507,0.0018181449,0.001148267,0.0010697595,0.0027966497],"category_scores_gemma":[0.0077920156,0.0003863156,0.0004738288,0.00053711946,0.0016128354,0.002597001,0.0010339993,0.00091701857,0.0003646422],"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.00009291563,0.00008142818,0.00078937766,0.000047335703,0.00003293135,0.0002922644,0.00024516092,0.43867645,0.0013767766,0.5487076,0.0014395468,0.00821815],"study_design_scores_gemma":[0.00002173928,0.00001837787,0.0000977647,0.0000031271368,0.0000042665474,0.000036034457,0.00006468597,0.83791196,0.00016001995,0.16088352,0.0007906897,0.000007745468],"about_ca_topic_score_codex":0.0025174362,"about_ca_topic_score_gemma":0.0015890026,"teacher_disagreement_score":0.0027966497,"about_ca_system_score_codex":0.0011097795,"about_ca_system_score_gemma":0.0010643672,"threshold_uncertainty_score":0.011777163},"labels":[],"label_agreement":null},{"id":"W2112716715","doi":"10.1109/tpds.2007.1119","title":"rStream: Resilient and Optimal Peer-to-Peer Streaming with Rateless Codes","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Peer-to-peer; Computer network; Latency (audio); Network topology; Coding (social sciences); Multimedia; Distributed computing; Telecommunications; Network packet","score_opus":0.014971959782380381,"score_gpt":0.23758531545923067,"score_spread":0.22261335567685028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112716715","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.044038605,0.00042100265,0.94555175,0.00020066391,0.000088124674,0.00016496863,0.00007578963,0.0070632985,0.0023958418],"genre_scores_gemma":[0.5441757,0.00031453688,0.45178154,0.00014470001,0.00005136618,0.00022201505,0.00019259122,0.0003549423,0.0027626597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989926,0.00025998574,0.0000613455,0.000100462166,0.00048549136,0.000100090634],"domain_scores_gemma":[0.99780685,0.0009960558,0.00016903592,0.00044069148,0.00045560073,0.00013186129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014112728,0.00048562567,0.00060824695,0.00060856494,0.0005654842,0.00079232274,0.0018412995,0.0010659772,0.0012568142],"category_scores_gemma":[0.005548065,0.00026869,0.00031538488,0.00052996824,0.0011461825,0.0016773001,0.0016840774,0.0012235938,0.00047540068],"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.0007815141,0.00023935467,0.0011262306,0.00019179317,0.000078029974,0.00042729345,0.00039806654,0.6831179,0.05817527,0.04762333,0.0060867686,0.2017544],"study_design_scores_gemma":[0.00004718791,0.00006429544,0.00005797336,0.000008490361,0.0000050157764,0.00006603053,0.000014434811,0.98136985,0.012797082,0.003924889,0.0016250536,0.000019804209],"about_ca_topic_score_codex":0.004760646,"about_ca_topic_score_gemma":0.0034867446,"teacher_disagreement_score":0.004760646,"about_ca_system_score_codex":0.0008812438,"about_ca_system_score_gemma":0.001628083,"threshold_uncertainty_score":0.009465873},"labels":[],"label_agreement":null},{"id":"W2116199450","doi":"10.1109/tpds.2012.308","title":"Anchor: A Versatile and Efficient Framework for Resource Management in the Cloud","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Distributed computing; Cloud computing; Resource management (computing); Matching (statistics); Workload; Virtualization; Resource (disambiguation); Virtual machine; Architecture; Node (physics); Resource allocation; Set (abstract data type); Convergence (economics); Computer network; Operating system","score_opus":0.020009155789149774,"score_gpt":0.2494322021557667,"score_spread":0.22942304636661692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116199450","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.0029507426,0.00012187343,0.9893078,0.00018510075,0.000046532794,0.000114947135,0.000083943596,0.0051853266,0.0020037245],"genre_scores_gemma":[0.20963855,0.0005054803,0.78336453,0.00027958222,0.00012315591,0.0004723927,0.00051252445,0.0010339518,0.0040698494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998548,0.00037240214,0.000119168624,0.00021179857,0.00054067845,0.00020799757],"domain_scores_gemma":[0.99904984,0.00019465481,0.00009416797,0.00037784444,0.0001304364,0.00015303232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024315002,0.00078832003,0.0009846461,0.001040095,0.0010722924,0.0028894353,0.0035493693,0.00094266626,0.004291479],"category_scores_gemma":[0.003614761,0.0007473518,0.000874659,0.0014376239,0.0012934431,0.0043602637,0.0035858045,0.0023415445,0.0015443894],"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.0004310879,0.00025314695,0.0017613826,0.00028606167,0.0001443625,0.00032566724,0.00038328595,0.32032526,0.012479756,0.41838565,0.027217284,0.21800704],"study_design_scores_gemma":[0.000051864317,0.000063379106,0.00016309367,0.000024112478,0.000023824878,0.000079967176,0.000037254646,0.8881834,0.0033753554,0.08169769,0.026259243,0.00004092543],"about_ca_topic_score_codex":0.0045214985,"about_ca_topic_score_gemma":0.0050862106,"teacher_disagreement_score":0.0045214985,"about_ca_system_score_codex":0.0012996168,"about_ca_system_score_gemma":0.0024824408,"threshold_uncertainty_score":0.014356434},"labels":[],"label_agreement":null},{"id":"W2117650386","doi":"10.1109/71.932714","title":"Generalized communicators in the message passing interface","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Message passing; Message Passing Interface; Interface (matter); Distributed computing; Construct (python library); Process (computing); Parallel computing; Programming language","score_opus":0.027864851378327962,"score_gpt":0.27476682561847154,"score_spread":0.2469019742401436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117650386","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.005786684,0.0006019986,0.9824707,0.00056996674,0.0003239283,0.00010393308,0.00008024795,0.0042158524,0.005846735],"genre_scores_gemma":[0.09659595,0.0015957722,0.8831712,0.0010545027,0.0009196243,0.0008925144,0.00052101555,0.0017951849,0.013454203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9967913,0.0011818316,0.00025098238,0.00044402218,0.0009812658,0.0003505681],"domain_scores_gemma":[0.99691963,0.0010304968,0.00027054688,0.0011227544,0.0005091506,0.00014745237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037776846,0.0011124993,0.0012423777,0.00075447536,0.001643734,0.003283275,0.002390282,0.002234052,0.0038331172],"category_scores_gemma":[0.006046129,0.00095549796,0.0014942134,0.0013240328,0.002616363,0.0072344546,0.0040574893,0.0041620205,0.0026621353],"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.00019806511,0.000049784565,0.0004418598,0.00029899325,0.0000542862,0.00033446398,0.0009841277,0.015686436,0.0055981926,0.90781987,0.012654614,0.055879224],"study_design_scores_gemma":[0.00016136086,0.00012921025,0.00021814412,0.00018720847,0.00017474263,0.00037678285,0.0001580619,0.13915037,0.01453341,0.51821244,0.32655814,0.00014015572],"about_ca_topic_score_codex":0.001099253,"about_ca_topic_score_gemma":0.0013154666,"teacher_disagreement_score":0.0038331172,"about_ca_system_score_codex":0.00070921,"about_ca_system_score_gemma":0.001746461,"threshold_uncertainty_score":0.019978523},"labels":[],"label_agreement":null},{"id":"W2119476394","doi":"10.1109/tpds.2013.166","title":"Novel Flow Control for Fully Adaptive Routing in Cache-Coherent NoCs","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National High-tech Research and Development Program; University of Toronto; Natural Sciences and Engineering Research Council of Canada; National University of Defense Technology; National Natural Science Foundation of China","keywords":"Computer science; Static routing; Equal-cost multi-path routing; Distributed computing; Deadlock; Computer network; Dynamic Source Routing; Routing (electronic design automation); Link-state routing protocol; Policy-based routing; Multipath routing; Destination-Sequenced Distance Vector routing; Network packet; Routing table; Cache; Routing protocol","score_opus":0.02305488258008939,"score_gpt":0.22512577546573054,"score_spread":0.20207089288564115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119476394","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.0985622,0.0005958108,0.8958082,0.00016455184,0.00008831149,0.000056873352,0.00006450497,0.0011787056,0.0034807732],"genre_scores_gemma":[0.7695806,0.00023253018,0.22758196,0.0001754552,0.00006419424,0.000093373215,0.000109165165,0.000059486945,0.0021031636],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997286,0.000051637016,0.000027973854,0.00006198947,0.00009537301,0.000034367436],"domain_scores_gemma":[0.9993881,0.0001617793,0.00009242554,0.00012980154,0.00019849553,0.000029344788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039770623,0.0003074589,0.00020874114,0.00045067674,0.00033613623,0.0005248754,0.00095954846,0.00027716337,0.00076205743],"category_scores_gemma":[0.0008644126,0.00019470729,0.00019362166,0.0003205876,0.00039338332,0.00078227534,0.00037021752,0.00036312954,0.00010862581],"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.0003022676,0.000167551,0.0025999136,0.00022728337,0.000069002104,0.00022139102,0.000243051,0.21098699,0.30015612,0.050331973,0.003902981,0.4307916],"study_design_scores_gemma":[0.00003985806,0.00023074314,0.0006089144,0.000018599678,0.000030333838,0.0001663241,0.000017961462,0.9440061,0.040253095,0.008836153,0.0057545733,0.000037303038],"about_ca_topic_score_codex":0.0012043471,"about_ca_topic_score_gemma":0.0024046712,"teacher_disagreement_score":0.0012043471,"about_ca_system_score_codex":0.00052486645,"about_ca_system_score_gemma":0.0005659277,"threshold_uncertainty_score":0.0038081408},"labels":[],"label_agreement":null},{"id":"W2129343865","doi":"10.1109/tpds.2012.286","title":"Parallel Sparse Approximate Inverse Preconditioning on Graphic Processing Units","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Preconditioner; Computer science; Biconjugate gradient stabilized method; Solver; Parallel computing; Computational science; Rate of convergence; Sparse matrix; Iterative method; Biconjugate gradient method; Linear system; Convergence (economics); Algorithm; Mathematics; Conjugate residual method; Gradient descent; Channel (broadcasting); Artificial intelligence","score_opus":0.03125104163723649,"score_gpt":0.23963007811566095,"score_spread":0.20837903647842446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129343865","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.04588474,0.00047473112,0.9130146,0.00039853356,0.00023659962,0.00015498407,0.0003898741,0.015663723,0.023782237],"genre_scores_gemma":[0.2736414,0.0003426524,0.7099572,0.00028392312,0.00008869547,0.00028024518,0.0013911597,0.00081598083,0.013198772],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944574,0.000110078545,0.000025317533,0.000069307316,0.00027733875,0.000072191964],"domain_scores_gemma":[0.99938357,0.000114815375,0.000040002888,0.0002194028,0.00020879832,0.00003335717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029884066,0.00075895136,0.0005871268,0.0005577174,0.0004627438,0.00071104296,0.0011899554,0.0005025448,0.011653329],"category_scores_gemma":[0.0014654582,0.00035081498,0.0006036561,0.0013819779,0.00041458794,0.0006117247,0.0009841035,0.0008164579,0.0035685485],"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.0010867094,0.0001563753,0.0021498788,0.00041726814,0.00010483304,0.0005743541,0.0002584751,0.2718699,0.10292741,0.042703047,0.068528004,0.5092237],"study_design_scores_gemma":[0.00015418878,0.00017666975,0.0013341928,0.000025912132,0.000028109871,0.00018119982,0.000050132006,0.9142967,0.03887251,0.011509339,0.033343602,0.00002750465],"about_ca_topic_score_codex":0.0052312603,"about_ca_topic_score_gemma":0.007818359,"teacher_disagreement_score":0.011653329,"about_ca_system_score_codex":0.0005295928,"about_ca_system_score_gemma":0.0011661813,"threshold_uncertainty_score":0.0389843},"labels":[],"label_agreement":null},{"id":"W2130150993","doi":"10.1109/tpds.2006.34","title":"Efficient algorithms for minimum congestion hypergraph embedding in a cycle","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hypergraph; Embedding; Computer science; Algorithm; Node (physics); Computational complexity theory; Approximation algorithm; Set (abstract data type); Enhanced Data Rates for GSM Evolution; Time complexity; Mathematics; Discrete mathematics","score_opus":0.015379917932781342,"score_gpt":0.24755556444552337,"score_spread":0.23217564651274203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130150993","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.041942526,0.0007260432,0.9468988,0.00043959662,0.0000752229,0.00028975567,0.0003468556,0.0029290307,0.006352044],"genre_scores_gemma":[0.19709587,0.00046253117,0.7963168,0.00009444489,0.00004151711,0.00036778598,0.001248043,0.00035279564,0.0040202425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906904,0.00024459165,0.00006533335,0.00020434758,0.00024272593,0.00017389524],"domain_scores_gemma":[0.99844605,0.000642052,0.00017837336,0.00037203438,0.00026453746,0.00009690253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000676701,0.0011802398,0.0010521851,0.0014884114,0.0008025886,0.0015453765,0.0016436998,0.0012001342,0.0061179404],"category_scores_gemma":[0.0041767824,0.00071077736,0.0007363721,0.0022657907,0.00062602706,0.003553208,0.0023466172,0.0012604888,0.0012719053],"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.0004621517,0.00029540044,0.0011403619,0.00045989465,0.00008528718,0.00016671847,0.00040096891,0.38072765,0.01013762,0.076293156,0.019920968,0.5099098],"study_design_scores_gemma":[0.00011441865,0.0000718335,0.000230821,0.000028548222,0.000022117043,0.0001202644,0.00012246144,0.91110367,0.0038371256,0.07792909,0.0063976864,0.000021984959],"about_ca_topic_score_codex":0.0033505843,"about_ca_topic_score_gemma":0.004502552,"teacher_disagreement_score":0.0061179404,"about_ca_system_score_codex":0.0014237942,"about_ca_system_score_gemma":0.0017508726,"threshold_uncertainty_score":0.020466566},"labels":[],"label_agreement":null},{"id":"W2133640365","doi":"10.1109/tpds.2004.1264797","title":"The impact of negative acknowledgments in shared memory scientific applications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministère de l'Économie, de la Science et de l'Innovation - Québec; National Science Foundation","keywords":"Computer science; Scalability; Node (physics); Protocol (science); Speedup; Computer network; Distributed computing; Shared memory; Asynchronous communication; Parallel computing; Operating system","score_opus":0.018345297096279828,"score_gpt":0.27642605061293735,"score_spread":0.2580807535166575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133640365","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.9851613,0.0004438261,0.010630707,0.00016950261,0.00004494243,0.000053728756,0.000027290045,0.0009202757,0.00254842],"genre_scores_gemma":[0.9932401,0.000092275506,0.00587979,0.000038227678,0.000011604618,0.000024494593,0.000037630314,0.000078477315,0.00059737416],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968652,0.0011845727,0.00026377177,0.00021580717,0.001186531,0.0002839983],"domain_scores_gemma":[0.9834247,0.00986898,0.0017907409,0.0025806546,0.0019690664,0.00036581856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002935528,0.0009003746,0.00040335098,0.00051226694,0.0011874813,0.00113743,0.0014620835,0.0006757653,0.0010827848],"category_scores_gemma":[0.015916046,0.00046894923,0.00024111943,0.0006283949,0.00094193325,0.0023212668,0.0012937328,0.00088081893,0.00020578929],"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.003597546,0.0010373032,0.043373473,0.001052861,0.00026079256,0.0023140819,0.0021801603,0.3142726,0.4388449,0.010614451,0.0033996461,0.17905207],"study_design_scores_gemma":[0.00023405254,0.004556339,0.018341294,0.000069281334,0.00035728852,0.0017865301,0.0011078398,0.5689957,0.39338207,0.004759285,0.0062602777,0.0001500846],"about_ca_topic_score_codex":0.0013879039,"about_ca_topic_score_gemma":0.0015312574,"teacher_disagreement_score":0.002935528,"about_ca_system_score_codex":0.0007213606,"about_ca_system_score_gemma":0.00092227024,"threshold_uncertainty_score":0.015524745},"labels":[],"label_agreement":null},{"id":"W2133703098","doi":"10.1109/tpds.2012.23","title":"Self-Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Routing protocol; Distributed computing; Routing (electronic design automation); Wireless Routing Protocol; Zone Routing Protocol; Channel (broadcasting); Dynamic Source Routing; Wireless; Protocol (science); Telecommunications","score_opus":0.03798366065885279,"score_gpt":0.278229920591184,"score_spread":0.24024625993233123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133703098","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.0468343,0.0009450563,0.94861275,0.00030918376,0.00017849664,0.00010143726,0.000030819327,0.00043883733,0.0025490469],"genre_scores_gemma":[0.9138119,0.00055095344,0.08335962,0.00012631761,0.000092132934,0.00019650921,0.00007032478,0.000032781973,0.0017593692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.00009144735,0.00002461744,0.000046571877,0.00012323237,0.000035979276],"domain_scores_gemma":[0.99920815,0.00034218223,0.0001389454,0.00011092103,0.00014875864,0.000051149345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006514306,0.0003350456,0.00040066932,0.0005519589,0.0005974188,0.0005073923,0.0013745014,0.000395717,0.00043684235],"category_scores_gemma":[0.0020785667,0.00015839121,0.00028493462,0.0004962693,0.0004738265,0.0009002305,0.0007996286,0.0006127064,0.000099128614],"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.00029805864,0.00018686065,0.0034298373,0.00031464233,0.00020553074,0.0011813228,0.0006719267,0.573593,0.050026257,0.16193454,0.0059190826,0.20223893],"study_design_scores_gemma":[0.000015915202,0.00006886894,0.00020374353,0.0000074761056,0.000023125609,0.00017435022,0.000029429037,0.9876451,0.0016504268,0.006997746,0.003170923,0.0000130643],"about_ca_topic_score_codex":0.0009816273,"about_ca_topic_score_gemma":0.0017347215,"teacher_disagreement_score":0.0013745014,"about_ca_system_score_codex":0.0005353433,"about_ca_system_score_gemma":0.00073658855,"threshold_uncertainty_score":0.0038841963},"labels":[],"label_agreement":null},{"id":"W2134238238","doi":"10.1109/tpds.2007.1046","title":"An Energy-Efficient Data Collection Framework for Wireless Sensor Networks by Exploiting Spatiotemporal Correlation","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":283,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Victoria","funders":"Canadian Imperial Bank of Commerce","keywords":"Wireless sensor network; Computer science; Data collection; Real-time computing; Spatial correlation; Workload; Fidelity; Data mining; Partition (number theory); Scheduling (production processes); Computer network; Telecommunications","score_opus":0.025625529411768554,"score_gpt":0.26377772425753654,"score_spread":0.238152194845768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134238238","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.0031982425,0.00014891695,0.9960859,0.00007997867,0.000014497156,0.000038354945,0.000037667116,0.00023135578,0.00016508916],"genre_scores_gemma":[0.13694428,0.00055469316,0.86111945,0.00006686836,0.00007125034,0.0002841508,0.0002436551,0.00010389419,0.0006117818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988703,0.00030173335,0.00009394252,0.00021724169,0.00043548166,0.00008132103],"domain_scores_gemma":[0.99864095,0.0004599705,0.00019119204,0.00032269274,0.00030496804,0.00008023072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023728476,0.001090977,0.001249954,0.001234002,0.0010480199,0.0010915665,0.0021758243,0.0006412721,0.00047410914],"category_scores_gemma":[0.0039173476,0.00062286865,0.0014687846,0.0027241716,0.0009961729,0.0023057845,0.0018840474,0.0012643099,0.00017350691],"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.00015220237,0.00022658672,0.0028092049,0.00030167037,0.00021451837,0.0003742102,0.00048669166,0.6983322,0.017716527,0.079350546,0.0039907796,0.19604492],"study_design_scores_gemma":[0.000011821119,0.000048930026,0.00028901265,0.000007930225,0.000024885392,0.00008830794,0.000029626348,0.98537767,0.0023910606,0.009586652,0.0021235433,0.00002058781],"about_ca_topic_score_codex":0.005067265,"about_ca_topic_score_gemma":0.008053473,"teacher_disagreement_score":0.005067265,"about_ca_system_score_codex":0.0010683882,"about_ca_system_score_gemma":0.002159106,"threshold_uncertainty_score":0.012548983},"labels":[],"label_agreement":null},{"id":"W2134502143","doi":"10.1109/tpds.2007.70748","title":"A Dynamic Skip List-Based Overlay for On-Demand Media Streaming with VCR Interactions","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Overlay; Computer network; Video on demand; On demand; Video streaming; Real Time Streaming Protocol; Live streaming; Multimedia; Operating system; The Internet","score_opus":0.019989506449667332,"score_gpt":0.24266425715382958,"score_spread":0.22267475070416226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134502143","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.06369731,0.00027342272,0.92899126,0.00044023062,0.0000610344,0.00012729436,0.0001611458,0.0012585963,0.004989749],"genre_scores_gemma":[0.83725154,0.00023804283,0.15932816,0.000080691716,0.000040465136,0.00012467147,0.00015556287,0.00007646385,0.002704368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99937063,0.00019332235,0.000032032185,0.000102876606,0.00022911142,0.00007208596],"domain_scores_gemma":[0.9988514,0.00043954948,0.000118408105,0.00023215971,0.00025136778,0.00010715782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000803531,0.00033050607,0.00056635565,0.000572867,0.00096110575,0.00092674413,0.0015848655,0.0006648026,0.0014450666],"category_scores_gemma":[0.0032776152,0.00023718731,0.00031527606,0.0007267701,0.00082786655,0.0017448498,0.0012530556,0.00065031153,0.0003173012],"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.00026483677,0.00016710102,0.0011578809,0.00015820099,0.000033116263,0.0004496445,0.00025186688,0.79751205,0.026569657,0.09742791,0.003962969,0.07204478],"study_design_scores_gemma":[0.000015325133,0.00005084073,0.00007601437,0.0000030001393,0.0000069887237,0.00005490094,0.000013804668,0.99203765,0.0014759363,0.004842162,0.0014122822,0.0000111267655],"about_ca_topic_score_codex":0.0058567864,"about_ca_topic_score_gemma":0.0060579814,"teacher_disagreement_score":0.0058567864,"about_ca_system_score_codex":0.0014424092,"about_ca_system_score_gemma":0.0016549155,"threshold_uncertainty_score":0.011645377},"labels":[],"label_agreement":null},{"id":"W2134703599","doi":"10.1109/tpds.2006.146","title":"Tight Bounds for Critical Sections in Processor Consistent Platforms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mutual exclusion; Sequential consistency; Computer science; Consistency (knowledge bases); Consistency model; Algorithm; Strong consistency; Upper and lower bounds; Extension (predicate logic); Variable (mathematics); Theoretical computer science; Mathematics; Programming language; Artificial intelligence; Statistics","score_opus":0.016551133402456432,"score_gpt":0.2537222123865423,"score_spread":0.23717107898408588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134703599","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.09070504,0.0027539742,0.88530517,0.0020001952,0.00024723163,0.00036993783,0.0001745374,0.002726631,0.015717238],"genre_scores_gemma":[0.75781786,0.0012833955,0.22798276,0.0009322691,0.00033733845,0.00072293024,0.0002732767,0.0013278438,0.009322353],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9858606,0.0023107326,0.00075006206,0.002785417,0.0052336063,0.003059595],"domain_scores_gemma":[0.936952,0.04065934,0.005292481,0.009682611,0.005050848,0.0023626734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010895789,0.0023172616,0.0019750267,0.0038997207,0.0037144348,0.006858333,0.005644111,0.0024149227,0.0067257634],"category_scores_gemma":[0.060845893,0.0024327787,0.0016287046,0.0018914632,0.0069473838,0.015597485,0.008016721,0.0064043887,0.0015139608],"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.0015020642,0.00037864756,0.00424553,0.0006279517,0.00016043485,0.0005245705,0.0015672251,0.29891354,0.025319276,0.5770365,0.006259473,0.08346479],"study_design_scores_gemma":[0.00011617101,0.00031771295,0.0006167923,0.00018814116,0.0001040557,0.00018434213,0.00024751003,0.4439931,0.022329558,0.524996,0.006838568,0.000068087014],"about_ca_topic_score_codex":0.0032826427,"about_ca_topic_score_gemma":0.0041477303,"teacher_disagreement_score":0.010895789,"about_ca_system_score_codex":0.007382181,"about_ca_system_score_gemma":0.0061606825,"threshold_uncertainty_score":0.057623148},"labels":[],"label_agreement":null},{"id":"W2135105254","doi":"10.1109/tpds.2007.70726","title":"Overlay Networks with Linear Capacity Constraints","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Overlay network; Computer science; Overlay; Linear programming; Network topology; Distributed computing; Node (physics); Computer network; Virtual network; Path (computing); Maximum flow problem; Context (archaeology); The Internet; Mathematical optimization; Algorithm; Mathematics","score_opus":0.025990534380577652,"score_gpt":0.21677064655900524,"score_spread":0.19078011217842758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135105254","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.039768986,0.00039063676,0.95104986,0.00039534498,0.000033931294,0.00008749439,0.0004584689,0.00046637803,0.0073488695],"genre_scores_gemma":[0.78185207,0.00080846006,0.21035501,0.00013507257,0.00007944703,0.00023052449,0.00048656185,0.00011911159,0.005933713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981147,0.0006053157,0.00008325605,0.00036879507,0.00052368775,0.00030431498],"domain_scores_gemma":[0.99405247,0.0038630182,0.00059613684,0.0006496535,0.0006335551,0.0002052246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013747135,0.000908949,0.0009211681,0.0006037419,0.00085481955,0.0018892067,0.0020379045,0.0012428251,0.0029896705],"category_scores_gemma":[0.0085620135,0.0007519574,0.00052744045,0.0019238987,0.0011114315,0.003970921,0.0016830837,0.001466362,0.00048223382],"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.000026158003,0.000023369881,0.00030704323,0.000063924475,0.000016112004,0.00010248962,0.00004370818,0.94339395,0.0012539448,0.042440403,0.0012165912,0.011112303],"study_design_scores_gemma":[0.0000064689552,0.000014066763,0.00008462771,0.00000552575,0.000005994983,0.00003605249,0.00001585985,0.97448844,0.0006842713,0.023174465,0.0014763122,0.0000079652045],"about_ca_topic_score_codex":0.0075143287,"about_ca_topic_score_gemma":0.0068654427,"teacher_disagreement_score":0.0075143287,"about_ca_system_score_codex":0.0019460688,"about_ca_system_score_gemma":0.0016826581,"threshold_uncertainty_score":0.014941156},"labels":[],"label_agreement":null},{"id":"W2136144445","doi":"10.1109/tpds.2008.229","title":"Enforcing Minimum-Cost Multicast Routing against Selfish Information Flows","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Multicast; Computer science; Xcast; Source-specific multicast; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Computer network; Routing (electronic design automation); Distributed computing; Cost allocation; Resource allocation; Protocol Independent Multicast; Mathematics; Economics; Telecommunications","score_opus":0.02178488400082582,"score_gpt":0.22697406040682014,"score_spread":0.20518917640599432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136144445","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.17237116,0.000106754684,0.822193,0.00041511568,0.000045168264,0.000075662734,0.000037465023,0.0001821785,0.0045735226],"genre_scores_gemma":[0.9482024,0.00008680257,0.050261848,0.00005098963,0.000024194387,0.00006266361,0.000018085024,0.00003656011,0.0012564592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984262,0.00076409895,0.000061616214,0.00015805011,0.00038165163,0.00020830845],"domain_scores_gemma":[0.9934416,0.0039241193,0.0010901047,0.00077661,0.0005413407,0.00022626507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031457923,0.0006045206,0.0009387701,0.000576481,0.00075115747,0.001507839,0.0012425038,0.0010182651,0.0007603959],"category_scores_gemma":[0.011519861,0.00036249505,0.00036867944,0.0006073137,0.0014133757,0.0020680302,0.0014692149,0.0010797519,0.00013308266],"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.00015023527,0.00007826997,0.0007704001,0.000050949016,0.000036050824,0.00012566028,0.00011524003,0.8201216,0.005218707,0.15547372,0.0005650344,0.017294087],"study_design_scores_gemma":[0.000012502128,0.000018457644,0.0000675887,0.000003987332,0.0000043111777,0.00001704525,0.000012712748,0.9684074,0.0012722295,0.029914329,0.00026511226,0.000004309455],"about_ca_topic_score_codex":0.00110586,"about_ca_topic_score_gemma":0.000833635,"teacher_disagreement_score":0.0031457923,"about_ca_system_score_codex":0.001508723,"about_ca_system_score_gemma":0.0013278959,"threshold_uncertainty_score":0.016636789},"labels":[],"label_agreement":null},{"id":"W2136795155","doi":"10.1109/tpds.2009.130","title":"On the Benefits of Cooperative Proxy Caching for Peer-to-Peer Traffic","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nokia (Canada); Simon Fraser University","funders":"","keywords":"Computer science; Computer network; Byte; Cache; False sharing; The Internet; Distributed computing; Peer-to-peer; Proxy (statistics); Internet traffic; Overhead (engineering); CPU cache; Cache algorithms; World Wide Web","score_opus":0.026165210683312293,"score_gpt":0.24693669426824968,"score_spread":0.2207714835849374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136795155","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.8268764,0.0034103722,0.14808764,0.0014420449,0.00007056007,0.00007956975,0.0001065096,0.00033931583,0.01958758],"genre_scores_gemma":[0.99615854,0.0003218246,0.0031107885,0.000033952783,0.00002648958,0.000009120307,0.000014155423,0.000012743094,0.00031244263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984615,0.0007027857,0.000030008649,0.00014052766,0.00041834186,0.00024688386],"domain_scores_gemma":[0.98763007,0.0092825405,0.00048566854,0.0010309468,0.0013272299,0.00024355232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018612419,0.00073543686,0.00076718966,0.0007264207,0.0008345457,0.0013075623,0.0012236392,0.0014045534,0.0011586231],"category_scores_gemma":[0.015300965,0.00031503206,0.0004060175,0.0011060492,0.00097546977,0.003768617,0.00087396166,0.0008047137,0.00020343435],"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.00044541046,0.00028513774,0.0071137105,0.00013638836,0.00009003053,0.00035177573,0.0002904337,0.883844,0.009037541,0.052798048,0.001617859,0.043989576],"study_design_scores_gemma":[0.000021168693,0.00018157893,0.0015942933,0.00001632257,0.00006457562,0.00018419264,0.00016230826,0.9829289,0.002045742,0.0119438935,0.00083373033,0.000023450855],"about_ca_topic_score_codex":0.0052226963,"about_ca_topic_score_gemma":0.0044010277,"teacher_disagreement_score":0.0052226963,"about_ca_system_score_codex":0.0017553162,"about_ca_system_score_gemma":0.00097043824,"threshold_uncertainty_score":0.012735724},"labels":[],"label_agreement":null},{"id":"W2139389207","doi":"10.1109/tpds.2011.20","title":"Traffic-Aware Relay Node Deployment: Maximizing Lifetime for Data Collection Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Hong Kong Polytechnic University","keywords":"Computer science; Computer network; Relay; Wireless sensor network; Software deployment; Base station; Wireless; Key distribution in wireless sensor networks; Distributed computing; Wireless network; Telecommunications","score_opus":0.04648938453610427,"score_gpt":0.24016167099591537,"score_spread":0.1936722864598111,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139389207","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.018076856,0.0012442671,0.97764456,0.0004245426,0.00006828638,0.0000825962,0.00010017978,0.00018662574,0.0021719742],"genre_scores_gemma":[0.7238093,0.0050924784,0.26651523,0.00020188409,0.00034442858,0.00036682683,0.0003327649,0.00024659114,0.0030904529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992311,0.00034368978,0.00004226352,0.00018508194,0.00011969657,0.00007816574],"domain_scores_gemma":[0.9985759,0.0008750858,0.00017546721,0.00009900869,0.00018847933,0.00008609845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014369847,0.0015018194,0.0009895896,0.0006973257,0.00047171544,0.00082423154,0.0018776442,0.0015011186,0.0010853088],"category_scores_gemma":[0.005980551,0.0004992157,0.00074776076,0.0012209876,0.00074436475,0.0024969308,0.0014346119,0.0008626826,0.00038416788],"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.00010739505,0.00008226995,0.0006353754,0.000572976,0.000052986587,0.00033127767,0.00022300548,0.8819666,0.01207407,0.038305514,0.0042143073,0.061434165],"study_design_scores_gemma":[0.000010534129,0.00011682864,0.00018792652,0.000032923002,0.000025276473,0.00022314207,0.00007525204,0.976926,0.0023376963,0.017636528,0.0024111276,0.000016855658],"about_ca_topic_score_codex":0.000652601,"about_ca_topic_score_gemma":0.0006423444,"teacher_disagreement_score":0.0018776442,"about_ca_system_score_codex":0.00091835804,"about_ca_system_score_gemma":0.0005793911,"threshold_uncertainty_score":0.0075995326},"labels":[],"label_agreement":null},{"id":"W2139541175","doi":"10.1109/71.932715","title":"Efficient local search far DAG scheduling","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Fair-share scheduling; Two-level scheduling; Dynamic priority scheduling; Rate-monotonic scheduling; Directed acyclic graph; Scheduling (production processes); Distributed computing; Incremental heuristic search; Algorithm; Schedule; Beam search; Search algorithm; Parallel computing; Mathematical optimization; Mathematics","score_opus":0.024678529277855774,"score_gpt":0.2528306202013057,"score_spread":0.22815209092344993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139541175","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.039503064,0.0009536896,0.94903815,0.0003196854,0.00010117632,0.00010260079,0.00018020571,0.0027789082,0.0070225336],"genre_scores_gemma":[0.6616815,0.0005691359,0.32720363,0.00021176528,0.000080261445,0.00029684152,0.0007794018,0.00040409388,0.008773386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990816,0.00037869028,0.000033491087,0.000093242284,0.00024611186,0.00016696173],"domain_scores_gemma":[0.9985713,0.0006461839,0.000105175626,0.00037379,0.00019177748,0.00011174819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933726,0.00053825154,0.0010898868,0.0008544315,0.0008869408,0.00096935517,0.001229061,0.00070706964,0.004539149],"category_scores_gemma":[0.003479912,0.00038493425,0.00050029985,0.0015332162,0.00058817136,0.0015952642,0.0017346267,0.00083161617,0.00146452],"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.0006193505,0.00017785045,0.00065146905,0.00023676887,0.00006266599,0.00014745769,0.00018072753,0.6978694,0.012336066,0.046245113,0.016056016,0.22541714],"study_design_scores_gemma":[0.00008236702,0.00010571941,0.00017696363,0.000008415502,0.000015512362,0.00004023773,0.000044881966,0.9673441,0.0033365968,0.024670916,0.0041593444,0.000014838349],"about_ca_topic_score_codex":0.0025286218,"about_ca_topic_score_gemma":0.0046363347,"teacher_disagreement_score":0.004539149,"about_ca_system_score_codex":0.0010128833,"about_ca_system_score_gemma":0.0015115947,"threshold_uncertainty_score":0.0151849985},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low"}],"label_agreement":"agree"},{"id":"W2140556288","doi":"10.1109/tpds.2011.180","title":"Leveraging Prediction to Improve the Coverage of Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless sensor network; Submodular set function; Leverage (statistics); Greedy algorithm; Node (physics); Entropy (arrow of time); Aggregate (composite); Distributed computing; Data mining; Mathematical optimization; Algorithm; Computer network; Machine learning","score_opus":0.01921452962852331,"score_gpt":0.20477065825686547,"score_spread":0.18555612862834214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140556288","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.034404624,0.00043417816,0.96372914,0.00024461545,0.00003053326,0.000026212,0.000031784894,0.00038614616,0.00071272504],"genre_scores_gemma":[0.8917787,0.00051405746,0.10666957,0.00012953392,0.00009750478,0.00007972032,0.00009833393,0.0000668602,0.00056573533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989349,0.0003430397,0.000045555043,0.00021477195,0.00034164134,0.00012005865],"domain_scores_gemma":[0.99602747,0.0025762059,0.00047755582,0.0005284559,0.0002933003,0.000097051605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014486127,0.0009578664,0.0012965575,0.00051963417,0.0004867166,0.000580853,0.0015229246,0.0009060333,0.00052951585],"category_scores_gemma":[0.007150104,0.00036276676,0.0004483575,0.0010519515,0.0009118441,0.002170691,0.0018322382,0.0010586522,0.00015871247],"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.0001236258,0.000053336513,0.0008454464,0.00007124231,0.00003216571,0.00005963957,0.000056899953,0.93047076,0.0065159583,0.0039583147,0.00075872755,0.057053927],"study_design_scores_gemma":[0.000008842311,0.000042087624,0.00013314318,0.000002955046,0.000007726845,0.00002254299,0.0000059112226,0.9946844,0.0014347843,0.0035115997,0.00014244525,0.000003508264],"about_ca_topic_score_codex":0.0016594463,"about_ca_topic_score_gemma":0.0020038367,"teacher_disagreement_score":0.0016594463,"about_ca_system_score_codex":0.0005682354,"about_ca_system_score_gemma":0.00074034435,"threshold_uncertainty_score":0.007661104},"labels":[],"label_agreement":null},{"id":"W2150914379","doi":"10.1109/tpds.2012.182","title":"Analysis of a Pool Management Scheme for Cloud Computing Centers","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Toronto Metropolitan University","funders":"","keywords":"Cloud computing; Computer science; Virtualization; Resource management (computing); Distributed computing; Task (project management); Capacity planning; Scheme (mathematics); Set (abstract data type); Resource allocation; Data center; Resource (disambiguation); Computer network; Operating system","score_opus":0.019437554857633592,"score_gpt":0.24862376703886746,"score_spread":0.22918621218123386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150914379","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.10920837,0.00036139396,0.880157,0.00084228633,0.000042776905,0.00023108619,0.00016105191,0.0002470347,0.008749055],"genre_scores_gemma":[0.95428336,0.00028742722,0.04155438,0.000077615674,0.000030117219,0.00019982357,0.00006845903,0.00006999618,0.0034287537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912935,0.00028094428,0.00002422019,0.00011004748,0.00021694395,0.0002385685],"domain_scores_gemma":[0.99892163,0.00053838175,0.0001498448,0.00010788027,0.00017521555,0.000107133164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002492876,0.00059471565,0.00093891594,0.0004760351,0.0010371504,0.0018656213,0.0015476819,0.0010235299,0.004078905],"category_scores_gemma":[0.004566458,0.0005226055,0.0006694615,0.0006072651,0.00097018445,0.0026047667,0.0013572773,0.00088290026,0.0003328698],"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.00004740111,0.000023141765,0.00028578896,0.000033406268,0.000015024006,0.000043229727,0.00004411583,0.9300536,0.0016547035,0.06322524,0.0006988618,0.00387545],"study_design_scores_gemma":[0.0000044154376,0.000015117978,0.000067379515,0.0000028040865,0.000004035136,0.000006568613,0.000010515551,0.99510705,0.00020072248,0.0043390617,0.00023895106,0.0000034758255],"about_ca_topic_score_codex":0.0056449403,"about_ca_topic_score_gemma":0.0022517082,"teacher_disagreement_score":0.0056449403,"about_ca_system_score_codex":0.0034925367,"about_ca_system_score_gemma":0.0030653558,"threshold_uncertainty_score":0.0253402},"labels":[],"label_agreement":null},{"id":"W2153410375","doi":"10.1109/tpds.2003.1239871","title":"Localized Delaunay triangulation with application in ad hoc wireless networks","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":230,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Delaunay triangulation; Computer science; Unit disk graph; Wireless ad hoc network; Spanner; Computer network; Topology (electrical circuits); Wireless network; Distributed computing; Algorithm; Mathematics; Wireless; Combinatorics; Telecommunications","score_opus":0.009531872383462547,"score_gpt":0.21650163505795017,"score_spread":0.20696976267448763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153410375","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.0039170766,0.0030101587,0.9891095,0.0001879294,0.00015016126,0.00010839449,0.000024984332,0.00065420574,0.002837591],"genre_scores_gemma":[0.18997559,0.007265182,0.7984392,0.00023079198,0.00024314917,0.0004420167,0.00016000832,0.00015264838,0.0030915148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989961,0.00033461707,0.000057208737,0.00014227655,0.0004218145,0.000048095906],"domain_scores_gemma":[0.9988249,0.0005442994,0.00013741243,0.00015694892,0.00028765452,0.000048778693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069458876,0.0008176149,0.0008469599,0.0011584768,0.0008825866,0.0006692969,0.0013047241,0.001250616,0.0025086745],"category_scores_gemma":[0.0032043213,0.0004622113,0.0006765398,0.003459803,0.0008099137,0.001201188,0.0017556929,0.00114291,0.0010747766],"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.000110955894,0.00008328333,0.0016987321,0.0011464407,0.00008305799,0.0005791963,0.00054301496,0.32822886,0.016676046,0.048900716,0.0088492045,0.5931005],"study_design_scores_gemma":[0.00003332702,0.00016621021,0.00047209652,0.00011515099,0.00004282001,0.0006342244,0.00020488258,0.8970006,0.007860844,0.044076953,0.049344663,0.00004822149],"about_ca_topic_score_codex":0.00158843,"about_ca_topic_score_gemma":0.001248657,"teacher_disagreement_score":0.0025086745,"about_ca_system_score_codex":0.00050593977,"about_ca_system_score_gemma":0.0005098121,"threshold_uncertainty_score":0.008392334},"labels":[],"label_agreement":null},{"id":"W2153758166","doi":"10.1109/tpds.2012.94","title":"Fast Channel Zapping with Destination-Oriented Multicast for IP Video Delivery","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multicast; Computer science; Computer network; IPTV; Scalability; Quality of experience; Channel (broadcasting); Overhead (engineering); Robustness (evolution); Quality of service; Distributed computing; Operating system","score_opus":0.023427496665875736,"score_gpt":0.22812416394470617,"score_spread":0.20469666727883043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153758166","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.07765693,0.0005057361,0.9178881,0.00016715766,0.000075484466,0.00006747703,0.00003773354,0.0005562026,0.0030452241],"genre_scores_gemma":[0.93591887,0.00036015824,0.06260746,0.00007149379,0.000060276077,0.00005207185,0.000043334898,0.000025114348,0.00086118723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999542,0.0001171237,0.000016988539,0.000068190006,0.00014698367,0.00010862824],"domain_scores_gemma":[0.9995704,0.0001498196,0.00006331335,0.00009898629,0.00008197921,0.00003552394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048451847,0.00042537352,0.00038052356,0.00042027966,0.0005394932,0.00046193268,0.00086367613,0.00035730092,0.0006934346],"category_scores_gemma":[0.0014135534,0.00016912573,0.00033771677,0.00044729156,0.00046007274,0.00083320925,0.0011724031,0.00067629036,0.00016063204],"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.00092959864,0.00022946508,0.0026489794,0.00043758005,0.00008841784,0.0009872714,0.00077379716,0.36073378,0.24042553,0.11645423,0.0049674003,0.27132386],"study_design_scores_gemma":[0.000017112721,0.00020855972,0.00031267616,0.000012987658,0.000025840005,0.00017259583,0.00007555312,0.97471946,0.011827072,0.009691006,0.0029151463,0.000022030956],"about_ca_topic_score_codex":0.0013622158,"about_ca_topic_score_gemma":0.0012916249,"teacher_disagreement_score":0.0013622158,"about_ca_system_score_codex":0.00069611886,"about_ca_system_score_gemma":0.00045466772,"threshold_uncertainty_score":0.005050719},"labels":[],"label_agreement":null},{"id":"W2154336299","doi":"10.1109/tpds.2012.195","title":"Exploiting Concurrency for Efficient Dissemination in Wireless Sensor Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Dissemination; Computer network; Wireless sensor network; Distributed computing; Flooding (psychology); Bottleneck; Concurrency; Control reconfiguration; Network topology; Exploit; Network packet; Linear network coding; Scheduling (production processes); Computer security; Embedded system","score_opus":0.01833559375524052,"score_gpt":0.2539992113007818,"score_spread":0.23566361754554127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154336299","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.13971289,0.0016138197,0.85495937,0.00033583253,0.00006668419,0.00009631165,0.000027625898,0.0010861566,0.002101415],"genre_scores_gemma":[0.9010836,0.0005461458,0.09718508,0.0000591555,0.00003759848,0.00013514949,0.000039719635,0.00008665932,0.0008269228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886405,0.0004173893,0.00009666411,0.00014104211,0.0003610681,0.000119801036],"domain_scores_gemma":[0.99543804,0.002707432,0.00046707742,0.0008234188,0.000359144,0.00020487486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022176185,0.00038790613,0.00047867265,0.00077742897,0.0007097191,0.0010466365,0.00092939957,0.0004142725,0.0006015466],"category_scores_gemma":[0.0073041506,0.0004371704,0.00032115993,0.00069868466,0.0012141503,0.002352425,0.002108009,0.0010295357,0.00014492357],"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.0005850963,0.0002330683,0.004561698,0.0004238719,0.00006983668,0.00036232214,0.0012300621,0.52600056,0.1446735,0.080973126,0.0012383477,0.23964854],"study_design_scores_gemma":[0.000087672226,0.00023912966,0.00038964857,0.000024731702,0.000037839556,0.00017349684,0.0000879911,0.9326344,0.030589074,0.030954283,0.0047432096,0.00003852958],"about_ca_topic_score_codex":0.0010471676,"about_ca_topic_score_gemma":0.0013426233,"teacher_disagreement_score":0.0022176185,"about_ca_system_score_codex":0.00058857934,"about_ca_system_score_gemma":0.0010473666,"threshold_uncertainty_score":0.011728048},"labels":[],"label_agreement":null},{"id":"W2154620955","doi":"10.1109/71.969122","title":"On rolling back and checkpointing in time warp","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Database Systems and Queries","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Benchmark (surveying); Parallel computing; Execution time; Granularity; Electronic circuit; Very-large-scale integration; Algorithm; Sequential logic; Embedded system; Logic gate","score_opus":0.0150698584488355,"score_gpt":0.22991987577352946,"score_spread":0.21485001732469397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154620955","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.05108329,0.0010845994,0.9401653,0.00039509492,0.00014244716,0.000113058384,0.000058143763,0.0021074081,0.0048505682],"genre_scores_gemma":[0.5500604,0.0011131639,0.44376394,0.0001845567,0.000111821624,0.00016390007,0.00020725884,0.000423341,0.0039716316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913186,0.0002818746,0.0000455357,0.00013514448,0.0002613356,0.0001443048],"domain_scores_gemma":[0.9979955,0.0010430836,0.00016109292,0.00047127396,0.00025054807,0.000078587356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010185019,0.00082403916,0.00090132863,0.00061866886,0.0009922198,0.0010096716,0.0010917551,0.0007500305,0.0022577131],"category_scores_gemma":[0.0047220276,0.00036688446,0.0004935017,0.0009403451,0.0013634131,0.0021461924,0.0012169309,0.0013327859,0.0005266462],"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.0005567667,0.00009485605,0.0012808352,0.0001331734,0.00004572787,0.00014819393,0.0003258316,0.68811774,0.008371919,0.055103455,0.0045673875,0.2412541],"study_design_scores_gemma":[0.000058852904,0.00010174127,0.00020288427,0.000018165048,0.000018359464,0.00007809647,0.00010078531,0.9601498,0.00932287,0.024084909,0.0058395187,0.000024023917],"about_ca_topic_score_codex":0.0051764753,"about_ca_topic_score_gemma":0.0026375956,"teacher_disagreement_score":0.0051764753,"about_ca_system_score_codex":0.0006642839,"about_ca_system_score_gemma":0.00082882395,"threshold_uncertainty_score":0.010292709},"labels":[],"label_agreement":null},{"id":"W2158171428","doi":"10.1109/tpds.2006.64","title":"Providing service guarantees in high-speed switching systems with feedback output queuing","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Computer science; Scalability; Queueing theory; Computer network; Speedup; Network packet; Packet switching; Distributed computing; Service (business); Parallel computing; Operating system","score_opus":0.012897240487963535,"score_gpt":0.20414071143785217,"score_spread":0.19124347094988864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158171428","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.36143062,0.00040297533,0.6332759,0.0006011638,0.00009935832,0.000064773914,0.00006224596,0.0006380878,0.0034247744],"genre_scores_gemma":[0.9856592,0.00011071773,0.013349409,0.000035549125,0.000039111652,0.0000274362,0.000020854295,0.000017968527,0.0007398268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990829,0.00023031964,0.000036708905,0.000096664546,0.00029928453,0.00025406465],"domain_scores_gemma":[0.99739325,0.0017456822,0.0002757775,0.00013793603,0.00031640398,0.0001310156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012939076,0.00059557875,0.0006526442,0.00035890716,0.0010589391,0.0013884314,0.001057015,0.0008418735,0.001658819],"category_scores_gemma":[0.004623495,0.0003119974,0.0003116689,0.00055033405,0.0012931334,0.0016116167,0.0009576186,0.0010209486,0.0001654392],"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.00028362975,0.00007780607,0.0010135599,0.00006655188,0.000024724348,0.00019206914,0.00014691145,0.93885446,0.0066569312,0.038807906,0.0006597896,0.013215653],"study_design_scores_gemma":[0.000021383992,0.000026930695,0.0000672991,0.0000014218851,0.0000044164567,0.000008439972,0.000012234146,0.99264646,0.0006073894,0.006474657,0.00012596304,0.000003342745],"about_ca_topic_score_codex":0.0058487905,"about_ca_topic_score_gemma":0.0033926794,"teacher_disagreement_score":0.0058487905,"about_ca_system_score_codex":0.0013136369,"about_ca_system_score_gemma":0.0013782983,"threshold_uncertainty_score":0.011629522},"labels":[],"label_agreement":null},{"id":"W2158438173","doi":"10.1109/tpds.2012.239","title":"GPUs as Storage System Accelerators","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Graphics processing unit; Multi-core processor; Leverage (statistics); Graphics; Embedded system; Coprocessor; Distributed computing; Parallel computing; Operating system","score_opus":0.022007362855716958,"score_gpt":0.24918552118173387,"score_spread":0.2271781583260169,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158438173","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.43994755,0.0049731014,0.48866767,0.0024710905,0.0013527932,0.00042014482,0.00082468713,0.015968114,0.045374863],"genre_scores_gemma":[0.8272396,0.0012013848,0.15796559,0.00026095528,0.00009310381,0.0000958953,0.00039692613,0.00040279824,0.012343817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.000097951204,0.000021968797,0.000053460368,0.00019102985,0.000055181536],"domain_scores_gemma":[0.99926215,0.00015004417,0.000048012782,0.00028298076,0.00018841415,0.000068377776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044643835,0.000386859,0.0003842166,0.00036498514,0.00062129716,0.0021077623,0.0013487,0.00069695426,0.005715468],"category_scores_gemma":[0.0017127327,0.0003790899,0.0002497168,0.00080021704,0.00076419185,0.001957969,0.0011869592,0.0008344611,0.0013743169],"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.0016324958,0.00020886093,0.009739824,0.00077510864,0.00014528126,0.00061763526,0.0010309606,0.12039985,0.31052285,0.18885645,0.045336124,0.32073456],"study_design_scores_gemma":[0.00032514802,0.0006446373,0.0042119822,0.00012362868,0.0001404882,0.00072058383,0.00042691507,0.59082663,0.17404217,0.04741381,0.1810235,0.000100550045],"about_ca_topic_score_codex":0.00238739,"about_ca_topic_score_gemma":0.0026026098,"teacher_disagreement_score":0.005715468,"about_ca_system_score_codex":0.0009376755,"about_ca_system_score_gemma":0.00081906526,"threshold_uncertainty_score":0.019120097},"labels":[],"label_agreement":null},{"id":"W2158783011","doi":"10.1109/tpds.2007.70730","title":"Scalability Analysis of the Hierarchical Architecture for Distributed Virtual Environments","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scalability; Server; Distributed computing; Workload; Consistency (knowledge bases); Virtual machine; Architecture; Workstation; Computer network; Operating system","score_opus":0.01742337890183155,"score_gpt":0.22847064163481381,"score_spread":0.21104726273298227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158783011","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.2746871,0.0015708497,0.70603764,0.001356703,0.00007529727,0.00028402562,0.00018113955,0.00080672477,0.015000608],"genre_scores_gemma":[0.9570502,0.00050960295,0.040355053,0.00009990781,0.00007444122,0.00015675087,0.00014686072,0.00007737001,0.0015299028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761814,0.0006908588,0.000088049215,0.00019654896,0.0010381953,0.00036823424],"domain_scores_gemma":[0.99321026,0.003146224,0.00063006714,0.0007445045,0.0018954048,0.0003734249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028099527,0.0005140959,0.00048221956,0.00092807185,0.0007099681,0.0012195429,0.0016290568,0.0005637304,0.0019348733],"category_scores_gemma":[0.015822371,0.00038255294,0.0004898466,0.0009448239,0.00083177985,0.0022915406,0.0013296606,0.001085573,0.0002739974],"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.00031785158,0.000167669,0.006803965,0.00025085435,0.00008050411,0.00029576308,0.0005286632,0.78041565,0.016451122,0.13817328,0.004545157,0.051969573],"study_design_scores_gemma":[0.000010975974,0.000036159057,0.0006593286,0.0000069551093,0.000010043736,0.00003872514,0.000045670462,0.9852158,0.0007381025,0.0127043165,0.0005267126,0.0000072496473],"about_ca_topic_score_codex":0.006268889,"about_ca_topic_score_gemma":0.0029954338,"teacher_disagreement_score":0.006268889,"about_ca_system_score_codex":0.0021489677,"about_ca_system_score_gemma":0.0016494729,"threshold_uncertainty_score":0.015591919},"labels":[],"label_agreement":null},{"id":"W2158909754","doi":"10.1109/tpds.2006.77","title":"Random coverage with guaranteed connectivity: joint scheduling for wireless sensor networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":237,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Scheduling (production processes); Distributed computing; Real-time computing; Key distribution in wireless sensor networks; Computer network; Wireless network; Wireless; Telecommunications; Engineering","score_opus":0.012251449699531795,"score_gpt":0.20498499222785466,"score_spread":0.19273354252832287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158909754","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.006402413,0.00023961102,0.9924043,0.00007471895,0.000030298552,0.000035573146,0.00001369701,0.00024337716,0.00055599184],"genre_scores_gemma":[0.6781112,0.00051162665,0.3189353,0.00010619946,0.00022405759,0.0002677057,0.00011525952,0.00017603429,0.0015525707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806434,0.00078817544,0.000085775595,0.0003105874,0.00061337696,0.0001377695],"domain_scores_gemma":[0.99637717,0.001857405,0.0005395838,0.0006433459,0.0003810826,0.00020147917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002368526,0.0009187926,0.000979117,0.0007127377,0.00052939897,0.0007490173,0.0014587743,0.00068107113,0.0009883285],"category_scores_gemma":[0.009033199,0.0004758838,0.00056679465,0.0010445372,0.00085059,0.0015593412,0.0011636779,0.0007031166,0.0002861761],"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.0002588995,0.0001240363,0.0008442656,0.00014912688,0.00007582737,0.00012687764,0.00015600755,0.8220238,0.009485778,0.04215588,0.0019850465,0.122614525],"study_design_scores_gemma":[0.00003492647,0.000108795786,0.00012544576,0.000006167564,0.000016024884,0.00006836595,0.000012064339,0.986357,0.0013815026,0.01068851,0.0011900787,0.000011169837],"about_ca_topic_score_codex":0.0011457758,"about_ca_topic_score_gemma":0.0012659385,"teacher_disagreement_score":0.002368526,"about_ca_system_score_codex":0.00078146247,"about_ca_system_score_gemma":0.001163085,"threshold_uncertainty_score":0.012526095},"labels":[],"label_agreement":null},{"id":"W2158923830","doi":"10.1109/tpds.2006.54","title":"Performance of a beacon enabled IEEE 802.15.4 cluster with downlink and uplink traffic","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Telecommunications link; Computer network; Computer science; Network packet; Queue; Beacon; Real-time computing","score_opus":0.009043354440059527,"score_gpt":0.2059237537876299,"score_spread":0.19688039934757037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158923830","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.9927201,0.000087872555,0.005523762,0.00010443119,0.000020805643,0.000018386498,0.00005390843,0.00024035682,0.0012303952],"genre_scores_gemma":[0.9988998,0.00003179412,0.000684163,0.000017474806,0.000003470357,0.0000068350205,0.00004474749,0.000009515596,0.00030217998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989737,0.0002160886,0.000055078977,0.00016391923,0.00023917027,0.00035207724],"domain_scores_gemma":[0.9959645,0.0019781934,0.00036744264,0.00026686097,0.0010163072,0.0004065819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019040303,0.0007086861,0.00079427916,0.00075455883,0.0008865188,0.00083326007,0.0011536068,0.00088959973,0.0008216113],"category_scores_gemma":[0.00494715,0.00033100808,0.00031868697,0.00086553016,0.0012969305,0.0008473158,0.0009389498,0.0006877194,0.00013158798],"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.0021970933,0.00026779034,0.009368889,0.000072358125,0.00006355981,0.00018328923,0.00019770871,0.9553716,0.019655004,0.002400014,0.000707274,0.00951537],"study_design_scores_gemma":[0.000047925503,0.00046116722,0.0026595185,0.000005792378,0.000027674427,0.000042269672,0.00006808126,0.98966646,0.0064801173,0.00042563534,0.00009400349,0.000021371377],"about_ca_topic_score_codex":0.017341608,"about_ca_topic_score_gemma":0.005936152,"teacher_disagreement_score":0.017341608,"about_ca_system_score_codex":0.0020817232,"about_ca_system_score_gemma":0.0014754112,"threshold_uncertainty_score":0.034481347},"labels":[],"label_agreement":null},{"id":"W2160280191","doi":"10.1109/tpds.2014.2342740","title":"Small Cluster in Cyber Physical Systems: Network Topology, Interdependence and Cascading Failures","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Ministarstvo Prosvete, Nauke i Tehnološkog Razvoja","keywords":"Interdependent networks; Cascading failure; Computer science; Giant component; Network topology; Small-world network; Component (thermodynamics); Generality; Cluster (spacecraft); Distributed computing; Topology (electrical circuits); Metric (unit); Fraction (chemistry); Complex network; Upper and lower bounds; Connected component; Percolation (cognitive psychology); Computer network; Random graph; Theoretical computer science; Mathematics; Physics; Graph; Electric power system; Artificial intelligence","score_opus":0.01464613176780329,"score_gpt":0.24597382361107165,"score_spread":0.23132769184326835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160280191","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.5732549,0.0061042737,0.4067164,0.0013688457,0.000103108934,0.00011663834,0.0002661061,0.00037980074,0.011690004],"genre_scores_gemma":[0.9909915,0.0012223684,0.0066956505,0.00004471551,0.000037115915,0.000039183004,0.00006565637,0.000023395569,0.00088048517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953854,0.0001716915,0.000017524224,0.00011243375,0.000106372,0.000053454816],"domain_scores_gemma":[0.99772054,0.0012077998,0.00047373414,0.00022450056,0.00021590029,0.0001575916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964445,0.0005489878,0.00044695634,0.0013529507,0.00071079464,0.0011391453,0.0007914071,0.0007142369,0.0011806935],"category_scores_gemma":[0.0039476654,0.0002744026,0.00041884938,0.0013859998,0.0014539515,0.002521604,0.0010102335,0.0007459636,0.00012857716],"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.00013554758,0.00007600645,0.018145418,0.0003293588,0.00013606486,0.0008781217,0.00068183057,0.8350671,0.0072677108,0.108134046,0.0023876566,0.026761064],"study_design_scores_gemma":[0.000012395743,0.00010910247,0.01029319,0.000048080252,0.000076089935,0.00059733324,0.00045362202,0.87886477,0.0018526075,0.10421076,0.003432034,0.000049965423],"about_ca_topic_score_codex":0.0035796273,"about_ca_topic_score_gemma":0.002739166,"teacher_disagreement_score":0.0035796273,"about_ca_system_score_codex":0.001010983,"about_ca_system_score_gemma":0.000446219,"threshold_uncertainty_score":0.0073352456},"labels":[],"label_agreement":null},{"id":"W2165019678","doi":"10.1109/tpds.2010.28","title":"FS2You: Peer-Assisted Semipersistent Online Hosting at a Large Scale","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Server; Upload; Bandwidth (computing); The Internet; Cloud computing; World Wide Web; SSH File Transfer Protocol; Software deployment; Peer-to-peer; BitTorrent; File server; File system; Self-certifying File System; Operating system; Computer network","score_opus":0.01937592325358305,"score_gpt":0.23531616155904106,"score_spread":0.215940238305458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165019678","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.41334793,0.00048360662,0.4842692,0.00039316263,0.00030666147,0.001237687,0.0005080605,0.08830503,0.01114871],"genre_scores_gemma":[0.91997683,0.00010183543,0.073705286,0.00014808492,0.0000665309,0.00027610554,0.0005344499,0.0005617618,0.0046290243],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987993,0.00024244713,0.000065810535,0.00025944333,0.00042800745,0.00020494575],"domain_scores_gemma":[0.9952199,0.0010305878,0.00042377406,0.0020914883,0.0005893476,0.00064481166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001475981,0.0006957398,0.00056420104,0.00065585005,0.0007590164,0.0008954266,0.003090491,0.0008203623,0.0035381871],"category_scores_gemma":[0.004307097,0.00034071459,0.0002908799,0.00036232488,0.0009269874,0.0029278914,0.003225782,0.0009975634,0.00093456],"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.0039947974,0.0020966954,0.020782797,0.0010526781,0.00039948866,0.0034505816,0.0030630429,0.1093005,0.28446233,0.024384655,0.064302914,0.48270953],"study_design_scores_gemma":[0.0005316512,0.0032456056,0.015545559,0.00008189153,0.00014832799,0.0020538797,0.0009144207,0.80130744,0.10432064,0.009756305,0.06180012,0.00029418783],"about_ca_topic_score_codex":0.0015572299,"about_ca_topic_score_gemma":0.0015180461,"teacher_disagreement_score":0.0035381871,"about_ca_system_score_codex":0.00047754357,"about_ca_system_score_gemma":0.00065263116,"threshold_uncertainty_score":0.01183641},"labels":[],"label_agreement":null},{"id":"W2165275875","doi":"10.1109/71.980024","title":"Dominating sets and neighbor elimination-based broadcasting algorithms in wireless networks","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":871,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada); University of Ottawa","funders":"","keywords":"Computer science; Broadcasting (networking); Computer network; Retransmission; Node (physics); Overhead (engineering); Wireless network; Transmission (telecommunications); Wireless; Algorithm; Distributed computing; Network packet; Telecommunications","score_opus":0.01915252195389812,"score_gpt":0.2278275419431529,"score_spread":0.2086750199892548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165275875","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.019974144,0.0044432073,0.9666889,0.0004504882,0.00020346695,0.0002559781,0.00012914915,0.00043950742,0.0074151545],"genre_scores_gemma":[0.37979433,0.0065179374,0.60329074,0.0005435481,0.00040646634,0.0008319906,0.00058976776,0.00014247412,0.007882712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.00061813195,0.000077006625,0.00020260295,0.00046081643,0.0000960222],"domain_scores_gemma":[0.9984048,0.0009911354,0.0001910938,0.00013261799,0.00022154313,0.00005881342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013809924,0.0009280157,0.000934955,0.001315973,0.00085621065,0.0010033447,0.0015469246,0.00089049526,0.0010647805],"category_scores_gemma":[0.0040578744,0.00045496796,0.00064318796,0.0019702062,0.001097076,0.0016222394,0.00097587984,0.0009897032,0.00041555896],"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.0001915239,0.000117594645,0.0010077669,0.0007273169,0.00020428796,0.000134362,0.00063476374,0.5024277,0.006687006,0.19834554,0.00592226,0.28359985],"study_design_scores_gemma":[0.0001260573,0.0003425378,0.00062421616,0.000095831965,0.00009152482,0.00036838293,0.00019219301,0.7871311,0.0056294557,0.17535229,0.029989233,0.000057123667],"about_ca_topic_score_codex":0.0016680633,"about_ca_topic_score_gemma":0.0015346315,"teacher_disagreement_score":0.0016680633,"about_ca_system_score_codex":0.0012676356,"about_ca_system_score_gemma":0.00087324163,"threshold_uncertainty_score":0.009197414},"labels":[],"label_agreement":null},{"id":"W2167628356","doi":"10.1109/tpds.2008.59","title":"Linear Programming-Based Affinity Scheduling of Independent Tasks on Heterogeneous Computing Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Computer science; Scheduling (production processes); Linear programming; Distributed computing; Mathematical optimization; Algorithm; Mathematics","score_opus":0.03311710618035313,"score_gpt":0.25184238615073806,"score_spread":0.21872527997038493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167628356","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.11384611,0.0004832877,0.8741019,0.0005647464,0.00010720551,0.00015047297,0.000059053484,0.0007609069,0.009926302],"genre_scores_gemma":[0.81511146,0.00026007008,0.17752627,0.00021367335,0.00009714532,0.00020860242,0.00013795421,0.00012539735,0.0063193957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.00061027403,0.00004404957,0.00013474668,0.00026335742,0.00027962183],"domain_scores_gemma":[0.99780196,0.0014678302,0.00020412308,0.00008912885,0.0002593393,0.00017759668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014879247,0.0009550938,0.0012803266,0.0008227121,0.0009185409,0.0011980103,0.0018130193,0.000874259,0.0031254576],"category_scores_gemma":[0.0036097807,0.00070533267,0.00046112365,0.0012665886,0.0007752975,0.0011117428,0.0011811942,0.0010786785,0.0005336921],"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.000120589575,0.00009112472,0.00023038762,0.000046690795,0.000016345337,0.000057364206,0.00004324164,0.9766715,0.0011220287,0.0038819471,0.00097111304,0.016747797],"study_design_scores_gemma":[0.0000096668855,0.000016717795,0.000030376475,9.38002e-7,0.0000019380439,0.0000037874593,0.000008298679,0.99858874,0.00015277536,0.0010972624,0.000087482375,0.0000018662049],"about_ca_topic_score_codex":0.008836131,"about_ca_topic_score_gemma":0.0095860725,"teacher_disagreement_score":0.008836131,"about_ca_system_score_codex":0.0015735114,"about_ca_system_score_gemma":0.0015947835,"threshold_uncertainty_score":0.017569363},"labels":[],"label_agreement":null},{"id":"W2170398686","doi":"10.1109/tpds.2010.162","title":"Consensus and Mutual Exclusion in a Multiple Access Channel","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Mutual exclusion; Collision detection; Channel (broadcasting); Collision; Logarithm; Time complexity; Process (computing); Collision problem; Critical section; Mutual information; Algorithm; Theoretical computer science; Distributed computing; Computer network; Mathematics; Artificial intelligence; Computer security","score_opus":0.025493967799435698,"score_gpt":0.2571901699211026,"score_spread":0.23169620212166692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170398686","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.16176859,0.00047465655,0.824471,0.0017276542,0.000085857246,0.00024907145,0.00029624096,0.0004874574,0.010439567],"genre_scores_gemma":[0.8497061,0.00035687588,0.14178951,0.00016606935,0.00017041256,0.00060049334,0.00033141603,0.00014155358,0.0067376695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99191356,0.0030959493,0.00028632738,0.0014210583,0.001740624,0.0015426398],"domain_scores_gemma":[0.93709916,0.054613937,0.0025630114,0.002878308,0.0017718998,0.0010737568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005021624,0.0013200401,0.0017096497,0.0011578536,0.0018487392,0.0032855195,0.001746003,0.0021659445,0.0039481474],"category_scores_gemma":[0.026782155,0.00075159885,0.0012745466,0.0017050536,0.0039021054,0.0063284333,0.0033537485,0.0027563192,0.00051069364],"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.0006692307,0.00016151024,0.0012133821,0.00018206703,0.0000784768,0.00024729752,0.00038133364,0.77561945,0.002291971,0.20621563,0.0010999509,0.011839754],"study_design_scores_gemma":[0.00007755041,0.000050741462,0.00012800469,0.000007116388,0.000015113818,0.000033466302,0.000041437837,0.8949542,0.0007948352,0.10332037,0.0005619102,0.000015261629],"about_ca_topic_score_codex":0.0035005282,"about_ca_topic_score_gemma":0.0020492969,"teacher_disagreement_score":0.005021624,"about_ca_system_score_codex":0.0027893004,"about_ca_system_score_gemma":0.003409255,"threshold_uncertainty_score":0.026557148},"labels":[],"label_agreement":null},{"id":"W2170560434","doi":"10.1109/tpds.2013.227","title":"Optimal Load Balancing and Energy Cost Management for Internet Data Centers in Deregulated Electricity Markets","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Zhejiang University","keywords":"Computer science; Queueing theory; Electricity; Heuristic; Service-level agreement; Service provider; Energy consumption; Quality of service; Load balancing (electrical power); Service (business); The Internet; Computer network; Constraint (computer-aided design); Load management; Transmission (telecommunications); Telecommunications; Business; Engineering","score_opus":0.015452294025610106,"score_gpt":0.22159135207505892,"score_spread":0.20613905804944882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170560434","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.19758935,0.0010767949,0.78609055,0.0012881018,0.00008827781,0.00028344672,0.00024056842,0.00030531178,0.013037628],"genre_scores_gemma":[0.95460516,0.00031889914,0.042753287,0.00007805977,0.000028951667,0.00012692278,0.00008334109,0.000053862037,0.0019515232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936694,0.00026343722,0.00001655015,0.00010544249,0.00009991695,0.00014769529],"domain_scores_gemma":[0.99908125,0.000618476,0.00011827958,0.000020096399,0.00009856255,0.00006333248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001431419,0.0010105815,0.0012402106,0.000771108,0.00081120053,0.0021655632,0.0013521044,0.0013755739,0.0024568313],"category_scores_gemma":[0.0028760198,0.0008517048,0.0003847822,0.0010273966,0.0007884687,0.0019239418,0.000942123,0.0010952262,0.00022169459],"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.00005676075,0.000039626255,0.00018574853,0.000029515604,0.000010205039,0.000027351232,0.000017008522,0.9873936,0.0003760456,0.0045156917,0.00047147163,0.0068768663],"study_design_scores_gemma":[0.000007878308,0.000008737449,0.000043102616,0.0000014735477,0.000002082781,0.0000021711264,0.000010298491,0.9981476,0.00009209766,0.0015886567,0.00009392255,0.0000019304525],"about_ca_topic_score_codex":0.011369768,"about_ca_topic_score_gemma":0.012849302,"teacher_disagreement_score":0.011369768,"about_ca_system_score_codex":0.0026943395,"about_ca_system_score_gemma":0.0020834478,"threshold_uncertainty_score":0.022607148},"labels":[],"label_agreement":null},{"id":"W2211113829","doi":"10.1109/tpds.2016.2623309","title":"Beehive: Erasure Codes for Fixing Multiple Failures in Distributed Storage Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Replication (statistics); Erasure code; Overhead (engineering); Fault tolerance; Distributed data store; Erasure; Distributed computing; Transfer (computing); Reliability (semiconductor); Storage efficiency; Computer data storage; Parallel computing; Database; Decoding methods; Algorithm; Computer hardware; Operating system; Mathematics","score_opus":0.021082824733172027,"score_gpt":0.24937216893755124,"score_spread":0.2282893442043792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2211113829","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.11277317,0.0017221234,0.87373126,0.0003933142,0.00015231936,0.00015640722,0.00027488355,0.0067389947,0.004057606],"genre_scores_gemma":[0.734933,0.0005089608,0.26107472,0.00019437574,0.00003261077,0.0002552044,0.00029291294,0.00040832406,0.0022998205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991584,0.00020542984,0.00004564718,0.000111195215,0.00035788395,0.00012146987],"domain_scores_gemma":[0.99717903,0.0013359331,0.0002914966,0.000597916,0.0005010672,0.00009456869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001099508,0.0007244221,0.00044853572,0.0007450965,0.0005953506,0.0005493624,0.0010725085,0.0007594762,0.0016427024],"category_scores_gemma":[0.006879573,0.00026022788,0.0002528587,0.0007082951,0.0009745688,0.0013803331,0.0013199992,0.0011111129,0.00042371024],"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.00062165776,0.00012526177,0.0017118879,0.0002824354,0.000059597725,0.00018158027,0.00023292964,0.7420086,0.03960642,0.03495365,0.006800632,0.17341533],"study_design_scores_gemma":[0.00007018565,0.00020295201,0.00031676496,0.000048203583,0.000015516702,0.00013102894,0.00004741215,0.9378454,0.04106726,0.013921499,0.006290057,0.000043735476],"about_ca_topic_score_codex":0.0029336042,"about_ca_topic_score_gemma":0.003162852,"teacher_disagreement_score":0.0029336042,"about_ca_system_score_codex":0.0008114924,"about_ca_system_score_gemma":0.0013284904,"threshold_uncertainty_score":0.0058878064},"labels":[],"label_agreement":null},{"id":"W2294851609","doi":"10.1109/tpds.2012.172","title":"Speculative Authorization","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Latency (audio); Authorization; Span (engineering); Overhead (engineering); Life span; Distributed computing; Computer network; Operating system; Telecommunications","score_opus":0.027980821566718505,"score_gpt":0.25689063261692957,"score_spread":0.22890981105021108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2294851609","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.1039065,0.0011318584,0.86333597,0.0012635732,0.000331606,0.00045170423,0.00086292747,0.014959445,0.013756352],"genre_scores_gemma":[0.85923094,0.00032133405,0.13436274,0.00022949341,0.00015417101,0.00010436847,0.0009359487,0.0002571018,0.0044039274],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975395,0.0004975468,0.00015620704,0.000464266,0.0009996998,0.00034273593],"domain_scores_gemma":[0.98615813,0.0047561494,0.0010542417,0.0057189707,0.0017165841,0.0005958833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020233642,0.00091741484,0.0007796312,0.00081470696,0.0013696972,0.0018766106,0.0025271825,0.000912605,0.005515856],"category_scores_gemma":[0.012845982,0.0004552291,0.0005308904,0.0010223488,0.0010990875,0.004899746,0.0019512,0.0017802413,0.0016824435],"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.0015812392,0.0008264444,0.036712952,0.00047792107,0.00019766949,0.0007801602,0.0011830245,0.19439703,0.042175252,0.06727907,0.043631524,0.6107577],"study_design_scores_gemma":[0.000068321366,0.00030327673,0.002310838,0.000032880733,0.000053664626,0.00045834447,0.0001975039,0.9311426,0.017003704,0.026979422,0.021376966,0.000072473755],"about_ca_topic_score_codex":0.0071490477,"about_ca_topic_score_gemma":0.009219901,"teacher_disagreement_score":0.0071490477,"about_ca_system_score_codex":0.00086821057,"about_ca_system_score_gemma":0.0028058526,"threshold_uncertainty_score":0.018452346},"labels":[],"label_agreement":null},{"id":"W2318956585","doi":"10.1109/tpds.2016.2542815","title":"Post-Deployment Anomaly Detection and Diagnosis in Networked Embedded Systems by Program Profiling and Symptom Mining","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Debugging; Anomaly detection; Profiling (computer programming); Software deployment; Wireless sensor network; Data mining; Program analysis; Distributed computing; Real-time computing; Computer network; Operating system","score_opus":0.01018631391818493,"score_gpt":0.23139136991951384,"score_spread":0.22120505600132892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2318956585","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.2424393,0.00039242452,0.73769784,0.00037053856,0.000050095474,0.00019421663,0.00038176274,0.017578673,0.0008952498],"genre_scores_gemma":[0.70712566,0.00017685533,0.29069063,0.000101870755,0.000025034571,0.00012466856,0.0006439756,0.00030177247,0.0008094711],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888736,0.00019678006,0.000102623664,0.00027574057,0.00044227895,0.000095268304],"domain_scores_gemma":[0.99407816,0.0023888608,0.0014705868,0.0007965546,0.0010319395,0.00023387794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009370383,0.0009545607,0.00064537337,0.003084591,0.00035779446,0.0006960366,0.001136275,0.00055328256,0.0005287956],"category_scores_gemma":[0.0071850205,0.00034658503,0.0005511622,0.0012847089,0.00042013242,0.0012734405,0.0009297073,0.00071376405,0.00031378993],"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.00043799225,0.00069566467,0.11280286,0.0005232087,0.00014433633,0.0011694594,0.00082544575,0.060290083,0.08707803,0.002758272,0.0039408407,0.7293338],"study_design_scores_gemma":[0.000035897552,0.0002762455,0.026112217,0.000043187672,0.00008037784,0.00066737103,0.00027094813,0.91170424,0.05282363,0.0056050015,0.0023395214,0.00004136672],"about_ca_topic_score_codex":0.0018057172,"about_ca_topic_score_gemma":0.0024570322,"teacher_disagreement_score":0.003084591,"about_ca_system_score_codex":0.00042763143,"about_ca_system_score_gemma":0.00089996425,"threshold_uncertainty_score":0.0049556494},"labels":[],"label_agreement":null},{"id":"W2331386032","doi":"10.1109/tpds.2015.2447528","title":"Analysis of CSMA/CA Mechanism of IEEE 802.15.6 under Non-Saturation Regime","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Computer network; Body area network; Wireless; Bandwidth (computing); IEEE 802.11e-2005; Software deployment; IEEE 802.15; Channel (broadcasting); Wireless network; Wireless lan; Wireless sensor network; Telecommunications; Wi-Fi array","score_opus":0.01921438123364785,"score_gpt":0.22246160627754463,"score_spread":0.20324722504389678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331386032","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.29857937,0.0025418093,0.6647489,0.000985286,0.00019075537,0.0002323866,0.00025016328,0.0007487901,0.03172258],"genre_scores_gemma":[0.98884517,0.00048591255,0.007559558,0.00005947025,0.00003135749,0.000053130843,0.000030206913,0.00003188226,0.002903255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992009,0.00013521545,0.000026444184,0.00010627898,0.00033446008,0.0001967737],"domain_scores_gemma":[0.99854577,0.0006264109,0.00021681537,0.00012808808,0.0004321878,0.000050799656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093622523,0.0005287366,0.00060416094,0.00090708333,0.00064801524,0.0008308356,0.0014086765,0.00075232086,0.002447039],"category_scores_gemma":[0.0028620972,0.00032713084,0.0005111276,0.00047384773,0.0008556026,0.001095548,0.000366523,0.00078103,0.00038748814],"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.00018077862,0.0001007746,0.0025452164,0.00018891205,0.000070598406,0.0005342744,0.00032398518,0.82342464,0.033301864,0.12372991,0.0013584283,0.014240687],"study_design_scores_gemma":[0.000004944792,0.000020766838,0.00025435726,0.000005875313,0.000006821829,0.00004904223,0.000011288537,0.99535596,0.0009635651,0.0030654352,0.00025607416,0.0000058882483],"about_ca_topic_score_codex":0.007571743,"about_ca_topic_score_gemma":0.0036412734,"teacher_disagreement_score":0.007571743,"about_ca_system_score_codex":0.0013700925,"about_ca_system_score_gemma":0.0016607211,"threshold_uncertainty_score":0.015055358},"labels":[],"label_agreement":null},{"id":"W2336088419","doi":"10.1109/tpds.2016.2556669","title":"Limitations of Highly-Available Eventually-Consistent Data Stores","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","keywords":"Liveness; Computer science; Consistency (knowledge bases); Concurrency; Consistency model; Causal consistency; Eventual consistency; Sequential consistency; Data consistency; Causality (physics); Weak consistency; Distributed computing; Strong consistency; Concurrency control; Theoretical computer science; Programming language; Database transaction; Artificial intelligence; Mathematics","score_opus":0.101871782258235,"score_gpt":0.2534145340961861,"score_spread":0.15154275183795107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336088419","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.16784258,0.0034962657,0.7950487,0.0066663325,0.00028003115,0.0005682295,0.001214807,0.0036455144,0.021237424],"genre_scores_gemma":[0.8676436,0.0017870273,0.12133075,0.0008629953,0.00021519198,0.0005550284,0.00076124107,0.00043955105,0.006404518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.97598356,0.0064036474,0.002436833,0.0021112938,0.011242905,0.0018217423],"domain_scores_gemma":[0.87736464,0.06235851,0.0050126184,0.039115623,0.01426835,0.0018802062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01725597,0.0008338737,0.0015917327,0.0011056956,0.0023254668,0.006557148,0.008577469,0.0028127923,0.0070060845],"category_scores_gemma":[0.068676345,0.0020310993,0.0016135107,0.0021291047,0.0048050187,0.017227674,0.006382195,0.0046051503,0.0015696461],"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.0020459583,0.00050532015,0.00877153,0.0014093423,0.0002341762,0.0012262545,0.0025634805,0.15890875,0.012940433,0.7016583,0.008849598,0.10088693],"study_design_scores_gemma":[0.0006170498,0.0008359221,0.0011827004,0.00044080906,0.00023650138,0.001630234,0.0016804681,0.41899174,0.028147027,0.49550468,0.050509077,0.0002237916],"about_ca_topic_score_codex":0.005177622,"about_ca_topic_score_gemma":0.0033006573,"teacher_disagreement_score":0.01725597,"about_ca_system_score_codex":0.002486422,"about_ca_system_score_gemma":0.0064167287,"threshold_uncertainty_score":0.09125942},"labels":[],"label_agreement":null},{"id":"W2339254261","doi":"10.1109/tpds.2016.2556668","title":"Workflow Scheduling in Multi-Tenant Cloud Computing Environments","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":178,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Computer science; Cloud computing; Workflow; Distributed computing; Scalability; Workflow management system; Scheduling (production processes); Workflow engine; Workflow technology; Multitenancy; Software as a service; Database; Operating system; Software","score_opus":0.023265830463538945,"score_gpt":0.23536662075159348,"score_spread":0.21210079028805454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339254261","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.17043044,0.0010713685,0.8234496,0.000516688,0.0002532176,0.00021656885,0.00014798333,0.00081937166,0.003094725],"genre_scores_gemma":[0.8427521,0.00060091383,0.15500793,0.00009667618,0.0000667183,0.000093707575,0.0001450436,0.00008137147,0.0011555637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985971,0.00045702403,0.00010881739,0.00029732642,0.00026403932,0.00027577087],"domain_scores_gemma":[0.99870944,0.00048261596,0.00021561055,0.00013055422,0.00018804827,0.00027372947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019492658,0.0008099252,0.0010739891,0.00050750934,0.0014780909,0.0014608407,0.0013597828,0.00073467894,0.0007035694],"category_scores_gemma":[0.0023056592,0.0004535749,0.00074815593,0.0011768439,0.0005900872,0.001273175,0.0009571521,0.00090197346,0.00017478265],"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.0003460236,0.00012438865,0.0011441857,0.000118488104,0.000057695357,0.0004999821,0.00013502286,0.95087844,0.008324652,0.008976287,0.001204405,0.028190345],"study_design_scores_gemma":[0.000013999298,0.00003126338,0.0001869477,0.0000033047309,0.0000065587615,0.000040290208,0.000028633809,0.99529415,0.0010045994,0.0027862273,0.0005980064,0.000006073996],"about_ca_topic_score_codex":0.009375183,"about_ca_topic_score_gemma":0.006773764,"teacher_disagreement_score":0.009375183,"about_ca_system_score_codex":0.0012697672,"about_ca_system_score_gemma":0.0024102265,"threshold_uncertainty_score":0.018641233},"labels":[],"label_agreement":null},{"id":"W2345172367","doi":"10.1109/tpds.2015.2497693","title":"Support for Provisioning and Configuration Decisions for Data Intensive Workflows","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Provisioning; Workflow; Distributed computing; Workflow management system; Resource allocation; Workflow technology; Database; Process (computing); Node (physics); Real-time computing; Computer network; Operating system","score_opus":0.09067728796791664,"score_gpt":0.29943676599564334,"score_spread":0.2087594780277267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345172367","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.2585329,0.0003582184,0.69937575,0.0007541392,0.00008820194,0.0002495097,0.00041614822,0.035337828,0.004887299],"genre_scores_gemma":[0.8900263,0.00012664536,0.10793951,0.000062054896,0.000027428816,0.00007563371,0.00040494485,0.0003095238,0.0010278559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890625,0.00028063307,0.00007125678,0.0002413369,0.00036153337,0.00013904259],"domain_scores_gemma":[0.9919498,0.004196115,0.0009900269,0.001608757,0.0008301588,0.00042521275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021738466,0.0007896594,0.0005700334,0.0005749588,0.0009550456,0.001677895,0.0015313209,0.0006505555,0.0028674707],"category_scores_gemma":[0.012750228,0.00060837565,0.00035339312,0.0006005905,0.00057583075,0.0016177492,0.0010118734,0.0015457754,0.00092494156],"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.0011128153,0.00059707585,0.026179079,0.00030309972,0.000068637295,0.00057659886,0.00060036895,0.57241744,0.043447252,0.0070462273,0.007974305,0.33967718],"study_design_scores_gemma":[0.000022576605,0.00005805625,0.0019260492,0.00001751819,0.000011039274,0.00005841268,0.000051835872,0.98107153,0.012364668,0.0023845525,0.0020123934,0.000021327272],"about_ca_topic_score_codex":0.0029184602,"about_ca_topic_score_gemma":0.0041071395,"teacher_disagreement_score":0.0029184602,"about_ca_system_score_codex":0.00081650575,"about_ca_system_score_gemma":0.0024160887,"threshold_uncertainty_score":0.011496484},"labels":[],"label_agreement":null},{"id":"W2358348501","doi":"10.1109/tpds.2016.2567390","title":"Diagnosing Performance Variations by Comparing Multi-Level Execution Traces","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Codebase; Tracing; TRACE (psycholinguistics); Task (project management); Overhead (engineering); Kernel (algebra); Context (archaeology); Source code; Tree (set theory); Distributed computing; Machine learning; Programming language","score_opus":0.03671217780830908,"score_gpt":0.24399445136615242,"score_spread":0.20728227355784334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2358348501","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.74019355,0.00038984683,0.23746784,0.00017496909,0.00005515074,0.00027348177,0.0014324653,0.01834336,0.0016694003],"genre_scores_gemma":[0.90864116,0.00012036813,0.08882853,0.000024168563,0.000016103204,0.00010109417,0.0013436138,0.00048649334,0.0004385139],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954788,0.00069574424,0.0004687262,0.0010283065,0.0019923474,0.00033601906],"domain_scores_gemma":[0.9795466,0.009105429,0.003774317,0.0038609856,0.0030300429,0.00068256404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029822616,0.0015077973,0.00082920946,0.007058456,0.00046826937,0.001499218,0.001478002,0.0009228648,0.0007993307],"category_scores_gemma":[0.017641215,0.0005772986,0.00057616044,0.0031497125,0.0005571497,0.0019115154,0.0013842223,0.0010771182,0.0003574484],"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.0012973315,0.0010243191,0.31378344,0.00063879945,0.00050894334,0.0011113769,0.0019878838,0.10007652,0.13071561,0.0026777224,0.0027289502,0.44344905],"study_design_scores_gemma":[0.000060074715,0.00096726173,0.12658481,0.000064781554,0.00019933525,0.0009772123,0.0005616576,0.7815721,0.08046313,0.004489269,0.0038980017,0.00016236068],"about_ca_topic_score_codex":0.0040220595,"about_ca_topic_score_gemma":0.004483953,"teacher_disagreement_score":0.007058456,"about_ca_system_score_codex":0.0008351531,"about_ca_system_score_gemma":0.0012470442,"threshold_uncertainty_score":0.015771866},"labels":[],"label_agreement":null},{"id":"W2388796209","doi":"10.1109/tpds.2015.2470238","title":"A Distributed and Scalable Approach to Semi-Intrusive Load Monitoring","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Smart Grid Energy Management","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Science and Technology Commission of Shanghai Municipality; Natural Sciences and Engineering Research Council of Canada; Shanghai Municipal Education Commission; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Metering mode; Distributed computing; Energy consumption; Energy (signal processing); Real-time computing; TRACE (psycholinguistics); Load management; Constraint (computer-aided design); Scale (ratio); Power (physics); Database","score_opus":0.022911886239072584,"score_gpt":0.21629878302235891,"score_spread":0.19338689678328633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2388796209","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.011910897,0.00007489168,0.98571604,0.00010746753,0.00002197643,0.00004835246,0.000056576675,0.000993982,0.0010699339],"genre_scores_gemma":[0.6824104,0.00014298742,0.314743,0.00009453083,0.000078465804,0.00011944098,0.0002705604,0.00009285356,0.00204776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993432,0.00014967132,0.000029323104,0.00020599698,0.00021360243,0.000058248148],"domain_scores_gemma":[0.9990595,0.00027682527,0.00014242514,0.0003056652,0.00016782519,0.00004771837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066971924,0.0007759938,0.0008472803,0.00054400915,0.00040013267,0.0007115788,0.0015081177,0.00047578447,0.0011784042],"category_scores_gemma":[0.001817176,0.00034151363,0.0004174668,0.0007122501,0.00044453246,0.001337117,0.0012937123,0.00089631695,0.00034009427],"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.00019727623,0.00025441882,0.0022376103,0.00011236302,0.00007785215,0.00020020884,0.00013530385,0.70005536,0.023805615,0.011508393,0.0035239516,0.25789163],"study_design_scores_gemma":[0.000007451979,0.000023933273,0.00021193769,0.0000016872877,0.0000048968873,0.00002796221,0.00001633624,0.99498945,0.0014079344,0.002748509,0.0005551333,0.000004741602],"about_ca_topic_score_codex":0.001988444,"about_ca_topic_score_gemma":0.003786211,"teacher_disagreement_score":0.001988444,"about_ca_system_score_codex":0.0004892043,"about_ca_system_score_gemma":0.0008198907,"threshold_uncertainty_score":0.0039538145},"labels":[],"label_agreement":null},{"id":"W2465608688","doi":"10.1109/tpds.2016.2589934","title":"A Multi-Objective Model Oriented Mapping Approach for NoC-based Computing Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Efficient energy use; Control reconfiguration; Speedup; Reliability (semiconductor); Latency (audio); Network on a chip; Simulated annealing; Upper and lower bounds; Distributed computing; Parallel computing; Algorithm; Embedded system","score_opus":0.03765948783194529,"score_gpt":0.24794323133287693,"score_spread":0.21028374350093165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2465608688","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.004912562,0.0004856769,0.9916351,0.0001138927,0.00003329515,0.00004685125,0.000035245386,0.00015014508,0.0025873366],"genre_scores_gemma":[0.33811942,0.0011796927,0.6543885,0.00018710646,0.00007379678,0.0006234263,0.000239593,0.00019442601,0.0049941284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99956256,0.00016662083,0.00001965848,0.00006113542,0.00015720284,0.000032878055],"domain_scores_gemma":[0.9997428,0.00011456193,0.0000357114,0.00002578156,0.000067452645,0.0000136916215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007094584,0.0012572579,0.00076115463,0.00090709276,0.00041794617,0.0007492865,0.0011519898,0.00068143144,0.0018338532],"category_scores_gemma":[0.001033268,0.0004986925,0.0011122609,0.0008248613,0.0003151745,0.0008138779,0.0008550525,0.000872333,0.00028077737],"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.000010229534,0.000027319998,0.00018568528,0.00008809496,0.00004725738,0.000035945657,0.000024390896,0.9601191,0.0017004499,0.0080879275,0.00046585835,0.029207697],"study_design_scores_gemma":[0.000002637823,0.00002392455,0.000049009628,0.00000715368,0.000010012099,0.000016712305,0.000007577556,0.99502915,0.00034929684,0.0035955568,0.0009052781,0.0000038152484],"about_ca_topic_score_codex":0.0026425552,"about_ca_topic_score_gemma":0.0026777862,"teacher_disagreement_score":0.0026425552,"about_ca_system_score_codex":0.0007091346,"about_ca_system_score_gemma":0.0010416256,"threshold_uncertainty_score":0.0061348677},"labels":[],"label_agreement":null},{"id":"W2473099193","doi":"10.1109/tpds.2016.2586059","title":"Durable Address Translation in PCM-based Flash Storage Systems","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Phase-change memory; Dram; Embedded system; Flash memory; Universal memory; Dynamic random-access memory; Overhead (engineering); Flash file system; Reliability (semiconductor); Non-volatile random-access memory; Computer hardware; Memory management; Semiconductor memory; Power (physics); Interleaved memory; Operating system; Computer memory; Memory refresh; Layer (electronics)","score_opus":0.0283094782003634,"score_gpt":0.2456543544431696,"score_spread":0.2173448762428062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473099193","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.66950625,0.003984569,0.30630398,0.0004644717,0.0002739466,0.00026843505,0.00038454312,0.0076719336,0.011141937],"genre_scores_gemma":[0.97749877,0.00031222403,0.019913755,0.00010172115,0.000040828178,0.00005407968,0.00013116626,0.0000531622,0.0018942103],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996315,0.000058820577,0.00003685077,0.00005560354,0.00016457684,0.000052610296],"domain_scores_gemma":[0.9993667,0.00013250078,0.00008866926,0.0002603819,0.00011969283,0.0000320459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026442157,0.00034316894,0.00029050963,0.00043326625,0.0005421728,0.00068199704,0.0009954462,0.00037936645,0.0016369144],"category_scores_gemma":[0.0012391543,0.00017298474,0.00012880407,0.0006272831,0.00034903342,0.0011901843,0.0007900071,0.0003348872,0.00040577838],"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.0010417046,0.00039398717,0.005850297,0.0005849914,0.00006073647,0.0018275902,0.0006765942,0.11526125,0.39986637,0.01702785,0.009055219,0.44835347],"study_design_scores_gemma":[0.00011955987,0.0010173352,0.00315082,0.000047634432,0.00006533135,0.0013527427,0.0002998816,0.6596443,0.30141303,0.0121555,0.020681877,0.000052017393],"about_ca_topic_score_codex":0.00054213766,"about_ca_topic_score_gemma":0.00072893803,"teacher_disagreement_score":0.0016369144,"about_ca_system_score_codex":0.00034917335,"about_ca_system_score_gemma":0.00034936666,"threshold_uncertainty_score":0.0054760575},"labels":[],"label_agreement":null},{"id":"W2500017973","doi":"10.1109/tpds.2015.2488629","title":"Wait Analysis of Distributed Systems Using Kernel Tracing","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Tracing; Distributed computing; Scheduling (production processes); Overhead (engineering); TRACE (psycholinguistics); Kernel (algebra); Control flow; Computer multitasking; Parallel computing; Address space; Real-time computing; Operating system","score_opus":0.040160039793068925,"score_gpt":0.268441434870765,"score_spread":0.22828139507769607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2500017973","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.13328263,0.00010304583,0.86035407,0.000041100477,0.000011836768,0.000031946623,0.000048865775,0.005344543,0.00078202836],"genre_scores_gemma":[0.8788645,0.000049082428,0.11981532,0.000013382989,0.000007954236,0.000036569527,0.00008582697,0.00029501997,0.0008324088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99927944,0.00013249514,0.000043740623,0.00014781945,0.00030076498,0.000095734395],"domain_scores_gemma":[0.9976774,0.0009060062,0.0003053841,0.0006837075,0.00034281242,0.00008477422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006239426,0.000531021,0.0004062457,0.001204221,0.00050620124,0.00081981526,0.0010409877,0.0002904772,0.0009302239],"category_scores_gemma":[0.0030926953,0.0002970647,0.00043677882,0.0006431316,0.0005607436,0.0011071765,0.00077120506,0.00062371127,0.00015734861],"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.0009930162,0.0002912989,0.033934116,0.0002950248,0.00015858989,0.0005522133,0.0014264489,0.4803113,0.18053026,0.040607896,0.0018526993,0.2590471],"study_design_scores_gemma":[0.000013130084,0.000059278547,0.0015388645,0.0000049128803,0.00001761059,0.000059050875,0.000033101514,0.97435826,0.018407082,0.004557312,0.0009379443,0.000013400471],"about_ca_topic_score_codex":0.0042958376,"about_ca_topic_score_gemma":0.0030466705,"teacher_disagreement_score":0.0042958376,"about_ca_system_score_codex":0.0007575149,"about_ca_system_score_gemma":0.0010995839,"threshold_uncertainty_score":0.008541644},"labels":[],"label_agreement":null},{"id":"W2512459603","doi":"10.1109/tpds.2016.2605684","title":"Semi-Online Algorithms for Computational Task Offloading with Communication Delay","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Scheduling (production processes); A priori and a posteriori; Job shop scheduling; Cloud computing; Distributed computing; Task (project management); Set (abstract data type); Parallel computing; Algorithm; Real-time computing; Computer network","score_opus":0.021393381816190715,"score_gpt":0.24702844434754812,"score_spread":0.2256350625313574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512459603","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.03126116,0.0008249739,0.9609828,0.0003681803,0.00013014973,0.00018615158,0.000150522,0.0015329119,0.004563148],"genre_scores_gemma":[0.5983895,0.00047833068,0.39581645,0.00029390177,0.00016049045,0.00044263378,0.00044050236,0.0004237702,0.0035543214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979948,0.0006812086,0.000109073124,0.00034822637,0.0004333239,0.00043338715],"domain_scores_gemma":[0.99226743,0.005087048,0.0007366794,0.001006956,0.0005153215,0.00038655015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022369844,0.0019166835,0.0021502103,0.000848918,0.00112195,0.0017605159,0.0033587883,0.0013862072,0.0040187393],"category_scores_gemma":[0.006631224,0.00079552527,0.0007574619,0.0016399745,0.0012462224,0.002641581,0.002117641,0.0016128923,0.00095135975],"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.0005954563,0.00041547057,0.0006072145,0.0003169685,0.00006060092,0.00010935287,0.00012514362,0.8786258,0.0039333715,0.014649404,0.0034249644,0.09713624],"study_design_scores_gemma":[0.000041521223,0.00006376756,0.00006603521,0.0000062372624,0.0000070199762,0.000027543618,0.000018813862,0.99120224,0.0006774363,0.0073282574,0.00055402535,0.0000070772003],"about_ca_topic_score_codex":0.004456261,"about_ca_topic_score_gemma":0.004130556,"teacher_disagreement_score":0.004456261,"about_ca_system_score_codex":0.0014540144,"about_ca_system_score_gemma":0.002956279,"threshold_uncertainty_score":0.013444066},"labels":[],"label_agreement":null},{"id":"W2554389056","doi":"10.1109/tpds.2017.2729545","title":"Nessie: A Decoupled, Client-Driven Key-Value Store Using RDMA","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Canada Foundation for Innovation","keywords":"Computer science; Server; Remote direct memory access; Throughput; Operating system; Key (lock); Idle; File server; Flexibility (engineering); Overhead (engineering); Garbage collection; Computer network; Garbage","score_opus":0.03047986043438524,"score_gpt":0.2696250131910511,"score_spread":0.23914515275666584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554389056","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.10845136,0.002063505,0.79238975,0.0005769083,0.00049693865,0.0006244568,0.0012785874,0.06770494,0.02641349],"genre_scores_gemma":[0.672615,0.00072670536,0.27436978,0.0007810439,0.0001861284,0.000438421,0.0029340491,0.0019497823,0.04599909],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881315,0.00009572331,0.00009709268,0.00018409935,0.00065190566,0.00015814409],"domain_scores_gemma":[0.99825495,0.0002887813,0.00012415664,0.00065079174,0.00054493063,0.00013644017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007134669,0.00074682175,0.00083100266,0.0009579691,0.00067658495,0.0020110512,0.005131883,0.00059387763,0.009107825],"category_scores_gemma":[0.0018799207,0.0006946209,0.0004539488,0.0012293409,0.00069767266,0.0031657019,0.0021953585,0.0013794026,0.0040293573],"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.0050862413,0.0012907502,0.005542666,0.0010629469,0.00037877355,0.0013794419,0.00087064307,0.032851946,0.2906646,0.054649014,0.09908288,0.50714016],"study_design_scores_gemma":[0.00090166734,0.0010972198,0.0016028717,0.00009015646,0.0001973206,0.0012072468,0.00022423331,0.50105757,0.36615336,0.013655534,0.1134751,0.0003377775],"about_ca_topic_score_codex":0.0022522972,"about_ca_topic_score_gemma":0.00407164,"teacher_disagreement_score":0.009107825,"about_ca_system_score_codex":0.00089214236,"about_ca_system_score_gemma":0.0017206209,"threshold_uncertainty_score":0.030468702},"labels":[],"label_agreement":null},{"id":"W2602337361","doi":"10.1109/tpds.2017.2687461","title":"Adaptive Particle Swarm Optimization with Heterogeneous Multicore Parallelism and GPU Acceleration","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Parallel computing; Multi-core processor; Data parallelism; CUDA; Xeon; Xeon Phi; Particle swarm optimization; Vectorization (mathematics); Graphics processing unit; Parallel processing; Parallelism (grammar); Algorithm","score_opus":0.041198773977055084,"score_gpt":0.27206910627444064,"score_spread":0.23087033229738557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2602337361","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.15328038,0.0004109215,0.83648795,0.0003183694,0.0000885851,0.00006918668,0.00004484396,0.00072193047,0.008577868],"genre_scores_gemma":[0.73129076,0.00017764202,0.26613876,0.00006158554,0.000029780764,0.00008189348,0.00007816417,0.00009394024,0.0020474503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997502,0.00007636164,0.000011033593,0.00004203711,0.00008812016,0.000032296386],"domain_scores_gemma":[0.9997116,0.000091281196,0.000029300028,0.00007965106,0.00006609043,0.000022000322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038925785,0.00041862004,0.00039061168,0.00025865468,0.00029365855,0.00049194036,0.0006911702,0.00036497053,0.000622706],"category_scores_gemma":[0.000998479,0.00017680886,0.00041993085,0.0006247247,0.00032779237,0.00046371503,0.00056921627,0.0005840506,0.00015115892],"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.000111595284,0.000070523434,0.0018647418,0.000035918067,0.00007114973,0.0001380263,0.00006670265,0.9221811,0.010405159,0.008973055,0.0010921888,0.054989785],"study_design_scores_gemma":[0.000009317362,0.000019899418,0.00024444456,0.0000010822072,0.0000042294187,0.000009635558,0.0000051809643,0.9968213,0.0011130613,0.0012585128,0.00051119947,0.000002248482],"about_ca_topic_score_codex":0.0041207266,"about_ca_topic_score_gemma":0.0040446203,"teacher_disagreement_score":0.0041207266,"about_ca_system_score_codex":0.00035872447,"about_ca_system_score_gemma":0.00055483915,"threshold_uncertainty_score":0.008193493},"labels":[],"label_agreement":null},{"id":"W2624200503","doi":"10.1109/tpds.2017.2712630","title":"Towards Quality Aware Information Integration in Distributed Sensing Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Computer science; Reliability (semiconductor); Distributed computing; Quality (philosophy); Resource (disambiguation); Data mining; Computer network","score_opus":0.029745209392772767,"score_gpt":0.2760718562533648,"score_spread":0.24632664686059202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2624200503","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.0042570606,0.00050970586,0.994131,0.00019024858,0.000026643535,0.00004424401,0.000030305862,0.00024137426,0.00056941155],"genre_scores_gemma":[0.5317726,0.0007716983,0.46564463,0.00027372167,0.00017178878,0.00015941092,0.00020096953,0.00008970021,0.00091546663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960211,0.0013241404,0.0002330009,0.000836434,0.0012807066,0.00030468474],"domain_scores_gemma":[0.9955621,0.0023684662,0.00043432484,0.0007444949,0.0007362179,0.00015448162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005350727,0.0014847677,0.0020504654,0.0014441409,0.0007527116,0.0026942613,0.0025698936,0.0014112116,0.0009533201],"category_scores_gemma":[0.00992379,0.0007419508,0.0009692942,0.0022156832,0.0013476349,0.004202064,0.004091923,0.002178618,0.00028176047],"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.00016886911,0.00013003228,0.0019845425,0.00026473362,0.00020255365,0.00022847878,0.00038749562,0.70028865,0.005696735,0.06941239,0.002592725,0.21864276],"study_design_scores_gemma":[0.000011178583,0.000029523495,0.0001803738,0.000010248578,0.000021804954,0.000031565767,0.000036734105,0.96421003,0.0007771739,0.033374384,0.0013074218,0.000009495214],"about_ca_topic_score_codex":0.0034370502,"about_ca_topic_score_gemma":0.0028242334,"teacher_disagreement_score":0.005350727,"about_ca_system_score_codex":0.0013426752,"about_ca_system_score_gemma":0.0017435629,"threshold_uncertainty_score":0.028297663},"labels":[],"label_agreement":null},{"id":"W2732621197","doi":"10.1109/tpds.2017.2720174","title":"Combining Vertex-Centric Graph Processing with SPARQL for Large-Scale RDF Data Analytics","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"SPARQL; Named graph; Computer science; RDF; Analytics; RDF Schema; Graph; Graph database; Linked data; Theoretical computer science; PageRank; Information retrieval; Database; Semantic Web","score_opus":0.04261578362629414,"score_gpt":0.2699335214137163,"score_spread":0.22731773778742215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2732621197","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.0063880836,0.00021530142,0.9407098,0.0005895848,0.00010923865,0.00016811836,0.0014546122,0.04686168,0.0035035352],"genre_scores_gemma":[0.13864186,0.00057808345,0.8399936,0.000971331,0.00013006004,0.0002947964,0.010865074,0.0059762266,0.0025489181],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963993,0.0006722561,0.00039619015,0.00079769525,0.0014859582,0.0002486966],"domain_scores_gemma":[0.9939628,0.0016176266,0.00025276165,0.0028587508,0.0010664053,0.00024160767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038809374,0.0013315901,0.000874934,0.0017205987,0.0010088556,0.0045322636,0.0035468354,0.00092454196,0.003519642],"category_scores_gemma":[0.010969381,0.00090872473,0.0017581608,0.0027890892,0.0016094552,0.008589801,0.0043276725,0.0027473294,0.0019486072],"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.00080074335,0.0005619231,0.010961068,0.0012666496,0.0007096108,0.0008499136,0.0011366908,0.22260106,0.036891192,0.28289717,0.11628208,0.32504192],"study_design_scores_gemma":[0.00010306265,0.00006190158,0.0006983447,0.000074003445,0.000103218845,0.0002244966,0.00030338028,0.7005505,0.031278756,0.21283787,0.05367385,0.00009061654],"about_ca_topic_score_codex":0.010647793,"about_ca_topic_score_gemma":0.016939234,"teacher_disagreement_score":0.010647793,"about_ca_system_score_codex":0.0015879181,"about_ca_system_score_gemma":0.002948797,"threshold_uncertainty_score":0.02117163},"labels":[],"label_agreement":null},{"id":"W2769557912","doi":"10.1109/tpds.2017.2773504","title":"Time- and Cost- Efficient Task Scheduling across Geo-Distributed Data Centers","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Big data; Data center; Integer programming; Unimodular matrix; Linear programming; Solver; Scheduling (production processes); SPARK (programming language); Distributed computing; Mathematical optimization; Algorithm; Data mining","score_opus":0.032238864280702634,"score_gpt":0.27692925317091455,"score_spread":0.2446903888902119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769557912","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.2711756,0.00070402835,0.71153057,0.0009410021,0.0002460338,0.00037706995,0.0004801168,0.0063561248,0.008189532],"genre_scores_gemma":[0.78232074,0.00020206111,0.21437222,0.00012546821,0.000064045016,0.00021456376,0.0005624165,0.00038416786,0.0017543449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983316,0.00034191925,0.000086656,0.00048259282,0.00035895724,0.00039834663],"domain_scores_gemma":[0.997663,0.0006791862,0.00026815152,0.00045498495,0.00053990213,0.00039465405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021132485,0.0012419546,0.0011348142,0.00065366254,0.0016020302,0.001267286,0.0024860268,0.00078078476,0.0018930761],"category_scores_gemma":[0.003854911,0.00049058726,0.0007457017,0.0012291664,0.00091012625,0.0015843433,0.0013332487,0.0011910178,0.0006052084],"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.00083931274,0.0003955235,0.0018601478,0.00016541555,0.00006578107,0.00017988974,0.00025708246,0.8930789,0.013628193,0.0059071733,0.007969879,0.07565275],"study_design_scores_gemma":[0.000074079275,0.00011658219,0.00051405816,0.0000043836076,0.000013348093,0.000031107313,0.000118135424,0.98858285,0.0040359064,0.00473772,0.0017590733,0.000012745296],"about_ca_topic_score_codex":0.010436091,"about_ca_topic_score_gemma":0.010483381,"teacher_disagreement_score":0.010436091,"about_ca_system_score_codex":0.0015033825,"about_ca_system_score_gemma":0.004037111,"threshold_uncertainty_score":0.020750701},"labels":[],"label_agreement":null},{"id":"W2791372502","doi":"10.1109/tpds.2018.2808202","title":"Efficient Performance-Centric Bandwidth Allocation with Fairness Tradeoff","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Bandwidth allocation; Max-min fairness; Bandwidth (computing); Fairness measure; Channel allocation schemes; Resource allocation; Resource management (computing); Dynamic bandwidth allocation; Computer network; Distributed computing; Throughput; Telecommunications; Wireless","score_opus":0.011430808633579825,"score_gpt":0.20444071211396994,"score_spread":0.19300990348039013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791372502","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.028608877,0.00022877034,0.9678289,0.00029315025,0.000047022862,0.00006123913,0.000027122687,0.0001785036,0.0027263078],"genre_scores_gemma":[0.80864567,0.00024064897,0.18819144,0.00017430767,0.00013357292,0.00014269202,0.00005817083,0.00012882927,0.0022845946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963568,0.0013953528,0.00015418103,0.000591361,0.0009156638,0.0005866558],"domain_scores_gemma":[0.996271,0.0019729014,0.00037799953,0.0006906718,0.0004571433,0.00023023786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050289864,0.0012944537,0.0014356504,0.00076309737,0.0012041809,0.002436226,0.0024945627,0.0013768688,0.0011201046],"category_scores_gemma":[0.009685892,0.00055671384,0.0005318657,0.0013953242,0.0014068673,0.0033520067,0.002662171,0.0017685016,0.00030341742],"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.00037710794,0.00022898243,0.00088361924,0.00010661334,0.000060426693,0.00009616742,0.00023369477,0.8439202,0.012519224,0.077560864,0.0017452616,0.062267795],"study_design_scores_gemma":[0.000026001953,0.000049188882,0.0001441056,0.000007416113,0.000013250061,0.000048359776,0.000026978409,0.956228,0.0027044886,0.039839197,0.0009006077,0.000012432154],"about_ca_topic_score_codex":0.0011937801,"about_ca_topic_score_gemma":0.0013920909,"teacher_disagreement_score":0.0050289864,"about_ca_system_score_codex":0.0016528977,"about_ca_system_score_gemma":0.002791719,"threshold_uncertainty_score":0.026596189},"labels":[],"label_agreement":null},{"id":"W2808102956","doi":"10.1109/tpds.2018.2846242","title":"Tsumiki: A Meta-Platform for Building Your Own Testbed","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Testbed; Computer science; Android (operating system); Interface (matter); Distributed computing; Embedded system; Set (abstract data type); Software; User interface; Computer architecture; Operating system; Computer network","score_opus":0.07174632797770371,"score_gpt":0.2940575395024576,"score_spread":0.22231121152475392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808102956","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.005305906,0.00029111796,0.71728146,0.0005013167,0.0004506572,0.0011266859,0.0024537933,0.25810835,0.014480796],"genre_scores_gemma":[0.09217788,0.0012097609,0.774517,0.001202996,0.00025251205,0.0045790705,0.025731787,0.07858812,0.0217408],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762934,0.00049137115,0.00033985265,0.00036018802,0.0008100004,0.00036927563],"domain_scores_gemma":[0.9938886,0.0011320224,0.0004342861,0.0024835933,0.0008984075,0.0011630459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070483573,0.0020349545,0.0011881392,0.0024871957,0.0013444818,0.0033293085,0.0063515906,0.0017036622,0.016509578],"category_scores_gemma":[0.012268611,0.0023766896,0.00242585,0.0012275284,0.0015304908,0.008664515,0.0077393525,0.0052077645,0.013754962],"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.0033902456,0.001249658,0.009314904,0.003065406,0.00080284534,0.0023791743,0.0036592227,0.046467073,0.10172552,0.1544389,0.39536366,0.2781435],"study_design_scores_gemma":[0.000683888,0.00061037135,0.0036573417,0.0005342839,0.0002803106,0.001092951,0.0004566888,0.15553609,0.049331155,0.060415905,0.7268917,0.00050933205],"about_ca_topic_score_codex":0.002824087,"about_ca_topic_score_gemma":0.0028271866,"teacher_disagreement_score":0.016509578,"about_ca_system_score_codex":0.0017132572,"about_ca_system_score_gemma":0.002592196,"threshold_uncertainty_score":0.055229962},"labels":[],"label_agreement":null},{"id":"W2888866881","doi":"10.1109/tpds.2018.2867853","title":"Energy-Efficient Multiple Producer-Consumer","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Energy (signal processing); Efficient energy use; Energy consumption; Electrical engineering","score_opus":0.020443101021900188,"score_gpt":0.23979685897064826,"score_spread":0.21935375794874806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888866881","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.10498973,0.00071115844,0.8794845,0.0010115984,0.00016237877,0.0002779281,0.00015525633,0.002470843,0.0107366005],"genre_scores_gemma":[0.619591,0.00029958814,0.36540914,0.00036868604,0.00009740665,0.00019806308,0.00030944773,0.0005434892,0.013183077],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767333,0.0004229096,0.00010596603,0.0006415455,0.00083895127,0.0003172855],"domain_scores_gemma":[0.9946854,0.0025101732,0.0004746034,0.0012039118,0.00090416835,0.00022172733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020770135,0.0010819337,0.0015733916,0.00074075407,0.0017435821,0.0023826633,0.004284207,0.0018656425,0.006392039],"category_scores_gemma":[0.0052414467,0.0008488141,0.00094018615,0.0014626614,0.0014329242,0.0036156266,0.001905051,0.0018454108,0.001366583],"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.0012868573,0.001058384,0.007134993,0.000711432,0.00017546749,0.000686629,0.00054338976,0.52242166,0.037713893,0.14586867,0.016958492,0.26544014],"study_design_scores_gemma":[0.00006646105,0.00011118663,0.000299898,0.000010677422,0.000024335804,0.0002819574,0.000045381537,0.94989496,0.011892622,0.033864968,0.0034823166,0.000025383593],"about_ca_topic_score_codex":0.0017213123,"about_ca_topic_score_gemma":0.0022111172,"teacher_disagreement_score":0.006392039,"about_ca_system_score_codex":0.0016212071,"about_ca_system_score_gemma":0.0021155172,"threshold_uncertainty_score":0.021383464},"labels":[],"label_agreement":null},{"id":"W2895829868","doi":"10.1109/tpds.2018.2874659","title":"HSDC: A Highly Scalable Data Center Network Architecture for Greater Incremental Scalability","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Institute of Computing Technology, Chinese Academy of Sciences; Key Laboratory of Computer System and Architecture; National Natural Science Foundation of China","keywords":"Computer science; Scalability; Server; Data center; Distributed computing; Computer network; Network architecture; Throughput; Database; Operating system","score_opus":0.03422902820518883,"score_gpt":0.2578291159504301,"score_spread":0.2236000877452413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895829868","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.23758766,0.0011709168,0.7348899,0.00082701206,0.00037359065,0.00037825076,0.0006992944,0.008857749,0.015215615],"genre_scores_gemma":[0.8245895,0.00041651668,0.17022306,0.0001549605,0.000078528436,0.00014848298,0.00097349397,0.00008390986,0.0033315688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998379,0.000024709183,0.000011231828,0.000023687424,0.00006708138,0.000035413752],"domain_scores_gemma":[0.9995914,0.00004963535,0.000030516992,0.00007934536,0.00019283783,0.00005637321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537547,0.00024238577,0.00021201471,0.0005114984,0.00044564556,0.0005574251,0.0008124138,0.00023882528,0.0013801608],"category_scores_gemma":[0.00048410674,0.00011234663,0.00022223426,0.0006730856,0.00030589555,0.00090831186,0.0006387709,0.00035990868,0.0002517356],"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.00067082036,0.00028776046,0.007021521,0.0004702287,0.0001239122,0.0004944035,0.00029047576,0.3423543,0.13567284,0.059604887,0.043050073,0.40995878],"study_design_scores_gemma":[0.000086508044,0.00044567804,0.0022990252,0.000020046038,0.000057196048,0.0003452246,0.00011918885,0.9054605,0.041940406,0.011758661,0.03740252,0.000065026325],"about_ca_topic_score_codex":0.0043571764,"about_ca_topic_score_gemma":0.005427811,"teacher_disagreement_score":0.0043571764,"about_ca_system_score_codex":0.000884785,"about_ca_system_score_gemma":0.0011086557,"threshold_uncertainty_score":0.008663654},"labels":[],"label_agreement":null},{"id":"W2904207032","doi":"10.1109/tpds.2018.2885519","title":"Enabling Encrypted Rich Queries in Distributed Key-Value Stores","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Encryption; Cloud computing; Scalability; Key (lock); Cryptography; Distributed computing; Information privacy; Database; Computer network; Computer security; Operating system","score_opus":0.01639953854860776,"score_gpt":0.24398053179766407,"score_spread":0.2275809932490563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904207032","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.16219735,0.00078493677,0.82440567,0.0004884979,0.00010969312,0.00037577294,0.0005059576,0.006267788,0.0048643406],"genre_scores_gemma":[0.8668681,0.00030668985,0.12833422,0.00015781095,0.00006331312,0.0001405164,0.00056427246,0.00021272068,0.0033522854],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970693,0.00041987264,0.0003819192,0.00037445652,0.0013802524,0.0003743214],"domain_scores_gemma":[0.99438924,0.0012775388,0.00040963918,0.003025883,0.00072138,0.0001762421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018917279,0.00040037915,0.0008601111,0.00072381593,0.0008098061,0.0023586417,0.0023214722,0.0007516354,0.0020047484],"category_scores_gemma":[0.005642521,0.0004986435,0.00043868617,0.0013304049,0.0012329415,0.0076644314,0.0044393404,0.0012394896,0.0009642642],"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.0048613357,0.0013150584,0.012213636,0.00072504836,0.0002984572,0.002298381,0.0024145194,0.1378449,0.17188737,0.23935945,0.019453345,0.40732846],"study_design_scores_gemma":[0.00041478104,0.0005713335,0.0011463895,0.00007137648,0.00012296285,0.0012558213,0.00053691835,0.67671615,0.20424283,0.08712638,0.027664494,0.00013056288],"about_ca_topic_score_codex":0.0010323102,"about_ca_topic_score_gemma":0.0011294467,"teacher_disagreement_score":0.0023586417,"about_ca_system_score_codex":0.00088974164,"about_ca_system_score_gemma":0.0011556888,"threshold_uncertainty_score":0.01000458},"labels":[],"label_agreement":null},{"id":"W2923126305","doi":"10.1109/tpds.2019.2907537","title":"CASpMV: A Customized and Accelerative SpMV Framework for the Sunway TaihuLight","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Hunan Provincial Innovation Foundation for Postgraduate; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Parallel computing; Supercomputer; Scalability; Memory hierarchy; Overhead (engineering); Computer architecture; Operating system; Cache","score_opus":0.0177715680750364,"score_gpt":0.2503210929208687,"score_spread":0.23254952484583227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2923126305","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.037009913,0.0007201742,0.82751244,0.00029386918,0.00020668689,0.00029513217,0.0013902722,0.122654,0.009917499],"genre_scores_gemma":[0.38930804,0.0005793647,0.57838327,0.00043104583,0.00010530172,0.00094644877,0.0072867856,0.013254792,0.009704972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995528,0.000062260566,0.000025925865,0.00007642916,0.00019927714,0.000083345316],"domain_scores_gemma":[0.9996377,0.00008238963,0.000026706834,0.00010495031,0.00010267559,0.000045458288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057171524,0.0011339232,0.0006463828,0.000550333,0.00058836286,0.00086334744,0.0037608233,0.0008720697,0.008382784],"category_scores_gemma":[0.0014580181,0.00055455626,0.0010094417,0.0006387852,0.00065771694,0.0017126913,0.001821966,0.0012830012,0.0018609858],"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.001546448,0.0003858547,0.0068985526,0.0009974921,0.0005077002,0.00071417034,0.0008900908,0.22513491,0.07574811,0.04287004,0.16038132,0.4839253],"study_design_scores_gemma":[0.00027597483,0.00020327463,0.0012575592,0.000043419524,0.00004377906,0.00017540122,0.00008988142,0.90263516,0.02447686,0.011521934,0.05918784,0.00008895465],"about_ca_topic_score_codex":0.006983374,"about_ca_topic_score_gemma":0.008847447,"teacher_disagreement_score":0.008382784,"about_ca_system_score_codex":0.00077920343,"about_ca_system_score_gemma":0.0017828718,"threshold_uncertainty_score":0.02804327},"labels":[],"label_agreement":null},{"id":"W2963209633","doi":"10.1109/tpds.2019.2900238","title":"Auction Mechanisms in Cloud/Fog Computing Resource Allocation for Public Blockchain Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Bidding; Proof-of-work system; Block (permutation group theory); Blockchain; Resource management (computing); Computational complexity theory; Resource allocation; Combinatorial auction; Heuristic","score_opus":0.014122808486160633,"score_gpt":0.22303105395878925,"score_spread":0.20890824547262862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963209633","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.053377513,0.0009702516,0.93066967,0.0007218375,0.00010904438,0.00031262063,0.00016061305,0.0003198223,0.01335862],"genre_scores_gemma":[0.9009635,0.0006362043,0.09251349,0.00012912253,0.000059475,0.00024852395,0.00009757654,0.000062671046,0.005289393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982799,0.0006006685,0.000086184555,0.00028294427,0.00038586065,0.00036452056],"domain_scores_gemma":[0.9981585,0.00094432745,0.00022891365,0.00024529846,0.00023260879,0.0001902405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002792476,0.0006808846,0.0012560292,0.00070808653,0.0012508282,0.0026518474,0.0026969176,0.0014522176,0.0043090438],"category_scores_gemma":[0.0060374555,0.00048287874,0.00080537994,0.0013209198,0.0015983491,0.003712773,0.0018201614,0.0012483972,0.00042040084],"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.0001923409,0.00013184131,0.00039304543,0.0001642124,0.000049020156,0.0003076904,0.00018728622,0.6509755,0.0022700578,0.31491742,0.0029681064,0.027443431],"study_design_scores_gemma":[0.000037622023,0.000020626436,0.00006236086,0.000014175762,0.000008996992,0.000039057864,0.000035201378,0.9274382,0.0003591631,0.07023105,0.0017427059,0.000010927802],"about_ca_topic_score_codex":0.005966078,"about_ca_topic_score_gemma":0.0046322304,"teacher_disagreement_score":0.005966078,"about_ca_system_score_codex":0.0029616205,"about_ca_system_score_gemma":0.0030005306,"threshold_uncertainty_score":0.02148819},"labels":[],"label_agreement":null},{"id":"W2970058891","doi":"10.1109/tpds.2019.2937029","title":"Energy and Task-Aware Partitioning on Single-ISA Clustered Heterogeneous Processors","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Frequency scaling; Energy consumption; Scheduling (production processes); Embedded system; Cache; Efficient energy use; Exploit; Parallel computing; Software; Symmetric multiprocessor system; Distributed computing; Multi-core processor; Reduction (mathematics); Operating system","score_opus":0.015953920145428197,"score_gpt":0.22302964595911495,"score_spread":0.20707572581368675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970058891","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.4188433,0.00058910437,0.5728816,0.00020302954,0.000051427698,0.00007397957,0.00008189355,0.00092970906,0.0063459934],"genre_scores_gemma":[0.8596719,0.000120711215,0.13757007,0.00004957225,0.000015361058,0.00005491278,0.00013735943,0.000107721025,0.0022722613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998252,0.000038604667,0.0000087861545,0.000039714192,0.000046603123,0.000041156185],"domain_scores_gemma":[0.99966085,0.000115328396,0.000048608465,0.000079878715,0.00006641215,0.000028922484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002537046,0.00046936402,0.00034423586,0.00040733328,0.0005750544,0.00040085864,0.00069376075,0.00028862018,0.0008857758],"category_scores_gemma":[0.0007708622,0.00018055076,0.00026428927,0.0004970351,0.00022113958,0.0005464978,0.0005084889,0.0002328957,0.00018627247],"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.00034779444,0.00011329703,0.0023743515,0.000094094736,0.000039550072,0.00011977877,0.00014904549,0.78723395,0.041210398,0.004958163,0.0026327507,0.16072685],"study_design_scores_gemma":[0.000017008371,0.00004643092,0.0008615905,0.000002995449,0.000009580739,0.00003425509,0.00005019489,0.98897374,0.007025732,0.0021683592,0.0008046093,0.0000055011365],"about_ca_topic_score_codex":0.0036553873,"about_ca_topic_score_gemma":0.006377681,"teacher_disagreement_score":0.0036553873,"about_ca_system_score_codex":0.000542649,"about_ca_system_score_gemma":0.0005945697,"threshold_uncertainty_score":0.0072681904},"labels":[],"label_agreement":null},{"id":"W2970532730","doi":"10.1109/tpds.2019.2938158","title":"The Network-Integrated Storage System","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Foundation for Innovation","keywords":"Computer science; Scalability; Distributed computing; Load balancing (electrical power); Storage area network; Computer network; Multicast; Replication (statistics); Key (lock); Consistency (knowledge bases); Routing (electronic design automation); Computer data storage; Operating system","score_opus":0.010254500150417878,"score_gpt":0.19577275175244518,"score_spread":0.1855182516020273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970532730","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.10795636,0.0025028796,0.768369,0.0015380398,0.00073966035,0.0004530172,0.0016236573,0.029019171,0.08779824],"genre_scores_gemma":[0.72008926,0.0010757544,0.23757671,0.0006736626,0.00016404358,0.0003001436,0.002377498,0.0005753276,0.037167598],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.999559,0.00005065324,0.000031672393,0.00008197186,0.00020596113,0.000070818045],"domain_scores_gemma":[0.99957293,0.000031389427,0.000023323259,0.00012265617,0.00020970685,0.00003999978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041259726,0.00030778503,0.0004172674,0.0004233828,0.00067932345,0.001600924,0.0018994713,0.00044247488,0.007750937],"category_scores_gemma":[0.0006234385,0.00026155065,0.00025057874,0.0005141726,0.00041217427,0.0026486823,0.0019012737,0.00067192526,0.0024966092],"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.0015577595,0.0003307643,0.004835992,0.0010151417,0.00018642437,0.0006465054,0.0006849492,0.08223853,0.19269694,0.1736403,0.0988227,0.44334397],"study_design_scores_gemma":[0.00021605038,0.0010156857,0.0020421022,0.00014096203,0.00023200474,0.0012073058,0.00020784755,0.4131436,0.12526889,0.02185133,0.4344818,0.00019239921],"about_ca_topic_score_codex":0.0022655074,"about_ca_topic_score_gemma":0.0028399848,"teacher_disagreement_score":0.007750937,"about_ca_system_score_codex":0.0010989974,"about_ca_system_score_gemma":0.0015076747,"threshold_uncertainty_score":0.025929451},"labels":[],"label_agreement":null},{"id":"W2973121604","doi":"10.1109/tpds.2019.2940945","title":"Enabling Encrypted Boolean Queries in Geographically Distributed Databases","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China; Louisiana Board of Regents","keywords":"Computer science; Scalability; Encryption; Server; Distributed database; Database; Outsourcing; Private information retrieval; Computer network; Computer security","score_opus":0.01593452215068129,"score_gpt":0.23438066521691725,"score_spread":0.21844614306623597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973121604","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.27226952,0.00065540895,0.71842664,0.0009637715,0.00006348102,0.00028627875,0.00028300117,0.0023814945,0.004670459],"genre_scores_gemma":[0.9429991,0.00020638538,0.054635208,0.00013890232,0.000027268667,0.00010683295,0.00016522327,0.00007130019,0.0016497569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99527466,0.0013470398,0.00061788014,0.00046539353,0.0018465079,0.00044846462],"domain_scores_gemma":[0.99345076,0.002102424,0.00076743425,0.0027813467,0.0007135814,0.00018453444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026683994,0.00035986493,0.0007460165,0.00053683994,0.00096637575,0.0020648914,0.0016011945,0.00085855566,0.0015008206],"category_scores_gemma":[0.006836797,0.0003808832,0.00044142667,0.001030486,0.0014874402,0.007704515,0.0044230437,0.0009878973,0.00055383577],"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.0046844315,0.0008136506,0.013571631,0.0007551426,0.00021583479,0.0046548257,0.003460268,0.16561724,0.21835671,0.3003445,0.009874983,0.27765083],"study_design_scores_gemma":[0.00034684647,0.00048516536,0.001716544,0.00005177239,0.000108798704,0.0017797254,0.0010725925,0.72218984,0.1578102,0.09591337,0.018427135,0.00009804233],"about_ca_topic_score_codex":0.0010969986,"about_ca_topic_score_gemma":0.00079206575,"teacher_disagreement_score":0.0026683994,"about_ca_system_score_codex":0.0012129471,"about_ca_system_score_gemma":0.001154885,"threshold_uncertainty_score":0.014111996},"labels":[],"label_agreement":null},{"id":"W2973166705","doi":"10.1109/tpds.2019.2940190","title":"Achieving Flexible Global Reconfiguration in NoCs Using Reconfigurable Rings","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Pearl River S and T Nova Program of Guangzhou; Ministry of Science and Technology of the People's Republic of China; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control reconfiguration; Computer science; Latency (audio); Embedded system; Overhead (engineering); Interconnection; Computer architecture; Flexibility (engineering); Network packet; Field-programmable gate array; Network on a chip; Distributed computing; Computer network","score_opus":0.022149339639874283,"score_gpt":0.24715347263248572,"score_spread":0.22500413299261143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973166705","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.4025664,0.0013442662,0.58375823,0.00014153817,0.00008690996,0.00007006907,0.000104558865,0.002701744,0.009226214],"genre_scores_gemma":[0.90837115,0.0002942558,0.089575276,0.00005209669,0.00002311576,0.000053954147,0.0000849597,0.00006574111,0.0014794058],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999783,0.00004684949,0.000017146174,0.000054511635,0.000040153514,0.00005830074],"domain_scores_gemma":[0.99967015,0.00007765727,0.00006930073,0.00011581597,0.00003946608,0.000027577053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024760605,0.0004249567,0.00032924776,0.0003825969,0.00034672912,0.00035359262,0.000518097,0.00025175934,0.000712971],"category_scores_gemma":[0.0004126848,0.00018418701,0.00032400127,0.00037367127,0.00034231335,0.00069932186,0.0006075841,0.0002908264,0.0002229937],"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.00033108515,0.00009749029,0.002348443,0.00023016203,0.000108055065,0.0005152195,0.0001694881,0.3546347,0.43419242,0.013542811,0.0020662867,0.19176374],"study_design_scores_gemma":[0.00005115187,0.00054016453,0.0024673324,0.000027821985,0.00008589174,0.0004749954,0.00009911548,0.8431565,0.1358469,0.0070408657,0.010147243,0.00006207803],"about_ca_topic_score_codex":0.0005576674,"about_ca_topic_score_gemma":0.001234565,"teacher_disagreement_score":0.000712971,"about_ca_system_score_codex":0.00024592783,"about_ca_system_score_gemma":0.00022007653,"threshold_uncertainty_score":0.0023850799},"labels":[],"label_agreement":null},{"id":"W3001143102","doi":"10.1109/tpds.2020.2968321","title":"Scalable and Adaptive Data Replica Placement for Geo-Distributed Cloud Storages","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Victoria","funders":"British Columbia Knowledge Development Fund; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Replica; Computer science; Scalability; Cloud computing; Distributed computing; Overhead (engineering); Node (physics); Big data; Replication (statistics); Distributed database; Scheme (mathematics); Computer network; Database; Data mining; Operating system","score_opus":0.06786269001036657,"score_gpt":0.257614554196899,"score_spread":0.18975186418653242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001143102","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.063016,0.0014411077,0.92775965,0.00047225566,0.00028443203,0.00017916797,0.0002295837,0.0039760885,0.0026417626],"genre_scores_gemma":[0.8219447,0.00038103302,0.1750711,0.00011284699,0.000113879236,0.00011326976,0.00025544292,0.00012916951,0.0018785694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988366,0.00023934986,0.00009291897,0.00024260256,0.00044536905,0.0001432624],"domain_scores_gemma":[0.9979735,0.00035414696,0.00020035874,0.00075291045,0.0005449558,0.00017415904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009509877,0.0005323229,0.00091242674,0.0007254329,0.0014036535,0.0010073128,0.002682988,0.00069078204,0.0012937948],"category_scores_gemma":[0.0030973873,0.00037564014,0.00042461517,0.0014557061,0.0006576944,0.0018208416,0.0016006588,0.0006503837,0.0007130733],"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.001104427,0.00033187616,0.005542728,0.0004169497,0.00014017626,0.0011192359,0.0006907444,0.4682475,0.100006185,0.023834875,0.018494597,0.38007072],"study_design_scores_gemma":[0.00003066316,0.000071673974,0.00042896805,0.000008429837,0.00001802106,0.0002457494,0.00009975461,0.97717786,0.012610826,0.0052781715,0.004002399,0.000027459713],"about_ca_topic_score_codex":0.003423989,"about_ca_topic_score_gemma":0.004819769,"teacher_disagreement_score":0.003423989,"about_ca_system_score_codex":0.0010031569,"about_ca_system_score_gemma":0.0011551303,"threshold_uncertainty_score":0.007278502},"labels":[],"label_agreement":null},{"id":"W3011234689","doi":"10.1109/tpds.2020.2972359","title":"Replica Exchange MCMC Hardware With Automatic Temperature Selection and Parallel Trial","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Replica; Computer science; Travelling salesman problem; Simulated annealing; Parallel tempering; Speedup; Markov chain Monte Carlo; Schedule; Parallel computing; Algorithm; Bayesian probability; Hybrid Monte Carlo; Artificial intelligence","score_opus":0.05291072562791479,"score_gpt":0.2919955292406469,"score_spread":0.23908480361273213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011234689","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.050582826,0.00037231686,0.9294202,0.00015356518,0.000104079976,0.00020299469,0.00020994918,0.009204753,0.009749411],"genre_scores_gemma":[0.41358685,0.00013084595,0.5820509,0.00009707052,0.000024393183,0.0003642497,0.00033319514,0.0003801619,0.0030323288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995914,0.00009734436,0.000021069187,0.000069592905,0.00017008095,0.000050548813],"domain_scores_gemma":[0.99944335,0.00019172543,0.00004408154,0.00017919976,0.000113868184,0.000027724805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055834797,0.00048470532,0.00071052037,0.0004586232,0.00046143122,0.0006077845,0.0018184485,0.0006454459,0.00575218],"category_scores_gemma":[0.0017128916,0.00039425923,0.00043953944,0.0007846693,0.00044851436,0.00047439165,0.00046739774,0.0010288052,0.0012676296],"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.00067489705,0.00027836172,0.003111744,0.0003657869,0.0002099481,0.00027264055,0.00018432614,0.6258358,0.051363982,0.050850417,0.009363434,0.25748876],"study_design_scores_gemma":[0.00006326563,0.000052157997,0.00030808704,0.0000072128482,0.00001642842,0.000051396495,0.0000065650565,0.9806403,0.012054018,0.0030599316,0.0037246803,0.00001588296],"about_ca_topic_score_codex":0.0037434832,"about_ca_topic_score_gemma":0.0049719666,"teacher_disagreement_score":0.00575218,"about_ca_system_score_codex":0.00067352486,"about_ca_system_score_gemma":0.0013632359,"threshold_uncertainty_score":0.019242942},"labels":[],"label_agreement":null},{"id":"W3020586295","doi":"10.1109/tpds.2020.2990429","title":"aeSpTV: An Adaptive and Efficient Framework for Sparse Tensor-Vector Product Kernel on a High-Performance Computing Platform","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Supercomputer; Parallel computing; Leverage (statistics); FLOPS; Thread (computing); Kernel (algebra); Tensor (intrinsic definition); Sparse matrix; Tensor product; Computational science; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.07216470640477066,"score_gpt":0.2944106034335115,"score_spread":0.22224589702874084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020586295","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.008048769,0.00012435103,0.9830657,0.00008243735,0.00004516005,0.000060956103,0.00010546552,0.0072991024,0.0011680317],"genre_scores_gemma":[0.20599273,0.00028529897,0.78483766,0.00014514817,0.0000689702,0.00031884285,0.00127561,0.002465859,0.0046098633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919456,0.00015782082,0.000055597313,0.000119030374,0.00036747562,0.00010546734],"domain_scores_gemma":[0.9992962,0.00011637261,0.00006123365,0.00020254675,0.0002408456,0.0000827269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073287694,0.0009984538,0.00073603564,0.0007011777,0.00062449055,0.0010410611,0.002334688,0.0006304513,0.0036055383],"category_scores_gemma":[0.0021527328,0.00047919806,0.0009166647,0.00091418193,0.00077718974,0.0019879993,0.0016553727,0.0015350538,0.0016572681],"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.0006690195,0.00030745263,0.0036301583,0.00042669618,0.00023057475,0.00043438084,0.0004466167,0.33866483,0.0749848,0.07558862,0.038349427,0.46626744],"study_design_scores_gemma":[0.0000350857,0.00006037157,0.00021827166,0.000007733312,0.000009857587,0.000052463587,0.000024320407,0.9733,0.010299137,0.008059419,0.007911038,0.00002226944],"about_ca_topic_score_codex":0.0055611026,"about_ca_topic_score_gemma":0.006492257,"teacher_disagreement_score":0.0055611026,"about_ca_system_score_codex":0.00080562057,"about_ca_system_score_gemma":0.0016229638,"threshold_uncertainty_score":0.012061775},"labels":[],"label_agreement":null},{"id":"W3111419317","doi":"10.1109/tpds.2020.3044223","title":"Biscotti: A Blockchain System for Private and Secure Federated Learning","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":334,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer security; Scalability; Peering; Blockchain; XACML; Cryptography; Process (computing); Protocol (science); Trusted Computing; Single point of failure; Computer network; Access control; Database; World Wide Web; The Internet; Operating system","score_opus":0.02823804456805096,"score_gpt":0.24289246594645067,"score_spread":0.2146544213783997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111419317","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.042684183,0.0008216268,0.8849807,0.0012964521,0.00046301857,0.0015067951,0.0018908738,0.03978869,0.026567742],"genre_scores_gemma":[0.7446746,0.00081637653,0.22577319,0.00042508054,0.00013123549,0.001225728,0.0039027662,0.0010584125,0.02199256],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979868,0.0004979446,0.0001573993,0.00025799987,0.00082369085,0.00027613534],"domain_scores_gemma":[0.99582785,0.00092644425,0.00029692633,0.0017482863,0.0006494882,0.0005510626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026747456,0.0007333768,0.0008341566,0.0011340171,0.0017284786,0.0019845786,0.0027252624,0.0016755229,0.0140093295],"category_scores_gemma":[0.0069199116,0.0006087027,0.0004047895,0.0014416821,0.0012917245,0.0046734815,0.0044641015,0.0020678,0.0038616736],"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.003645274,0.0012174333,0.004995612,0.0008875858,0.00022291254,0.0018153902,0.00083649415,0.29560342,0.033115152,0.18656887,0.069325946,0.40176588],"study_design_scores_gemma":[0.00047462594,0.00030637434,0.0005242049,0.00006718357,0.000031150143,0.00031899905,0.00006285442,0.8498311,0.013277711,0.075585306,0.05942781,0.000092677794],"about_ca_topic_score_codex":0.006341697,"about_ca_topic_score_gemma":0.0060487315,"teacher_disagreement_score":0.0140093295,"about_ca_system_score_codex":0.0013815949,"about_ca_system_score_gemma":0.004573771,"threshold_uncertainty_score":0.04686588},"labels":[],"label_agreement":null},{"id":"W3112250879","doi":"10.1109/tpds.2020.3042695","title":"Privacy-Preserving Similarity Search With Efficient Updates in Distributed Key-Value Stores","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Homomorphic encryption; Speedup; Encryption; Cloud computing; Hash function; Nearest neighbor search; Locality-sensitive hashing; Similarity (geometry); Key (lock); Data mining; ElGamal encryption; Leverage (statistics); Theoretical computer science; Distributed computing; Public-key cryptography; Hash table; Computer network; Computer security; Parallel computing","score_opus":0.023356389890738804,"score_gpt":0.239407286401864,"score_spread":0.21605089651112522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112250879","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.12636973,0.0006875673,0.8665228,0.0005413463,0.00010238125,0.000457729,0.00020975998,0.0023927374,0.0027159124],"genre_scores_gemma":[0.84928674,0.00023604008,0.14743361,0.00013597756,0.000074295975,0.0002582008,0.00021619104,0.000100207544,0.0022587515],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920398,0.001602192,0.0008734808,0.0012093714,0.003427987,0.0008471478],"domain_scores_gemma":[0.98884785,0.002983424,0.0010474276,0.0055250074,0.0012688516,0.00032742467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045484533,0.0006867609,0.0018925464,0.0013293296,0.0017870527,0.0037071102,0.0031397855,0.0016003668,0.0017675406],"category_scores_gemma":[0.012469055,0.00084913435,0.0007881239,0.0025250425,0.0019946527,0.010517919,0.0062234183,0.0022303192,0.00069145916],"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.0041368883,0.0011890198,0.006984875,0.0005380215,0.0003354811,0.0014093522,0.0020274303,0.2106755,0.08529492,0.30746412,0.0071501895,0.37279415],"study_design_scores_gemma":[0.00047243055,0.00057183264,0.00070697075,0.000041187304,0.000121860074,0.0007493544,0.00033356436,0.7888406,0.07544462,0.12506634,0.0075368686,0.00011441715],"about_ca_topic_score_codex":0.001449493,"about_ca_topic_score_gemma":0.0011522642,"teacher_disagreement_score":0.0045484533,"about_ca_system_score_codex":0.0013659383,"about_ca_system_score_gemma":0.0029164224,"threshold_uncertainty_score":0.024054825},"labels":[],"label_agreement":null},{"id":"W3118725232","doi":"10.1109/tpds.2020.3048373","title":"Partitioning-Based Scheduling of OpenMP Task Systems With Tied Tasks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Processor scheduling; Parallel computing; Scheduling (production processes); Distributed computing; Task (project management); Task analysis; Operating system; Schedule","score_opus":0.02394696952466485,"score_gpt":0.23492347764144825,"score_spread":0.2109765081167834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118725232","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.18646263,0.0004094949,0.8078275,0.0001541875,0.000102807644,0.00018450995,0.00012430524,0.00083851756,0.0038960772],"genre_scores_gemma":[0.680581,0.00012246262,0.3172717,0.00006699923,0.000030699302,0.00016773939,0.0003055704,0.00013996357,0.0013138879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993399,0.0001657315,0.000057767444,0.00012884306,0.00016328754,0.00014441647],"domain_scores_gemma":[0.9985794,0.00061478745,0.00017945598,0.00023815129,0.00024043494,0.0001477018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074009964,0.0007073282,0.0006336404,0.00044555083,0.00081751985,0.0006417597,0.0015095975,0.000568616,0.0012652376],"category_scores_gemma":[0.0028990833,0.00041130884,0.0003437367,0.00048105646,0.0004907954,0.00084256846,0.0011879321,0.0007343094,0.00023541196],"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.00048575283,0.00018792364,0.0018957936,0.00020603897,0.000048192003,0.0003416179,0.00029732124,0.8658982,0.02204852,0.011315444,0.0026593094,0.09461596],"study_design_scores_gemma":[0.00003231441,0.00007958086,0.00025379952,0.000006373506,0.000007189123,0.00004495941,0.00004441567,0.9905342,0.0040472215,0.004010881,0.00093067635,0.000008331119],"about_ca_topic_score_codex":0.0020467981,"about_ca_topic_score_gemma":0.002806685,"teacher_disagreement_score":0.0020467981,"about_ca_system_score_codex":0.0005288634,"about_ca_system_score_gemma":0.0010139231,"threshold_uncertainty_score":0.0042325854},"labels":[],"label_agreement":null},{"id":"W3151453676","doi":"10.1109/tpds.2007.253279","title":"LRED: A Robust and Responsive AQM Algorithm Using Packet Loss Ratio Measurement","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Microsoft Research Asia","keywords":"Active queue management; Goodput; Computer science; Random early detection; Network congestion; Robustness (evolution); Queue; Packet loss; Network packet; Computer network; Algorithm; Queueing theory; Flow control (data); Real-time computing; Throughput; Telecommunications","score_opus":0.026084443534727154,"score_gpt":0.2182216668738476,"score_spread":0.19213722333912042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151453676","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.010491445,0.0004862814,0.9853683,0.00018458147,0.00012616302,0.000093116876,0.000040286453,0.0024177707,0.0007920261],"genre_scores_gemma":[0.5154095,0.00038322675,0.48095152,0.0004211207,0.00015380929,0.00024308506,0.0002048741,0.00014212803,0.0020907542],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989272,0.00024975403,0.00008729314,0.00026938922,0.0003894584,0.000076860095],"domain_scores_gemma":[0.9986235,0.00052064785,0.00031154658,0.00015034335,0.00033125997,0.000062736595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020028176,0.0009451633,0.0010708944,0.0013049286,0.00045753896,0.0008933742,0.0033868544,0.0011581315,0.000712808],"category_scores_gemma":[0.004696239,0.00034269327,0.0005312726,0.00063496816,0.0007117321,0.0013463162,0.0013257262,0.001612774,0.0003293941],"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.00052596047,0.00031163788,0.0030469229,0.00028614048,0.00020491508,0.00018189452,0.00020196216,0.42720035,0.037281353,0.016400808,0.0050308425,0.50932723],"study_design_scores_gemma":[0.00005184454,0.00008924635,0.00023069381,0.000007146476,0.000016515514,0.000053365988,0.000008877865,0.9915748,0.004597478,0.0018266727,0.0015176445,0.000025749072],"about_ca_topic_score_codex":0.002014279,"about_ca_topic_score_gemma":0.0011074387,"teacher_disagreement_score":0.0033868544,"about_ca_system_score_codex":0.00090394623,"about_ca_system_score_gemma":0.0010547638,"threshold_uncertainty_score":0.010592043},"labels":[],"label_agreement":null},{"id":"W3178661111","doi":"10.1109/tpds.2021.3096076","title":"Decentralized Edge Intelligence: A Dynamic Resource Allocation Framework for Hierarchical Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":290,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Ministry of Education, India; National Research Foundation Singapore; National Natural Science Foundation of China; Nanyang Technological University; Singapore University of Technology and Design; Ministry of Education - Singapore; National Research Foundation","keywords":"Computer science; Server; Distributed computing; Bottleneck; Resource allocation; Incentive; Edge device; Raw data; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Computer network; Cloud computing","score_opus":0.028982075181504443,"score_gpt":0.2913225440989919,"score_spread":0.26234046891748747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178661111","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.006329959,0.00022353466,0.98876625,0.00030820668,0.000034280576,0.00006694461,0.00006904266,0.0003581403,0.0038434996],"genre_scores_gemma":[0.6733015,0.0004263583,0.31820938,0.0003143033,0.000077671866,0.0003175076,0.00020406263,0.000113620095,0.0070354925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872655,0.00047113458,0.00005202119,0.00025136105,0.0002489057,0.00025002126],"domain_scores_gemma":[0.9990859,0.00038064062,0.00009859855,0.00014844725,0.0001556812,0.00013067556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024149513,0.0006347319,0.0009949764,0.00053320016,0.0007968746,0.0018412146,0.0028812208,0.0013314025,0.0036352978],"category_scores_gemma":[0.0031408481,0.00039227994,0.00074236,0.00088851876,0.0013193244,0.0022343814,0.0024106954,0.0014720163,0.00047507745],"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.00012493106,0.00009306755,0.00036924428,0.00007320871,0.000042456108,0.00015310975,0.00012844644,0.7827828,0.0013013299,0.17538476,0.0030322834,0.036514405],"study_design_scores_gemma":[0.0000121777275,0.000017328653,0.000034926747,0.0000054458114,0.0000044612193,0.000017056696,0.000012479932,0.9633199,0.00017694503,0.035186887,0.0012074466,0.0000049807145],"about_ca_topic_score_codex":0.005068809,"about_ca_topic_score_gemma":0.0051818877,"teacher_disagreement_score":0.005068809,"about_ca_system_score_codex":0.001708174,"about_ca_system_score_gemma":0.0023827222,"threshold_uncertainty_score":0.012771666},"labels":[],"label_agreement":null},{"id":"W4205597275","doi":"10.1109/tpds.2021.3134647","title":"AUCTION: Automated and Quality-Aware Client Selection Framework for Efficient Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Young Elite Scientists Sponsorship Program by Tianjin; National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Computer science; Quality (philosophy); Artificial intelligence; Selection (genetic algorithm); Task (project management); Information retrieval; Machine learning","score_opus":0.04055274412034599,"score_gpt":0.3061016620335053,"score_spread":0.2655489179131593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205597275","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.0122475615,0.0002818823,0.9721797,0.0003429498,0.00006407418,0.0002275458,0.00017511852,0.012881891,0.0015993495],"genre_scores_gemma":[0.5246106,0.00027679035,0.4685027,0.00025535174,0.00008628586,0.00030602302,0.00078137027,0.0005052089,0.004675613],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966485,0.0010143238,0.00025803255,0.00058372226,0.0009282349,0.00056718383],"domain_scores_gemma":[0.99677086,0.0009132252,0.0002665996,0.0008987866,0.0006623174,0.00048818576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00561981,0.0009010302,0.0016070956,0.0012998447,0.0011983784,0.0035241335,0.0051971134,0.0016993184,0.004316077],"category_scores_gemma":[0.0072833938,0.0006187261,0.0012159124,0.0013168725,0.0009716164,0.0043486846,0.004062774,0.0019244738,0.001315203],"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.0017133069,0.0010994194,0.004053837,0.0002576596,0.00023047085,0.0004796009,0.00027382324,0.42655915,0.008262413,0.070124336,0.03152249,0.45542347],"study_design_scores_gemma":[0.000058831807,0.00003871941,0.0001636959,0.000007373861,0.000012218452,0.000047747253,0.000022744609,0.9826099,0.0014498844,0.013567246,0.0020022024,0.000019319545],"about_ca_topic_score_codex":0.009330257,"about_ca_topic_score_gemma":0.009020949,"teacher_disagreement_score":0.009330257,"about_ca_system_score_codex":0.0022573608,"about_ca_system_score_gemma":0.004364808,"threshold_uncertainty_score":0.029720724},"labels":[],"label_agreement":null},{"id":"W4236689819","doi":"10.1109/tpds.2010.21","title":"Editor's Note","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"","field":"","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 Ottawa","funders":"","keywords":"Computer science","score_opus":0.011066769556988883,"score_gpt":0.249589884124528,"score_spread":0.23852311456753914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236689819","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013956493,0.003692672,0.0001938083,0.13831219,0.8511013,0.000031786043,0.00010959331,0.0000814868,0.0063377377],"genre_scores_gemma":[0.0024158715,0.0035961159,0.0005091333,0.23377527,0.6768999,0.0000756829,0.0001078179,0.00010038162,0.08251976],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9962585,0.00045876988,0.00044161142,0.00068667356,0.0017328728,0.00042158677],"domain_scores_gemma":[0.98554057,0.003730111,0.0014362199,0.0008128716,0.006449755,0.0020303999],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00398507,0.0017728701,0.0025408766,0.0017721487,0.0026179152,0.0050231013,0.0036676268,0.018266788,0.043656457],"category_scores_gemma":[0.029577818,0.0010626597,0.0021630486,0.0014229992,0.0013914852,0.0024118482,0.0016662498,0.015058209,0.029757574],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","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.00003532796,0.000010003872,0.00005342351,0.00007136948,0.000010882884,0.00022004785,0.0000084023695,0.000020536776,0.00007035962,0.00019115847,0.9945036,0.004804873],"study_design_scores_gemma":[0.00003300594,0.000018546518,0.0003454987,0.00009548983,0.000022900953,0.000349079,0.000026933705,0.000090015215,0.00013848316,0.00027995877,0.99858475,0.000015373374],"about_ca_topic_score_codex":0.0026533345,"about_ca_topic_score_gemma":0.007350073,"teacher_disagreement_score":0.95634353,"about_ca_system_score_codex":0.0021631946,"about_ca_system_score_gemma":0.0032186895,"threshold_uncertainty_score":0.14604545},"labels":[],"label_agreement":null},{"id":"W4285137472","doi":"10.1109/tpds.2022.3170574","title":"The State of the Art of Metadata Managements in Large-Scale Distributed File Systems — Scalability, Performance and Availability","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Advanced Data Storage Technologies","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; National Natural Science Foundation of China","keywords":"Metadata; Computer science; File system; Distributed File System; Database; Scalability; Metadata management; Meta Data Services; Namespace; Distributed database; Distributed data store; Operating system; Metadata repository","score_opus":0.01313245041459584,"score_gpt":0.22281705968027216,"score_spread":0.2096846092656763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285137472","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033693906,0.5859736,0.29903343,0.027924806,0.0020308192,0.000326418,0.00079681375,0.0019437338,0.048276465],"genre_scores_gemma":[0.5580994,0.3054081,0.11565516,0.0020054725,0.010066972,0.00041183244,0.0012304254,0.00041269662,0.006709895],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99371463,0.0014462287,0.0004348943,0.00094718765,0.002982012,0.00047512082],"domain_scores_gemma":[0.9787445,0.013296206,0.0013732992,0.0023205488,0.0037305495,0.00053480756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059158257,0.0008623797,0.0013022604,0.0033875369,0.0018905426,0.006846125,0.0038324997,0.002436305,0.002765157],"category_scores_gemma":[0.017284488,0.00074858486,0.00059570104,0.0063311025,0.0038924797,0.022468539,0.0027319593,0.0028921128,0.0013700109],"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.00020670168,0.000239812,0.0047753938,0.004203172,0.0001016482,0.00019730892,0.0011201533,0.015878556,0.006972102,0.2074784,0.025073668,0.7337531],"study_design_scores_gemma":[0.00006435459,0.00053080946,0.0058578146,0.002828864,0.00014611245,0.001632022,0.0033201927,0.18636486,0.016020235,0.40079054,0.38206944,0.00037477643],"about_ca_topic_score_codex":0.0035972616,"about_ca_topic_score_gemma":0.0013864691,"teacher_disagreement_score":0.006846125,"about_ca_system_score_codex":0.0033799228,"about_ca_system_score_gemma":0.0033041115,"threshold_uncertainty_score":0.03128624},"labels":[],"label_agreement":null},{"id":"W4319069175","doi":"10.1109/tpds.2023.3241965","title":"Synchronize Only the Immature Parameters: Communication-Efficient Federated Learning By Freezing Parameters Adaptively","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Chinese University of Hong Kong; National Natural Science Foundation of China","keywords":"Bottleneck; Computer science; Python (programming language); Edge device; Bandwidth (computing); Distributed computing; Enhanced Data Rates for GSM Evolution; Process (computing); Synchronization (alternating current); Overhead (engineering); Artificial intelligence; Computer network; Operating system; Embedded system","score_opus":0.028012493810970415,"score_gpt":0.24874325850519785,"score_spread":0.22073076469422742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319069175","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.059971426,0.0001871472,0.93482155,0.00026858857,0.00005423468,0.00007476723,0.00007461132,0.0034337167,0.0011138879],"genre_scores_gemma":[0.899139,0.00006477662,0.09900803,0.00023736642,0.000029163273,0.00011898438,0.00018940427,0.00023411802,0.0009791631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988838,0.0002780918,0.00007338243,0.00035908917,0.00022777118,0.00017791375],"domain_scores_gemma":[0.9970414,0.00092949794,0.00027991235,0.0012009471,0.0003529349,0.00019531806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025206855,0.0011971833,0.0011250001,0.0005574719,0.000801514,0.00089032686,0.0029300887,0.0012036591,0.0012528301],"category_scores_gemma":[0.010825355,0.0005845758,0.00059233274,0.0005361129,0.0014751316,0.0035597712,0.002807315,0.0022913706,0.0005293044],"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.0004641083,0.00019331842,0.0046500387,0.00005411183,0.00007993474,0.00020083827,0.00043945495,0.7907359,0.009030917,0.007131171,0.0027792586,0.18424094],"study_design_scores_gemma":[0.000029215405,0.000039176906,0.00021235787,0.000006339859,0.000011811096,0.00003919862,0.000025810084,0.9902165,0.0030285337,0.0058213286,0.0005531895,0.000016617092],"about_ca_topic_score_codex":0.004956353,"about_ca_topic_score_gemma":0.0043661883,"teacher_disagreement_score":0.004956353,"about_ca_system_score_codex":0.0007823812,"about_ca_system_score_gemma":0.0019350115,"threshold_uncertainty_score":0.013330817},"labels":[],"label_agreement":null},{"id":"W4319865686","doi":"10.1109/tpds.2023.3240883","title":"On Model Transmission Strategies in Federated Learning With Lossy Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Retransmission; Lossy compression; Computer network; Transmission (telecommunications); Overhead (engineering); Network packet; The Internet; Packet loss; Reinforcement learning; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.04183442928896504,"score_gpt":0.28102890297574606,"score_spread":0.23919447368678104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319865686","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.0590762,0.0008248134,0.93686765,0.00066983857,0.00004031231,0.000059785358,0.000056269677,0.0006669969,0.0017381401],"genre_scores_gemma":[0.9023977,0.00046249147,0.094724126,0.00032251564,0.00005385708,0.00009615907,0.00016532544,0.00013661604,0.0016410982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975647,0.0011150367,0.00012260661,0.00040355208,0.00050166075,0.00029239964],"domain_scores_gemma":[0.98587763,0.010050125,0.0010516436,0.0015139785,0.0011906234,0.00031594804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006788446,0.0011945007,0.0014515525,0.0010383901,0.00085541065,0.0015011387,0.0021614507,0.0018228403,0.0012755084],"category_scores_gemma":[0.024106964,0.0006123103,0.00069131283,0.00091694074,0.0019006685,0.0041067633,0.0024880583,0.0024740442,0.0003068267],"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.00018870784,0.0001259673,0.001023021,0.00006120694,0.000037017333,0.00009638915,0.00011604839,0.9411278,0.0006541979,0.013066587,0.00086082367,0.04264227],"study_design_scores_gemma":[0.000007801285,0.00003690657,0.000071998846,0.000008696366,0.0000056330323,0.00002546642,0.000014846188,0.9922652,0.00041846235,0.00702371,0.00011733851,0.0000039498327],"about_ca_topic_score_codex":0.004208118,"about_ca_topic_score_gemma":0.0024350826,"teacher_disagreement_score":0.006788446,"about_ca_system_score_codex":0.0017255298,"about_ca_system_score_gemma":0.0018187187,"threshold_uncertainty_score":0.03590119},"labels":[],"label_agreement":null},{"id":"W4324290811","doi":"10.1109/tpds.2023.3256083","title":"A Parallel Algorithm to Accelerate DEVS Simulations in Shared Memory Architectures","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Parallel computing; Benchmark (surveying); DEVS; Discrete event simulation; Shared memory; Parallel algorithm; Computation; Set (abstract data type); Event (particle physics); Algorithm; Distributed computing; Modeling and simulation","score_opus":0.09724948399096503,"score_gpt":0.37081208315633524,"score_spread":0.2735625991653702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324290811","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.013760476,0.00010135588,0.9800367,0.00013248567,0.00010734728,0.00010642802,0.0000937259,0.0031889991,0.0024725501],"genre_scores_gemma":[0.11600996,0.000098038465,0.8802658,0.00006078877,0.000029247156,0.00028106567,0.0004085433,0.0003173821,0.0025291762],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957067,0.00007625042,0.000029531077,0.00006425879,0.00020605625,0.000053225027],"domain_scores_gemma":[0.99923325,0.00026290707,0.000057350215,0.00013720835,0.00024348947,0.00006588435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000714528,0.0007406517,0.0005825032,0.0005881178,0.0006372723,0.0007092695,0.0015887703,0.0007731366,0.0031957352],"category_scores_gemma":[0.0019856847,0.00048205254,0.0006288152,0.00063038943,0.00052875926,0.00095374347,0.0010138636,0.0011965288,0.0009215412],"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.00032644114,0.00019185855,0.002696486,0.00019350387,0.000120376506,0.0002324209,0.00015499943,0.71651447,0.021312192,0.03421784,0.007817884,0.21622159],"study_design_scores_gemma":[0.000048189795,0.00002986915,0.00009576477,0.0000040318355,0.000005935945,0.000027656422,0.0000078100165,0.9902165,0.0034073766,0.002898862,0.00325207,0.0000060359125],"about_ca_topic_score_codex":0.004053477,"about_ca_topic_score_gemma":0.0044563413,"teacher_disagreement_score":0.004053477,"about_ca_system_score_codex":0.0006579201,"about_ca_system_score_gemma":0.001691688,"threshold_uncertainty_score":0.010690808},"labels":[],"label_agreement":null},{"id":"W4366147943","doi":"10.1109/tpds.2023.3267897","title":"Dap-FL: Federated Learning Flourishes by Adaptive Tuning and Secure Aggregation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Computer science; Computer network; Computer security; Distributed computing","score_opus":0.026275272268198573,"score_gpt":0.24573404448059358,"score_spread":0.21945877221239501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366147943","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.026224652,0.00022864933,0.9700431,0.00026573185,0.000049426017,0.000041506566,0.000038193903,0.0016319891,0.0014767089],"genre_scores_gemma":[0.92435515,0.00014089246,0.07301198,0.00032314213,0.000040632134,0.00007422755,0.00008947031,0.000073192816,0.0018913221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986527,0.0003107972,0.00008012819,0.00040046475,0.0003726846,0.00018315675],"domain_scores_gemma":[0.99822134,0.0005128034,0.0002004498,0.0006366813,0.0003157544,0.00011312039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019900335,0.00067385903,0.000981567,0.00037200857,0.0006231177,0.0011350174,0.0018730405,0.0010018527,0.00096090976],"category_scores_gemma":[0.004908169,0.0002836204,0.00046930788,0.00047873493,0.0010531889,0.0024397355,0.002459984,0.0017913977,0.00032576115],"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.00045840384,0.00021512214,0.0033008098,0.000118192154,0.000117994285,0.00028214775,0.00026023647,0.6670393,0.011789738,0.036063254,0.005056364,0.27529845],"study_design_scores_gemma":[0.0000157372,0.00004198716,0.00013069694,0.0000054293964,0.000008995076,0.000050918366,0.000013547517,0.9884453,0.0019419917,0.008511991,0.0008249169,0.000008456381],"about_ca_topic_score_codex":0.0019909306,"about_ca_topic_score_gemma":0.0019036562,"teacher_disagreement_score":0.0019909306,"about_ca_system_score_codex":0.00080874725,"about_ca_system_score_gemma":0.001398246,"threshold_uncertainty_score":0.010524452},"labels":[],"label_agreement":null},{"id":"W4366310729","doi":"10.1109/tpds.2023.3267731","title":"Practical Cloud-Edge Scheduling for Large-Scale Crowdsourced Live Streaming","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Inefficiency; Crowdsourcing; Enhanced Data Rates for GSM Evolution; Scheduling (production processes); Quality of service; Computer network; Distributed computing; Artificial intelligence; World Wide Web; Operating system","score_opus":0.05107296161385121,"score_gpt":0.33083133948338417,"score_spread":0.27975837786953295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366310729","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.09112455,0.00064810104,0.89371955,0.0013274367,0.00035637958,0.00046635556,0.00063064246,0.0016759788,0.010051007],"genre_scores_gemma":[0.8881268,0.00017324137,0.109009266,0.00018461772,0.00011625963,0.00016953886,0.0002819165,0.00013875007,0.0017996249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809283,0.0005331315,0.00009360774,0.0005317326,0.00030568818,0.00044304668],"domain_scores_gemma":[0.99659204,0.0017066809,0.00024457742,0.00044271286,0.00046616403,0.0005478381],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028823728,0.0013395171,0.0013557089,0.00044879728,0.0020120514,0.0015557352,0.0023517814,0.001069569,0.0054359483],"category_scores_gemma":[0.0063070864,0.0005074866,0.0005783174,0.0010278246,0.00078849803,0.0018723131,0.0018532842,0.001387886,0.0007298597],"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.0007089521,0.00020938413,0.0017889689,0.00018560617,0.000048180074,0.00023039551,0.00022732596,0.897254,0.0061735436,0.029355824,0.012956294,0.050861504],"study_design_scores_gemma":[0.00003008479,0.000031971504,0.00019911672,0.0000042241345,0.0000054209895,0.000018691511,0.0000838737,0.99127465,0.0005416068,0.0069819973,0.00082024944,0.0000080526615],"about_ca_topic_score_codex":0.019311875,"about_ca_topic_score_gemma":0.019992134,"teacher_disagreement_score":0.019311875,"about_ca_system_score_codex":0.0031018592,"about_ca_system_score_gemma":0.004269882,"threshold_uncertainty_score":0.03839892},"labels":[],"label_agreement":null},{"id":"W4388919408","doi":"10.1109/tpds.2023.3335671","title":"Simple, Fast and Widely Applicable Concurrent Memory Reclamation via Neutralization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed systems and fault tolerance","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of Waterloo","keywords":"Computer science; Garbage collection; Garbage; Concurrent data structure; Bounded function; Overhead (engineering); Parallel computing; POSIX Threads; Concurrency; Data consistency; Consistency (knowledge bases); Distributed computing; Synchronization (alternating current); Data structure; Key (lock); Operating system; Programming language; Computer network; Thread (computing)","score_opus":0.019059756359146897,"score_gpt":0.24742579670462958,"score_spread":0.2283660403454827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388919408","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.08579485,0.0013545142,0.8938921,0.0003582879,0.00020799908,0.00023468833,0.00011123518,0.012727911,0.005318415],"genre_scores_gemma":[0.6148772,0.000559903,0.37629062,0.0004921494,0.000065258675,0.00028673443,0.00028489684,0.0013081854,0.005835013],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9983689,0.0002359631,0.00015873012,0.00034127053,0.0006622819,0.00023277677],"domain_scores_gemma":[0.9954803,0.0009662857,0.0006651129,0.0019070039,0.00083167426,0.00014959027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012407121,0.0007849412,0.0007105295,0.0006657417,0.0010452957,0.0014076098,0.0026934966,0.00061669055,0.0017062399],"category_scores_gemma":[0.0042687473,0.00050812063,0.0007334841,0.0006241641,0.0016162421,0.0027662169,0.0027972204,0.0014195578,0.001044689],"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.0016974839,0.00029212216,0.008214882,0.0009209598,0.000119037475,0.00056382496,0.002763757,0.024883736,0.30159706,0.052128155,0.008786963,0.59803206],"study_design_scores_gemma":[0.0003033115,0.0012137669,0.0020832682,0.00021615923,0.00019210918,0.0014791256,0.00077763357,0.23129165,0.63747865,0.0416165,0.08308648,0.00026133825],"about_ca_topic_score_codex":0.0015739257,"about_ca_topic_score_gemma":0.0023016657,"teacher_disagreement_score":0.0026934966,"about_ca_system_score_codex":0.00086301804,"about_ca_system_score_gemma":0.0022116231,"threshold_uncertainty_score":0.006561637},"labels":[],"label_agreement":null},{"id":"W4394896940","doi":"10.1109/tpds.2024.3390109","title":"Sampling-Based Multi-Job Placement for Heterogeneous Deep Learning Clusters","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Toronto; Memorial University of Newfoundland","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Computer science; Workload; Job scheduler; Scheduling (production processes); Distributed computing; Artificial intelligence; Machine learning; Latency (audio); Mathematical optimization; Computer network","score_opus":0.03431295490472693,"score_gpt":0.2792646518185682,"score_spread":0.24495169691384125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394896940","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.19635752,0.0004137531,0.7963958,0.00043885427,0.00019901888,0.0002936527,0.00012224361,0.0024520094,0.0033271073],"genre_scores_gemma":[0.86663693,0.000079311656,0.13114166,0.00013707628,0.000043995307,0.00016397201,0.00015990346,0.00014075961,0.0014963854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991574,0.00019342384,0.000057724024,0.00021224134,0.0001651264,0.00021410089],"domain_scores_gemma":[0.9981864,0.0005796683,0.00016706304,0.00041798316,0.0002940482,0.00035481656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014847578,0.0007360349,0.00091516634,0.00041917732,0.0012842531,0.000815767,0.002219338,0.0006503629,0.0031067657],"category_scores_gemma":[0.0039981944,0.00043894723,0.00046879234,0.0006298189,0.0007069235,0.001103744,0.0012896255,0.001010168,0.0005457485],"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.001104648,0.0005788264,0.004274349,0.00017261153,0.00007093543,0.00021191873,0.00024534078,0.8051181,0.019124199,0.009148265,0.0072176848,0.15273319],"study_design_scores_gemma":[0.000027186095,0.00006113839,0.0002336361,0.0000025507513,0.000004821788,0.000014582857,0.000032215423,0.99470323,0.0022064948,0.0022892924,0.00041899635,0.0000058095784],"about_ca_topic_score_codex":0.004169896,"about_ca_topic_score_gemma":0.0073868823,"teacher_disagreement_score":0.004169896,"about_ca_system_score_codex":0.0012436492,"about_ca_system_score_gemma":0.0023449846,"threshold_uncertainty_score":0.010393202},"labels":[],"label_agreement":null},{"id":"W4402186982","doi":"10.1109/tpds.2024.3453607","title":"CODE+: Fast and Accurate Inference for Compact Distributed IoT Data Collection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Data Stream Mining Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"National Natural Science Foundation of China; Higher Education Discipline Innovation Project; Guoqiang Institute, Tsinghua University","keywords":"Computer science; Code (set theory); Inference; Programming language; Artificial intelligence","score_opus":0.06580068564945558,"score_gpt":0.3247437108379405,"score_spread":0.25894302518848494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402186982","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.0015365422,0.00006705173,0.9761555,0.0001606142,0.00008800261,0.00007860162,0.0009338225,0.019934632,0.0010452956],"genre_scores_gemma":[0.054227322,0.0001442367,0.93392617,0.00033189097,0.00013482102,0.00047536497,0.004135418,0.0029193177,0.0037053688],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998555,0.00026931168,0.00011033131,0.00034147754,0.0006024589,0.00012135091],"domain_scores_gemma":[0.99673826,0.0014160818,0.00017005415,0.00086544524,0.0006815478,0.00012860452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001935168,0.001606612,0.0010900119,0.001038729,0.0007580164,0.0018702192,0.0037629749,0.0011544158,0.01704193],"category_scores_gemma":[0.008588526,0.0008448037,0.0010821399,0.001372112,0.0008696007,0.0025589166,0.0026444898,0.0022029306,0.00936853],"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.0007960566,0.00025226397,0.003971672,0.0006651292,0.00027327245,0.0005016232,0.0003851079,0.21655646,0.016731441,0.048439052,0.1211615,0.59026635],"study_design_scores_gemma":[0.00008354952,0.000025063566,0.00030443625,0.00001614609,0.000011669321,0.00008612189,0.000019703373,0.96575844,0.0043943655,0.018064402,0.011214734,0.000021299795],"about_ca_topic_score_codex":0.0109733455,"about_ca_topic_score_gemma":0.016882963,"teacher_disagreement_score":0.01704193,"about_ca_system_score_codex":0.00084223936,"about_ca_system_score_gemma":0.0026606242,"threshold_uncertainty_score":0.05701089},"labels":[],"label_agreement":null},{"id":"W4405270867","doi":"10.1109/tpds.2024.3515804","title":"UMPIPE: Unequal Microbatches-Based Pipeline Parallelism for Deep Neural Network Training","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Neural Networks and Reservoir Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Pipeline (software); Parallelism (grammar); Parallel computing; Artificial neural network; Training (meteorology); Data parallelism; Computer architecture; Artificial intelligence; Operating system","score_opus":0.03361677045423552,"score_gpt":0.25995712606493104,"score_spread":0.22634035561069552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405270867","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.04385469,0.00048342563,0.9414822,0.00036864835,0.0001045912,0.0001250231,0.000202146,0.008369882,0.005009438],"genre_scores_gemma":[0.35205093,0.0002526198,0.64096063,0.00033233204,0.000036298115,0.00031288652,0.0007218567,0.0007006317,0.004631911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99964213,0.000059563856,0.000021586346,0.0000933666,0.00012044111,0.00006285194],"domain_scores_gemma":[0.99953496,0.00018927739,0.000038868082,0.0001020888,0.00008904012,0.000045842844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067293365,0.00086126867,0.00057101523,0.0004540198,0.0005618481,0.0006309478,0.00210834,0.00075824757,0.0044903625],"category_scores_gemma":[0.0019541283,0.0004200992,0.0006345045,0.0006280904,0.000565235,0.0017460354,0.0014560374,0.0016213345,0.00081765384],"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.00035218036,0.0002952203,0.0019015239,0.00020706796,0.00008819876,0.00016928518,0.0001396529,0.54675937,0.01813855,0.018390618,0.013492271,0.40006605],"study_design_scores_gemma":[0.000039125847,0.00007398938,0.00013926272,0.0000069942766,0.000009525841,0.000026193406,0.000012698705,0.9875236,0.0049649645,0.0051435013,0.002052364,0.000007792083],"about_ca_topic_score_codex":0.006093125,"about_ca_topic_score_gemma":0.01201649,"teacher_disagreement_score":0.006093125,"about_ca_system_score_codex":0.0010554981,"about_ca_system_score_gemma":0.002441989,"threshold_uncertainty_score":0.015021801},"labels":[],"label_agreement":null},{"id":"W4409133982","doi":"10.1109/tpds.2025.3557747","title":"OneOS: Distributed Operating System for the Edge-to-Cloud Continuum","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Cloud computing; Enhanced Data Rates for GSM Evolution; Distributed computing; Operating system; Telecommunications","score_opus":0.01655929933797853,"score_gpt":0.25101901897492546,"score_spread":0.23445971963694692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409133982","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.050883498,0.0014574042,0.65216625,0.0010462947,0.0009687452,0.0008683391,0.0017592179,0.2583114,0.032538824],"genre_scores_gemma":[0.5865608,0.0016517336,0.33961698,0.0021927224,0.0005763421,0.001714072,0.008440161,0.023484131,0.035763174],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987446,0.00016946819,0.00015823974,0.00022560326,0.00051978807,0.0001822647],"domain_scores_gemma":[0.9978654,0.000381789,0.00023452216,0.0006383874,0.0003763335,0.00050355744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015307355,0.0011766802,0.00075155735,0.00090932887,0.00082814856,0.0021071145,0.002780466,0.00077156076,0.007941127],"category_scores_gemma":[0.004196041,0.0005758634,0.0005574976,0.0006093029,0.00093600765,0.0028757148,0.0032580597,0.0027748195,0.0035921258],"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.0046103834,0.0012383555,0.012915682,0.0012028463,0.00033546254,0.001710974,0.0015434707,0.026436524,0.11022883,0.10370245,0.2646609,0.47141424],"study_design_scores_gemma":[0.001134023,0.0008809807,0.0085560195,0.00032592248,0.00022732094,0.0018320634,0.00034666766,0.40496865,0.0634857,0.044865564,0.4729208,0.0004562135],"about_ca_topic_score_codex":0.0009999555,"about_ca_topic_score_gemma":0.0008393524,"teacher_disagreement_score":0.007941127,"about_ca_system_score_codex":0.0008022036,"about_ca_system_score_gemma":0.0018293103,"threshold_uncertainty_score":0.02656573},"labels":[],"label_agreement":null},{"id":"W4412939588","doi":"10.1109/tpds.2025.3595801","title":"MUCVR: Edge Computing-Enabled High-Quality Multi-User Collaboration for Interactive MVR","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Key Research and Development Program of Hunan Province of China; Hunan Provincial Innovation Foundation for Postgraduate; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Human–computer interaction; Computer network; Multimedia; Computer architecture; Telecommunications","score_opus":0.014855832187134035,"score_gpt":0.2897676691655921,"score_spread":0.27491183697845806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412939588","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.039867748,0.00037984774,0.943798,0.00015375261,0.0001287434,0.00016820458,0.00011201529,0.008916639,0.0064749834],"genre_scores_gemma":[0.6062566,0.00026185098,0.38725987,0.00030568673,0.00007631578,0.000149579,0.00043226697,0.00058295025,0.0046748505],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896216,0.00024075132,0.00005827482,0.00018907676,0.00035757764,0.00019220031],"domain_scores_gemma":[0.9993074,0.000120111436,0.000052486463,0.00022750862,0.0001645773,0.00012779163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930662,0.00072222116,0.00061748986,0.0005734726,0.0005756615,0.0011160233,0.0017557056,0.00089554524,0.004100118],"category_scores_gemma":[0.0013676508,0.00030401244,0.00058158947,0.00043793538,0.0003982516,0.0014495199,0.0031026865,0.0009421369,0.0010683531],"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.0025911457,0.00081595586,0.003660268,0.0005419563,0.00021181781,0.002005008,0.0011903412,0.061848264,0.33609736,0.028609542,0.023459582,0.53896874],"study_design_scores_gemma":[0.00019692646,0.0006421919,0.0025726731,0.000043962533,0.00007191837,0.0010172296,0.00024205835,0.8607792,0.08989835,0.0070747435,0.037292715,0.00016794448],"about_ca_topic_score_codex":0.0018694958,"about_ca_topic_score_gemma":0.0021171928,"teacher_disagreement_score":0.004100118,"about_ca_system_score_codex":0.0003436302,"about_ca_system_score_gemma":0.00056767976,"threshold_uncertainty_score":0.013716221},"labels":[],"label_agreement":null},{"id":"W6903282469","doi":"10.1109/tpds.2025.3587641","title":"<i>$\\mathsf{streamline}$</i>: Accelerating Deployment and Assessment of Real-Time Big Data Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Parallel and Distributed Systems","topic":"Software System Performance and Reliability","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Testbed; Cloud computing; Software deployment; Pipeline (software); Big data; Benchmarking; Stream processing; Dependability; Modular design","score_opus":0.04520426180685106,"score_gpt":0.2959825439453026,"score_spread":0.25077828213845155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903282469","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.0069775633,0.0004189422,0.7420258,0.005356385,0.0012676778,0.000957954,0.0064944425,0.15015456,0.08634674],"genre_scores_gemma":[0.08972809,0.0015745764,0.7428406,0.002380373,0.0016149692,0.0010503049,0.025354128,0.029819874,0.10563709],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987765,0.00020689402,0.00007316931,0.00017225015,0.00064132985,0.0001299104],"domain_scores_gemma":[0.99709785,0.00052730367,0.00018323769,0.0006729322,0.0010875473,0.00043107063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024942304,0.001287563,0.00058286334,0.0022785303,0.0009399277,0.0048006224,0.0032811065,0.0015024787,0.048945468],"category_scores_gemma":[0.006286255,0.0006297661,0.0006563741,0.0018935187,0.000742261,0.004081914,0.0023808077,0.0015377707,0.02396233],"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.0003143593,0.00019179078,0.0013120528,0.00023604328,0.00002940758,0.00018992403,0.00017000391,0.0069168415,0.016034216,0.0318138,0.6061961,0.33659554],"study_design_scores_gemma":[0.00019733771,0.00022786809,0.0041188104,0.00016459715,0.000037059497,0.0003379802,0.00011277041,0.19605826,0.04693074,0.031517718,0.7201411,0.00015572172],"about_ca_topic_score_codex":0.010130804,"about_ca_topic_score_gemma":0.0112633705,"teacher_disagreement_score":0.048945468,"about_ca_system_score_codex":0.0019734062,"about_ca_system_score_gemma":0.0020965203,"threshold_uncertainty_score":0.1637389},"labels":[],"label_agreement":null}]}