{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026167603,0.00015216529,0.9957832,0.00016795579,0.00015981027,0.0004942061,0.00012944103,0.00041960884,0.00007684845],"genre_scores_gemma":[0.9748625,0.00014325736,0.024322249,0.00005380832,0.000036906782,0.00030962392,0.00009695292,0.000008546878,0.00016613863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871236,0.000082262784,0.00031819506,0.0004949486,0.00017405294,0.00021816308],"domain_scores_gemma":[0.99911714,0.00013438893,0.00013321284,0.0003697918,0.00012415058,0.00012131244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034628707,0.00018897427,0.00028120156,0.00021518751,0.000410193,0.00018085624,0.0001993287,0.0001583272,9.424496e-7],"category_scores_gemma":[0.0000055171313,0.0001725646,0.00008657465,0.0005600459,0.000045972934,0.00025568236,0.0000035824728,0.00013712094,0.0000025584593],"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.00003390661,0.000057292797,0.0002846666,0.000056146622,0.000110633926,1.168626e-7,0.000059710113,0.9869576,0.00007460297,0.0014412015,0.0003097856,0.010614312],"study_design_scores_gemma":[0.0005239001,0.0001805876,0.0013640024,0.000019450452,0.00010395086,0.00000782641,0.000012668002,0.99562466,0.00011955346,0.0001741289,0.0016860756,0.00018320078],"about_ca_topic_score_codex":0.00003755372,"about_ca_topic_score_gemma":0.000007372912,"teacher_disagreement_score":0.97224575,"about_ca_system_score_codex":0.000029717032,"about_ca_system_score_gemma":0.000015867572,"threshold_uncertainty_score":0.70369804},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006744364,0.00023614017,0.9915557,0.00026511835,0.0002742048,0.0004783276,0.00009837919,0.00020341162,0.00014435519],"genre_scores_gemma":[0.97138625,0.000041670264,0.028197959,0.000032648357,0.000011834887,0.00008953945,0.000011932611,0.000009904488,0.00021828317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986423,0.0001120031,0.00046265853,0.00032292926,0.00022901836,0.00023106107],"domain_scores_gemma":[0.998954,0.00008891605,0.0001714144,0.00037435457,0.00030248257,0.00010883103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016183207,0.00019359759,0.00035356628,0.00015177134,0.00011581191,0.000078529454,0.00038138573,0.00013238327,0.000008853347],"category_scores_gemma":[0.000009488283,0.00016265565,0.00008874896,0.00042120987,0.00011011771,0.00017774465,0.0000052081505,0.00016370404,0.000008730971],"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.00005970836,0.00067906745,0.00013403695,0.0005405985,0.00018797127,0.0000042971715,0.0023432318,0.97346634,0.0076404763,0.0015370899,0.0037326256,0.009674559],"study_design_scores_gemma":[0.0011416958,0.00040276357,0.00015055457,0.00023938692,0.000032533862,0.00003423376,0.00029634326,0.9893394,0.0064113634,0.0005352614,0.00097078795,0.00044568902],"about_ca_topic_score_codex":0.00019657053,"about_ca_topic_score_gemma":0.000006286262,"teacher_disagreement_score":0.96464187,"about_ca_system_score_codex":0.000016752145,"about_ca_system_score_gemma":0.000057382644,"threshold_uncertainty_score":0.66329044},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105529815,0.0005227388,0.8919276,0.00014315819,0.0012105788,0.00022980371,0.00002507437,0.00039853642,0.000012673833],"genre_scores_gemma":[0.9773646,0.000016946726,0.022318339,0.00004155134,0.0001504606,0.000046662048,0.000004940563,0.000016772905,0.00003972696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837774,0.00011297962,0.0003825558,0.0004223981,0.00028981865,0.0004144801],"domain_scores_gemma":[0.9990009,0.00014757173,0.000100633966,0.00033204586,0.00009038083,0.00032844627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003347481,0.00025495622,0.0003331249,0.00010161421,0.00025376174,0.0003513822,0.0002935595,0.0001620584,0.000002215015],"category_scores_gemma":[0.000013776133,0.00024362154,0.00009736252,0.0003972179,0.00002769969,0.00031835597,0.0000043029113,0.00031431505,0.000010999706],"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.000029198722,0.00004756875,0.000009289805,0.000012353875,0.000051349216,0.000014713925,0.00024504526,0.99161243,0.00005750507,0.0022628282,0.000050932005,0.0056067645],"study_design_scores_gemma":[0.0008907117,0.00007051538,0.000012451403,0.00012148776,0.00003254602,0.00010213599,0.0001430398,0.9979801,0.0000064943038,0.000008556869,0.00035611386,0.0002758521],"about_ca_topic_score_codex":0.000035449357,"about_ca_topic_score_gemma":0.0000017855708,"teacher_disagreement_score":0.8718348,"about_ca_system_score_codex":0.00009668137,"about_ca_system_score_gemma":0.00008518316,"threshold_uncertainty_score":0.9934598},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072169527,0.00010707183,0.99170786,0.000026914835,0.0002799539,0.0003589946,0.000038254093,0.00014552807,0.00011847989],"genre_scores_gemma":[0.98916364,0.000015267451,0.010550919,0.00003053034,0.000012638914,0.00015150539,0.000023689083,0.000011474079,0.00004034034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862003,0.0001485045,0.00030361052,0.0004348602,0.0002043837,0.00028862504],"domain_scores_gemma":[0.9993509,0.000027835355,0.00009238167,0.0003601485,0.000024403289,0.0001443185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026414063,0.00018643754,0.00019871579,0.00014512395,0.0002424662,0.00012205895,0.00024455268,0.00012955257,0.000004672524],"category_scores_gemma":[0.0000016816252,0.00017634992,0.000040041323,0.00035590632,0.000054570537,0.00024023495,0.000002186058,0.00017599502,0.000008206273],"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.00003477873,0.0003552493,0.00016765937,0.000028291577,0.0000068544036,0.000010614801,0.00030650423,0.99717075,0.00012054088,0.00011778467,0.0000164875,0.0016644843],"study_design_scores_gemma":[0.0006571127,0.00015396446,0.00044881355,0.00017466313,0.000011502029,0.000020101059,0.00009723496,0.9969817,0.0010074184,0.00005085046,0.00013520097,0.0002614581],"about_ca_topic_score_codex":0.00012046718,"about_ca_topic_score_gemma":0.000015673035,"teacher_disagreement_score":0.9819467,"about_ca_system_score_codex":0.00008792036,"about_ca_system_score_gemma":0.00004442707,"threshold_uncertainty_score":0.7191341},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030458039,0.0006266505,0.9923627,0.000095599025,0.0015941578,0.00058781484,0.0009109736,0.0002806211,0.000495672],"genre_scores_gemma":[0.9983792,0.00005301585,0.00090832525,0.0000774998,0.00003295009,0.00028569906,0.000025073727,0.000015792908,0.0002224525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975018,0.00021433971,0.0007285856,0.00066831865,0.00038265984,0.00050428574],"domain_scores_gemma":[0.998792,0.00013997819,0.00016270237,0.00051575864,0.00012624654,0.00026329255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036025685,0.00034736216,0.0005227568,0.00018860828,0.000248525,0.00013268593,0.00047806514,0.00023225557,0.00003754668],"category_scores_gemma":[0.0000068071954,0.00032310755,0.00015048198,0.0005313081,0.00009939199,0.00058799353,0.0000019964834,0.00040359446,0.00006386563],"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.0022625544,0.007580903,0.0056031994,0.0013553915,0.0013184955,0.0012309154,0.010277726,0.83771944,0.0015679369,0.040401816,0.008108846,0.08257275],"study_design_scores_gemma":[0.031220865,0.0017349978,0.025053542,0.0014188624,0.00022383184,0.001284152,0.002215345,0.91803825,0.00056262186,0.0020863158,0.011934275,0.0042269244],"about_ca_topic_score_codex":0.0005493288,"about_ca_topic_score_gemma":0.00006860401,"teacher_disagreement_score":0.9953334,"about_ca_system_score_codex":0.000097107724,"about_ca_system_score_gemma":0.00010027801,"threshold_uncertainty_score":0.9999221},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07258897,0.000059599544,0.92431,0.00094733847,0.0009186505,0.00057513354,0.00013473643,0.00037627603,0.000089250636],"genre_scores_gemma":[0.9924809,0.000033063185,0.0064664013,0.00005521396,0.000023549594,0.000684625,0.000009259599,0.000013674322,0.00023334625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976079,0.00009458577,0.00047152478,0.0006961117,0.00059194566,0.00053793314],"domain_scores_gemma":[0.99868006,0.00008545302,0.00006472904,0.0008016813,0.00007494788,0.00029314338],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047363827,0.00028875028,0.00034396583,0.00024780867,0.00017817752,0.0001131214,0.0006729151,0.00012140516,0.000007565874],"category_scores_gemma":[0.000021249509,0.00027400427,0.00007287202,0.00053005037,0.000055754845,0.00038458937,0.000024410509,0.00029003507,0.00015821653],"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.00015609412,0.0008467995,0.0020567612,0.00005764404,0.00007594897,0.00008254097,0.0031012422,0.9591328,0.00035050086,0.001183276,0.0021743588,0.030782064],"study_design_scores_gemma":[0.0073942607,0.0026955912,0.09292893,0.0008979624,0.000116028066,0.00020352265,0.006994137,0.7527776,0.011060965,0.0011709938,0.118883125,0.00487693],"about_ca_topic_score_codex":0.0008512177,"about_ca_topic_score_gemma":0.00014895474,"teacher_disagreement_score":0.9198919,"about_ca_system_score_codex":0.00023376798,"about_ca_system_score_gemma":0.000022778033,"threshold_uncertainty_score":0.9999712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06861323,0.00013096236,0.9288645,0.00029125984,0.0013205002,0.00048579104,0.00002355245,0.00017678131,0.000093446295],"genre_scores_gemma":[0.99908566,0.000018721961,0.00015061296,0.00019181821,0.00015247815,0.00032512454,0.000044480592,0.000011463132,0.000019611232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981151,0.0003607436,0.00037728302,0.00045462738,0.00037700174,0.0003152485],"domain_scores_gemma":[0.9991218,0.00011768116,0.0001227514,0.00029434223,0.00023906934,0.00010437939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008629972,0.00019886531,0.00025534886,0.00015334315,0.00039910377,0.00021713947,0.00023805749,0.0001958713,0.000007778539],"category_scores_gemma":[0.0000054894967,0.00019840477,0.000056014505,0.001180901,0.000015196169,0.00041167787,0.000003886819,0.0002797259,0.0000175961],"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.000044032793,0.0000903693,0.000055836535,0.000038841004,0.000019088067,0.0000010091791,0.0005981071,0.98788196,0.00008078744,0.00032466333,0.000064096355,0.010801225],"study_design_scores_gemma":[0.0012269513,0.000088545545,0.0007628643,0.000052018466,0.000026188573,0.000012996102,0.00023631778,0.9954187,0.00003176284,0.00009483409,0.0018313569,0.00021742521],"about_ca_topic_score_codex":0.000848829,"about_ca_topic_score_gemma":0.00064108503,"teacher_disagreement_score":0.93047243,"about_ca_system_score_codex":0.00011610943,"about_ca_system_score_gemma":0.00004226933,"threshold_uncertainty_score":0.8090712},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13811423,0.00007809561,0.8597599,0.0007753086,0.00047091575,0.0004912393,0.000031908497,0.0001738208,0.000104538834],"genre_scores_gemma":[0.99860436,0.0000015761583,0.00086066173,0.0000766317,0.000076407465,0.000057122586,0.000035118836,0.000010847275,0.00027726678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983992,0.00015841809,0.00042661073,0.00043236132,0.0002822799,0.0003011525],"domain_scores_gemma":[0.99901533,0.0001952583,0.00013830706,0.00036056023,0.00015172976,0.00013879866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076580216,0.00017969932,0.00024511918,0.00014905815,0.00023210308,0.00020937501,0.00030545145,0.000102967664,4.7528306e-7],"category_scores_gemma":[0.000017494995,0.00016915475,0.000056954806,0.00049737503,0.00003286645,0.000050459403,0.0000100582665,0.00014989561,0.0000061509886],"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.00005545615,0.000095915355,0.00018760102,0.00007194063,0.000018517807,0.000004661009,0.00042139218,0.99404496,0.0000072369335,0.0013706875,0.0011338892,0.002587764],"study_design_scores_gemma":[0.001678751,0.00013256761,0.00060917274,0.00014008315,0.000011652753,0.000015034488,0.0006887966,0.99197614,0.00001978642,0.00019626725,0.004320208,0.00021154579],"about_ca_topic_score_codex":0.00024580842,"about_ca_topic_score_gemma":0.0000296499,"teacher_disagreement_score":0.86049014,"about_ca_system_score_codex":0.00011461681,"about_ca_system_score_gemma":0.000043124703,"threshold_uncertainty_score":0.68979305},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01364082,0.00089237717,0.9820781,0.000012021425,0.0016427248,0.0010880477,0.00036409587,0.00025466725,0.000027164178],"genre_scores_gemma":[0.9937423,0.00008273364,0.0052631786,0.000010962375,0.00015408397,0.0005596858,0.00008606221,0.00006685876,0.000034149587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998258,0.000062927225,0.0006100605,0.00027885244,0.00014280852,0.00064734684],"domain_scores_gemma":[0.99901545,0.00035562663,0.000080221915,0.0002126405,0.000070460956,0.00026558523],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036305838,0.00030570893,0.0004330755,0.00029827905,0.00017693102,0.00006461107,0.00010358943,0.00022447249,0.0000025381848],"category_scores_gemma":[0.000018689576,0.00032196977,0.00008221931,0.0006476023,0.000020070784,0.000321175,0.0000016398797,0.00022889182,0.0000060129437],"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.000043123353,0.0000697926,0.00017194194,0.00012342661,0.000054230088,0.0000015603135,0.0005060401,0.99615574,0.00031931666,0.000060701575,0.000051465802,0.0024426756],"study_design_scores_gemma":[0.000980378,0.000038484006,0.000080988844,0.00015027577,0.00004038235,0.000021474465,0.0009458278,0.99695927,0.00020812947,0.0000017026931,0.00021653765,0.0003565358],"about_ca_topic_score_codex":0.000119192264,"about_ca_topic_score_gemma":0.000073905,"teacher_disagreement_score":0.98010147,"about_ca_system_score_codex":0.00025665705,"about_ca_system_score_gemma":0.000009774776,"threshold_uncertainty_score":0.9999232},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076638744,0.000075899,0.9899673,0.0004465011,0.0003945881,0.0006627434,0.000027438507,0.000615133,0.0001465572],"genre_scores_gemma":[0.9980176,0.00003647371,0.001338546,0.000073161726,0.000035873414,0.00021072365,0.00003745024,0.000019517116,0.00023062827],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820524,0.00015967824,0.00042776286,0.0005227669,0.0002695954,0.0004149359],"domain_scores_gemma":[0.99892175,0.0002029215,0.0001295523,0.0005306482,0.000106206826,0.000108909924],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018305382,0.00026828874,0.0003107783,0.00026779008,0.00024047245,0.00030128437,0.00037183778,0.00023934318,0.000035528916],"category_scores_gemma":[0.000007902582,0.00025199165,0.000055390803,0.0009869315,0.00008405984,0.00040506062,0.000004994561,0.00028462286,0.0001806368],"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.000009432153,0.000110675326,0.00008440883,0.000022260247,0.000013285881,0.0000067107894,0.000021958158,0.99307853,0.000058380192,0.00031758728,0.0006821048,0.005594654],"study_design_scores_gemma":[0.00073298614,0.00011726001,0.00020043821,0.00015186006,0.0000069528137,0.00000980324,0.000045643283,0.9982745,0.00008366789,0.000039539183,0.00006588523,0.00027145637],"about_ca_topic_score_codex":0.00008700208,"about_ca_topic_score_gemma":0.0000062261456,"teacher_disagreement_score":0.99035376,"about_ca_system_score_codex":0.00017928128,"about_ca_system_score_gemma":0.00004582739,"threshold_uncertainty_score":0.9999932},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013360117,0.00006310963,0.9946522,0.000103613165,0.00015538794,0.0011550207,0.0008211987,0.00037024723,0.0013431944],"genre_scores_gemma":[0.9852784,0.000017104949,0.013205333,0.00005596508,0.000042578147,0.00061194703,0.00005643406,0.000018461771,0.0007137765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794716,0.00005962535,0.0007686956,0.0005356981,0.0004220446,0.00026678096],"domain_scores_gemma":[0.9980236,0.0007363413,0.00024441216,0.00048368418,0.0003561754,0.00015574927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050993456,0.00022534489,0.00033213745,0.00021664641,0.00043555055,0.00036454227,0.00030046358,0.00018525387,0.00005789661],"category_scores_gemma":[0.000058233047,0.00017768923,0.00017820584,0.00042814665,0.00009331241,0.00046898026,0.0000033649353,0.00012606068,0.000043008757],"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.00026238136,0.00034233465,0.00012555804,0.000018993278,0.000045082437,0.0000018231533,0.00040486877,0.96511513,0.00010443145,0.007434391,0.0010711855,0.025073819],"study_design_scores_gemma":[0.0010738769,0.0004854438,0.00030612617,0.000055834418,0.000060536757,0.000019149122,0.0013272256,0.9330118,0.0005592335,0.034017876,0.02844402,0.00063892995],"about_ca_topic_score_codex":0.000035155957,"about_ca_topic_score_gemma":0.0000036452905,"teacher_disagreement_score":0.9839424,"about_ca_system_score_codex":0.00004287899,"about_ca_system_score_gemma":0.00002582978,"threshold_uncertainty_score":0.72459567},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009086712,0.000045195688,0.938147,0.0035045405,0.046978496,0.00047332462,0.00002022256,0.0003753969,0.0013691316],"genre_scores_gemma":[0.90730554,0.000005572771,0.0003819079,0.00011186457,0.09066055,0.00003618289,0.000008460958,0.000013646926,0.0014762869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980168,0.0001444168,0.0004138216,0.0006268311,0.00039930656,0.0003988663],"domain_scores_gemma":[0.9988889,0.00012067309,0.0001253298,0.0005664967,0.0001011591,0.00019741402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002362121,0.00027295106,0.00029678663,0.00013563017,0.000583886,0.00046678964,0.00042036732,0.00011550011,0.00004702931],"category_scores_gemma":[0.000005606228,0.00023557624,0.00009933993,0.0003865035,0.00006671355,0.00004960181,0.000011543015,0.00031233052,0.00057385507],"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.000013974072,0.00021372703,0.000007748711,0.000038157636,0.000057301506,0.000008432127,0.00022656382,0.6664583,0.000014480211,0.00082199293,0.32234597,0.009793315],"study_design_scores_gemma":[0.00086960173,0.00036791735,0.00020349343,0.00009432199,0.00002345605,0.00006123531,0.00038096114,0.5351379,0.00006748504,0.00007451697,0.46224776,0.0004713815],"about_ca_topic_score_codex":0.00018402847,"about_ca_topic_score_gemma":0.000002476692,"teacher_disagreement_score":0.93776506,"about_ca_system_score_codex":0.000081864106,"about_ca_system_score_gemma":0.000016875938,"threshold_uncertainty_score":0.960652},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00832524,0.000104009545,0.9893077,0.000015051307,0.00033555477,0.0012142208,0.00020364247,0.000058840393,0.00043573882],"genre_scores_gemma":[0.99844086,0.000031624106,0.0009309464,0.000017107734,0.000039665843,0.00042238508,0.000022815795,0.000009653326,0.00008495089],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817914,0.00018171493,0.0005868275,0.00038535002,0.00034591282,0.00032104048],"domain_scores_gemma":[0.9985054,0.00016039041,0.00032401396,0.00063868595,0.00022426856,0.00014724064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043121935,0.0002315797,0.0005770297,0.00017688115,0.00014718747,0.000066828055,0.00036258463,0.00017200642,0.000036859918],"category_scores_gemma":[0.0000022492547,0.00018877507,0.00027123105,0.001576946,0.000061951825,0.00021634695,0.000003018644,0.00016257714,0.000005762056],"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.00014425108,0.0002980096,0.00042288174,0.000040575385,0.0009282197,0.0000013071151,0.00016689618,0.99378115,0.00014968586,0.0030936038,0.000421751,0.0005516959],"study_design_scores_gemma":[0.0010552045,0.0011484927,0.008360169,0.00022689954,0.00048110733,0.000007259511,0.000059791397,0.9873285,0.0002844949,0.0005347702,0.00013154204,0.00038174243],"about_ca_topic_score_codex":0.0018178012,"about_ca_topic_score_gemma":0.000054926026,"teacher_disagreement_score":0.9901156,"about_ca_system_score_codex":0.00009879691,"about_ca_system_score_gemma":0.00014326128,"threshold_uncertainty_score":0.7698024},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002353396,0.00035940565,0.99565244,0.000030075556,0.00067014486,0.00017924716,0.00003057704,0.00054153026,0.00018318328],"genre_scores_gemma":[0.9314157,0.000035537094,0.06832662,0.000009892118,0.000011860357,0.000058459205,0.0000021317148,0.0000123440095,0.00012746245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883145,0.00012492151,0.00018560769,0.00037125,0.00019732017,0.00028944464],"domain_scores_gemma":[0.99905056,0.00029161086,0.0000565013,0.0004153689,0.000057461875,0.00012847572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001808647,0.00020097422,0.00023260503,0.00007963185,0.00019014181,0.00011093058,0.00020126256,0.00007950878,0.0000020052485],"category_scores_gemma":[0.00002497474,0.00016109503,0.000038108974,0.00032686398,0.0000380202,0.00029305418,0.0000014165618,0.00019712362,0.000008640006],"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.00001204933,0.000034809855,0.000026998086,0.00003745141,0.00003352754,0.000026198146,0.000101052756,0.99300486,0.00014214645,0.0055696685,0.000015727857,0.000995501],"study_design_scores_gemma":[0.043599956,0.013893182,0.011236288,0.0075557,0.000979677,0.0130855115,0.012589112,0.59022266,0.09737313,0.08178142,0.10291126,0.024772123],"about_ca_topic_score_codex":0.000017524617,"about_ca_topic_score_gemma":0.000004456487,"teacher_disagreement_score":0.9290623,"about_ca_system_score_codex":0.00006468682,"about_ca_system_score_gemma":0.000036952268,"threshold_uncertainty_score":0.65692645},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08473062,0.00027100477,0.91285324,0.00020541745,0.0010629724,0.00043529322,0.000014655359,0.0003222209,0.00010458901],"genre_scores_gemma":[0.9986785,0.000005252667,0.0008409156,0.00007617345,0.00011025407,0.000042246935,0.0000090855065,0.000016440732,0.00022114819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976293,0.00038658234,0.0005719607,0.00064232905,0.00032695927,0.00044287063],"domain_scores_gemma":[0.99883527,0.00019349626,0.00016976534,0.0005753578,0.000055986056,0.00017010103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006419184,0.0002813448,0.00037268316,0.00019800897,0.00034902623,0.00034068924,0.0004876783,0.00013379999,6.0085574e-7],"category_scores_gemma":[0.000007189778,0.00025966752,0.00009026362,0.00042480903,0.000047772453,0.000029328054,0.000014220648,0.0002498247,0.000028312405],"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.0000113775395,0.0001683532,0.00005923219,0.00008811896,0.00003266528,0.00001003055,0.00032289146,0.9949119,0.00004455577,0.00057576393,0.00012727147,0.0036478506],"study_design_scores_gemma":[0.0010312132,0.000109831104,0.0002720317,0.00017905714,0.000012475937,0.000065589295,0.00022965422,0.99444807,0.000017316774,0.000009533937,0.0033333027,0.0002919211],"about_ca_topic_score_codex":0.00052055303,"about_ca_topic_score_gemma":0.000031071813,"teacher_disagreement_score":0.9139479,"about_ca_system_score_codex":0.00012176796,"about_ca_system_score_gemma":0.000016793281,"threshold_uncertainty_score":0.9999856},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006005453,0.0014232355,0.9913766,0.00015991766,0.00034153162,0.00028086416,0.000013410749,0.000061280625,0.00033771823],"genre_scores_gemma":[0.9975545,0.0012511925,0.0010597575,0.00002447568,0.000015977379,0.00004725963,0.0000050513536,0.000006257063,0.000035575657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983978,0.0003830545,0.00048387388,0.00029334016,0.00013538702,0.0003065442],"domain_scores_gemma":[0.99887466,0.00022519355,0.00015422182,0.000601867,0.000064863016,0.0000792086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060351833,0.00016599226,0.00028425443,0.00008533223,0.00040902814,0.00007890464,0.0006753888,0.00007783551,0.000009748302],"category_scores_gemma":[0.0000052562227,0.00012746055,0.000076649965,0.00091779156,0.0001645865,0.00021271066,0.000011454454,0.00032408105,0.0000021641195],"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.00005143444,0.0001391022,0.0008773131,0.000020512152,0.000046915706,0.000004118856,0.0010210075,0.97020227,0.000054372904,0.019585853,0.00013352763,0.007863598],"study_design_scores_gemma":[0.00035995722,0.00006121112,0.00910688,0.00013885013,0.000011850664,0.000012705984,0.0001844645,0.98952043,0.000014221122,0.00033732338,0.000093017865,0.00015905776],"about_ca_topic_score_codex":0.0001116013,"about_ca_topic_score_gemma":0.00037580996,"teacher_disagreement_score":0.991549,"about_ca_system_score_codex":0.000050780418,"about_ca_system_score_gemma":0.00003118818,"threshold_uncertainty_score":0.519769},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062364887,0.0009716258,0.9343902,0.0006406216,0.0007074635,0.0005536463,0.000029515335,0.00023334239,0.00010871262],"genre_scores_gemma":[0.9980657,0.00008918671,0.0014295075,0.00006858883,0.00017165641,0.000053557607,0.000008077161,0.000013929138,0.000099770186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823326,0.0001789278,0.00041015563,0.0005719098,0.00024357595,0.00036214464],"domain_scores_gemma":[0.9989839,0.00027855427,0.00016721529,0.00033770566,0.000077410106,0.00015520262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067145884,0.0002259904,0.00029782383,0.00014375127,0.0005748799,0.00028640966,0.0002651516,0.00008808794,9.175488e-7],"category_scores_gemma":[0.0000064060305,0.00020326352,0.00008335377,0.00015211408,0.000040623978,0.000036925707,0.000013301485,0.00012515379,0.0000048959914],"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.00008962172,0.00020372531,0.000021616377,0.00059508864,0.00022571327,0.0000047960903,0.0038270536,0.685235,0.00026582877,0.023126416,0.0007533175,0.28565177],"study_design_scores_gemma":[0.002294185,0.00036397425,0.0003298983,0.00012096101,0.00006994888,0.000037895952,0.0027596639,0.96136,0.000072788345,0.00042127987,0.031745207,0.00042422785],"about_ca_topic_score_codex":0.00013307053,"about_ca_topic_score_gemma":0.00001917163,"teacher_disagreement_score":0.93570083,"about_ca_system_score_codex":0.000035323985,"about_ca_system_score_gemma":0.000012295561,"threshold_uncertainty_score":0.8288846},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15719272,0.000117012125,0.8400173,0.0000886336,0.0007278024,0.0014805967,0.000030328794,0.0003211662,0.000024410208],"genre_scores_gemma":[0.9898087,0.00001888901,0.009143539,0.00007962764,0.00013928566,0.0007159564,0.000027091504,0.000037828595,0.000029081388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727255,0.00029329272,0.0007358454,0.0007528357,0.00027915707,0.00066630286],"domain_scores_gemma":[0.9981573,0.00044527504,0.00031272855,0.00065704505,0.0002336497,0.00019396204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006636114,0.00037558188,0.00045940749,0.00020135313,0.00054367643,0.00022230226,0.00051055086,0.00031534146,0.0000016035079],"category_scores_gemma":[0.000030611696,0.00038669526,0.00012329523,0.00088318205,0.00008386909,0.00030706375,0.000007064863,0.0005781316,0.000006314252],"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.00016768705,0.00025970986,0.00022429528,0.0001882686,0.000041055635,0.000007918758,0.0011727636,0.9927942,0.00018713824,0.00016942328,0.000048437043,0.0047391052],"study_design_scores_gemma":[0.0015583121,0.00017061346,0.0001631687,0.0004270781,0.000015513679,0.000019255513,0.0005360118,0.9961328,0.0004262867,0.00001799371,0.00009836206,0.00043463227],"about_ca_topic_score_codex":0.00023734779,"about_ca_topic_score_gemma":0.0000554331,"teacher_disagreement_score":0.832616,"about_ca_system_score_codex":0.00016210433,"about_ca_system_score_gemma":0.000084389096,"threshold_uncertainty_score":0.9998585},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073942444,0.00026376083,0.9884906,0.00040062756,0.0005858071,0.0004467155,0.00013701973,0.0011473261,0.0011339462],"genre_scores_gemma":[0.987021,0.00026236675,0.011133108,0.00025755135,0.00008170285,0.00019245366,0.000046025874,0.000026294554,0.0009794922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974564,0.00015996523,0.00056369917,0.00078182016,0.0004336897,0.0006044581],"domain_scores_gemma":[0.9985891,0.00015081014,0.00019305086,0.00063784915,0.00014985215,0.00027936298],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036848692,0.00038333965,0.00041782326,0.00022125388,0.0006952809,0.00037035203,0.00057046034,0.00020587913,0.000016368662],"category_scores_gemma":[0.000011334781,0.00035352624,0.0001395728,0.00047926864,0.00005236338,0.00045865212,0.000010555943,0.0003654567,0.000074429416],"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.00007352577,0.0004141786,0.00006146638,0.0000463094,0.00004346008,0.000041903408,0.00084971834,0.9917982,0.000050694838,0.00062335544,0.002069325,0.003927835],"study_design_scores_gemma":[0.0013833886,0.00024427913,0.0001973569,0.00019739298,0.000016843154,0.00010159843,0.0004921084,0.9918982,0.00021669648,0.00015685442,0.0045524174,0.0005428636],"about_ca_topic_score_codex":0.00008889841,"about_ca_topic_score_gemma":0.000016357448,"teacher_disagreement_score":0.9796268,"about_ca_system_score_codex":0.00009235191,"about_ca_system_score_gemma":0.000045217104,"threshold_uncertainty_score":0.9998917},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08194342,0.000048040038,0.9168921,0.000047115464,0.000570693,0.00014215338,0.000065421795,0.000064901644,0.00022615609],"genre_scores_gemma":[0.99956286,0.000015488831,0.00022470647,0.000030635987,0.0000290769,0.0000407702,0.000017282235,0.0000058936275,0.0000732702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984241,0.00026657587,0.0005047027,0.00037177844,0.00020982926,0.00022299902],"domain_scores_gemma":[0.99903524,0.00012238145,0.00012729253,0.0005069122,0.00008849158,0.000119665165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046351616,0.00015411871,0.00046457478,0.00039762282,0.00011155799,0.0001116081,0.00029521566,0.00011672663,0.000007428206],"category_scores_gemma":[0.0000032557798,0.00013532578,0.00013082118,0.0010342774,0.000038219176,0.00025736887,0.0000015558367,0.000128586,0.0000057332113],"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.000019455681,0.00014602237,0.00078643515,0.000020467261,0.00013043304,0.0000021965423,0.00023060926,0.9925844,0.00016631917,0.004709496,0.000045239496,0.001158925],"study_design_scores_gemma":[0.00041952782,0.0001735041,0.0030694332,0.000034467463,0.000067460496,0.000011279709,0.00019105451,0.9953744,0.00004309803,0.000041239357,0.00042181753,0.00015274066],"about_ca_topic_score_codex":0.0007939708,"about_ca_topic_score_gemma":0.00041848898,"teacher_disagreement_score":0.91761947,"about_ca_system_score_codex":0.00004059597,"about_ca_system_score_gemma":0.000016934766,"threshold_uncertainty_score":0.5518425},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008919959,0.00045559378,0.99629986,0.0007188108,0.0007456203,0.00050527183,0.000040572646,0.00016510725,0.00017716257],"genre_scores_gemma":[0.9970212,0.0007899948,0.0012622616,0.00020249744,0.000058883696,0.00017740733,0.000044013,0.000011062507,0.0004327015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860483,0.00035655277,0.0002719377,0.0003867905,0.00013470494,0.0002452082],"domain_scores_gemma":[0.9986296,0.00038543486,0.0000910779,0.00054442935,0.00021525155,0.00013418529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048843253,0.00019036133,0.00025674552,0.00006578997,0.0007042608,0.00023727804,0.0003062475,0.00010954092,0.0000037498105],"category_scores_gemma":[0.0000144137475,0.00016585851,0.00007514948,0.00028750146,0.000046301204,0.0002669429,0.000006544033,0.00019999623,0.000010127011],"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.000036209396,0.00008064541,0.0000060800785,0.000012791641,0.000026776388,7.013283e-7,0.00009849851,0.96317875,0.00018360918,0.014601119,0.0018757876,0.01989901],"study_design_scores_gemma":[0.00092238764,0.00022911945,0.00011548486,0.00007163774,0.000011905688,0.000014675094,0.00002693028,0.9780272,0.000045725286,0.00006088915,0.020261774,0.00021222008],"about_ca_topic_score_codex":0.0000093014605,"about_ca_topic_score_gemma":0.000018325929,"teacher_disagreement_score":0.99612916,"about_ca_system_score_codex":0.000046132798,"about_ca_system_score_gemma":0.000023059622,"threshold_uncertainty_score":0.67635137},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002341144,0.00025004422,0.99185956,0.001441,0.0006279355,0.00051347713,0.0028754848,0.00005656226,0.000034819717],"genre_scores_gemma":[0.9987816,0.00009257195,0.00029785442,0.00036645582,0.0002038468,0.00009869332,0.00015026817,0.0000059505433,0.000002714893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986245,0.00018652275,0.00026861925,0.0004615791,0.00016450463,0.00029426426],"domain_scores_gemma":[0.9986003,0.00030914144,0.00007998729,0.0008771214,0.00003587438,0.00009756406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007316149,0.00016617101,0.00024327767,0.0001242732,0.0003503543,0.0006369625,0.000993354,0.00008846918,5.3414027e-7],"category_scores_gemma":[0.00001563682,0.00012185285,0.000042168555,0.0004331083,0.00006209921,0.0005552353,0.000013115363,0.00017462317,0.0000016659716],"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.0015366679,0.0021825416,0.002898353,0.0018966334,0.00071232964,0.000039383252,0.006266911,0.45123047,0.00045114983,0.41818684,0.03812195,0.076476745],"study_design_scores_gemma":[0.0037880782,0.00016812922,0.0007869602,0.00008520192,0.0000541833,0.00005835095,0.00036725216,0.8984629,0.000014432548,0.003995669,0.091825806,0.0003930355],"about_ca_topic_score_codex":0.000803212,"about_ca_topic_score_gemma":0.00023628793,"teacher_disagreement_score":0.99644053,"about_ca_system_score_codex":0.000013024517,"about_ca_system_score_gemma":0.000037393922,"threshold_uncertainty_score":0.6142244},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018230908,0.0022511375,0.9737942,0.00010623849,0.0015403213,0.0025582772,0.001147693,0.00029420436,0.000076993616],"genre_scores_gemma":[0.99726164,0.00020518583,0.00095265696,0.000017719007,0.00013925557,0.001106372,0.00019354596,0.000033855526,0.00008975519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99641657,0.0006459217,0.0010250125,0.0007271453,0.00033498817,0.0008503351],"domain_scores_gemma":[0.9978331,0.00056719955,0.00035376576,0.0006201166,0.00019444877,0.0004313936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013751531,0.00047321952,0.00083255663,0.00024165913,0.00034829977,0.00039353085,0.0003213056,0.0003000704,0.0000040948357],"category_scores_gemma":[0.000029609058,0.0004358297,0.00011515706,0.000520846,0.000077135344,0.0010816198,0.0000061246683,0.00020589333,0.000028474664],"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.0004324302,0.0014093859,0.0016282739,0.0017776954,0.00065707054,0.000037139016,0.0017739552,0.9562772,0.015250894,0.016974047,0.001074689,0.0027072472],"study_design_scores_gemma":[0.003975242,0.0002890271,0.0022740792,0.00038471931,0.00010811719,0.00016297736,0.0005396887,0.99123216,0.000117473035,0.00007924152,0.00019952067,0.00063777104],"about_ca_topic_score_codex":0.0009384877,"about_ca_topic_score_gemma":0.00002400629,"teacher_disagreement_score":0.9790307,"about_ca_system_score_codex":0.0003306269,"about_ca_system_score_gemma":0.00010449729,"threshold_uncertainty_score":0.9998093},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007410736,0.00015429349,0.9886294,0.0005381978,0.0011411288,0.0009438246,0.000053845557,0.00081358704,0.0003149981],"genre_scores_gemma":[0.97768945,0.00002345788,0.021340227,0.00007467417,0.00010209481,0.00047809505,0.000015467895,0.000032960823,0.00024358994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973569,0.00033091014,0.0005450537,0.00071649265,0.00039045236,0.0006601913],"domain_scores_gemma":[0.99728143,0.0014211003,0.00018102437,0.000759211,0.00017335564,0.00018387758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001386842,0.00035882773,0.00044086872,0.0001814119,0.0012662931,0.0005426016,0.0008515411,0.00018144159,0.0000024177873],"category_scores_gemma":[0.00004636856,0.0002809617,0.00019596792,0.0004898427,0.00010367179,0.00036256955,0.000013649528,0.00048360886,0.00000994701],"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.000088839726,0.00016088877,0.00034205476,0.00009767343,0.00010813731,0.0000048939487,0.0019471127,0.9631449,0.00070295937,0.002908443,0.0008204392,0.029673664],"study_design_scores_gemma":[0.00060415344,0.0003143455,0.0001405957,0.00017748502,0.00004321924,0.0001119239,0.00094773516,0.99494594,0.0012081243,0.00019118706,0.00089681894,0.0004184646],"about_ca_topic_score_codex":0.00035031783,"about_ca_topic_score_gemma":0.0001840892,"teacher_disagreement_score":0.9702787,"about_ca_system_score_codex":0.0001143848,"about_ca_system_score_gemma":0.00006095083,"threshold_uncertainty_score":0.99996424},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004282939,0.000059139333,0.992535,0.00030075683,0.001272574,0.00035116586,0.000085388856,0.00095028407,0.00016278634],"genre_scores_gemma":[0.928921,0.000023692612,0.07043195,0.00005258453,0.000059407117,0.000114992334,0.000020106814,0.000013210191,0.00036308775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984145,0.00008221654,0.00037169116,0.0004938041,0.0002750698,0.00036272794],"domain_scores_gemma":[0.99888426,0.00010288057,0.00012304129,0.00054535375,0.00013785255,0.00020659782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029196494,0.00024295438,0.00027180507,0.00014513318,0.0004422016,0.00038631103,0.00047531683,0.00019392767,0.000008199556],"category_scores_gemma":[0.000008440235,0.00021807752,0.00008137873,0.00041297165,0.00007661355,0.00029917847,0.0000063864472,0.00043161566,0.000028724893],"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.00007463966,0.0009395067,0.00019088431,0.00015352665,0.00018607141,0.000055967826,0.0005672851,0.8595603,0.0021741001,0.05074704,0.0057052043,0.079645485],"study_design_scores_gemma":[0.0016587222,0.00036429614,0.0008098809,0.000111601476,0.000041406973,0.00027684876,0.00010174996,0.97643024,0.0014639178,0.00091319665,0.016816663,0.0010114824],"about_ca_topic_score_codex":0.00021950903,"about_ca_topic_score_gemma":0.00003247657,"teacher_disagreement_score":0.92463803,"about_ca_system_score_codex":0.000027182798,"about_ca_system_score_gemma":0.000054528544,"threshold_uncertainty_score":0.8892943},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04064708,0.00007033385,0.9576199,0.0002669632,0.0004923494,0.00022124615,0.00005445016,0.00016042222,0.00046723342],"genre_scores_gemma":[0.99836403,0.000004583324,0.0009325622,0.000059196835,0.00003401144,0.000018914925,0.000006990831,0.000009340706,0.00057033915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984878,0.00015124686,0.00037398443,0.0003911506,0.00030456085,0.00029127643],"domain_scores_gemma":[0.9991262,0.000118201766,0.00013512737,0.00043801017,0.000051640673,0.00013079903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000398223,0.00018314943,0.00028615538,0.00011657008,0.00031618186,0.00011373383,0.0003535479,0.00007642081,0.0000026439427],"category_scores_gemma":[0.0000036357098,0.00015256835,0.00009770998,0.0002724165,0.00004937485,0.000029317687,0.000013826314,0.0001654111,0.000011369002],"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.000022822549,0.00018960644,0.000044033128,0.00006530657,0.000043841308,0.0000020170132,0.0005020091,0.98524415,0.0000673969,0.0015427726,0.00018410572,0.01209192],"study_design_scores_gemma":[0.0009138044,0.00026578997,0.00018369626,0.00009564152,0.000018268945,0.00001602278,0.00043051355,0.99597996,0.000048480495,0.00003432314,0.0018362853,0.00017720947],"about_ca_topic_score_codex":0.000108771324,"about_ca_topic_score_gemma":0.000020624862,"teacher_disagreement_score":0.957717,"about_ca_system_score_codex":0.000029891049,"about_ca_system_score_gemma":0.000014837626,"threshold_uncertainty_score":0.62215567},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029509158,0.00010653246,0.9943958,0.00005802121,0.0013818227,0.0005592943,0.00011497786,0.0004013685,0.000031270865],"genre_scores_gemma":[0.8466895,0.000034534183,0.15281332,0.000068106034,0.000035816687,0.00019427427,0.00009348155,0.000026207967,0.000044727207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772674,0.0004736381,0.00045185204,0.0006759896,0.00018352682,0.00048823497],"domain_scores_gemma":[0.99837,0.00038808602,0.00018529658,0.00064737455,0.00017766107,0.00023156148],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004477316,0.00029949198,0.00040145218,0.00016005653,0.00038168376,0.00013570774,0.00044589865,0.0002993325,0.000006071793],"category_scores_gemma":[0.000004599108,0.00028406866,0.000119543816,0.00040594704,0.00009483621,0.00025981886,0.000002323689,0.00020496988,0.0000026350563],"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.0001357202,0.00024107182,0.000011158871,0.00002694253,0.000041924814,0.000006588606,0.000102408325,0.9963056,0.00010431174,0.0011845382,0.000026846305,0.001812924],"study_design_scores_gemma":[0.00097568193,0.0003513537,0.000040409403,0.000037889484,0.000040263105,0.000026849342,0.0000909792,0.9978818,0.00015907014,0.00002069331,0.000049216836,0.00032573994],"about_ca_topic_score_codex":0.000114532304,"about_ca_topic_score_gemma":0.00003915551,"teacher_disagreement_score":0.8437386,"about_ca_system_score_codex":0.00006802291,"about_ca_system_score_gemma":0.000043563832,"threshold_uncertainty_score":0.99996114},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4618315,0.000065291635,0.5354454,0.00087323645,0.00041981996,0.00034340544,0.0000059584268,0.00010227558,0.00091309875],"genre_scores_gemma":[0.9992209,0.000007828627,0.00012040651,0.00022996205,0.000027489696,0.000114756825,0.0000012741168,0.000007830726,0.00026952138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985553,0.00012705752,0.00034330276,0.0003605365,0.00027374277,0.000340069],"domain_scores_gemma":[0.9991531,0.00019064819,0.00008168694,0.0004569971,0.000027861608,0.00008970128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028894417,0.00019460618,0.00019577834,0.00008700699,0.00037146412,0.00028022446,0.00043617192,0.00007248699,0.0000065318077],"category_scores_gemma":[0.0000032891367,0.0001302329,0.00006408737,0.0003998665,0.000049772538,0.000041923766,0.000005344234,0.00032575175,0.000070972055],"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.0000112856,0.00013667486,0.000059465667,0.000028830138,0.00002413164,0.0000052307573,0.00046636842,0.9907966,0.000035357538,0.0024380623,0.00062970986,0.0053682737],"study_design_scores_gemma":[0.0006224945,0.00024254415,0.0031842808,0.00013678889,0.00000622109,0.000026252657,0.0003631559,0.99436116,0.00004046342,0.00017372434,0.00061928615,0.00022364753],"about_ca_topic_score_codex":0.00026636242,"about_ca_topic_score_gemma":0.000010021793,"teacher_disagreement_score":0.53738946,"about_ca_system_score_codex":0.000053002797,"about_ca_system_score_gemma":0.000017389375,"threshold_uncertainty_score":0.53107435},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002785542,0.000007963069,0.98474675,0.0006439849,0.0004396125,0.010787899,0.00022572516,0.00028561702,0.000076887976],"genre_scores_gemma":[0.9883429,4.897347e-7,0.0047420696,0.000039528557,0.00005426591,0.006726832,0.00006329754,0.0000109619705,0.000019679657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977365,0.0003920919,0.0005555031,0.00059938733,0.00033626313,0.00038026678],"domain_scores_gemma":[0.9983298,0.00028402815,0.00016115332,0.000942142,0.000099391924,0.00018343866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074088946,0.00022451785,0.00029056484,0.00018122619,0.00040896598,0.00037931884,0.0007736948,0.00014515546,0.000008207298],"category_scores_gemma":[0.000057697685,0.0002283579,0.00007416134,0.0006452912,0.00005422597,0.00041233216,0.000020172145,0.00031911107,0.000027799992],"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.00015348833,0.0017350557,0.0013119627,0.00083477626,0.00006793292,0.0000149915095,0.0017378925,0.9573677,0.0009507585,0.028853428,0.0030400844,0.003931921],"study_design_scores_gemma":[0.001331743,0.00007846337,0.0028564304,0.00017267065,0.0000090114,0.000010050995,0.000046795005,0.9920808,0.00004674811,0.0004589153,0.0026595485,0.00024883333],"about_ca_topic_score_codex":0.00041562488,"about_ca_topic_score_gemma":0.000087974986,"teacher_disagreement_score":0.9855573,"about_ca_system_score_codex":0.00012762175,"about_ca_system_score_gemma":0.00007090899,"threshold_uncertainty_score":0.9312165},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027169867,0.00009801149,0.9950065,0.0007845696,0.0003542512,0.00055730797,0.0001998645,0.00018433113,0.00009818494],"genre_scores_gemma":[0.99156123,0.000009377864,0.007505542,0.00021290226,0.00004836429,0.00025378738,0.00013874432,0.000013552869,0.00025647625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857837,0.00006182227,0.00028586498,0.00051886775,0.00025731613,0.00029776874],"domain_scores_gemma":[0.99882114,0.0000785385,0.000112184614,0.0006850224,0.00019007016,0.0001130302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017040576,0.00020053584,0.00021634722,0.00006252914,0.00033098512,0.000367871,0.00056475383,0.0000671462,0.0000048171974],"category_scores_gemma":[0.0000014633151,0.00015283833,0.000034789664,0.00028345516,0.000023899469,0.00011218218,0.000014746703,0.00008222171,0.0000077612685],"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.000029702318,0.00011001368,0.000045604516,0.000061370716,0.0000681713,0.0000031447094,0.0000830668,0.99487966,0.000005933688,0.00017238874,0.0015864645,0.002954503],"study_design_scores_gemma":[0.0011423932,0.00009838341,0.000028408926,0.00010866817,0.000022564576,0.000042675565,0.00013726404,0.9921038,0.0000083303785,0.000008586323,0.0060895556,0.0002093755],"about_ca_topic_score_codex":0.0018050228,"about_ca_topic_score_gemma":0.00016146313,"teacher_disagreement_score":0.9888443,"about_ca_system_score_codex":0.00006161063,"about_ca_system_score_gemma":0.00004360829,"threshold_uncertainty_score":0.6232566},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1461964,0.00007447969,0.851829,0.0003538258,0.00040913062,0.00027063824,0.0006309401,0.00007501872,0.00016057088],"genre_scores_gemma":[0.9976916,0.000029629173,0.0009140582,0.00008500678,0.000061359526,0.000113378934,0.000054493554,0.000010594009,0.0010399192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977371,0.0003386958,0.0007046722,0.00052090007,0.00044400015,0.00025462217],"domain_scores_gemma":[0.99856985,0.0004766736,0.0001838212,0.00046735132,0.00014059657,0.00016170382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010362384,0.00018975342,0.00032859866,0.00018756812,0.00033889952,0.00015988342,0.0002725645,0.00014428693,0.00008388341],"category_scores_gemma":[0.00004368363,0.0001564231,0.00009503436,0.0007103167,0.00013062374,0.00024906898,0.0000023554016,0.00023071372,0.00018616447],"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.0001497979,0.0005050036,0.00022496453,0.00000973704,0.000014788726,0.000002409873,0.00017520906,0.9891186,0.00046954872,0.004395615,0.00045400334,0.004480325],"study_design_scores_gemma":[0.003967202,0.00028097423,0.010027487,0.0001195464,0.000041043502,0.00008747017,0.00432353,0.95288074,0.00035435223,0.0036636994,0.023560682,0.0006932638],"about_ca_topic_score_codex":0.00005706896,"about_ca_topic_score_gemma":0.00008875961,"teacher_disagreement_score":0.85149515,"about_ca_system_score_codex":0.000054346234,"about_ca_system_score_gemma":0.000024234183,"threshold_uncertainty_score":0.6378749},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004196475,0.00013541982,0.9932819,0.0002571398,0.00035373544,0.0015674923,0.000112800124,0.000054003485,0.000041045016],"genre_scores_gemma":[0.99842757,0.000010785548,0.0008703311,0.00016489081,0.000033728767,0.0003725429,0.000011092683,0.000008760265,0.00010030346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984181,0.00023407211,0.0004844636,0.00034431883,0.00019704674,0.0003219827],"domain_scores_gemma":[0.99822325,0.0011852968,0.00014348242,0.0002638963,0.00009397366,0.00009010797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013148999,0.0002131839,0.00034869806,0.00014629013,0.00011160839,0.00007828846,0.00034573683,0.000107881366,0.0000029596583],"category_scores_gemma":[0.0000059663093,0.00015294507,0.000110330744,0.00031827463,0.00006369889,0.000109502806,8.592537e-7,0.00018359275,0.0000050831586],"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.002003224,0.000664625,0.000002253641,0.000017622866,0.00004479887,0.000011440298,0.00018143152,0.96520835,0.000037554928,0.0017209977,0.00033558757,0.02977214],"study_design_scores_gemma":[0.007364235,0.0013713924,0.000026416412,0.00009185566,0.000036283294,0.000008260243,0.0002176634,0.9902614,0.000044862587,0.000032655775,0.0003842351,0.00016078212],"about_ca_topic_score_codex":0.000029840236,"about_ca_topic_score_gemma":0.000028003544,"teacher_disagreement_score":0.9942311,"about_ca_system_score_codex":0.000045248835,"about_ca_system_score_gemma":0.000056767123,"threshold_uncertainty_score":0.62369186},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009582393,0.0006245308,0.98712623,0.00018670651,0.00072930416,0.0005070484,0.00011852082,0.00006094007,0.001064352],"genre_scores_gemma":[0.9992196,0.00036925758,0.00006756661,0.000042781292,0.000013740573,0.0001307008,0.000013443913,0.000006677288,0.0001362284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825287,0.00049164717,0.00049504684,0.00027792293,0.00021375727,0.00026877332],"domain_scores_gemma":[0.9985986,0.0004058017,0.00017144872,0.00061414216,0.00012671048,0.00008333169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007398574,0.00018164146,0.00028765405,0.00005797299,0.00029231745,0.000115170486,0.00047169338,0.00008591382,0.000023582323],"category_scores_gemma":[0.00001531458,0.00013075628,0.00007282638,0.00049263367,0.000079193574,0.00015473517,0.000009335688,0.00025492464,0.000008171499],"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.0004778038,0.0009578384,0.00084575237,0.00011148062,0.00023465158,0.000020368858,0.0022422022,0.3562212,0.0003061747,0.6245451,0.011975134,0.002062295],"study_design_scores_gemma":[0.002121296,0.0006460434,0.010545039,0.0013458757,0.00003845157,0.000053937405,0.0015467529,0.97888255,0.00021548715,0.0004859602,0.0034213464,0.00069725205],"about_ca_topic_score_codex":0.000108963206,"about_ca_topic_score_gemma":0.000028569077,"teacher_disagreement_score":0.9896372,"about_ca_system_score_codex":0.00008024031,"about_ca_system_score_gemma":0.000029521523,"threshold_uncertainty_score":0.5332086},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003902758,0.00005232568,0.9928367,0.00046676875,0.0005036906,0.0004105943,0.00077307515,0.0008985001,0.00015558985],"genre_scores_gemma":[0.9766937,0.000018538125,0.02285448,0.00007787185,0.00005702092,0.0001184475,0.0001152599,0.000016235861,0.000048475402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978017,0.00009918395,0.00043414853,0.00086129946,0.00035653842,0.00044710192],"domain_scores_gemma":[0.9978173,0.00023970012,0.00012756801,0.0015345538,0.000085748616,0.00019516585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041873986,0.00026920938,0.00034311457,0.00017368165,0.00040450913,0.00028526175,0.0015636941,0.000086053486,0.0000014359639],"category_scores_gemma":[0.00009504206,0.00024665505,0.000036005116,0.0005033235,0.00006719842,0.0008949879,0.000036953854,0.00028573774,0.00003815592],"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.000115869516,0.00024725086,0.000052562227,0.0002256676,0.00008046269,0.000026627838,0.0006896628,0.93550175,0.0054432726,0.0070275734,0.0013753503,0.04921392],"study_design_scores_gemma":[0.0010136442,0.00024413575,0.00007730736,0.00023908545,0.000028778752,0.00010374083,0.000678234,0.9892138,0.0017138211,0.001316346,0.0046719317,0.00069913635],"about_ca_topic_score_codex":0.000057117246,"about_ca_topic_score_gemma":0.000020941538,"teacher_disagreement_score":0.9727909,"about_ca_system_score_codex":0.000046667177,"about_ca_system_score_gemma":0.000040193863,"threshold_uncertainty_score":0.99999857},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035026025,0.00013145492,0.96152234,0.00034655363,0.0007413213,0.0007957551,0.00064924953,0.00036064562,0.00042662624],"genre_scores_gemma":[0.9928871,0.000016447668,0.0061831134,0.00031904088,0.00009674114,0.00026741746,0.00020180804,0.000015900558,0.000012430912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778056,0.00020941222,0.0004697903,0.0005378295,0.0004088461,0.000593558],"domain_scores_gemma":[0.9986369,0.00011982908,0.00013753222,0.00046042263,0.00012871681,0.00051658944],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028146093,0.0003477469,0.0003548396,0.00018264187,0.00048077595,0.0002784146,0.0003321806,0.00016752572,0.000004077536],"category_scores_gemma":[0.0000011598422,0.00030799222,0.00009755841,0.00075609103,0.000049805953,0.0006339853,0.000010048306,0.00029201023,0.00006433892],"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.00028060336,0.0015408449,0.0012096408,0.00038055834,0.00036763184,0.000008016819,0.004672982,0.92273796,0.0048133433,0.04854258,0.0006780899,0.014767736],"study_design_scores_gemma":[0.011778614,0.0030393535,0.04917506,0.0013199244,0.00074863504,0.0029446005,0.013818056,0.8773994,0.005778885,0.001077464,0.026616037,0.00630396],"about_ca_topic_score_codex":0.00053273863,"about_ca_topic_score_gemma":0.000054154174,"teacher_disagreement_score":0.95786107,"about_ca_system_score_codex":0.00011070122,"about_ca_system_score_gemma":0.000042438238,"threshold_uncertainty_score":0.99993724},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048971906,0.0005222058,0.9495134,0.00017523498,0.0003227504,0.0004315202,0.000010582024,0.000020250127,0.000032146996],"genre_scores_gemma":[0.9988562,0.0003426573,0.0005965715,0.000020809692,0.000011291987,0.0001518338,0.0000061436826,0.0000019907084,0.00001249322],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927187,0.000082215374,0.00037670202,0.00008678871,0.000072342555,0.000110052424],"domain_scores_gemma":[0.9994266,0.00007396024,0.00011951796,0.00020708225,0.00014385661,0.00002897216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015930885,0.0000725219,0.00017755922,0.00009118116,0.000077015065,0.000034196968,0.00017723469,0.00005342848,0.0000019640595],"category_scores_gemma":[0.0000046099126,0.00006025932,0.000032961663,0.00020476646,0.00004155572,0.0003655232,0.0000038872645,0.00006487504,0.0000016177769],"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.00013248278,0.0002728777,0.0002047161,0.00040427904,0.000058430032,2.1264682e-7,0.004846917,0.90473247,0.008702304,0.012517997,0.00071886485,0.06740847],"study_design_scores_gemma":[0.0008651027,0.00016080991,0.00032812328,0.00024845387,0.0000055250284,0.0000042940874,0.0006151539,0.9949071,0.0017326087,0.00015602451,0.00085192744,0.00012492275],"about_ca_topic_score_codex":0.000118977165,"about_ca_topic_score_gemma":0.000027529897,"teacher_disagreement_score":0.9498843,"about_ca_system_score_codex":0.000019475892,"about_ca_system_score_gemma":0.000023719831,"threshold_uncertainty_score":0.24573037},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022633018,0.00026450455,0.97513974,0.00017120155,0.00092323485,0.00017570576,0.00010293195,0.00022620235,0.00036347267],"genre_scores_gemma":[0.9985685,0.00014417645,0.00027856237,0.000065294036,0.00003944901,0.000041027582,0.000024052288,0.000006987122,0.00083199586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989064,0.00011771575,0.00025856408,0.00034105428,0.00018452847,0.00019174343],"domain_scores_gemma":[0.99939793,0.00008268488,0.00006292087,0.00024353164,0.000094580944,0.00011834376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012873227,0.00015114936,0.00019447634,0.0000858114,0.00060410413,0.00012241623,0.0001754545,0.00008714252,0.000005658065],"category_scores_gemma":[0.000004332512,0.00013745313,0.00006263398,0.00026226896,0.00004593498,0.00036753152,0.0000021098163,0.00022020562,0.00003232376],"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.000109955174,0.00034554556,0.00016897384,0.00006143768,0.00016643011,0.00012803584,0.0014869289,0.97371256,0.003045256,0.009189105,0.0028520373,0.008733725],"study_design_scores_gemma":[0.0014252684,0.00028269333,0.0005627405,0.00009722465,0.000024554845,0.00046562118,0.0003267822,0.9936681,0.00035961525,0.00008186025,0.0022202006,0.00048536895],"about_ca_topic_score_codex":0.00014161921,"about_ca_topic_score_gemma":0.0000074620702,"teacher_disagreement_score":0.97593546,"about_ca_system_score_codex":0.000042036307,"about_ca_system_score_gemma":0.00006562296,"threshold_uncertainty_score":0.5605176},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027376836,0.002780401,0.9591677,0.00011135007,0.0030205178,0.0008287768,0.006423461,0.0002733064,0.000017655588],"genre_scores_gemma":[0.99709237,0.000090169284,0.0018885466,0.000021501206,0.00020251091,0.000071284194,0.00054432946,0.00002048995,0.00006881647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770683,0.00018825453,0.00051563006,0.0006755187,0.00028345143,0.0006303156],"domain_scores_gemma":[0.99786913,0.00047394345,0.00018227017,0.0010633646,0.00007927757,0.0003320136],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009166266,0.0002918079,0.0004317125,0.00015894893,0.0008110162,0.0005106522,0.0007135068,0.00017075069,0.000001228743],"category_scores_gemma":[0.000027854556,0.0002861063,0.000058961028,0.00038021582,0.00009160873,0.0009079625,0.000036313282,0.00026764843,0.000012069264],"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.00041823759,0.0029637606,0.0018594897,0.0033247601,0.0017035023,0.000054598604,0.012033584,0.9043247,0.0015429078,0.03271599,0.02022355,0.018834898],"study_design_scores_gemma":[0.00088656816,0.000078643956,0.0002453121,0.00011121035,0.000068474874,0.00019539557,0.00083926064,0.9870224,0.000006490952,0.000015820737,0.010178112,0.0003523244],"about_ca_topic_score_codex":0.00021797574,"about_ca_topic_score_gemma":0.000038170096,"teacher_disagreement_score":0.96971554,"about_ca_system_score_codex":0.00011803797,"about_ca_system_score_gemma":0.000057940608,"threshold_uncertainty_score":0.9999591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027663177,0.0007798224,0.99353576,0.000056576562,0.0013426183,0.00056381954,0.000250565,0.00028732576,0.00041719005],"genre_scores_gemma":[0.9980337,0.00025202296,0.0011683551,0.000076470606,0.00007752333,0.0001404394,0.00016270869,0.000023430204,0.00006534212],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727696,0.00020990024,0.00079982914,0.00071898196,0.00032205918,0.00067228853],"domain_scores_gemma":[0.9985594,0.00013020234,0.00020330085,0.000635645,0.0001301213,0.00034128927],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034119166,0.00040511068,0.0005263621,0.00017089554,0.00033450162,0.00021263298,0.00048069458,0.0003327406,0.000031374006],"category_scores_gemma":[0.0000020456926,0.0003774464,0.000114488845,0.000761147,0.00010571285,0.0004508133,0.000009434296,0.00043370505,0.000031038355],"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.00017043043,0.0006159179,0.00062886364,0.000059201968,0.00010068357,0.00028602176,0.0004819018,0.9726516,0.000005123971,0.0031281048,0.0007474124,0.021124741],"study_design_scores_gemma":[0.0012099975,0.00022395089,0.00058321905,0.00013674588,0.000035293346,0.00018682067,0.00013387534,0.9964556,0.0000060762313,0.00016850501,0.00041121047,0.000448698],"about_ca_topic_score_codex":0.0004645068,"about_ca_topic_score_gemma":0.000089752546,"teacher_disagreement_score":0.9952674,"about_ca_system_score_codex":0.00016582034,"about_ca_system_score_gemma":0.00011568276,"threshold_uncertainty_score":0.99986774},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23619612,0.00038422554,0.76177543,0.00008420574,0.0005545875,0.000266007,0.00036265262,0.00012597679,0.00025076626],"genre_scores_gemma":[0.9992072,0.00003953243,0.0003383196,0.000038792597,0.000023240053,0.00006291271,0.000019400495,0.0000113900005,0.00025922895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981201,0.00010787293,0.0005462862,0.00044770216,0.00041449143,0.0003635155],"domain_scores_gemma":[0.9987632,0.00011313633,0.00019904305,0.0006256094,0.00011722755,0.00018175412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017318729,0.000272716,0.0004184424,0.00013012232,0.0002518179,0.000114839124,0.00046524423,0.00013128232,0.00002435105],"category_scores_gemma":[0.000003581859,0.00022552942,0.00014022384,0.00041569007,0.00010343909,0.0001695194,0.0000033271037,0.00020514881,0.000035185923],"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.00005756516,0.00045743334,0.001384544,0.00028526303,0.0000684991,0.000009789692,0.00022943586,0.99242896,0.00024330748,0.00075124385,0.00095102,0.003132938],"study_design_scores_gemma":[0.0011851814,0.0003579703,0.0024469204,0.0001721696,0.000020932051,0.0000310983,0.000057703794,0.9929568,0.0005263215,0.000010136784,0.0019115622,0.00032321425],"about_ca_topic_score_codex":0.00009679439,"about_ca_topic_score_gemma":0.0000084651765,"teacher_disagreement_score":0.76301104,"about_ca_system_score_codex":0.000036750098,"about_ca_system_score_gemma":0.000023484365,"threshold_uncertainty_score":0.9196823},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010654125,0.004025153,0.9841984,0.00028907313,0.00011109025,0.00055687217,0.000025774663,0.00010186239,0.000037664362],"genre_scores_gemma":[0.9933805,0.0008748869,0.005326057,0.000058670517,0.000030235931,0.00023649364,0.000031597567,0.000010893955,0.00005068519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990022,0.00010680562,0.00024873792,0.00022512283,0.0001247949,0.00029231893],"domain_scores_gemma":[0.99900776,0.00016574071,0.000117180905,0.0004175116,0.00012844366,0.00016339014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003656977,0.00017368543,0.00020253743,0.000045789497,0.0006512127,0.00022008685,0.00023735792,0.00008158639,0.000001037356],"category_scores_gemma":[0.000002160906,0.00014106212,0.00003053957,0.00022789884,0.00006865916,0.00046471076,0.000008637445,0.00018263969,8.229545e-7],"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.0012085872,0.0030104013,0.004522586,0.0012441344,0.0006465503,0.0000049836644,0.014145326,0.4890595,0.0017584976,0.04400319,0.0020961105,0.43830013],"study_design_scores_gemma":[0.0012268329,0.00009824087,0.00073004776,0.0003102796,0.000020675014,0.00002830736,0.0003564857,0.9952837,0.00007100474,0.000011144649,0.0016038988,0.00025935957],"about_ca_topic_score_codex":0.000013534609,"about_ca_topic_score_gemma":0.00004889901,"teacher_disagreement_score":0.98272634,"about_ca_system_score_codex":0.000051427396,"about_ca_system_score_gemma":0.000025784759,"threshold_uncertainty_score":0.57523465},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021837514,0.0010654645,0.9753134,0.00043573885,0.0005887921,0.00026366714,0.000014394475,0.00018678088,0.000294242],"genre_scores_gemma":[0.995785,0.0002555324,0.0035558783,0.00008306699,0.000060558854,0.000054940592,0.000011394898,0.0000114992645,0.00018212524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982946,0.00034395364,0.00044275436,0.00035918647,0.00021519959,0.00034429823],"domain_scores_gemma":[0.99886596,0.00017715683,0.00010214078,0.0004931437,0.0001372932,0.00022428558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006286671,0.00020069562,0.00031790324,0.00009357465,0.0003134283,0.00028020854,0.00046575797,0.0001018746,0.0000044682847],"category_scores_gemma":[0.000017398206,0.00018886547,0.000048022022,0.0007941142,0.000043984543,0.00029626125,0.000014197887,0.0003321989,0.000027093369],"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.000048141632,0.00009207352,0.00020643846,0.000008646971,0.000022926508,0.000009741452,0.000722754,0.99475485,0.00012616385,0.0010831123,0.00096986897,0.001955287],"study_design_scores_gemma":[0.0022680652,0.00012467563,0.0004813415,0.00017599048,0.000013206253,0.000060587954,0.00038651054,0.9925384,0.000036590856,0.00003131382,0.0035237975,0.00035951566],"about_ca_topic_score_codex":0.000037425536,"about_ca_topic_score_gemma":0.00006315841,"teacher_disagreement_score":0.97394747,"about_ca_system_score_codex":0.00009939304,"about_ca_system_score_gemma":0.00009622614,"threshold_uncertainty_score":0.77017105},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006133603,0.0002731955,0.9954066,0.00012713316,0.0017800984,0.0007821617,0.00032232053,0.00047539148,0.0002197253],"genre_scores_gemma":[0.97427666,0.00012026261,0.024740366,0.00008095393,0.00009762682,0.0002970402,0.00022468112,0.0000318914,0.00013049952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976233,0.00015793514,0.00058940455,0.00073570746,0.00027857762,0.0006150718],"domain_scores_gemma":[0.9983848,0.0002432391,0.0002237434,0.0006884349,0.00020979787,0.00025004067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026520298,0.0003787736,0.00042684114,0.00011712186,0.0005226704,0.00024080575,0.0005556388,0.0003005413,0.000009017843],"category_scores_gemma":[0.000007683288,0.0003527258,0.00017030913,0.000577145,0.000100823476,0.00043013904,0.000008673549,0.00024562792,0.000007549129],"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.00011057438,0.00023354296,0.000018077584,0.000032100346,0.00007505463,0.0000059124704,0.00012867906,0.9944586,0.0000056335234,0.0025872434,0.000925136,0.0014194391],"study_design_scores_gemma":[0.0013593925,0.00023139245,0.000068360205,0.00007344709,0.000048884493,0.00004021953,0.00007940501,0.9969231,0.00005231755,0.00005854572,0.0006612121,0.0004037485],"about_ca_topic_score_codex":0.00012139731,"about_ca_topic_score_gemma":0.00004139143,"teacher_disagreement_score":0.97366333,"about_ca_system_score_codex":0.00009238851,"about_ca_system_score_gemma":0.000036920304,"threshold_uncertainty_score":0.9998925},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009255166,0.0004931014,0.9856978,0.0014524757,0.00092773983,0.010197947,0.00009041677,0.00012336115,0.000091627204],"genre_scores_gemma":[0.9699263,0.00014513025,0.0024677452,0.00014413022,0.0010398742,0.025518702,0.000057667603,0.000018274279,0.0006821808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985465,0.0002230194,0.00038008543,0.00039381234,0.00014982044,0.0003067719],"domain_scores_gemma":[0.9989097,0.00020052533,0.00012321745,0.00059843145,0.00006828459,0.00009985036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003668149,0.00018838832,0.00025557668,0.000047359797,0.0008604096,0.00023757498,0.00035509825,0.0001561989,0.0000047491653],"category_scores_gemma":[0.000003709597,0.00014798206,0.00006187447,0.0003025846,0.00008444092,0.00018856776,0.000011721715,0.00019665781,0.0000028916795],"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.00026258192,0.00015741591,0.000012414174,0.00003187927,0.00003358849,8.8680173e-7,0.00018040887,0.9581372,0.000020802234,0.0047834404,0.028374597,0.008004788],"study_design_scores_gemma":[0.0014427619,0.0005156613,0.00014918022,0.000085538326,0.000024968667,0.00004880109,0.000077126126,0.51664746,0.0000260361,0.0002920447,0.48045385,0.00023659402],"about_ca_topic_score_codex":0.00011081377,"about_ca_topic_score_gemma":0.00062596897,"teacher_disagreement_score":0.98323005,"about_ca_system_score_codex":0.00006590334,"about_ca_system_score_gemma":0.000029530245,"threshold_uncertainty_score":0.6617662},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28247237,0.0007608341,0.7155779,0.00016362996,0.000052698117,0.000502757,0.00021387436,0.00018839283,0.00006756043],"genre_scores_gemma":[0.9849275,0.0006525884,0.013668175,0.0000067749133,0.000008373946,0.00050856837,0.00011631838,0.000037551396,0.00007418976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877805,0.00011312962,0.0004803822,0.00020032364,0.00018258566,0.00024551654],"domain_scores_gemma":[0.998502,0.00020719956,0.00007554718,0.00084224535,0.00020664337,0.00016633965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000085312466,0.00025307326,0.00035330243,0.00011685761,0.00032593534,0.00007741367,0.00035871263,0.00014452059,0.00004630629],"category_scores_gemma":[0.0000023122332,0.00021534659,0.00006790547,0.00038625687,0.00020603123,0.00026488482,0.0000032840103,0.00039590028,0.0000309326],"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.000037398007,0.00013701624,0.000009895813,0.00009205997,0.00013461505,6.119621e-7,0.00038391506,0.9896942,0.00845356,0.00017645933,0.000092358816,0.00078791677],"study_design_scores_gemma":[0.0008158378,0.00015275156,0.00008324763,0.00023300142,0.000055195855,0.00003237391,0.0011919241,0.9958909,0.0007417229,6.471871e-7,0.0005514859,0.0002508909],"about_ca_topic_score_codex":0.00022055085,"about_ca_topic_score_gemma":0.00003888016,"teacher_disagreement_score":0.7024551,"about_ca_system_score_codex":0.00006254551,"about_ca_system_score_gemma":0.000038145496,"threshold_uncertainty_score":0.8781579},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011945614,0.00019150515,0.9784547,0.00029658718,0.00025956266,0.002293925,0.006192543,0.000318117,0.00004745938],"genre_scores_gemma":[0.9976591,0.000009536137,0.001312103,0.00006396264,0.00008053634,0.0004030697,0.0003070492,0.000018979963,0.00014568376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965309,0.00026271868,0.001099336,0.0008217908,0.0008347386,0.00045052276],"domain_scores_gemma":[0.9970491,0.00089140085,0.00033234668,0.0006742373,0.00067242683,0.0003805071],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012060588,0.00033387306,0.000573566,0.00023093529,0.0008550183,0.0004444959,0.00035084863,0.0002816036,0.00002342407],"category_scores_gemma":[0.000031662246,0.00026474523,0.00022444065,0.00070986873,0.00005244691,0.00028118104,0.0000010209202,0.00019698011,0.000022087033],"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.0004024309,0.00052333885,0.000025624258,0.000009675464,0.000021579915,7.915935e-7,0.00012814646,0.99384403,0.00053997996,0.0017480485,0.00037080588,0.0023855567],"study_design_scores_gemma":[0.0023000233,0.0005244585,0.00055272784,0.000049859078,0.000054741427,0.0000062311988,0.0010058878,0.98576397,0.00008335095,0.00054804684,0.008792832,0.00031789087],"about_ca_topic_score_codex":0.000034608423,"about_ca_topic_score_gemma":0.0000037399163,"teacher_disagreement_score":0.9857135,"about_ca_system_score_codex":0.000104376,"about_ca_system_score_gemma":0.000052865096,"threshold_uncertainty_score":0.99998045},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035708666,0.00036942968,0.96184015,0.0001838791,0.0010248481,0.00028956478,0.000023786417,0.00018426351,0.00037538196],"genre_scores_gemma":[0.9993091,0.000059533388,0.00030656342,0.00007871146,0.0000378431,0.000043499826,0.0000033470762,0.000006242434,0.00015511716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984413,0.00013992448,0.0004400728,0.000423127,0.00020742844,0.00034819118],"domain_scores_gemma":[0.9992874,0.00008893214,0.00009125189,0.00034767197,0.00005841402,0.00012628178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032374196,0.00020047904,0.00029332194,0.00020034691,0.00024440757,0.0002376412,0.0002454195,0.0001302184,0.0000036485064],"category_scores_gemma":[0.0000026584737,0.00017750147,0.00009055904,0.0005414798,0.000021083888,0.0003291103,0.0000013712684,0.000250383,0.00001541724],"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.00012382035,0.00043447572,0.0002542376,0.0000632441,0.00007481454,0.00010369783,0.001195139,0.94469494,0.0007167162,0.021346275,0.000436833,0.030555816],"study_design_scores_gemma":[0.0017728969,0.0006340403,0.0016529623,0.0002962567,0.000014777709,0.00027484016,0.0007610437,0.98997164,0.00018172506,0.0030932645,0.00074529386,0.000601244],"about_ca_topic_score_codex":0.00017164549,"about_ca_topic_score_gemma":0.000100316895,"teacher_disagreement_score":0.96360046,"about_ca_system_score_codex":0.00006779006,"about_ca_system_score_gemma":0.00002190607,"threshold_uncertainty_score":0.72383},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015695995,0.000094868505,0.979812,0.0001082604,0.0002449522,0.0037579194,0.0001492132,0.00011958259,0.000017194181],"genre_scores_gemma":[0.9822869,0.000014043682,0.015358028,0.000015701826,0.000011227696,0.0021973415,0.000026644178,0.000012425772,0.00007770089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858654,0.00005809101,0.000500167,0.00041494315,0.0001806836,0.0002595747],"domain_scores_gemma":[0.99900925,0.0001890094,0.00018336198,0.00032050622,0.00013758648,0.00016025947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016330114,0.0001971795,0.00030862246,0.00009292034,0.0001514986,0.00013720473,0.00025947648,0.00009883103,0.000008732183],"category_scores_gemma":[0.0000053814333,0.00018152678,0.00007208709,0.00017264165,0.000128695,0.00046554426,0.000004404652,0.00012911514,0.000007684391],"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.0014625458,0.010217975,0.01239866,0.012067761,0.00261267,0.00004424521,0.03902148,0.23900938,0.19123289,0.31065518,0.0014482532,0.17982896],"study_design_scores_gemma":[0.0019130118,0.00023413524,0.0018321548,0.00025809807,0.000044842785,0.000026825384,0.00020095408,0.98848295,0.0030625386,0.0032891291,0.0003104563,0.00034492777],"about_ca_topic_score_codex":0.00016455141,"about_ca_topic_score_gemma":0.0000073257024,"teacher_disagreement_score":0.9665909,"about_ca_system_score_codex":0.000029414829,"about_ca_system_score_gemma":0.000016399843,"threshold_uncertainty_score":0.74024475},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004929185,0.0000065563386,0.958431,0.0002577072,0.0008497618,0.039366964,0.00015120405,0.00035150247,0.00009236231],"genre_scores_gemma":[0.832335,7.129645e-7,0.004814803,0.00008569147,0.00006135064,0.16212313,0.000013988403,0.000013403924,0.0005518955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836767,0.00007178365,0.00039482542,0.00055334816,0.00023526052,0.00037709795],"domain_scores_gemma":[0.9989603,0.00014970012,0.00011601413,0.00043920518,0.000104096194,0.00023066458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026450315,0.00026982318,0.000277389,0.000118764314,0.00024559235,0.00028933954,0.0004331476,0.0001561371,0.000014691142],"category_scores_gemma":[0.0000031615596,0.00023322488,0.00014347125,0.00020517778,0.00007147907,0.00016827803,0.0000028698312,0.00027414042,0.00002057648],"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.00049749145,0.00077354134,0.000013579746,0.0002883098,0.00016014207,0.000028275941,0.000120349054,0.8265861,0.000096121476,0.012076597,0.0033499263,0.15600954],"study_design_scores_gemma":[0.004682784,0.00026313242,0.000026788453,0.000069509246,0.000027995533,0.000018536977,0.00003668896,0.96098167,0.000047099107,0.000036073303,0.033530883,0.00027883935],"about_ca_topic_score_codex":0.000016745653,"about_ca_topic_score_gemma":0.000049529,"teacher_disagreement_score":0.9536162,"about_ca_system_score_codex":0.000032557924,"about_ca_system_score_gemma":0.000055470275,"threshold_uncertainty_score":0.95106345},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016051413,0.00028449125,0.98140496,0.00039257042,0.000570712,0.00087659666,0.00005524669,0.00018599295,0.00017802819],"genre_scores_gemma":[0.9991861,0.000059855716,0.00021797432,0.0001547288,0.00006505935,0.00023053044,0.000028848408,0.000015616206,0.000041308715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979133,0.00022349886,0.0004471043,0.00061435177,0.00024016477,0.00056157296],"domain_scores_gemma":[0.9988434,0.00039618483,0.000119447235,0.0002715721,0.0001609131,0.00020853474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023500453,0.00029439287,0.00039229947,0.0001823621,0.0002887756,0.00038874667,0.00020587764,0.00015730965,0.000009110638],"category_scores_gemma":[0.000012794831,0.00027386643,0.0000902575,0.00068801636,0.00010536599,0.0003643387,0.0000036702852,0.00037909028,0.000021682421],"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.000048902057,0.00014530441,0.000047527716,0.000040917967,0.00003389127,0.00005533903,0.00013079269,0.99098307,0.000023738325,0.00036613163,0.000091662056,0.008032747],"study_design_scores_gemma":[0.0010750759,0.00018068549,0.0009445472,0.00042659938,0.000018018278,0.000065077904,0.00014314179,0.99648654,0.000016083972,0.0002752484,0.000029063976,0.00033990905],"about_ca_topic_score_codex":0.00063142943,"about_ca_topic_score_gemma":0.00015150457,"teacher_disagreement_score":0.9831347,"about_ca_system_score_codex":0.00014222684,"about_ca_system_score_gemma":0.00007321362,"threshold_uncertainty_score":0.99997133},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014996528,0.00010651767,0.9825593,0.00023544198,0.000939594,0.0006381052,0.0000812706,0.00041458124,0.000028638235],"genre_scores_gemma":[0.9981784,0.000018030789,0.0012937662,0.00007225458,0.00005805444,0.00014968074,0.000038782797,0.000014391634,0.00017659993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998483,0.000025536243,0.00042566145,0.0004013691,0.00019886285,0.00046554033],"domain_scores_gemma":[0.99918497,0.00016087129,0.000099162084,0.00027030773,0.00009552879,0.00018917194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032754184,0.0002229356,0.00025167613,0.00011806195,0.00025791943,0.00017251894,0.0002614545,0.00009956114,0.000003871001],"category_scores_gemma":[0.0000014664279,0.00020885655,0.00009137183,0.0003585967,0.000011286137,0.00016233878,0.000002688022,0.0001326314,0.000008535922],"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.000067976696,0.00011206577,0.0000068651857,0.00016569355,0.000133135,0.000016246002,0.00010176174,0.9408175,0.000037489575,0.0016192237,0.00021410307,0.056707952],"study_design_scores_gemma":[0.0015008253,0.00007433197,0.00020923787,0.00008267882,0.000052647334,0.000023502951,0.00015694828,0.9960122,0.000026070558,0.000010572571,0.0015961616,0.0002548015],"about_ca_topic_score_codex":0.000011019786,"about_ca_topic_score_gemma":0.000021822892,"teacher_disagreement_score":0.9831819,"about_ca_system_score_codex":0.000046799436,"about_ca_system_score_gemma":0.000015777821,"threshold_uncertainty_score":0.85169226},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010907566,0.00053579593,0.9859736,0.000116693474,0.000639093,0.000485898,0.0006022399,0.0002296194,0.00050948764],"genre_scores_gemma":[0.9982698,0.000018434337,0.001418013,0.00001129921,0.000014505162,0.000045919398,0.00006109458,0.000017093287,0.0001438328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756795,0.00039287208,0.0004888038,0.00066755636,0.0004652574,0.0004175876],"domain_scores_gemma":[0.99744135,0.00033961784,0.00031478849,0.001619949,0.00013826639,0.00014600962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007403462,0.0003181533,0.00046196583,0.00010108016,0.00054922147,0.00028988547,0.0011541968,0.00011497596,0.0000014488613],"category_scores_gemma":[0.000007902046,0.00020876927,0.00007170457,0.0006355217,0.00011248737,0.00035353692,0.000012046419,0.0002602183,0.000010447638],"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.000048430087,0.00021660431,0.000105793704,0.0004561235,0.0002798604,0.000034790228,0.00040115797,0.9812349,0.00011831166,0.014557562,0.00056508166,0.0019813497],"study_design_scores_gemma":[0.0012380437,0.00020808892,0.00023170002,0.0005602472,0.00009103796,0.00053935766,0.0025727914,0.99012345,0.000038174727,0.000017381455,0.003921105,0.0004586374],"about_ca_topic_score_codex":0.00024015004,"about_ca_topic_score_gemma":0.000036931473,"teacher_disagreement_score":0.98736227,"about_ca_system_score_codex":0.00007453354,"about_ca_system_score_gemma":0.0001252777,"threshold_uncertainty_score":0.8513364},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010325521,0.000382062,0.9980537,0.0004570878,0.00022955982,0.00030892275,0.00001781829,0.00021918227,0.00022836193],"genre_scores_gemma":[0.9861876,0.00023429704,0.013272752,0.000053833286,0.000012085875,0.00002632135,0.000002641878,0.0000038998683,0.00020657878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886304,0.00017276985,0.00032997425,0.00023467223,0.00019680957,0.00020273036],"domain_scores_gemma":[0.99908066,0.00020520875,0.00012300108,0.00041318376,0.00009862542,0.00007934017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038507397,0.00013683148,0.00018986514,0.000059462283,0.00039550444,0.00018429523,0.00047278852,0.0000727998,8.298766e-7],"category_scores_gemma":[0.0000065318145,0.000095621515,0.000054970707,0.00029488956,0.00005367794,0.00015119484,0.000002257048,0.00012262618,0.0000050684916],"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.000028419929,0.00007420064,0.0000023500634,0.0000056434865,0.00001836387,0.00000206904,0.00007139816,0.9853373,0.00012599445,0.005499585,0.0016783287,0.007156303],"study_design_scores_gemma":[0.00042496918,0.00035701942,0.00010776113,0.000048671536,0.000010952351,0.000032327585,0.00004100341,0.99559087,0.00070187304,0.0010444756,0.0014549454,0.00018512961],"about_ca_topic_score_codex":0.000021300588,"about_ca_topic_score_gemma":8.530575e-7,"teacher_disagreement_score":0.98608434,"about_ca_system_score_codex":0.000020387159,"about_ca_system_score_gemma":0.000039513652,"threshold_uncertainty_score":0.38993323},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048876803,0.00029782223,0.9465823,0.00051164057,0.0017585914,0.0006219324,0.00035491356,0.000934382,0.00006158955],"genre_scores_gemma":[0.99646276,0.00004220002,0.0030797427,0.000018901173,0.000030617888,0.00025958984,0.000035876514,0.000018339255,0.000051972776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997495,0.00013603439,0.000646552,0.0009244906,0.0003260932,0.00047181634],"domain_scores_gemma":[0.99770266,0.00022936332,0.00020288498,0.0016472398,0.00006452639,0.00015332182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000516559,0.00033285422,0.00048319122,0.00022767452,0.00030648994,0.0002813826,0.00079013826,0.0003482691,0.000002602246],"category_scores_gemma":[0.000052018426,0.00029772753,0.00007312554,0.0008900009,0.00020825192,0.00080682134,0.000012376392,0.00085969595,0.000015375144],"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.00010108464,0.00065473974,0.0005568066,0.00027406265,0.000045860572,0.0001476372,0.00034754327,0.9694066,0.009068834,0.010608,0.0010435134,0.0077452967],"study_design_scores_gemma":[0.0024738389,0.00028192034,0.004276909,0.00027926324,0.00003300858,0.00044196512,0.0006699708,0.9764062,0.00086547754,0.0009686791,0.012024215,0.0012785593],"about_ca_topic_score_codex":0.00037309687,"about_ca_topic_score_gemma":0.00007955546,"teacher_disagreement_score":0.94758594,"about_ca_system_score_codex":0.00012902911,"about_ca_system_score_gemma":0.00007042615,"threshold_uncertainty_score":0.9999475},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030322256,0.0010965933,0.9647415,0.000095587064,0.0015483967,0.0010387406,0.00072285207,0.00035908972,0.00007498628],"genre_scores_gemma":[0.9984631,0.00033213064,0.00041271793,0.00002218,0.000101676145,0.0003469913,0.000097425094,0.000020443416,0.00020331924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684393,0.00045192527,0.0008121027,0.00076428894,0.0005038127,0.00062395143],"domain_scores_gemma":[0.99816525,0.00035527238,0.00020165669,0.000815693,0.00013979402,0.00032230566],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005382652,0.0004019036,0.0007510833,0.00017114166,0.00047366912,0.00019766328,0.00057739334,0.00028632957,0.000005084405],"category_scores_gemma":[0.000013019469,0.00036948235,0.00014066021,0.0008746997,0.00014481954,0.0004874235,0.000008879213,0.0005345008,0.000041570536],"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.00014515134,0.00030433864,0.00039029305,0.00008167794,0.00005898477,0.00019188446,0.00021931273,0.99673164,0.000053171752,0.0007702968,0.0008657288,0.00018754523],"study_design_scores_gemma":[0.003881454,0.00015690915,0.0013031621,0.00015769411,0.000022059225,0.0003617761,0.00012821698,0.9905991,0.000029428842,0.000025333582,0.002852906,0.0004819741],"about_ca_topic_score_codex":0.00081723445,"about_ca_topic_score_gemma":0.00007653112,"teacher_disagreement_score":0.96814084,"about_ca_system_score_codex":0.00020746383,"about_ca_system_score_gemma":0.00012652829,"threshold_uncertainty_score":0.9998757},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046940736,0.0003314148,0.94861585,0.000052019004,0.0020804845,0.00042182198,0.00020544865,0.0002973451,0.0010549079],"genre_scores_gemma":[0.99867415,0.000027218273,0.00096609135,0.000025177233,0.000029036002,0.00008851857,0.000021979109,0.00001602088,0.00015177591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975404,0.0002503459,0.00062837824,0.00067529944,0.00033335542,0.0005722273],"domain_scores_gemma":[0.9988293,0.00013122943,0.0001574937,0.00058107346,0.00007107222,0.00022985492],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000496065,0.00033130942,0.0004222038,0.0002909333,0.00022021524,0.00018900156,0.0005803619,0.0001689157,0.000012458033],"category_scores_gemma":[0.000006280597,0.00030585975,0.00011672091,0.00075352006,0.00006274598,0.0001416529,0.000009112735,0.00030704567,0.00007361459],"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.0000971604,0.00052005926,0.00019988748,0.00011616351,0.00006622351,0.000114437156,0.0010103851,0.99303377,0.000111140784,0.0019384301,0.00028119414,0.0025111465],"study_design_scores_gemma":[0.001090254,0.00012192818,0.004416104,0.00022949903,0.000013754471,0.00014827208,0.000223562,0.9925684,0.000031463052,0.00007943488,0.0006353455,0.00044198413],"about_ca_topic_score_codex":0.00031632461,"about_ca_topic_score_gemma":0.000030522522,"teacher_disagreement_score":0.95173347,"about_ca_system_score_codex":0.00012486202,"about_ca_system_score_gemma":0.00004679778,"threshold_uncertainty_score":0.9999393},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29843706,0.00010585867,0.7003697,0.00034922958,0.00021731878,0.00019113864,0.000119068056,0.00011098667,0.000099612356],"genre_scores_gemma":[0.9975426,0.000017179309,0.001138138,0.000047905713,0.000031309057,0.000027913326,0.000017016218,0.000010365182,0.0011675765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983519,0.000057116544,0.0002787393,0.00047931852,0.00046834015,0.0003646316],"domain_scores_gemma":[0.99896693,0.00013515796,0.00006436385,0.00032611287,0.00021446857,0.00029298212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004506559,0.00022430132,0.00026344327,0.00014103552,0.000354704,0.00033120302,0.00020362138,0.000085118525,0.0000014049477],"category_scores_gemma":[0.0000053564117,0.0001803169,0.000043638705,0.000287207,0.000059154267,0.00022334643,0.0000049982877,0.00019308385,0.000008634497],"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.0009411815,0.0005490333,0.0012443028,0.0001355573,0.00028251327,0.00033440252,0.0018967891,0.9623902,0.0029639388,0.0023591244,0.0018839099,0.025019085],"study_design_scores_gemma":[0.010154877,0.0039654113,0.015086901,0.0012814538,0.00033227412,0.0022196334,0.01397209,0.9319828,0.0048077,0.00007443557,0.012768434,0.00335396],"about_ca_topic_score_codex":0.0005858848,"about_ca_topic_score_gemma":0.00016359086,"teacher_disagreement_score":0.6992316,"about_ca_system_score_codex":0.000053813426,"about_ca_system_score_gemma":0.000034506913,"threshold_uncertainty_score":0.735311},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04694853,0.000599403,0.9501823,0.00062285847,0.0005181369,0.0007038989,0.000026200036,0.00007198246,0.00032665994],"genre_scores_gemma":[0.99711376,0.0000125079405,0.0023547718,0.00014236785,0.000087361695,0.00018903623,0.0000026693265,0.000006696288,0.00009081863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875116,0.00012926328,0.00023266359,0.0002944251,0.0002237501,0.00036873904],"domain_scores_gemma":[0.9991464,0.00029712415,0.00006143351,0.00038635934,0.000013849873,0.00009484275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006313408,0.00015589297,0.00016371919,0.00008953656,0.00032109144,0.00016538253,0.0002989137,0.0000679828,7.2997483e-7],"category_scores_gemma":[0.0000033544088,0.00011178371,0.0000555632,0.00029818097,0.00004176871,0.00001594467,0.000009499893,0.00015822139,0.000004709203],"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.00006347877,0.00045512329,0.00007663395,0.00017091514,0.00009002695,0.000007274897,0.0037872554,0.9195382,0.000002152523,0.06023443,0.0014581439,0.014116338],"study_design_scores_gemma":[0.0017341978,0.00021029609,0.0018408042,0.0002272121,0.00007675449,0.00004699866,0.0058775484,0.93528414,0.00000727421,0.00070802,0.053556807,0.00042992554],"about_ca_topic_score_codex":0.000029451588,"about_ca_topic_score_gemma":0.0000017657309,"teacher_disagreement_score":0.9501653,"about_ca_system_score_codex":0.000039720668,"about_ca_system_score_gemma":0.0000041636285,"threshold_uncertainty_score":0.45584074},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009363455,0.00052025483,0.9879305,0.0009769404,0.00021068906,0.00026160674,0.000014126534,0.00027472604,0.0004476988],"genre_scores_gemma":[0.9937142,0.00035580766,0.0055631674,0.00014894857,0.000013149725,0.0000733799,0.0000067512647,0.000007365814,0.000117234515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984589,0.00044991338,0.00035113495,0.00028073034,0.00020626429,0.0002530271],"domain_scores_gemma":[0.9989971,0.00017500101,0.00009287791,0.0006287316,0.00004000191,0.000066286644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004935055,0.0001744113,0.00022138325,0.00012451,0.00034373172,0.0003302831,0.0007583759,0.000091744376,0.0000030025615],"category_scores_gemma":[0.000004371909,0.00012851493,0.00006103974,0.00055365404,0.000060395956,0.00021966141,0.000007076142,0.00027422857,0.0000075791027],"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.00003024626,0.00020910884,0.00014853427,0.000014885163,0.000024440333,0.000021191016,0.0008801584,0.9903515,0.000049416987,0.004328485,0.0013252045,0.002616822],"study_design_scores_gemma":[0.00097256433,0.000103053404,0.00036903794,0.00011074407,0.000011982894,0.0001656683,0.00040882127,0.9890052,0.00010221792,0.00047005527,0.00796024,0.00032039438],"about_ca_topic_score_codex":0.0002407289,"about_ca_topic_score_gemma":0.000030625557,"teacher_disagreement_score":0.98435074,"about_ca_system_score_codex":0.000046146564,"about_ca_system_score_gemma":0.000023287253,"threshold_uncertainty_score":0.52406865},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002578926,0.000093924835,0.9935165,0.00027974264,0.0015886311,0.0014492979,0.00023784385,0.00011792846,0.00013721976],"genre_scores_gemma":[0.9966445,0.000005569292,0.0017568972,0.000080207705,0.00010181971,0.0011165753,0.000011548092,0.000013756077,0.00026910097],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818826,0.00011280684,0.0005809857,0.00047954498,0.00019894356,0.00043944136],"domain_scores_gemma":[0.99892527,0.00027367575,0.00014736582,0.0003066595,0.00019395197,0.00015308693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034737115,0.000249347,0.00040867663,0.00011818646,0.00025550256,0.00031557024,0.00026613762,0.00016312087,0.000010480226],"category_scores_gemma":[0.0000067709757,0.00021512533,0.00013385854,0.00025911862,0.00003086814,0.00039025288,0.000002470636,0.00021361522,0.000028410828],"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.00008835743,0.00024239483,0.0000541681,0.0000492689,0.00010059636,0.000003277529,0.00043956804,0.9887361,0.00058622664,0.0046121855,0.00086707564,0.0042207614],"study_design_scores_gemma":[0.0023808132,0.00023472,0.00028277838,0.000117783165,0.000012963978,0.00004717791,0.00047121884,0.99576724,0.000026142749,0.00007394095,0.00032752697,0.0002576821],"about_ca_topic_score_codex":0.0016107922,"about_ca_topic_score_gemma":0.00026090108,"teacher_disagreement_score":0.9940656,"about_ca_system_score_codex":0.00012877544,"about_ca_system_score_gemma":0.000044279815,"threshold_uncertainty_score":0.8772556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011552539,0.00025756317,0.98568684,0.00011826204,0.0008986854,0.00037612318,0.00014775616,0.0003206309,0.00064157543],"genre_scores_gemma":[0.9971347,0.000046255172,0.0021135225,0.000096060394,0.00009757592,0.00015940393,0.00003310768,0.000016263974,0.00030314707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981277,0.00021447096,0.00037640345,0.00041239263,0.00033408243,0.000534937],"domain_scores_gemma":[0.9989169,0.000104994826,0.00016368115,0.00039884538,0.00009168006,0.00032385695],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004573295,0.00029573662,0.00029523481,0.00020005037,0.0006539209,0.00028363065,0.0003159293,0.00014334981,0.000013824282],"category_scores_gemma":[0.0000067623196,0.0002615512,0.000076661134,0.0006975091,0.00008692267,0.00093805505,0.000004577677,0.00031027038,0.00005586789],"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.0002765325,0.0013379124,0.00024613077,0.00062111235,0.00022717049,0.000031807085,0.0028933098,0.89669967,0.00029799892,0.08139401,0.0015506875,0.014423673],"study_design_scores_gemma":[0.0035185425,0.00051760615,0.00062222703,0.0007043216,0.00012946021,0.00042626486,0.0019863208,0.9822044,0.0008145222,0.002757736,0.0047694365,0.0015491584],"about_ca_topic_score_codex":0.000016061706,"about_ca_topic_score_gemma":0.0000021267672,"teacher_disagreement_score":0.9855821,"about_ca_system_score_codex":0.000042967273,"about_ca_system_score_gemma":0.000050906947,"threshold_uncertainty_score":0.99998367},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04124326,0.00024587134,0.9556183,0.00014799119,0.0017530248,0.00060214853,0.00012146862,0.00013765792,0.00013027967],"genre_scores_gemma":[0.9982496,0.000008574003,0.0010452685,0.000019698022,0.000101802034,0.0003468826,0.000018539726,0.00001103104,0.00019861228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00010103873,0.00049128954,0.0004486692,0.000189216,0.00034846726],"domain_scores_gemma":[0.99928516,0.00017553115,0.000107898486,0.00025235917,0.00009536703,0.00008367959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003450236,0.0001971124,0.00029324813,0.00020044274,0.00025505864,0.00021218153,0.00017926615,0.00013957839,0.0000017543776],"category_scores_gemma":[0.0000031575696,0.00018090811,0.000113270646,0.0003847946,0.000033605105,0.00011267143,0.0000019123884,0.00013239465,0.0000073738156],"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.00003302177,0.00015381964,0.000028403028,0.00003832064,0.000014993614,0.0000055901887,0.00008049631,0.9949277,0.0001476544,0.003466479,0.0003250121,0.00077849324],"study_design_scores_gemma":[0.0011781061,0.00012396988,0.00020754423,0.00011295289,0.00000959567,0.00005723161,0.00016750043,0.996945,0.000037250633,0.00019219394,0.0007513317,0.00021728118],"about_ca_topic_score_codex":0.00057446695,"about_ca_topic_score_gemma":0.00010349113,"teacher_disagreement_score":0.95700634,"about_ca_system_score_codex":0.000087196066,"about_ca_system_score_gemma":0.000024207295,"threshold_uncertainty_score":0.73772186},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053958152,0.00023344904,0.99314785,0.00007481889,0.00018060733,0.0005440629,0.000103343125,0.0001257998,0.00019427633],"genre_scores_gemma":[0.9967735,0.00005008281,0.0028037536,0.0000036566996,0.0000093085755,0.00020965781,0.000011374546,0.0000055044025,0.00013318931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988233,0.000086475615,0.00036276347,0.0003162396,0.00018820837,0.00022301164],"domain_scores_gemma":[0.99904037,0.00012998321,0.00013751577,0.00044207062,0.00016472927,0.000085307656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030922948,0.000143604,0.00018724779,0.00015064668,0.00047178328,0.00026732738,0.00045109776,0.00006653272,0.0000015735349],"category_scores_gemma":[0.000007910365,0.000102775964,0.00008970434,0.00080087455,0.00012127968,0.00022079515,0.000005900219,0.00014082211,0.000010590102],"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.000017573491,0.00017983648,0.000031144216,0.000012012048,0.000028064253,9.0370474e-7,0.000339691,0.99665445,0.00012923377,0.001262118,0.00019305729,0.0011519324],"study_design_scores_gemma":[0.0036302416,0.00045582541,0.0030433992,0.00032720107,0.000023349041,0.000037597663,0.00047926762,0.9811731,0.0026395486,0.0072086453,0.00035629564,0.00062555465],"about_ca_topic_score_codex":0.00028061264,"about_ca_topic_score_gemma":0.00003622411,"teacher_disagreement_score":0.99137765,"about_ca_system_score_codex":0.00013878742,"about_ca_system_score_gemma":0.00014052456,"threshold_uncertainty_score":0.41910824},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014647916,0.00004476905,0.9588869,0.000027165679,0.00097921,0.039281193,0.00014428789,0.00036885517,0.00012110405],"genre_scores_gemma":[0.8900768,0.000004476286,0.0013970771,0.000044448396,0.00015799716,0.10812534,0.00003953446,0.00001681194,0.0001375072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812514,0.00014718086,0.0005316141,0.0004113536,0.00020384071,0.000580846],"domain_scores_gemma":[0.9986844,0.000244205,0.00023595801,0.00033200072,0.00020239328,0.00030102333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036736403,0.000287815,0.000369881,0.000071200644,0.00045699935,0.00021744621,0.00024876822,0.00020657292,0.0000060432703],"category_scores_gemma":[0.0000014077035,0.00025006558,0.00014908671,0.00023836907,0.000044996883,0.00050096464,0.0000058470737,0.00023441635,0.0000088203315],"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.0029416743,0.005849451,0.0012525843,0.0012901573,0.0017587418,0.00006973617,0.0029054552,0.81687015,0.00010000769,0.029554736,0.013738289,0.12366902],"study_design_scores_gemma":[0.0020351056,0.0003838295,0.000049549264,0.00014286817,0.000043587937,0.00006485653,0.00038806064,0.9937394,0.000010675394,0.000027960543,0.002805593,0.00030851402],"about_ca_topic_score_codex":0.000033663568,"about_ca_topic_score_gemma":0.000004093203,"teacher_disagreement_score":0.95748985,"about_ca_system_score_codex":0.00008554086,"about_ca_system_score_gemma":0.00004695212,"threshold_uncertainty_score":0.9999952},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008119274,0.00031375964,0.9879124,0.00010168361,0.0023176686,0.0004989318,0.00028841663,0.00042738754,0.000020469095],"genre_scores_gemma":[0.97606593,0.00007261566,0.022632355,0.0000702057,0.00019795889,0.000084737956,0.0007551871,0.00003641647,0.000084612395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707437,0.0001920971,0.0006938458,0.0009800048,0.00042510094,0.0006345667],"domain_scores_gemma":[0.99740493,0.0007070134,0.00032889497,0.0010633578,0.00018943765,0.00030635126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000826564,0.0003469684,0.00036638152,0.00017020933,0.00087735866,0.00037619023,0.0006294881,0.00040233537,0.0000019162862],"category_scores_gemma":[0.000012124785,0.00035374405,0.00007913106,0.0007860041,0.00007494491,0.0004418943,0.000009147331,0.0003348187,0.00000198567],"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.00012685043,0.000307241,0.000040745064,0.000017765627,0.00004008723,0.000004945924,0.00009187754,0.9878917,0.00012576224,0.005443118,0.0007059532,0.0052040084],"study_design_scores_gemma":[0.00070469995,0.0002081304,0.000045256496,0.00010385359,0.00003117,0.000029129911,0.00027322912,0.9973369,0.00018527012,0.0000428823,0.00063925976,0.0004001742],"about_ca_topic_score_codex":0.00028051148,"about_ca_topic_score_gemma":0.00006569471,"teacher_disagreement_score":0.96794665,"about_ca_system_score_codex":0.00014869634,"about_ca_system_score_gemma":0.00004449166,"threshold_uncertainty_score":0.99989146},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026975313,0.00007546845,0.9692167,0.0010279755,0.0008288162,0.00067249977,0.0005064865,0.0006228061,0.00007394757],"genre_scores_gemma":[0.9890959,0.000018609782,0.009885879,0.00009803964,0.000028180382,0.0005280426,0.00005078909,0.0000206943,0.00027382994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982308,0.000056823148,0.00034243238,0.00060444523,0.00033035353,0.0004351425],"domain_scores_gemma":[0.99835837,0.0005603806,0.00011905829,0.00063401915,0.00013218985,0.00019599074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013268607,0.00031184827,0.00036286382,0.00028228975,0.00055386865,0.00015328678,0.00045496516,0.00012842283,0.0000028601155],"category_scores_gemma":[0.00001817607,0.00025803514,0.000101076716,0.0005980248,0.000108893924,0.00026378557,0.0000045334455,0.00027141304,0.000016058582],"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.00026316725,0.00037862486,0.00007430782,0.00005535585,0.0001186027,0.00005504681,0.00033349977,0.9908988,0.0001994478,0.00091775955,0.0037271972,0.0029781798],"study_design_scores_gemma":[0.0023853127,0.001019898,0.0009903874,0.0003527867,0.000056138917,0.00024013495,0.00031248,0.98748165,0.0003623054,0.00015149724,0.005976665,0.0006707635],"about_ca_topic_score_codex":0.000104656014,"about_ca_topic_score_gemma":0.0002972606,"teacher_disagreement_score":0.9621206,"about_ca_system_score_codex":0.00016893256,"about_ca_system_score_gemma":0.00009708415,"threshold_uncertainty_score":0.9999872},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006369099,0.0004349649,0.9891386,0.0004643239,0.0011739957,0.00074048317,0.0010831008,0.00020005382,0.00039537245],"genre_scores_gemma":[0.99734837,0.000013609531,0.0011349076,0.000041597443,0.00008038244,0.0007867831,0.00007249811,0.000014199273,0.00050764927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979036,0.000039691287,0.0006682166,0.00058344763,0.00028606,0.00051901035],"domain_scores_gemma":[0.9989438,0.00024067042,0.00010052406,0.0003686612,0.00018597314,0.00016038454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027680618,0.00027685653,0.00041608332,0.00016474872,0.00045388483,0.00040961232,0.00028591158,0.00019522951,0.0000031641212],"category_scores_gemma":[0.000011894569,0.00024162562,0.00013364342,0.0005229833,0.00010758879,0.0004798266,0.0000029529958,0.00021528703,0.000014310824],"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.00031019992,0.002338748,0.0005624203,0.001101213,0.00014161042,0.00008413667,0.00039623937,0.71585685,0.00059718767,0.26632655,0.010465234,0.0018196456],"study_design_scores_gemma":[0.0056183646,0.0006370812,0.002161868,0.0005355191,0.000070395225,0.00046023724,0.000555422,0.94654083,0.0004225995,0.0077573135,0.033933043,0.0013073432],"about_ca_topic_score_codex":0.00039285448,"about_ca_topic_score_gemma":0.00025902022,"teacher_disagreement_score":0.99097925,"about_ca_system_score_codex":0.00012312082,"about_ca_system_score_gemma":0.00009681494,"threshold_uncertainty_score":0.9853207},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022052953,0.00012025378,0.97543216,0.00041901867,0.00049168116,0.00039098292,0.00014234228,0.0007460265,0.000204568],"genre_scores_gemma":[0.99020714,0.000050227485,0.009309652,0.00009989101,0.000042196574,0.00010239801,0.000008749363,0.000012549734,0.00016719855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829215,0.00007186047,0.00030326602,0.00053350476,0.00032963607,0.00046957683],"domain_scores_gemma":[0.9988239,0.000115984214,0.000087041524,0.0006210973,0.00011438966,0.00023762808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014933878,0.00027667018,0.0003461639,0.00012410081,0.00043583274,0.00009825497,0.0004895922,0.00018738925,0.0000043244872],"category_scores_gemma":[0.000005575986,0.00022589417,0.00006238769,0.0006663792,0.00031083013,0.00024735372,0.000006323697,0.00035679838,0.000032440756],"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.000042229683,0.00010867637,0.00019895133,0.000012699606,0.000070300695,0.00008293218,0.00012483806,0.99383736,0.000030030022,0.0015352606,0.0022119172,0.0017448248],"study_design_scores_gemma":[0.0020725722,0.00086921034,0.0024664921,0.00020602158,0.000042767766,0.0019573374,0.00019591114,0.9841942,0.00033835944,0.0001022915,0.0065012057,0.0010535932],"about_ca_topic_score_codex":0.00012410396,"about_ca_topic_score_gemma":0.000035234076,"teacher_disagreement_score":0.9681542,"about_ca_system_score_codex":0.00006957607,"about_ca_system_score_gemma":0.00005694107,"threshold_uncertainty_score":0.9211697},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054580916,0.000037567745,0.9423656,0.00036143966,0.0007328821,0.00057718076,0.00016641521,0.0008560563,0.00032197245],"genre_scores_gemma":[0.9928319,0.000049498933,0.006640351,0.00015264528,0.000035430345,0.0001687305,0.000039496274,0.000009561384,0.00007241551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816656,0.000057780806,0.00055885623,0.0003550375,0.00037152594,0.00049022713],"domain_scores_gemma":[0.99882686,0.00013497859,0.00013705231,0.00055043184,0.00014448503,0.00020621814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023044054,0.00026837274,0.00031002215,0.00024335377,0.00063684845,0.00028080554,0.0005293745,0.00018226313,0.0000014899855],"category_scores_gemma":[0.000026081396,0.00025586432,0.00008325618,0.00072374055,0.00005486703,0.0010711818,0.000012427352,0.00028798942,0.000107954664],"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.000028790286,0.00008075816,0.00014146292,0.000038244805,0.00005261427,0.000034238652,0.0012069861,0.97851443,0.0002047753,0.00042474127,0.002297714,0.016975226],"study_design_scores_gemma":[0.00085349113,0.000097393095,0.00049058005,0.00010302804,0.000011989571,0.00017595378,0.00050580886,0.9905196,0.000251866,0.000013740252,0.0065721455,0.00040442217],"about_ca_topic_score_codex":0.00012698823,"about_ca_topic_score_gemma":0.000025029218,"teacher_disagreement_score":0.93825096,"about_ca_system_score_codex":0.00013102326,"about_ca_system_score_gemma":0.000057061145,"threshold_uncertainty_score":0.99998933},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.124402635,0.000078473546,0.8698784,0.004074029,0.00035850875,0.00066566473,0.00039142565,0.00007936428,0.000071510396],"genre_scores_gemma":[0.99880975,0.000005865277,0.00012491486,0.00025639118,0.000028366634,0.000109672765,0.000014436818,0.000006015231,0.00064458523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987193,0.000089450616,0.00028008438,0.0003228348,0.00036312733,0.00022521382],"domain_scores_gemma":[0.9989086,0.00029238322,0.00007303008,0.00032702083,0.0002975573,0.00010139958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003920653,0.00017467834,0.0002410598,0.000082726765,0.00038160098,0.00016051492,0.00030926077,0.0000677841,0.0000012478016],"category_scores_gemma":[0.000026419124,0.00011955322,0.00010530964,0.00024417983,0.000023567638,0.00013045066,0.0000014583885,0.00016881185,0.0000067114843],"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.00009270425,0.00016258062,9.674555e-7,0.000011944855,0.000035338337,0.0000010025065,0.00050371577,0.983958,0.0003062033,0.009536528,0.0016515141,0.003739465],"study_design_scores_gemma":[0.0014510375,0.0017227737,0.00015062837,0.00025906583,0.000047830363,0.000030645053,0.0005111407,0.99352,0.0007154729,0.00012219942,0.0010687192,0.0004004783],"about_ca_topic_score_codex":0.000053898246,"about_ca_topic_score_gemma":0.000013308662,"teacher_disagreement_score":0.8744071,"about_ca_system_score_codex":0.00003539646,"about_ca_system_score_gemma":0.00003518849,"threshold_uncertainty_score":0.48752388},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006232378,0.0002818863,0.9896596,0.00011998125,0.0019645288,0.0007920875,0.00027611255,0.0006075119,0.000065931104],"genre_scores_gemma":[0.98504823,0.000200556,0.013800482,0.00006376354,0.00010861699,0.00022087475,0.00019713762,0.00004918124,0.00031113555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971161,0.00020523944,0.00063102494,0.0010568191,0.00032980632,0.00066105044],"domain_scores_gemma":[0.99775785,0.00028162787,0.00023735578,0.0012820066,0.00015667512,0.00028446375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041087484,0.00040031248,0.0004704602,0.00016920854,0.000758466,0.00025784917,0.0009130092,0.00031441692,0.0000056289837],"category_scores_gemma":[0.0000056849217,0.0003866015,0.00012675775,0.000651898,0.000085667125,0.00046445627,0.000016816604,0.00033486722,0.000010524539],"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.0001688271,0.00027959744,0.000022551583,0.000046731893,0.00011756048,0.00001513472,0.00020200004,0.99494696,0.000028284052,0.0002255005,0.0013868139,0.0025600248],"study_design_scores_gemma":[0.0012886879,0.00017618894,0.000044052653,0.00013049664,0.000074707066,0.00009094451,0.00014587227,0.996626,0.000081318045,0.0000033262913,0.0008951129,0.0004432573],"about_ca_topic_score_codex":0.00021409645,"about_ca_topic_score_gemma":0.00006897984,"teacher_disagreement_score":0.97881585,"about_ca_system_score_codex":0.000107038584,"about_ca_system_score_gemma":0.000059517643,"threshold_uncertainty_score":0.9998586},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024423582,0.00062603434,0.9716615,0.00028598768,0.0013785863,0.00044072297,0.00015671278,0.0005148768,0.0005119875],"genre_scores_gemma":[0.99818766,0.000059599606,0.001125536,0.00006729,0.000094765775,0.000059430968,0.000034773482,0.000020526462,0.0003503964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692154,0.0002756758,0.000622135,0.00080679526,0.000626872,0.00074699277],"domain_scores_gemma":[0.99834806,0.0001927866,0.00012228699,0.0007428001,0.00018068703,0.00041338743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005995788,0.00038752542,0.00046966557,0.00020463408,0.0006578812,0.0005004492,0.0007080179,0.00021221206,0.000011268096],"category_scores_gemma":[0.0000054454285,0.00035125547,0.0001662545,0.0008814215,0.00012916565,0.00015240477,0.000012572877,0.0004308931,0.0001998583],"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.0000432969,0.0002253922,0.00006782845,0.00005182404,0.00006455224,0.00006864964,0.00021074334,0.99327564,0.00007379738,0.0019917595,0.00016492624,0.0037616033],"study_design_scores_gemma":[0.00095626665,0.00015956994,0.00018453278,0.00012278475,0.00001842675,0.00038002897,0.00036114675,0.9927821,0.000009759519,0.00003476435,0.004580972,0.00040963292],"about_ca_topic_score_codex":0.00035015616,"about_ca_topic_score_gemma":0.00001048669,"teacher_disagreement_score":0.9737641,"about_ca_system_score_codex":0.00013301798,"about_ca_system_score_gemma":0.00010594083,"threshold_uncertainty_score":0.99989396},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047197253,0.000090361194,0.9501118,0.00007572724,0.0016067731,0.00041206388,0.000094058865,0.0001579248,0.00025404335],"genre_scores_gemma":[0.99880993,0.00007323077,0.000742896,0.00006559546,0.000061406805,0.000082763705,0.000007435903,0.000014721625,0.00014200274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983109,0.0001626697,0.00044216754,0.00044328248,0.00028674013,0.00035420348],"domain_scores_gemma":[0.9987984,0.00014985204,0.00015251793,0.0006192313,0.0001188554,0.00016116473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002727675,0.00022191108,0.0002787771,0.00009184912,0.00030347516,0.000096958116,0.0004214923,0.0001302214,0.0000037165828],"category_scores_gemma":[0.0000027868666,0.0001678141,0.00009436573,0.00048667495,0.00007013619,0.00017227037,0.000007821506,0.0002503297,0.0000061344053],"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.000054582306,0.00011140293,0.00007833353,0.000018204031,0.00005355321,0.0000060261214,0.00055972894,0.994549,0.0003043671,0.00080778566,0.00011953458,0.0033375125],"study_design_scores_gemma":[0.00048738686,0.00019431024,0.0007652202,0.00008159058,0.000027378514,0.00003393137,0.00020894055,0.9971227,0.000629232,0.000015821255,0.00023434857,0.00019913702],"about_ca_topic_score_codex":0.00028114975,"about_ca_topic_score_gemma":0.000012134355,"teacher_disagreement_score":0.9516127,"about_ca_system_score_codex":0.000049257404,"about_ca_system_score_gemma":0.000024435218,"threshold_uncertainty_score":0.68432605},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08116612,0.00018141,0.91706824,0.000093169125,0.0007500434,0.00040705773,0.0000817285,0.00011110451,0.00014112414],"genre_scores_gemma":[0.99605405,0.0000072008324,0.0036204369,0.000039989878,0.000049655322,0.000036568767,0.0000138193,0.000007517896,0.00017075149],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856937,0.00007164498,0.00040885518,0.0003175793,0.0002454782,0.0003870636],"domain_scores_gemma":[0.9991175,0.00011760982,0.00016349375,0.0004016822,0.000054076576,0.00014566709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041173055,0.0001773893,0.00035845893,0.00030114022,0.00023660976,0.00007790329,0.00031293448,0.000056131532,0.0000016516798],"category_scores_gemma":[0.0000016407737,0.00015837533,0.00023546013,0.0008034335,0.00003453995,0.000027662989,0.000011378139,0.000080227335,0.0000033673123],"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.000030084773,0.00031443406,0.0005193981,0.00017218318,0.001595064,0.0000015258403,0.00036732663,0.9879719,0.000024434043,0.004116844,0.00030258205,0.004584229],"study_design_scores_gemma":[0.0007001379,0.00006725201,0.001630161,0.00006119982,0.00043014222,0.000003950702,0.00042481805,0.9949746,0.000026936956,0.00000914526,0.001480052,0.0001915922],"about_ca_topic_score_codex":0.000059350125,"about_ca_topic_score_gemma":0.0000020006785,"teacher_disagreement_score":0.91488796,"about_ca_system_score_codex":0.000049955015,"about_ca_system_score_gemma":0.0000056379567,"threshold_uncertainty_score":0.6458358},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007368637,0.0006895435,0.9904761,0.000057590394,0.00029401213,0.00085345836,0.000017474656,0.00015220187,0.000091008085],"genre_scores_gemma":[0.99772424,0.00014826097,0.0014360986,0.000033548284,0.00002122418,0.00051930716,0.000028910337,0.000015175564,0.000073263705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982272,0.00024889957,0.00041906475,0.00051659916,0.0002455743,0.00034268657],"domain_scores_gemma":[0.99900466,0.00013180234,0.00014111423,0.00050292676,0.00007135195,0.00014815544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030656418,0.00022894357,0.00031485994,0.000106511055,0.00017395294,0.00015066302,0.00022060945,0.00018094674,0.0000033211898],"category_scores_gemma":[0.0000019539386,0.00019845687,0.000049648446,0.0008142683,0.00005050958,0.00029594073,0.0000014608671,0.00024664414,0.000009242242],"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.00010767142,0.00012732255,0.00012629747,0.00001688527,0.000024020248,0.0000081005055,0.00006913332,0.9840161,0.00002724941,0.004174352,0.000066245164,0.011236606],"study_design_scores_gemma":[0.0022025567,0.0001379081,0.0002515968,0.000069355854,0.000017038532,0.00004575688,0.00006952726,0.994966,0.000035334426,0.00012424102,0.0018137335,0.00026699516],"about_ca_topic_score_codex":0.000080075915,"about_ca_topic_score_gemma":0.00021862405,"teacher_disagreement_score":0.99035555,"about_ca_system_score_codex":0.00010741278,"about_ca_system_score_gemma":0.000041803287,"threshold_uncertainty_score":0.8092836},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029674765,0.00025950966,0.9682037,0.00014002161,0.00079665624,0.0004733261,0.00020627101,0.00020709459,0.00003865281],"genre_scores_gemma":[0.99791944,0.000018028146,0.0014331188,0.000055609118,0.0000765209,0.00025259508,0.0000337765,0.000012951318,0.0001979568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868935,0.00006644094,0.0002656341,0.00033690082,0.00022747174,0.000414172],"domain_scores_gemma":[0.99900603,0.00020662788,0.000096739066,0.00028881998,0.00018120262,0.00022059286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022630561,0.00021209389,0.00022882498,0.000119292105,0.00046249077,0.00015492002,0.0001843432,0.00008169535,9.829096e-7],"category_scores_gemma":[0.000007678362,0.00017755783,0.00008076721,0.00026444232,0.00004498308,0.00057027704,0.000003099751,0.0001400337,0.00000953882],"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.00071580784,0.0015636052,0.000888952,0.00040245245,0.0005372566,0.000022575512,0.0026644778,0.9631956,0.0022911143,0.00938927,0.00094091496,0.017387927],"study_design_scores_gemma":[0.002033973,0.000279519,0.00079952815,0.00019753243,0.000069950795,0.00014864551,0.0007501549,0.9942149,0.00014707896,0.000020985886,0.00091585534,0.00042190228],"about_ca_topic_score_codex":0.00014214678,"about_ca_topic_score_gemma":0.000013849627,"teacher_disagreement_score":0.9682447,"about_ca_system_score_codex":0.00006440564,"about_ca_system_score_gemma":0.0000321945,"threshold_uncertainty_score":0.7240598},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08708896,0.00041778616,0.9098867,0.00006826843,0.0017417808,0.0005173634,0.00006680335,0.00016187466,0.000050440205],"genre_scores_gemma":[0.9982637,0.000052427404,0.0011176951,0.00001620995,0.00012052189,0.00030096472,0.00004327198,0.000018385592,0.00006678538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805206,0.00014357867,0.00048463405,0.000420513,0.0002457579,0.00065343076],"domain_scores_gemma":[0.9986886,0.0005366101,0.00015337777,0.0003204091,0.00009323172,0.0002077688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045694152,0.00025292992,0.0003166065,0.000154518,0.00027481886,0.00014489262,0.00024195708,0.00017042729,0.0000015507368],"category_scores_gemma":[0.000008680029,0.00024162765,0.00009096658,0.0004977316,0.000048809547,0.000252876,0.00000411048,0.00022361311,0.0000044851768],"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.00002372093,0.00026901127,0.00018440727,0.000038769456,0.000014543547,0.0000022153095,0.0002748966,0.9915871,0.0001639516,0.0035510226,0.00008061635,0.0038097613],"study_design_scores_gemma":[0.0006607647,0.000055839086,0.00034364784,0.00018019596,0.0000131296765,0.000022598688,0.00029354525,0.99780214,0.00019313772,0.000003523973,0.00014497984,0.00028651982],"about_ca_topic_score_codex":0.000035421723,"about_ca_topic_score_gemma":0.000007613254,"teacher_disagreement_score":0.9111748,"about_ca_system_score_codex":0.000111734196,"about_ca_system_score_gemma":0.000016479638,"threshold_uncertainty_score":0.985329},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049388945,0.00022915576,0.94930524,0.00013326906,0.0002395143,0.0002505042,0.00010731476,0.00008885873,0.00025722937],"genre_scores_gemma":[0.99670315,0.00012884689,0.0024597002,0.00004251176,0.000028717106,0.000042711326,0.000015803133,0.000010069105,0.00056849426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863863,0.000082423765,0.0003575926,0.00042915027,0.00019749672,0.00029473304],"domain_scores_gemma":[0.99930507,0.00013998877,0.00008383733,0.000313307,0.00003120334,0.00012657155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025548166,0.00019648887,0.0002887324,0.00012049219,0.00020179883,0.00012407612,0.00014052092,0.00008390715,0.000009678563],"category_scores_gemma":[0.0000063448565,0.00017214705,0.000040313535,0.00031196207,0.000041676,0.00042009837,0.0000047062827,0.00018356282,0.00007691695],"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.00032984858,0.0005177086,0.00095154316,0.00028413715,0.00009647132,0.00021240555,0.0009815468,0.96590406,0.0020857642,0.018072953,0.0006076563,0.0099559035],"study_design_scores_gemma":[0.0036368934,0.00043298805,0.0009928381,0.00093951746,0.00001943675,0.0004954988,0.00044493092,0.9703131,0.0003035702,0.00046505604,0.020990755,0.0009654251],"about_ca_topic_score_codex":0.00019605378,"about_ca_topic_score_gemma":0.000026972326,"teacher_disagreement_score":0.9473142,"about_ca_system_score_codex":0.00004455699,"about_ca_system_score_gemma":0.000016730864,"threshold_uncertainty_score":0.7019953},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11961198,0.00038128253,0.87681735,0.00026996373,0.0016010607,0.00072671723,0.00005026538,0.0002920436,0.00024932178],"genre_scores_gemma":[0.99891424,0.000014616489,0.000260388,0.0000468326,0.00017602569,0.00013740272,0.000018636325,0.000027683891,0.00040415308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716675,0.0002789727,0.0008202426,0.00072112767,0.00043596426,0.0005769205],"domain_scores_gemma":[0.99875337,0.00016813228,0.0002634655,0.00049424026,0.00019412437,0.00012666424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053245074,0.00039784395,0.0005938814,0.00028125368,0.0004307424,0.0008653706,0.00041223125,0.0001990797,0.0000016525528],"category_scores_gemma":[0.0000022634156,0.00032284553,0.00007726932,0.0008720362,0.000026716145,0.0007095226,0.000005891255,0.00037881688,0.000023978828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082836676,0.00013093634,0.00033770595,0.00021323044,0.000049640654,0.00004578199,0.0003602405,0.9939538,0.00032028154,0.0040751486,0.00019802996,0.00023234347],"study_design_scores_gemma":[0.0019426676,0.00018090282,0.0005873696,0.001016338,0.000023880999,0.00033607913,0.0012435104,0.99329555,0.00006331739,0.000059883245,0.0007093501,0.0005411527],"about_ca_topic_score_codex":0.015621083,"about_ca_topic_score_gemma":0.0016652233,"teacher_disagreement_score":0.87930226,"about_ca_system_score_codex":0.0001957577,"about_ca_system_score_gemma":0.000065597356,"threshold_uncertainty_score":0.99992234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012343914,0.00093085266,0.9823636,0.00009307832,0.0018517361,0.00036697334,0.0003173469,0.0014056613,0.0003268748],"genre_scores_gemma":[0.9968953,0.00004962911,0.0026037327,0.000030207895,0.00005495411,0.00017114427,0.000018695417,0.000016421607,0.00015988745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823767,0.000097043616,0.0003583801,0.00043519653,0.0003220395,0.0005496493],"domain_scores_gemma":[0.9985729,0.0001051894,0.0001361318,0.00086275296,0.00006432751,0.00025871716],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023089282,0.00028773857,0.00033349267,0.00016617862,0.0003902543,0.00021466882,0.00060968654,0.0001916906,0.0000050958206],"category_scores_gemma":[0.000009153015,0.0002526509,0.00007386502,0.00050679443,0.000086834385,0.0012182012,0.000011618877,0.00028510785,0.00020350833],"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.00024555784,0.0016480583,0.00068475836,0.001033321,0.0006396643,0.0003580216,0.0019148401,0.60663784,0.0035547332,0.33725995,0.009959578,0.036063712],"study_design_scores_gemma":[0.012267286,0.0027275295,0.0028695082,0.0016253036,0.0005348116,0.0073655685,0.023928646,0.75321096,0.019767288,0.0019288756,0.16465358,0.009120619],"about_ca_topic_score_codex":0.00009604542,"about_ca_topic_score_gemma":0.0000030582337,"teacher_disagreement_score":0.9845514,"about_ca_system_score_codex":0.0001996766,"about_ca_system_score_gemma":0.00003578809,"threshold_uncertainty_score":0.99999255},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11715449,0.000042435702,0.8786093,0.00094172335,0.0002621323,0.0005818574,0.0022754255,0.00012665564,0.0000059884987],"genre_scores_gemma":[0.99759054,0.000014471636,0.001969204,0.000042488773,0.000013019541,0.00019822181,0.00005704761,0.000007433588,0.00010755804],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808985,0.00014480557,0.00045806443,0.0005431022,0.00040895998,0.00035521341],"domain_scores_gemma":[0.99840164,0.0003208675,0.00012806764,0.00095488154,0.000047421407,0.0001471379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021979124,0.00023205388,0.00047614484,0.00019443632,0.0004143363,0.000044092565,0.0008361092,0.00017166004,0.0000019762867],"category_scores_gemma":[0.00003044006,0.00016590625,0.00029695398,0.0015102938,0.00030571356,0.000090707574,0.000019863222,0.0002645277,0.0000025463796],"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.00007600582,0.00023718498,0.000931187,0.000014470243,0.00042730427,0.000002347308,0.00016703812,0.994032,0.0003782184,0.0009303837,0.00046549574,0.0023383098],"study_design_scores_gemma":[0.002874632,0.00111911,0.11357754,0.000102566744,0.0009766999,0.00010604766,0.0002479092,0.8616428,0.0023625651,0.0013055116,0.014523191,0.0011614347],"about_ca_topic_score_codex":0.00005656795,"about_ca_topic_score_gemma":0.000037973336,"teacher_disagreement_score":0.88043606,"about_ca_system_score_codex":0.00008709519,"about_ca_system_score_gemma":0.00004012939,"threshold_uncertainty_score":0.67654604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07051774,0.00024270712,0.9268437,0.00014067073,0.0007929521,0.00085491507,0.00014783724,0.00036853636,0.00009093581],"genre_scores_gemma":[0.9949627,0.000037806818,0.0043189186,0.00006142766,0.000148475,0.00025502188,0.000047799145,0.000034349072,0.00013351851],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763197,0.00017736139,0.0005204904,0.0007281419,0.00033095837,0.00061106286],"domain_scores_gemma":[0.99842197,0.00051959924,0.00022264622,0.0005128917,0.00017217216,0.00015070739],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034886572,0.00039269237,0.0006111812,0.00013162628,0.00059191504,0.00040171316,0.00026126066,0.00021321526,0.0000020744997],"category_scores_gemma":[0.0000037946754,0.0003272252,0.00016245483,0.000464317,0.000103799226,0.00023634381,0.0000037315585,0.00029060384,0.0000034473153],"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.00039314272,0.0002140769,0.000049186358,0.000049941336,0.00008429838,0.000024797157,0.000033189033,0.9944379,0.00029348087,0.00376123,0.00009483998,0.00056397],"study_design_scores_gemma":[0.00528872,0.00022833169,0.00008401631,0.00017559009,0.000050868155,0.000110366935,0.00006595892,0.9929349,0.00030907008,0.00004524464,0.00025960756,0.0004473701],"about_ca_topic_score_codex":0.00031063127,"about_ca_topic_score_gemma":0.00007695592,"teacher_disagreement_score":0.924445,"about_ca_system_score_codex":0.000084517764,"about_ca_system_score_gemma":0.00004744307,"threshold_uncertainty_score":0.999918},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22835617,0.00014812083,0.7693823,0.000103494305,0.00016135212,0.0016187041,0.000059320406,0.00008603689,0.0000844977],"genre_scores_gemma":[0.99784744,0.000051129697,0.0009350792,0.000023945144,0.000060188493,0.0008369511,0.000014651104,0.000012056854,0.00021855484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853486,0.00007680274,0.00042339813,0.00041364648,0.00022776955,0.00032355363],"domain_scores_gemma":[0.9991827,0.000099149984,0.00015807617,0.00035121018,0.00009149756,0.00011737805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002125439,0.00024566712,0.00038134842,0.000092177994,0.00024322204,0.00015365382,0.000217535,0.00014574015,0.0000032982064],"category_scores_gemma":[4.4698908e-7,0.00018636903,0.000055912813,0.0003225054,0.00010057764,0.00031403257,0.000002722822,0.00020208677,0.000004241147],"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.00023791894,0.00016766455,0.0001963241,0.00023832156,0.000044930126,0.000006434887,0.00008955802,0.99391896,0.00017069596,0.00018725549,0.00042485533,0.004317059],"study_design_scores_gemma":[0.0023205045,0.000679861,0.00090870896,0.00028480942,0.00003577404,0.000101945414,0.000031599,0.99407136,0.00031363883,0.000018222128,0.00090241415,0.00033117086],"about_ca_topic_score_codex":0.000120954974,"about_ca_topic_score_gemma":0.000039399583,"teacher_disagreement_score":0.76949126,"about_ca_system_score_codex":0.000025402216,"about_ca_system_score_gemma":0.000048241356,"threshold_uncertainty_score":0.7599909},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12360272,0.00015056929,0.87501866,0.0001063309,0.0002119834,0.00032145216,0.00006541025,0.00006972087,0.00045314428],"genre_scores_gemma":[0.9991466,0.000010241152,0.0001424003,0.000018304398,0.0002946077,0.00017406084,0.000029095405,0.000016648366,0.0001680674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998463,0.00027069144,0.00037567137,0.00041021378,0.00011636808,0.0003640945],"domain_scores_gemma":[0.9991962,0.00026492128,0.00011289661,0.0002571853,0.000046813188,0.0001219882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028475412,0.00025399393,0.00049406243,0.00009236614,0.00019778096,0.00015170152,0.00012864548,0.00008828279,0.000011142391],"category_scores_gemma":[0.0000018195631,0.00022576508,0.0000949092,0.00020872816,0.00009919409,0.000101594014,0.0000071255677,0.00030478215,0.0000070352635],"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.0001135445,0.00027629474,0.009438787,0.00010090692,0.00028898008,0.000005304138,0.00043413928,0.9617825,0.000107551794,0.02165192,0.0015234137,0.0042766617],"study_design_scores_gemma":[0.0013620828,0.0001920633,0.0012602357,0.0004031587,0.0001683567,0.000031698917,0.0011493453,0.9879077,0.000039241735,0.0023094525,0.0045392816,0.0006374008],"about_ca_topic_score_codex":0.0029156257,"about_ca_topic_score_gemma":0.00036774823,"teacher_disagreement_score":0.87554383,"about_ca_system_score_codex":0.000041607607,"about_ca_system_score_gemma":0.000012335082,"threshold_uncertainty_score":0.92064327},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776694,0.00010830963,0.71893156,0.00059726916,0.0014042765,0.00018506013,0.00069258414,0.00026063112,0.00015095023],"genre_scores_gemma":[0.99652064,0.000015676613,0.0007093776,0.00010313669,0.000075322896,0.00004203374,0.000097686905,0.000013343776,0.0024227712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981356,0.000088587294,0.00037278904,0.00054038345,0.00043353977,0.00042907312],"domain_scores_gemma":[0.99875164,0.000118064345,0.000115078714,0.0005652692,0.0001796104,0.00027034743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032185335,0.00025055194,0.00030329343,0.00011144082,0.0006774619,0.0002547004,0.00037815617,0.00016776418,0.0000118670305],"category_scores_gemma":[0.000011273024,0.0002241096,0.00017996073,0.000291509,0.000052179934,0.00023501612,0.00001135606,0.00045535652,0.000043704422],"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.0014648032,0.01509639,0.011812755,0.0012965796,0.0021026526,0.0008949707,0.009846733,0.6062235,0.25403246,0.00699133,0.034966618,0.055271193],"study_design_scores_gemma":[0.0023027824,0.00021531768,0.002921188,0.00013577567,0.00008206303,0.0006009526,0.00089935184,0.98291594,0.00019668975,0.000018324798,0.0090728095,0.0006388268],"about_ca_topic_score_codex":0.00027892875,"about_ca_topic_score_gemma":0.0005631948,"teacher_disagreement_score":0.71885127,"about_ca_system_score_codex":0.00007594431,"about_ca_system_score_gemma":0.000041042505,"threshold_uncertainty_score":0.9138924},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011808211,0.00066110224,0.98609555,0.00023168024,0.0004937478,0.00042762092,0.000041744126,0.00014581553,0.00009452336],"genre_scores_gemma":[0.9974515,0.000117294476,0.002072372,0.00005870672,0.0000489543,0.0001735459,0.0000126444065,0.000015804568,0.000049222584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808973,0.00017748708,0.00048425433,0.00055442814,0.00025758985,0.00043652873],"domain_scores_gemma":[0.9987889,0.00048084577,0.00015119476,0.0003267504,0.000075435186,0.00017686296],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033436142,0.00026004642,0.0003290389,0.0001499606,0.00031475993,0.0003020531,0.00024922492,0.00017525084,0.000008215272],"category_scores_gemma":[0.000007193562,0.00025769527,0.000052110117,0.000594082,0.000066400935,0.00034703474,0.0000051685274,0.00034408475,0.000005115657],"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.000011524946,0.00012865583,0.00016861208,0.000044210607,0.000015703381,0.00003383116,0.0001963766,0.9136798,0.000023471419,0.00042933965,0.00009500881,0.08517347],"study_design_scores_gemma":[0.0012423322,0.00008985666,0.00067386276,0.00021503717,0.000011626327,0.000046448655,0.00010017671,0.99726385,0.000017256985,0.000018358507,0.000048233946,0.0002729712],"about_ca_topic_score_codex":0.00014874211,"about_ca_topic_score_gemma":0.000043428085,"teacher_disagreement_score":0.98564327,"about_ca_system_score_codex":0.00008291468,"about_ca_system_score_gemma":0.000017423834,"threshold_uncertainty_score":0.99998754},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10360996,0.00041789157,0.8925747,0.00006484493,0.001671809,0.00082176476,0.00030966176,0.00045506633,0.0000742567],"genre_scores_gemma":[0.99725944,0.000018819837,0.0023350576,0.000039743092,0.000118686105,0.00007265992,0.00007495115,0.000031074887,0.00004956534],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959347,0.00044391034,0.0011504451,0.0009016648,0.00087055063,0.0006986918],"domain_scores_gemma":[0.99743885,0.00040586712,0.00056218967,0.0009116645,0.00031274182,0.0003686786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065926975,0.0005338703,0.0008569858,0.00028910305,0.00074784545,0.00023612354,0.00077486923,0.00031338382,0.0000020610607],"category_scores_gemma":[0.000018400171,0.00049280137,0.00027266843,0.00071754225,0.00015728417,0.00017811124,0.000013123194,0.0005243205,0.000035459932],"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.00008927774,0.00056498934,0.0002388893,0.00025767754,0.00012324553,0.00009298269,0.00023186758,0.99723196,0.000073353236,0.00044647715,0.00008803405,0.0005612599],"study_design_scores_gemma":[0.0016996231,0.0007156285,0.00018692853,0.00051677646,0.000032958404,0.0003982211,0.00011429353,0.99439913,0.00027234107,0.000007160838,0.0011128224,0.00054411095],"about_ca_topic_score_codex":0.0004202849,"about_ca_topic_score_gemma":0.0000072561807,"teacher_disagreement_score":0.89364946,"about_ca_system_score_codex":0.00014115052,"about_ca_system_score_gemma":0.00019908136,"threshold_uncertainty_score":0.99975234},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19339992,0.00018274525,0.8037513,0.00032563508,0.0012429896,0.00044105758,0.00041803473,0.00012941398,0.00010893245],"genre_scores_gemma":[0.99932677,0.000046213176,0.0002614976,0.000045568027,0.00004575273,0.00013205892,0.000020589134,0.000011431105,0.00011014924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.00010456039,0.00047698722,0.0006009632,0.00026122847,0.00040020334],"domain_scores_gemma":[0.99889266,0.00020083977,0.00012173728,0.0004486487,0.00008715433,0.0002489781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000328858,0.00026988046,0.0003832708,0.00016830156,0.00032788012,0.0004255706,0.00040342627,0.00021890852,0.0000036027275],"category_scores_gemma":[0.000015198583,0.0002410275,0.000057079338,0.0004447382,0.0001181162,0.00035756582,0.0000140731645,0.00042632618,0.000014028778],"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.0017456542,0.0051343464,0.014681325,0.0018996337,0.00053848844,0.0013572513,0.00756092,0.8342838,0.03234079,0.027038816,0.010737373,0.06268159],"study_design_scores_gemma":[0.003277511,0.00013905796,0.006704671,0.00016763179,0.000013263814,0.00037862838,0.00028498285,0.9844724,0.00020436382,0.0002216104,0.0035648705,0.00057099835],"about_ca_topic_score_codex":0.0008330481,"about_ca_topic_score_gemma":0.00063414284,"teacher_disagreement_score":0.8059268,"about_ca_system_score_codex":0.00002970551,"about_ca_system_score_gemma":0.000050232342,"threshold_uncertainty_score":0.9828816},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05920961,0.00021953072,0.9392779,0.0002465349,0.0002782222,0.000490564,0.000055783534,0.00009569315,0.00012614868],"genre_scores_gemma":[0.9975247,0.000041929725,0.0014944152,0.00006393167,0.000015725616,0.00014903863,0.00003094669,0.000008776962,0.0006705645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845624,0.00008683009,0.00032409048,0.0005810655,0.00019311091,0.0003586782],"domain_scores_gemma":[0.9992032,0.00009526114,0.00007872447,0.00046010915,0.000043805263,0.00011891083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028905997,0.00019132307,0.0002268011,0.00012856569,0.00013344691,0.000282157,0.00047994358,0.000065220534,0.0000024395824],"category_scores_gemma":[0.00000257414,0.00017209277,0.00003454689,0.00025886894,0.000030374966,0.000066426095,0.000033602533,0.00009860059,0.0000030126387],"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.00016462986,0.0004314159,0.00021960733,0.00033609176,0.0003281454,0.000034099463,0.000260758,0.88971585,0.00006322374,0.0017656325,0.008005603,0.09867497],"study_design_scores_gemma":[0.0012271394,0.00006380617,0.0014029247,0.00011923919,0.000019313225,0.000021092786,0.00011677887,0.99356544,0.000017275544,0.000019187295,0.003232643,0.00019515782],"about_ca_topic_score_codex":0.0010285437,"about_ca_topic_score_gemma":0.00005576104,"teacher_disagreement_score":0.93831503,"about_ca_system_score_codex":0.000105674924,"about_ca_system_score_gemma":0.000013250621,"threshold_uncertainty_score":0.70177394},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062429006,0.0006556606,0.98176646,0.0005467784,0.00087584514,0.0010864895,0.00810021,0.0007190432,0.0000066104235],"genre_scores_gemma":[0.99572957,0.000088631925,0.0030975332,0.000011519746,0.000034869263,0.00078182295,0.00011625926,0.000022193793,0.00011760122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757737,0.00013309781,0.00059833383,0.0007899966,0.0003029529,0.00059825316],"domain_scores_gemma":[0.9978812,0.00081460946,0.0002094531,0.0008168192,0.00012885581,0.000149111],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003324568,0.0003706288,0.0005428836,0.00024146507,0.00033824958,0.00024768867,0.0007105792,0.0002589393,0.0000016064265],"category_scores_gemma":[0.00008704906,0.00027592218,0.00010079834,0.0004883908,0.00014847975,0.0008641192,0.000014026565,0.00021924873,0.0000125492825],"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.00031863226,0.00046002195,0.0009585604,0.00043926205,0.00019487093,0.00010513635,0.00024592792,0.9655244,0.008903435,0.011551127,0.0034913428,0.007807336],"study_design_scores_gemma":[0.0121266665,0.0009218321,0.0019303972,0.0017270895,0.00009191773,0.00025674506,0.002190521,0.9385277,0.0033327602,0.0017993291,0.034659866,0.0024351755],"about_ca_topic_score_codex":0.00024972408,"about_ca_topic_score_gemma":0.00016117223,"teacher_disagreement_score":0.9894867,"about_ca_system_score_codex":0.00025227288,"about_ca_system_score_gemma":0.000055879347,"threshold_uncertainty_score":0.9999693},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009567573,0.00025643132,0.99568933,0.00017315733,0.0012209782,0.00030087787,0.000054400047,0.00032643994,0.0010216137],"genre_scores_gemma":[0.9970503,0.00003392769,0.0024252872,0.000028403767,0.000075174685,0.00009708112,0.000011156115,0.000008138004,0.00027053364],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890757,0.00012345288,0.00026751804,0.00023581402,0.00018582701,0.00027980882],"domain_scores_gemma":[0.9993415,0.00005474204,0.000089313784,0.00028713676,0.00005210481,0.00017521145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002496721,0.00015892021,0.00019661504,0.000091114685,0.0002209387,0.00015287867,0.00017565842,0.00010187209,0.0000058856153],"category_scores_gemma":[0.000001947064,0.00013429039,0.00005879032,0.00026390454,0.000022570297,0.0005732824,0.000002482546,0.0001207986,0.00003034541],"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.00009429548,0.0019001788,0.0040916046,0.0003890621,0.00057067646,0.000025538304,0.0055342405,0.08342167,0.0017537714,0.8463076,0.016571814,0.039339576],"study_design_scores_gemma":[0.0038611656,0.0011268553,0.014683425,0.0005650053,0.00016307035,0.0008320609,0.0016277344,0.8418064,0.0060792,0.003956897,0.12216936,0.0031288296],"about_ca_topic_score_codex":0.00010172493,"about_ca_topic_score_gemma":0.0000026253863,"teacher_disagreement_score":0.9960935,"about_ca_system_score_codex":0.00005407987,"about_ca_system_score_gemma":0.000014393455,"threshold_uncertainty_score":0.5476203},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.466451,0.0014771946,0.5301475,0.00011134846,0.00065580953,0.00088793616,0.000056170462,0.00020958504,0.000003472744],"genre_scores_gemma":[0.9973453,0.0009508245,0.00027181307,0.000014188479,0.00003808603,0.0013172464,0.000006179021,0.000014918215,0.000041437717],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788404,0.0002458517,0.0005605541,0.00065277715,0.00024506054,0.0004117474],"domain_scores_gemma":[0.9988914,0.00032577198,0.00015033376,0.000335989,0.00009642547,0.00020009407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056579825,0.0002787489,0.0003971122,0.00013495785,0.00027690173,0.00045497657,0.00015477075,0.00019803118,7.0360846e-7],"category_scores_gemma":[0.0000108768745,0.00019431191,0.00004830625,0.00031519553,0.00008994395,0.00084149843,0.00000797044,0.00013171499,0.0000029667087],"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.00086374744,0.002281151,0.15687144,0.0031985366,0.00067215314,0.00007942987,0.003994764,0.065695584,0.011010917,0.00029456045,0.00044079695,0.7545969],"study_design_scores_gemma":[0.007878189,0.00274406,0.01798655,0.00393085,0.00013535332,0.0005115495,0.0040636635,0.9569938,0.0024143192,0.000039755065,0.0014849027,0.0018169956],"about_ca_topic_score_codex":0.0003475078,"about_ca_topic_score_gemma":0.000053764466,"teacher_disagreement_score":0.89129823,"about_ca_system_score_codex":0.00011057305,"about_ca_system_score_gemma":0.000032969983,"threshold_uncertainty_score":0.792381},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07027896,0.0002439633,0.92745465,0.000018369552,0.0006961855,0.0002352895,0.0005741547,0.000100219266,0.0003982073],"genre_scores_gemma":[0.9994489,0.00009169226,0.0001097161,0.000004053361,0.00003687114,0.000046782017,0.00015907733,0.0000223772,0.000080537524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986925,0.000059452057,0.00052681693,0.00021798052,0.00028831392,0.00021493176],"domain_scores_gemma":[0.99914885,0.00007432894,0.00012706603,0.00034129573,0.00015595967,0.00015250583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019764123,0.00021392546,0.00055128965,0.00028388464,0.000055627585,0.000027898674,0.000114181355,0.00021465535,0.000010654566],"category_scores_gemma":[0.0000021435555,0.00020635751,0.00015620413,0.00081521383,0.00004963773,0.00014295743,8.8871514e-7,0.0001686399,0.0000071834997],"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.00005247972,0.000060258164,0.00002555244,0.000076391836,0.0008531961,0.000002136755,0.00016461394,0.99598277,0.0017964856,0.00035504825,0.00048912026,0.00014193373],"study_design_scores_gemma":[0.0007033143,0.00008923628,0.00024063514,0.00007609076,0.00057912455,0.0000068063136,0.00057190115,0.99522597,0.0021216231,0.00007615278,0.00007974365,0.00022940482],"about_ca_topic_score_codex":0.00028029206,"about_ca_topic_score_gemma":0.00012578377,"teacher_disagreement_score":0.92916995,"about_ca_system_score_codex":0.00008476274,"about_ca_system_score_gemma":0.00003536748,"threshold_uncertainty_score":0.8415015},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002271427,0.0008132553,0.9905474,0.0006161823,0.0009163408,0.00037032962,0.0038783613,0.00015955481,0.00042714766],"genre_scores_gemma":[0.9970429,0.00042539267,0.0010521226,0.00002484164,0.000034733708,0.00008163571,0.00007313472,0.000012563535,0.0012526676],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976891,0.00015918227,0.000686839,0.0006813769,0.0004226653,0.00036078083],"domain_scores_gemma":[0.99737775,0.00043906958,0.00025329887,0.0015022872,0.00021396803,0.00021360519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003819767,0.0002521564,0.0004307251,0.00012064572,0.00023464757,0.0001319785,0.00094983965,0.00012823792,0.000013152716],"category_scores_gemma":[0.000030123198,0.00017730809,0.00009536859,0.00039299272,0.00012538042,0.0007209007,0.000016871707,0.00010989419,0.000107617576],"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.0009818875,0.0075375712,0.001758465,0.0016849269,0.003532445,0.00023411677,0.0021102515,0.26403576,0.042160567,0.17856486,0.27222684,0.2251723],"study_design_scores_gemma":[0.013650145,0.0018169746,0.0030213194,0.002840752,0.00043129825,0.00046486722,0.0013719676,0.45483893,0.0034645468,0.0011231942,0.51368934,0.003286674],"about_ca_topic_score_codex":0.00020112851,"about_ca_topic_score_gemma":0.000052362528,"teacher_disagreement_score":0.9947715,"about_ca_system_score_codex":0.00005978379,"about_ca_system_score_gemma":0.00011370248,"threshold_uncertainty_score":0.7230414},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11167234,0.00014157403,0.8865586,0.00042473918,0.00079290976,0.00024517011,0.0000162937,0.0001258479,0.000022558632],"genre_scores_gemma":[0.9955019,0.000026109343,0.0038911165,0.0000397423,0.00004696402,0.000021614936,0.0000012890772,0.00001109278,0.00046017402],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821573,0.00014242569,0.00041751296,0.0005352528,0.00025622948,0.00043286887],"domain_scores_gemma":[0.9991765,0.00015081567,0.00010621852,0.00040690918,0.00001337137,0.00014620775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003590032,0.00022107683,0.00026442265,0.00013568859,0.00025039868,0.0001205389,0.00036707975,0.000093581184,0.0000019842498],"category_scores_gemma":[0.0000046801183,0.00013633278,0.00007693079,0.00027321253,0.00005425838,0.00003473768,0.00001451024,0.00016119411,0.000047625],"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.000018343013,0.0002184998,0.00039279545,0.000021412317,0.00003462611,0.00002925131,0.00016870776,0.96806985,0.00021501802,0.00021821632,0.000025347847,0.030587913],"study_design_scores_gemma":[0.001908701,0.00008660023,0.0016964203,0.0004092524,0.000009997627,0.000024636991,0.00012402411,0.9941105,0.00006606077,0.00003951579,0.0012216097,0.00030263508],"about_ca_topic_score_codex":0.000073189556,"about_ca_topic_score_gemma":0.000010957717,"teacher_disagreement_score":0.88382953,"about_ca_system_score_codex":0.000115469134,"about_ca_system_score_gemma":0.000014116093,"threshold_uncertainty_score":0.5559489},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038422495,0.00015476438,0.9930735,0.0007444005,0.00073951826,0.0009961618,0.0002846034,0.00011175019,0.000053053158],"genre_scores_gemma":[0.9894666,0.000007751464,0.009575372,0.00010015672,0.000057127105,0.00016473545,0.000114894436,0.00000914986,0.00050420983],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987572,0.00004373608,0.00030450313,0.00049715285,0.00017398191,0.00022346449],"domain_scores_gemma":[0.99853146,0.000386803,0.00009700516,0.0005171243,0.00028862155,0.00017900365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049620017,0.00014731514,0.00021560607,0.000079480815,0.00034915347,0.00029754464,0.0003463179,0.00006994696,4.201389e-7],"category_scores_gemma":[0.000070382455,0.00012129546,0.000040879593,0.00014134083,0.0000363974,0.000064928994,0.000015456166,0.000078259734,0.0000031637032],"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.00028951388,0.00019175302,0.00002397755,0.00011797148,0.00017286949,0.000008212779,0.001184009,0.8528675,0.00005757515,0.0047826204,0.027170096,0.1131339],"study_design_scores_gemma":[0.0013481671,0.00030904074,0.000020640713,0.00008193957,0.00003580441,0.000027159484,0.0007801948,0.9771301,0.000013268322,0.0003036053,0.019787392,0.000162657],"about_ca_topic_score_codex":0.00004337698,"about_ca_topic_score_gemma":0.000010155989,"teacher_disagreement_score":0.9856244,"about_ca_system_score_codex":0.000029377194,"about_ca_system_score_gemma":0.000056483048,"threshold_uncertainty_score":0.49462852},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091627546,0.00024633174,0.9059796,0.00026158316,0.0010151772,0.00033225276,0.00022556585,0.00028257442,0.000029383464],"genre_scores_gemma":[0.99781525,0.00026629743,0.0014255288,0.00001923258,0.00003380976,0.00017593164,0.000013122931,0.000009761934,0.00024106207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983308,0.00011093681,0.00046994028,0.0004695826,0.00027297484,0.00034581727],"domain_scores_gemma":[0.99894756,0.00021331637,0.00014302359,0.000432958,0.000107202824,0.0001559583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003278271,0.0002276495,0.0003027691,0.00009355609,0.00057630945,0.00017729787,0.00030404777,0.00013887901,0.000004383382],"category_scores_gemma":[0.000009253531,0.00015616693,0.0000753797,0.0002937687,0.000077071745,0.0008828641,0.0000044147896,0.00013384971,0.000053861895],"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.00041203026,0.0044515645,0.0785098,0.0015783992,0.00078418106,0.000025247686,0.003913982,0.5714553,0.015201056,0.0034456416,0.010980628,0.30924216],"study_design_scores_gemma":[0.004174434,0.00033985722,0.040804476,0.0008203212,0.000060706792,0.000116132534,0.00018939869,0.94681484,0.0023127678,0.0000443142,0.00335431,0.0009684217],"about_ca_topic_score_codex":0.00013526442,"about_ca_topic_score_gemma":0.000015261476,"teacher_disagreement_score":0.9061877,"about_ca_system_score_codex":0.0001260563,"about_ca_system_score_gemma":0.00004456537,"threshold_uncertainty_score":0.6368303},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047073096,0.00054378354,0.9486354,0.000047799807,0.0012168955,0.00040999294,0.00043912441,0.0004092219,0.0012246921],"genre_scores_gemma":[0.99870646,0.000086494685,0.00045949174,0.000009780558,0.00012347354,0.00029662007,0.000058054207,0.0000336682,0.00022598558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860185,0.000041818155,0.00030294675,0.00035092724,0.0003145641,0.00038788986],"domain_scores_gemma":[0.99908984,0.000038149316,0.000029282597,0.00028545994,0.00009584191,0.00046143885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018704678,0.00028740737,0.00032477756,0.00010281045,0.00013900077,0.0001567222,0.00011591552,0.00012252787,0.0000020492002],"category_scores_gemma":[0.000007561914,0.0002821434,0.000042944386,0.0003667452,0.000036681726,0.00015829835,0.000004686552,0.00018066751,0.000029763833],"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.000041941403,0.00006116054,0.00014362222,0.000099367455,0.00011703067,0.0000063432863,0.00019121818,0.9950584,0.00012658445,0.0000707566,0.0038191252,0.00026443668],"study_design_scores_gemma":[0.002771754,0.00021222705,0.0012824496,0.00021916885,0.0001729992,0.00009936415,0.0033255108,0.9606867,0.00083380734,0.000044504144,0.029329555,0.0010219986],"about_ca_topic_score_codex":0.00023859472,"about_ca_topic_score_gemma":0.000009056943,"teacher_disagreement_score":0.95163333,"about_ca_system_score_codex":0.00030394137,"about_ca_system_score_gemma":0.000023473602,"threshold_uncertainty_score":0.99996305},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011151629,0.00016165001,0.9943238,0.000107294785,0.0018729705,0.0014551185,0.00047247426,0.00040570402,0.00008583996],"genre_scores_gemma":[0.9761347,0.0000069964162,0.022598712,0.000047156947,0.0001111992,0.00054412126,0.000024003424,0.000027127648,0.00050595414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973147,0.00023122766,0.00072202104,0.0008489364,0.0003117669,0.0005713453],"domain_scores_gemma":[0.9982372,0.00035827656,0.00027808262,0.000538857,0.0003615387,0.00022607426],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006215557,0.00037209663,0.0005479417,0.00022764324,0.0006359143,0.00030520093,0.00037140687,0.00022617877,7.5604856e-7],"category_scores_gemma":[0.000012346361,0.0002673434,0.0002132005,0.0004123102,0.000067111665,0.00033785592,0.0000053908125,0.00017037116,0.000008056392],"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.000067435125,0.00019940994,0.000024764578,0.00015526343,0.000100805206,0.0000022665627,0.00027687533,0.9954167,0.00061483297,0.0021990794,0.00040958097,0.0005330062],"study_design_scores_gemma":[0.0026668091,0.00014666896,0.000019050702,0.00032345363,0.000020421789,0.000047334066,0.00046630637,0.99534786,0.000052762705,0.000012261761,0.00050998403,0.0003870702],"about_ca_topic_score_codex":0.00015127742,"about_ca_topic_score_gemma":0.000007572235,"teacher_disagreement_score":0.9750196,"about_ca_system_score_codex":0.00023807427,"about_ca_system_score_gemma":0.000093813695,"threshold_uncertainty_score":0.9999779},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004735766,0.00061918376,0.99118495,0.00047775212,0.0007981241,0.00060833065,0.00082000816,0.0006727037,0.00008318725],"genre_scores_gemma":[0.99749404,0.00009552193,0.0018697908,0.000015029901,0.000017223258,0.00030464062,0.000023733017,0.000016143105,0.00016388342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796265,0.00015632996,0.00049677835,0.0006206985,0.00033233702,0.0004312306],"domain_scores_gemma":[0.9985335,0.00034691728,0.00014511091,0.0007838381,0.00007126236,0.000119355085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027724466,0.00027913315,0.00037277985,0.00029515996,0.00018650427,0.00017121129,0.0005384982,0.00021440291,0.0000045381967],"category_scores_gemma":[0.0000145870445,0.0002097592,0.00006466981,0.00058351946,0.000108379085,0.0008846528,0.000003896522,0.00020215272,0.000052028976],"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.000086574626,0.00019335916,0.00007489424,0.00012737076,0.00003046425,0.00006543469,0.000082470215,0.9836034,0.0037200819,0.0027921689,0.00046168707,0.008762081],"study_design_scores_gemma":[0.006448933,0.00044403004,0.00054156437,0.0010228093,0.000036286223,0.00010669849,0.00043172002,0.9761853,0.0021678663,0.0005160701,0.0108837625,0.001214965],"about_ca_topic_score_codex":0.00013618227,"about_ca_topic_score_gemma":0.0000623813,"teacher_disagreement_score":0.9927583,"about_ca_system_score_codex":0.00019357514,"about_ca_system_score_gemma":0.00006166939,"threshold_uncertainty_score":0.85537314},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1569948,0.0005909299,0.8397097,0.00003158907,0.0012350408,0.0003923355,0.0008160346,0.00019616219,0.00003339291],"genre_scores_gemma":[0.9992489,0.000027752192,0.00047637246,0.000007459509,0.00004103409,0.000057232028,0.0000790653,0.0000124971075,0.0000496363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971223,0.00026427268,0.0009618722,0.00060420437,0.00061818765,0.00042919457],"domain_scores_gemma":[0.99786717,0.00016977589,0.00036229118,0.00083687657,0.0004051322,0.00035877788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008240384,0.00032346553,0.000896955,0.0003976173,0.00025551292,0.00022612834,0.00045566304,0.00023438108,0.000002497536],"category_scores_gemma":[0.000017516906,0.00026778868,0.00027155504,0.0020950781,0.00010377236,0.00051965687,0.000007640449,0.00021745694,0.000010022216],"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.000046666693,0.00016821033,0.0021134196,0.00016885153,0.00061114307,0.000007970193,0.00037873135,0.9958947,0.00009522541,0.0002122652,0.00010438288,0.00019845806],"study_design_scores_gemma":[0.0008505346,0.00012969997,0.0013227195,0.00014201703,0.00048458017,0.00005539802,0.00083320076,0.99556094,0.000073055955,0.0000187382,0.00020191478,0.0003272213],"about_ca_topic_score_codex":0.0018289057,"about_ca_topic_score_gemma":0.000026089036,"teacher_disagreement_score":0.84225416,"about_ca_system_score_codex":0.000224823,"about_ca_system_score_gemma":0.00015488603,"threshold_uncertainty_score":0.9999774},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016220214,0.00014476124,0.98129374,0.0012511124,0.000187503,0.0003892659,0.0002808527,0.00019755856,0.000034982448],"genre_scores_gemma":[0.9867032,0.0000134758275,0.012700862,0.00005875555,0.000034765748,0.00009086091,0.000030994248,0.000010628017,0.0003564152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988111,0.00008164249,0.00027983854,0.00034698576,0.00022247428,0.0002579118],"domain_scores_gemma":[0.99893844,0.0003349041,0.00011621295,0.0003797315,0.00012484276,0.00010589335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023151547,0.00016722642,0.00019284186,0.000088014465,0.00045069001,0.00012569925,0.00033283132,0.00006047427,0.0000012702363],"category_scores_gemma":[0.0000028914492,0.000108442124,0.000059502196,0.0002063353,0.000062970845,0.000044370274,0.000007177834,0.000084003084,0.000006339503],"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.000030449542,0.00014270625,0.000027668248,0.000029779683,0.00008456898,0.000002628169,0.00010107621,0.98059773,0.000032761618,0.0013675081,0.00039450134,0.017188627],"study_design_scores_gemma":[0.0015444062,0.00020474492,0.00017629893,0.00020324266,0.000027022661,0.00005658939,0.000115113166,0.9931186,0.000016551916,0.00026868584,0.0040472383,0.0002215465],"about_ca_topic_score_codex":0.000045900284,"about_ca_topic_score_gemma":0.000010491809,"teacher_disagreement_score":0.970483,"about_ca_system_score_codex":0.00006535504,"about_ca_system_score_gemma":0.00002798736,"threshold_uncertainty_score":0.44221413},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23638919,0.00013020648,0.7612626,0.00028603896,0.0012625213,0.00025179487,0.00004097106,0.00015870837,0.0002179816],"genre_scores_gemma":[0.9977493,0.000013012302,0.0016459874,0.000040389095,0.000102730584,0.000029732892,0.0000034063999,0.000014027047,0.0004013979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982402,0.000099765406,0.0003462954,0.00055969186,0.00034612717,0.00040794272],"domain_scores_gemma":[0.99833715,0.000060877213,0.00024658485,0.0010750202,0.0000699318,0.00021043427],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00025201013,0.00025452318,0.00031704715,0.00010438826,0.0017289611,0.0008293067,0.00086184154,0.000117340285,0.000003244673],"category_scores_gemma":[0.000006724526,0.00022208036,0.00013071139,0.00014224686,0.00010569454,0.00007720035,0.000024102217,0.00021549418,0.000025459438],"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.00001987262,0.00012774054,0.00026343187,0.000055468674,0.000075411735,0.000037272766,0.00023384426,0.9944403,0.00008948278,0.0012295956,0.0002197047,0.0032078484],"study_design_scores_gemma":[0.00090635015,0.00007986657,0.0012313011,0.00016345113,0.000039708677,0.000063240135,0.00015757165,0.99466383,0.000022479277,0.000055177166,0.002327109,0.00028989653],"about_ca_topic_score_codex":0.0004571829,"about_ca_topic_score_gemma":0.000025580122,"teacher_disagreement_score":0.7613601,"about_ca_system_score_codex":0.00009463975,"about_ca_system_score_gemma":0.000043069238,"threshold_uncertainty_score":0.99957067},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005808596,0.00013101131,0.992575,0.00043376628,0.00022575643,0.0005671148,0.000083555475,0.000114828115,0.000060404993],"genre_scores_gemma":[0.96898687,0.00019402761,0.03037811,0.000026536507,0.000027780432,0.00014924021,0.000016213624,0.000014696743,0.00020652615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983453,0.00013642067,0.00030390322,0.0005249115,0.00037950353,0.00030995288],"domain_scores_gemma":[0.9985701,0.000094066825,0.0001836443,0.00066374615,0.0002315904,0.0002568494],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00021327549,0.00022087253,0.00026188974,0.000073188254,0.0010708283,0.0011346469,0.00035763966,0.00010230083,0.000010051146],"category_scores_gemma":[0.000018852892,0.00018185056,0.000034627155,0.00012970169,0.00015707855,0.00072464655,0.000010987484,0.00016696536,0.000010639445],"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.0000840443,0.0000994851,0.000060188348,0.000018614171,0.00005311857,0.000022828446,0.00014566563,0.99631625,0.000021424283,0.00052014523,0.00002552564,0.0026327276],"study_design_scores_gemma":[0.0013671053,0.00025426046,0.00038960885,0.000035308713,0.000023444649,0.00008476938,0.0000685232,0.99725646,0.00021795534,0.000025608655,0.000054639975,0.00022231681],"about_ca_topic_score_codex":0.00016152121,"about_ca_topic_score_gemma":0.000025247038,"teacher_disagreement_score":0.9631783,"about_ca_system_score_codex":0.00004311927,"about_ca_system_score_gemma":0.0000520227,"threshold_uncertainty_score":0.99990225},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047520217,0.000085475986,0.989557,0.0004045666,0.0027275314,0.000589856,0.0013048728,0.00030097476,0.00027766346],"genre_scores_gemma":[0.99889493,0.00007702571,0.00051711715,0.00003549874,0.00007061285,0.00005956503,0.00027828867,0.000010744541,0.00005622342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972941,0.00026801298,0.0009543194,0.0004937342,0.0005104089,0.00047940496],"domain_scores_gemma":[0.9977619,0.00010404284,0.000538356,0.0010337005,0.0003134156,0.00024860943],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006898748,0.00035944048,0.0005179782,0.00021636958,0.0010354163,0.0023796828,0.0005393576,0.00029536925,0.0000029125113],"category_scores_gemma":[0.000046407185,0.00033062996,0.00012635406,0.00038313918,0.00010662597,0.0021437663,0.000012891096,0.00044467222,0.00003570088],"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.00014371393,0.00017868986,0.00010778099,0.0001357607,0.000075192496,0.000033065913,0.0003109638,0.92619926,0.00006444408,0.00552494,0.000756664,0.06646951],"study_design_scores_gemma":[0.001407623,0.00010575937,0.00380994,0.0002232047,0.000016797687,0.000081303835,0.00073274254,0.9908963,0.00007946541,0.0001501381,0.0020451006,0.0004516375],"about_ca_topic_score_codex":0.0030622752,"about_ca_topic_score_gemma":0.00016657292,"teacher_disagreement_score":0.9941429,"about_ca_system_score_codex":0.00024566526,"about_ca_system_score_gemma":0.00007991525,"threshold_uncertainty_score":0.9999146},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024545752,0.00018470216,0.99498934,0.00022301546,0.0005532744,0.0004021085,0.0009867029,0.00012578839,0.0000805136],"genre_scores_gemma":[0.99557865,0.00003748251,0.0040119183,0.000028084401,0.000027277174,0.000058566653,0.000092770184,0.000013425207,0.00015182582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839765,0.000055510052,0.00028224575,0.0006025385,0.00024185979,0.0004202048],"domain_scores_gemma":[0.9980755,0.00009337427,0.00022306945,0.0013067507,0.00011803158,0.00018331391],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00042178482,0.0002267755,0.00032089488,0.00011397026,0.0017531943,0.0008751891,0.0011751213,0.00009281411,0.0000015278138],"category_scores_gemma":[0.000007651618,0.00018279826,0.000064408436,0.00025439568,0.00009599673,0.0009120394,0.00001416639,0.00017613516,0.0000045957713],"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.0019426238,0.006657136,0.004545533,0.0027207334,0.0020563689,0.0003057203,0.0042223674,0.816183,0.00041638748,0.07407738,0.0054666656,0.081406094],"study_design_scores_gemma":[0.0023846424,0.00018272283,0.0004008893,0.00019012463,0.000100722435,0.000060046932,0.0003290993,0.9935406,0.000050962062,0.00095571927,0.0014556721,0.00034883711],"about_ca_topic_score_codex":0.000031442367,"about_ca_topic_score_gemma":0.000045864723,"teacher_disagreement_score":0.99312407,"about_ca_system_score_codex":0.000018266073,"about_ca_system_score_gemma":0.000063023035,"threshold_uncertainty_score":0.9995464},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17451894,0.0002243767,0.82171786,0.0006421542,0.0006881838,0.00042094148,0.0015374786,0.00019414273,0.000055892502],"genre_scores_gemma":[0.99897313,0.000023426917,0.0005231674,0.0000409954,0.000058739195,0.000027237693,0.00010761676,0.000012781852,0.00023291756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977799,0.00009898418,0.00038211962,0.00086130836,0.00034162597,0.0005360582],"domain_scores_gemma":[0.99741715,0.000102823185,0.00023403819,0.0019034005,0.00007173832,0.0002708606],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00057089,0.00028673778,0.00034297796,0.000058340232,0.0019417127,0.0012476055,0.0013930274,0.000115336166,0.0000020390426],"category_scores_gemma":[0.00001804005,0.00025340222,0.00006424461,0.00013531675,0.0002184675,0.00007944544,0.0001146968,0.00025568545,0.00003692596],"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.000033672684,0.00016686438,0.0000631219,0.000055665667,0.00010372838,0.000030569397,0.00020067528,0.9926747,0.0000745667,0.000088302586,0.0005092249,0.0059989057],"study_design_scores_gemma":[0.001220947,0.000060247294,0.0009497413,0.00013844848,0.000032981992,0.000054419404,0.00021221627,0.9935448,0.000014972029,0.0000069979988,0.003466197,0.00029800917],"about_ca_topic_score_codex":0.0003706696,"about_ca_topic_score_gemma":0.000017390195,"teacher_disagreement_score":0.8244542,"about_ca_system_score_codex":0.000058774574,"about_ca_system_score_gemma":0.00002645811,"threshold_uncertainty_score":0.99999183},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3120004,0.000051022605,0.6866464,0.0001831524,0.00041979388,0.00026561276,0.0000091698685,0.00017294123,0.00025147572],"genre_scores_gemma":[0.99897027,0.000006263074,0.00044440266,0.000039044495,0.000079316545,0.00005471215,0.0000037915302,0.000009481318,0.0003927347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854577,0.00007407761,0.00025759733,0.00044416002,0.00034709225,0.00033132258],"domain_scores_gemma":[0.9992155,0.00004609062,0.00009160104,0.0004064391,0.00009995068,0.00014044589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020896454,0.00020179228,0.00019828136,0.00013549278,0.00053139025,0.0001929257,0.00030820238,0.00006693028,0.0000039272386],"category_scores_gemma":[0.0000010701791,0.00014993052,0.000044748533,0.0006060729,0.00009504937,0.000020763948,0.000004782681,0.00013069001,0.00004068341],"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.00005108969,0.00019870387,0.00006527105,0.00005386211,0.00004613327,0.0000048037523,0.00040180524,0.990737,0.000016546895,0.0004602916,0.00015025926,0.007814197],"study_design_scores_gemma":[0.00093291566,0.0004486405,0.0012177764,0.00009815149,0.000026171667,0.000053790805,0.00017468352,0.9956526,0.000092485076,0.0000048752618,0.0010674696,0.00023040602],"about_ca_topic_score_codex":0.000067386456,"about_ca_topic_score_gemma":0.000007145536,"teacher_disagreement_score":0.6869699,"about_ca_system_score_codex":0.00006990127,"about_ca_system_score_gemma":0.00003503303,"threshold_uncertainty_score":0.61139894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068684355,0.0002477687,0.98871875,0.0010108134,0.0010109126,0.0007927871,0.00038445526,0.0008686889,0.0000974197],"genre_scores_gemma":[0.9656254,0.000015043747,0.03307572,0.00011667328,0.00009727763,0.0006362889,0.000010741096,0.000017320888,0.00040552183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806625,0.000034479555,0.00042299065,0.00063140853,0.00028715108,0.000557714],"domain_scores_gemma":[0.9985175,0.00021242847,0.00011934753,0.0007283817,0.0002200777,0.00020222632],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003639156,0.00031069812,0.00049165153,0.00022253928,0.0005120869,0.00034010227,0.0007542133,0.0001915913,0.000005347624],"category_scores_gemma":[0.00002478897,0.00025063608,0.00018133837,0.0007003673,0.000105323285,0.00039386706,0.0000113813485,0.00018139878,0.00004379007],"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.0009386478,0.0016643384,0.00014515407,0.0006266426,0.007188435,0.00010059911,0.0024363522,0.6528215,0.016594438,0.096335754,0.09613133,0.12501684],"study_design_scores_gemma":[0.0033781796,0.0024593824,0.00021502574,0.00019564296,0.0009690396,0.0003326187,0.00058389094,0.82288384,0.009020963,0.006321722,0.15173665,0.0019030262],"about_ca_topic_score_codex":0.00011715501,"about_ca_topic_score_gemma":0.00004588873,"teacher_disagreement_score":0.958757,"about_ca_system_score_codex":0.000082059545,"about_ca_system_score_gemma":0.000046026766,"threshold_uncertainty_score":0.9999946},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038126016,0.00031100956,0.99263376,0.00013173686,0.0012595009,0.00046759294,0.0001187117,0.0007935754,0.00047153168],"genre_scores_gemma":[0.9960289,0.000025560345,0.0029494613,0.000062570296,0.00010944163,0.0002910716,0.000008253698,0.00001945266,0.00050530984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977542,0.00022509905,0.00048708267,0.0007198912,0.0003797215,0.00043398025],"domain_scores_gemma":[0.99836797,0.00013657096,0.00014531137,0.0008979455,0.00023393567,0.00021827276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036656472,0.0002941035,0.00033711543,0.0001882984,0.00042612274,0.00025562465,0.00051077077,0.00016967396,0.000007313726],"category_scores_gemma":[0.000008503591,0.00025572535,0.00009627229,0.00050472765,0.00015437786,0.00022097313,0.00000649695,0.0001670059,0.00008755344],"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.0011525796,0.007641988,0.0013228529,0.0013354317,0.0019434036,0.0003879374,0.008851389,0.5239472,0.08099024,0.123098105,0.11847921,0.1308497],"study_design_scores_gemma":[0.0010793622,0.0004953707,0.000099390876,0.0001799223,0.000033334007,0.00023081708,0.00014250845,0.961034,0.016375698,0.00024854264,0.019351866,0.000729211],"about_ca_topic_score_codex":0.0004130395,"about_ca_topic_score_gemma":0.00004131159,"teacher_disagreement_score":0.9922163,"about_ca_system_score_codex":0.00009172908,"about_ca_system_score_gemma":0.00006651117,"threshold_uncertainty_score":0.9999895},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007088941,0.00008661857,0.98642987,0.00044344005,0.0034038487,0.00091716216,0.0012095538,0.00020579307,0.00021476338],"genre_scores_gemma":[0.9960146,0.000007832035,0.0025162736,0.00015998649,0.00064391753,0.00018844468,0.00015189598,0.00001758336,0.0002994518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753827,0.00021192046,0.0005459397,0.0008761119,0.00026532423,0.0005624355],"domain_scores_gemma":[0.9981547,0.00013159701,0.00013243889,0.0011987517,0.00017536561,0.00020713713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066329446,0.00029367264,0.00038844734,0.00007620599,0.0006808884,0.0004241073,0.0007732687,0.00017272093,0.000017888868],"category_scores_gemma":[0.000005815027,0.00023530932,0.00011106791,0.00032667644,0.000113464164,0.000417516,0.000022291082,0.00019880559,0.00003845758],"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.0023924487,0.001830929,0.0041335644,0.0009133784,0.0014731998,0.000034875236,0.0016405417,0.71102214,0.00065859675,0.008447141,0.2446009,0.022852296],"study_design_scores_gemma":[0.002232895,0.0006756337,0.0003195624,0.00021258951,0.000046446985,0.00018636895,0.00009275429,0.9344083,0.00011444826,0.00036085615,0.06081812,0.0005319894],"about_ca_topic_score_codex":0.00024384791,"about_ca_topic_score_gemma":0.00023852507,"teacher_disagreement_score":0.9889257,"about_ca_system_score_codex":0.00007955854,"about_ca_system_score_gemma":0.000039543105,"threshold_uncertainty_score":0.95956355},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06414972,0.0004357963,0.9323136,0.00017236247,0.0008821434,0.0003388622,0.0013292076,0.00027550088,0.00010277833],"genre_scores_gemma":[0.9977772,0.00013214943,0.0017048186,0.00004792418,0.00007995658,0.000093608855,0.00014250974,0.000011120511,0.00001069719],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772185,0.00022321237,0.00052497274,0.00066258886,0.0003513386,0.000516019],"domain_scores_gemma":[0.9986728,0.00017723355,0.00012558227,0.00066107675,0.00014417862,0.00021916023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037672563,0.00031024675,0.00038704797,0.00028872283,0.00049011735,0.00036035676,0.0005203162,0.00019266093,0.000014610718],"category_scores_gemma":[0.000018551995,0.00028522502,0.00009742384,0.0013164997,0.00022159505,0.0007014666,0.000010611221,0.00031399343,0.0000307079],"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.0024337228,0.0062278085,0.011927085,0.0012129927,0.0012028969,0.0005651814,0.021171622,0.3641956,0.0073205945,0.55090594,0.0148364995,0.018000072],"study_design_scores_gemma":[0.012147185,0.0027775252,0.02780837,0.0012069951,0.00022140262,0.0004958676,0.0072923996,0.853414,0.005461415,0.0124324355,0.07216166,0.0045807743],"about_ca_topic_score_codex":0.00081556273,"about_ca_topic_score_gemma":0.00040212157,"teacher_disagreement_score":0.9336275,"about_ca_system_score_codex":0.00007736809,"about_ca_system_score_gemma":0.00007172973,"threshold_uncertainty_score":0.99996},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002877724,0.0007705959,0.9937147,0.0006683874,0.00087967893,0.0008298762,0.00007707865,0.000112434805,0.00006951953],"genre_scores_gemma":[0.99175787,0.0001759427,0.0070980806,0.00009871229,0.0000596769,0.00023084648,0.00001084424,0.000010747861,0.00055726944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988973,0.000080885926,0.00023977937,0.00037946546,0.0001569131,0.0002456507],"domain_scores_gemma":[0.9987666,0.0006054364,0.000109585846,0.00031823723,0.00010655209,0.000093585084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023962498,0.00018314614,0.00025186015,0.000049820723,0.00051277975,0.00046976624,0.00022516352,0.00013191729,0.000005754503],"category_scores_gemma":[0.0000067696506,0.00012288618,0.000060880768,0.0002869201,0.00005461529,0.000282492,0.0000034177194,0.00018631534,0.000011730179],"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.00029840384,0.00012726641,0.00010047726,0.00014707423,0.00017445917,0.0000028780662,0.0014565396,0.9643937,0.000061986524,0.022515565,0.0010991837,0.009622464],"study_design_scores_gemma":[0.001515792,0.00014175674,0.00008149511,0.0001098284,0.000042942647,0.000024625511,0.00035225818,0.9936381,0.000078341924,0.0011026866,0.0026723172,0.00023986706],"about_ca_topic_score_codex":0.000034235683,"about_ca_topic_score_gemma":0.0000079882975,"teacher_disagreement_score":0.98888016,"about_ca_system_score_codex":0.000027576441,"about_ca_system_score_gemma":0.00004298639,"threshold_uncertainty_score":0.5011153},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016397808,0.00014726992,0.9800664,0.0012804149,0.0006181389,0.0010926713,0.000040942286,0.00032143336,0.00003492993],"genre_scores_gemma":[0.9968865,0.000015359738,0.0025670314,0.000073628195,0.00004166435,0.00028109693,0.000039612503,0.000012554794,0.00008258771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983489,0.00010950132,0.00043080552,0.0005681253,0.00016100118,0.00038167706],"domain_scores_gemma":[0.99895155,0.00017340956,0.00015205218,0.0005355041,0.00009172971,0.00009576387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006130421,0.00019875223,0.00028109047,0.00021855744,0.0003141998,0.00014148648,0.0003916061,0.0003012497,0.000002230515],"category_scores_gemma":[0.0000051786697,0.00020214613,0.00007266379,0.00064887607,0.000042642172,0.000109711036,0.0000071728746,0.00030235338,0.000009747061],"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.000025498603,0.00018495134,0.000039085015,0.000041132687,0.000028775677,9.038415e-7,0.00012130938,0.8884976,0.00014997115,0.10536686,0.0001810477,0.005362859],"study_design_scores_gemma":[0.00090465765,0.00012700802,0.000083519626,0.000040022584,0.000008345667,0.000027590002,0.00025848323,0.9941735,0.00008282853,0.0021865116,0.0018881347,0.00021939435],"about_ca_topic_score_codex":0.00007608691,"about_ca_topic_score_gemma":0.00004085155,"teacher_disagreement_score":0.98048866,"about_ca_system_score_codex":0.00009939872,"about_ca_system_score_gemma":0.000033522876,"threshold_uncertainty_score":0.824328},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013416991,0.00019760462,0.98476815,0.00017454928,0.00037643837,0.00025704154,0.00006761353,0.0004929867,0.00024861025],"genre_scores_gemma":[0.9980294,0.000076511606,0.0012044925,0.00015416881,0.000025471685,0.00007058261,0.000028049682,0.000015361487,0.00039596367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841774,0.00012322619,0.00034451694,0.0005621995,0.0002464067,0.0003059176],"domain_scores_gemma":[0.9991247,0.00010661574,0.00013840123,0.00037662566,0.00009282668,0.00016082726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012804999,0.00025076646,0.0002922236,0.00014117765,0.00030356657,0.00033740775,0.00023869329,0.00014165194,0.0000049921036],"category_scores_gemma":[0.0000028004183,0.00023158232,0.00006189993,0.00026684924,0.000044381784,0.00023372936,0.0000070066026,0.00013090954,0.000014020306],"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.00005245672,0.00017560774,0.000054219396,0.00007387517,0.000044456072,0.000010101265,0.00017661435,0.9951832,0.00015974978,0.0007823327,0.00035639596,0.002930942],"study_design_scores_gemma":[0.00080306194,0.00055570394,0.000031168434,0.00020638239,0.0000147977225,0.00011977757,0.00005653713,0.994676,0.0010892968,0.00017518854,0.0018839847,0.00038809178],"about_ca_topic_score_codex":0.00006559216,"about_ca_topic_score_gemma":0.000011448101,"teacher_disagreement_score":0.9846124,"about_ca_system_score_codex":0.000053198197,"about_ca_system_score_gemma":0.000028713912,"threshold_uncertainty_score":0.9443653},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016377266,0.0007237698,0.9784916,0.00017167357,0.0029875622,0.0003635868,0.000078599565,0.00034389403,0.00046201932],"genre_scores_gemma":[0.9979522,0.000053547228,0.000052939187,0.00003439522,0.000050737293,0.000059623493,0.000009508862,0.000009088104,0.0017779656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854076,0.00019234956,0.0002995149,0.00035745406,0.0002601713,0.00034973398],"domain_scores_gemma":[0.99890405,0.00020951059,0.00009361823,0.00058409414,0.00008703062,0.000121712605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036755353,0.00018992773,0.00023550261,0.000030997635,0.0005792649,0.00046999461,0.00043076283,0.00009147982,0.00000215176],"category_scores_gemma":[0.0000017174318,0.00012575052,0.000105764346,0.00029814168,0.000034798257,0.000192256,0.0000036366146,0.00025516222,0.00014489073],"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.0000774798,0.000050865776,0.000102149126,0.0000546616,0.00011514565,0.000019074649,0.000068704794,0.9792952,0.00014504656,0.014812601,0.002847545,0.002411509],"study_design_scores_gemma":[0.00062035804,0.00012201961,0.00013817596,0.00014021584,0.000019055968,0.000097780285,0.0005011405,0.98933196,0.000007662234,0.000021644933,0.008772622,0.00022738936],"about_ca_topic_score_codex":0.00031280553,"about_ca_topic_score_gemma":0.000024050301,"teacher_disagreement_score":0.98157495,"about_ca_system_score_codex":0.000091817994,"about_ca_system_score_gemma":0.000045669327,"threshold_uncertainty_score":0.51279575},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06270252,0.0005016247,0.9323659,0.0001420162,0.00059617066,0.00048262472,0.0028752433,0.00026346117,0.00007047106],"genre_scores_gemma":[0.9975164,0.00030227785,0.0014822801,0.00005651805,0.000021531947,0.00008182538,0.0005180592,0.000011269935,0.000009826193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976352,0.00018045794,0.00055390876,0.00074951374,0.00036794582,0.000513009],"domain_scores_gemma":[0.9984665,0.00023682232,0.00012538381,0.00085770374,0.00008524704,0.00022833946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034888514,0.000319621,0.00043518798,0.0003532015,0.00024103245,0.0003193667,0.0005142692,0.0001411745,0.000024824747],"category_scores_gemma":[0.000011037755,0.0002958547,0.00013586553,0.001291944,0.00010914167,0.0009073781,0.00001343329,0.00039581992,0.000035383884],"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.0017977634,0.0054666824,0.05616819,0.0018215647,0.00094705226,0.0005305224,0.0030531802,0.48597586,0.0070742792,0.42166305,0.0028015154,0.012700325],"study_design_scores_gemma":[0.02126265,0.002371645,0.072951294,0.0026924112,0.00028957843,0.0006804801,0.008169919,0.784205,0.002067577,0.008321778,0.08996223,0.0070253876],"about_ca_topic_score_codex":0.0008988211,"about_ca_topic_score_gemma":0.00025808555,"teacher_disagreement_score":0.9348139,"about_ca_system_score_codex":0.000039331106,"about_ca_system_score_gemma":0.000058850655,"threshold_uncertainty_score":0.99994934},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122713335,0.0001522944,0.8717832,0.00010879285,0.0023408215,0.0004485363,0.000049441867,0.00014126401,0.0022622887],"genre_scores_gemma":[0.9989037,0.000027340911,0.00035146024,0.000047918962,0.00005075584,0.000042416475,0.000008966388,0.000009339248,0.0005581144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817675,0.00016597213,0.00055693794,0.00051609904,0.00021283154,0.00037138874],"domain_scores_gemma":[0.9991766,0.00007557187,0.00016019844,0.00038758636,0.0000855776,0.00011446032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041377777,0.00022192307,0.00035799135,0.00012883623,0.00020277973,0.0003821572,0.0002548984,0.00017410863,0.000026582054],"category_scores_gemma":[0.0000033621295,0.00021294705,0.00008733521,0.0005525406,0.00001969887,0.00068174285,0.0000021955912,0.00022053052,0.00007908967],"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.000050710027,0.00007909849,0.0011307542,0.00008166936,0.000035130197,0.0000072937837,0.00015792174,0.9915562,0.001069358,0.0039313924,0.00015116172,0.0017492669],"study_design_scores_gemma":[0.0010481265,0.00015644926,0.0008395916,0.00036708757,0.000010037045,0.00021124541,0.00037769755,0.9946342,0.00017848966,0.00011638684,0.0016865166,0.00037416248],"about_ca_topic_score_codex":0.001161154,"about_ca_topic_score_gemma":0.00011119305,"teacher_disagreement_score":0.87619036,"about_ca_system_score_codex":0.00024811132,"about_ca_system_score_gemma":0.000059362632,"threshold_uncertainty_score":0.8683729},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039296565,0.0007462425,0.9865999,0.0016850285,0.00046941964,0.0006266147,0.0056885867,0.00023217627,0.000022373657],"genre_scores_gemma":[0.9982015,0.00011130963,0.0008389521,0.00019625707,0.00008907132,0.00011714588,0.0003198162,0.000011744688,0.000114241695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.000095254356,0.00034474925,0.0008236875,0.0002327874,0.00031613608],"domain_scores_gemma":[0.9986136,0.00019331207,0.00011079607,0.00069379923,0.00009654713,0.00029192877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002679611,0.00023490662,0.00033661764,0.000043824577,0.000419394,0.00029752552,0.00051712507,0.00010099269,0.0000026844564],"category_scores_gemma":[0.00001597108,0.00021601426,0.000061190796,0.00022358635,0.000056605626,0.00037211354,0.000022637527,0.00019093657,0.000008968303],"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.0025991919,0.0009837196,0.00016333188,0.0007643907,0.001196787,0.000096445205,0.0013286893,0.83847094,0.0029523068,0.008772136,0.1304738,0.012198257],"study_design_scores_gemma":[0.0016195781,0.0004775802,0.000046527573,0.00006293242,0.00006975444,0.00003456832,0.00047363172,0.98520225,0.00005944565,0.000042648593,0.011591132,0.00031992578],"about_ca_topic_score_codex":0.00020138231,"about_ca_topic_score_gemma":0.000012816062,"teacher_disagreement_score":0.9942718,"about_ca_system_score_codex":0.000044642078,"about_ca_system_score_gemma":0.000054280383,"threshold_uncertainty_score":0.8808806},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09858883,0.00032891327,0.89757025,0.00080344215,0.0002657459,0.0015253488,0.0003928893,0.00034481304,0.0001797571],"genre_scores_gemma":[0.9928441,0.0001394761,0.0055772946,0.00012870792,0.00019459797,0.00047576646,0.000038152823,0.000044627603,0.0005572588],"study_design_codex":"randomized_trial","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980691,0.00028823037,0.00049024285,0.00054949225,0.00029277286,0.00031015993],"domain_scores_gemma":[0.99885786,0.00025220428,0.00018172279,0.00027026876,0.00010656178,0.00033137097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034019572,0.0003494232,0.0005984936,0.00006898858,0.00034568083,0.0001644833,0.000094718205,0.00024391936,0.00002118103],"category_scores_gemma":[0.00004391128,0.0002651496,0.000098876604,0.00031187976,0.00005818995,0.00013273089,0.000002747908,0.0003675033,5.2225744e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.26032645,0.010589439,0.00094728655,0.051179275,0.011493603,0.0011855769,0.04378587,0.24018896,0.02812718,0.026139315,0.24711446,0.07892259],"study_design_scores_gemma":[0.19179222,0.016050713,0.00022875788,0.0023316843,0.0027830543,0.0016139208,0.010982598,0.7051391,0.0013281609,0.0008779297,0.06158891,0.005282986],"about_ca_topic_score_codex":0.000051809104,"about_ca_topic_score_gemma":0.000055901983,"teacher_disagreement_score":0.8942553,"about_ca_system_score_codex":0.000047340378,"about_ca_system_score_gemma":0.000047920334,"threshold_uncertainty_score":0.9999801},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38363457,0.000025352769,0.6141145,0.00043009064,0.00011519953,0.0008173862,0.0006980179,0.00014906829,0.000015776915],"genre_scores_gemma":[0.9908754,0.0000139993135,0.008534895,0.00012969869,0.00012871901,0.00020757584,0.000051391107,0.00002971366,0.00002855722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986119,0.000041749492,0.0003979983,0.0004858597,0.0001925905,0.00026988404],"domain_scores_gemma":[0.9988935,0.00034354496,0.00015291835,0.0002573999,0.0001035248,0.00024912885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013143409,0.0002536275,0.0003606481,0.000052636547,0.00047167967,0.00009835776,0.00010493393,0.00011280328,0.0000064207143],"category_scores_gemma":[0.00001778168,0.0002197932,0.000060948423,0.00019621801,0.00006882259,0.00007809139,0.0000021383732,0.0002581595,0.000014965973],"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.0021327464,0.0016814597,0.000065318505,0.0007966026,0.00028260812,0.00000672918,0.0023560445,0.854228,0.001206283,0.13207543,0.0011431421,0.004025598],"study_design_scores_gemma":[0.0022935066,0.0014875937,0.0011326494,0.00035300423,0.00016504941,0.000046330675,0.0014186358,0.9888932,0.0011680174,0.0019397425,0.0004801159,0.00062214234],"about_ca_topic_score_codex":0.00001797719,"about_ca_topic_score_gemma":0.0000023850841,"teacher_disagreement_score":0.60724086,"about_ca_system_score_codex":0.000044275625,"about_ca_system_score_gemma":0.000020697262,"threshold_uncertainty_score":0.89629066},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014604319,0.0003737917,0.97593784,0.0063220905,0.00031202612,0.00067018927,0.00046408636,0.0012948544,0.000020772131],"genre_scores_gemma":[0.9904319,0.00004377667,0.009174752,0.00005455819,0.000031673157,0.0001896962,0.000033090768,0.000017548922,0.000023018496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826705,0.00012686868,0.00036699182,0.00066977076,0.00020596554,0.00036336618],"domain_scores_gemma":[0.99842405,0.00019253622,0.000137841,0.0009710531,0.00007615831,0.00019838358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024070441,0.000257937,0.00036088622,0.0000850302,0.00055579294,0.00043995658,0.0020981287,0.00019835996,8.8965703e-7],"category_scores_gemma":[0.00029797317,0.00023492075,0.00005879832,0.0004409988,0.000069410475,0.0002025821,0.00023613354,0.0003428897,0.0000074136415],"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.0013421032,0.00068359816,0.0008890326,0.008264794,0.0017357313,0.00033786168,0.002385649,0.83361745,0.020042643,0.021067666,0.079796284,0.0298372],"study_design_scores_gemma":[0.0010348517,0.00027990935,0.000014943616,0.00014101616,0.000025382622,0.00006686941,0.00042405177,0.9946303,0.00077215326,0.00026340203,0.002062049,0.00028508753],"about_ca_topic_score_codex":0.000043335058,"about_ca_topic_score_gemma":0.000004519058,"teacher_disagreement_score":0.9758276,"about_ca_system_score_codex":0.000056723038,"about_ca_system_score_gemma":0.000033283224,"threshold_uncertainty_score":0.957979},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11580939,0.00025956848,0.87987196,0.0013211617,0.00014830627,0.0004804489,0.0018636613,0.00021698029,0.00002851175],"genre_scores_gemma":[0.997615,0.000049462382,0.0019557807,0.00009050625,0.000028377897,0.00006231983,0.00018525003,0.000011823589,0.0000014888193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975544,0.0002613152,0.00042093222,0.0007521297,0.0005074225,0.00050378963],"domain_scores_gemma":[0.99859524,0.00017892125,0.0000849424,0.0006608046,0.00009843089,0.00038168553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003174962,0.00030371308,0.00039877638,0.0001392412,0.00034370366,0.00037356795,0.0008428679,0.00013592339,0.000009839694],"category_scores_gemma":[0.000016697195,0.00025448902,0.000088989225,0.0012609849,0.00011328425,0.00039372031,0.00003087045,0.00048970914,0.000011202167],"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.00028585098,0.00045081825,0.0015618704,0.0001902654,0.00007492805,0.00007538408,0.0015948856,0.98890996,0.00016693995,0.0058705257,0.00056539004,0.0002531614],"study_design_scores_gemma":[0.0018374949,0.00033987436,0.0047377627,0.00013475431,0.00002677293,0.000030420058,0.0007437681,0.98972183,0.00032321812,0.00013491111,0.0014928826,0.0004763257],"about_ca_topic_score_codex":0.0005620381,"about_ca_topic_score_gemma":0.00009440525,"teacher_disagreement_score":0.8818056,"about_ca_system_score_codex":0.00006207119,"about_ca_system_score_gemma":0.000082123595,"threshold_uncertainty_score":0.99999076},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020727094,0.00026871043,0.99579716,0.00044515613,0.0001991022,0.0004563772,0.0001262927,0.0004898577,0.0001446511],"genre_scores_gemma":[0.9852994,0.000019907691,0.014370989,0.00010836255,0.000028393242,0.00009742515,0.00003200469,0.000014728207,0.000028803384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982949,0.00016048168,0.0004876715,0.00046221886,0.00033201126,0.00026275558],"domain_scores_gemma":[0.9988652,0.000107407956,0.00024438213,0.00036343266,0.00019377962,0.00022579262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020335283,0.0002344266,0.00040642126,0.0000991853,0.00025866352,0.00024914776,0.0003812698,0.000112329864,0.0000026834366],"category_scores_gemma":[0.00000788295,0.00020001877,0.000070185844,0.0005606947,0.000078178186,0.00024110734,0.000004501292,0.00019974033,0.000009335372],"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.00006837818,0.000082097264,0.00006667381,0.00012404128,0.0000457243,0.0000074460895,0.00012811758,0.9979714,0.00014183701,0.0009944575,0.0002464502,0.00012337763],"study_design_scores_gemma":[0.00093546306,0.0004140486,0.0000325883,0.00021387542,0.00002611759,0.000017309518,0.00010292382,0.9969391,0.00060310203,0.00001166405,0.0004494979,0.0002542768],"about_ca_topic_score_codex":0.000108758686,"about_ca_topic_score_gemma":0.0000029985922,"teacher_disagreement_score":0.98322666,"about_ca_system_score_codex":0.00003178678,"about_ca_system_score_gemma":0.00010676348,"threshold_uncertainty_score":0.81565285},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028321357,0.0020544638,0.99329877,0.00047798577,0.0005874378,0.00040430625,0.00014572094,0.00016309986,0.000036073696],"genre_scores_gemma":[0.9963325,0.0000802369,0.003125447,0.0000761319,0.00010440909,0.00007153331,0.000010406394,0.000010546753,0.00018876037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822474,0.0002043602,0.0003742393,0.0004650694,0.0004108106,0.00032076208],"domain_scores_gemma":[0.9991242,0.00009616056,0.00011329995,0.0003003481,0.00021177858,0.00015417104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035723596,0.00023750059,0.00029119308,0.00010109907,0.0004331574,0.00031278405,0.00016274658,0.00011699211,0.0000043344867],"category_scores_gemma":[0.0000034942457,0.00021678723,0.0000664008,0.00028955648,0.00008247036,0.00032403672,0.0000031099048,0.00016917076,0.000007036303],"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.000088521694,0.00016322538,0.000021767059,0.00002763891,0.00008932776,0.00005961238,0.000074775286,0.97074187,0.00022927653,0.0017053339,0.0015768581,0.025221795],"study_design_scores_gemma":[0.0013961648,0.000103153485,0.00015421848,0.00007868052,0.000050040817,0.00016557518,0.00009334048,0.99575454,0.000051470575,0.00009052853,0.001779991,0.0002822676],"about_ca_topic_score_codex":0.00023018103,"about_ca_topic_score_gemma":0.00004656429,"teacher_disagreement_score":0.9935004,"about_ca_system_score_codex":0.000099189434,"about_ca_system_score_gemma":0.00009412121,"threshold_uncertainty_score":0.88403267},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016292487,0.00060714205,0.98901075,0.006862088,0.0005194611,0.00042657513,0.00019384093,0.0007248973,0.0000260203],"genre_scores_gemma":[0.9089831,0.00025299826,0.09015556,0.00006216303,0.00001588492,0.0002088417,0.00020869778,0.000016446935,0.00009627635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791044,0.00024703462,0.00043792804,0.00069773087,0.00026656606,0.00044032506],"domain_scores_gemma":[0.99718666,0.0006768875,0.00012120616,0.0017067529,0.00016525754,0.00014325633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032038076,0.0002311391,0.00031000646,0.00010599804,0.00060080475,0.0005059283,0.0024120375,0.00031324232,0.0000072941443],"category_scores_gemma":[0.0014553919,0.00022902257,0.00009571117,0.0006977987,0.00009615199,0.00025647096,0.00015770267,0.0005978411,0.000012530274],"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.00075998774,0.0015272627,0.00013153594,0.0008220763,0.0008108913,0.00016565295,0.00095865707,0.7294403,0.0039469353,0.06121911,0.020930745,0.17928687],"study_design_scores_gemma":[0.00043738313,0.00011482284,0.00003237351,0.00017890242,0.000023408047,0.00007462986,0.000410007,0.96959364,0.0010739011,0.022953255,0.004817561,0.00029012226],"about_ca_topic_score_codex":0.000022107055,"about_ca_topic_score_gemma":0.000013302975,"teacher_disagreement_score":0.9073539,"about_ca_system_score_codex":0.00012813229,"about_ca_system_score_gemma":0.000111851405,"threshold_uncertainty_score":0.93392694},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01507784,0.0003038696,0.9789199,0.0021779952,0.00077156845,0.0003849852,0.00021616487,0.0021371676,0.000010480038],"genre_scores_gemma":[0.9733777,0.0000979177,0.026129628,0.00003207052,0.00002863602,0.00017713357,0.000077213415,0.000013762921,0.00006595745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801236,0.00024239291,0.00042962714,0.0007047747,0.00025809908,0.00035272934],"domain_scores_gemma":[0.9982231,0.00039310256,0.00015362505,0.00086759625,0.00024413435,0.00011841141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038400808,0.00022427397,0.0003125342,0.0001071883,0.000908904,0.0005366436,0.0009098058,0.00028182004,0.000004072562],"category_scores_gemma":[0.00063387095,0.00022249401,0.00006576835,0.00071408984,0.00006813408,0.00020483242,0.00015323033,0.00041218693,0.0000059538456],"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.00013772288,0.00048466556,0.00022529566,0.00043626633,0.0002603063,0.000019355388,0.0001816215,0.9777045,0.0015251045,0.005770941,0.0065562967,0.006697896],"study_design_scores_gemma":[0.0006355604,0.00013852089,0.0003144461,0.00013182487,0.000022208103,0.000100392885,0.00037007322,0.9946945,0.0010548538,0.0012574112,0.0010104089,0.00026981733],"about_ca_topic_score_codex":0.00006989338,"about_ca_topic_score_gemma":0.000016257287,"teacher_disagreement_score":0.9582998,"about_ca_system_score_codex":0.00012122218,"about_ca_system_score_gemma":0.00007559515,"threshold_uncertainty_score":0.9073042},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024327522,0.00006026894,0.9522784,0.00013995031,0.017869703,0.00049151265,0.0036812932,0.00051351305,0.00063785067],"genre_scores_gemma":[0.9970778,0.000013295489,0.00021104036,0.00002364027,0.0017222137,0.00018200937,0.00010124958,0.00006153906,0.00060718425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981129,0.000096974,0.0004232369,0.00047680052,0.00042132894,0.00046875046],"domain_scores_gemma":[0.99869096,0.00014369788,0.000121880366,0.00053074013,0.00014157187,0.0003711329],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002968405,0.00032637612,0.0003572879,0.00015356207,0.00043162148,0.00018564261,0.00019800293,0.0003103713,0.00010276224],"category_scores_gemma":[0.000011674529,0.00029385628,0.00012966548,0.00035668764,0.00017030316,0.00024405988,0.0000010846331,0.00070354546,0.00175298],"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.0010227695,0.0017687593,0.00031023234,0.00025930544,0.0004357969,0.00008265197,0.0005236848,0.6887274,0.114332184,0.0015743369,0.18868077,0.0022821405],"study_design_scores_gemma":[0.008768813,0.0006632755,0.0022235622,0.00022137954,0.0004904825,0.0007092065,0.00093769527,0.25061643,0.0034062732,0.0002866115,0.72904223,0.0026340208],"about_ca_topic_score_codex":0.00040001512,"about_ca_topic_score_gemma":0.00023887625,"teacher_disagreement_score":0.9727503,"about_ca_system_score_codex":0.000059644146,"about_ca_system_score_gemma":0.000064224085,"threshold_uncertainty_score":0.99995136},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09092842,0.00039337992,0.8879254,0.00015364612,0.00038043232,0.0007985655,0.019328019,0.00007408963,0.000018043722],"genre_scores_gemma":[0.9988895,0.00012730986,0.00026797183,0.0000052865776,0.0000020967516,0.00032673503,0.000117102354,0.0000062606305,0.000257735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978654,0.00031476442,0.0006323136,0.0004395669,0.00044351423,0.00030448227],"domain_scores_gemma":[0.99799126,0.0003057436,0.00029438097,0.0012885926,0.00007348357,0.000046528057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090712635,0.00017895811,0.0003454819,0.000075054806,0.00052744645,0.00009867589,0.0010211444,0.000042534448,0.0000065440377],"category_scores_gemma":[0.000028537903,0.000121276906,0.000056253644,0.0008236634,0.0002989828,0.00048141036,0.00013367063,0.00031184772,0.0000013768432],"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.00017220246,0.00068414304,0.004331925,0.0005975748,0.00013881033,0.000005336198,0.00032077625,0.98458254,0.0001592566,0.0011516407,0.0035629135,0.0042928704],"study_design_scores_gemma":[0.0018622822,0.0003909942,0.030919524,0.00016744118,0.000057503286,0.00004970433,0.0026539448,0.94240683,0.00037958875,0.0006762718,0.019961942,0.00047394188],"about_ca_topic_score_codex":0.00015510208,"about_ca_topic_score_gemma":0.000110347166,"teacher_disagreement_score":0.9079611,"about_ca_system_score_codex":0.00011327486,"about_ca_system_score_gemma":0.000038891074,"threshold_uncertainty_score":0.49455288},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03253489,0.00078857166,0.9566517,0.0070625693,0.00035711704,0.0005349112,0.0004464735,0.0015793014,0.000044450404],"genre_scores_gemma":[0.9936123,0.00037595746,0.005450022,0.000060036284,0.000006344001,0.00020040433,0.00015981882,0.000021581613,0.00011354436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746346,0.00046644307,0.00045742653,0.0006320839,0.00043396643,0.0005466023],"domain_scores_gemma":[0.99587333,0.0009912213,0.00021850942,0.0026983963,0.00010271355,0.000115826755],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00068236433,0.00031657523,0.00032650237,0.000152324,0.0013894913,0.0008065725,0.006051566,0.00023943074,0.0000028862526],"category_scores_gemma":[0.0005335068,0.0002451792,0.000100467274,0.0012846892,0.00025011867,0.00032648764,0.00049066875,0.00089279766,0.00006742157],"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.000060878647,0.00015274154,0.000032906526,0.000053695632,0.00023074687,0.000018231318,0.0003149007,0.9125074,0.00062620384,0.00040578618,0.07911492,0.0064815716],"study_design_scores_gemma":[0.0005069034,0.00010544168,0.00011467874,0.00015244748,0.000025469144,0.000048735037,0.0012577382,0.9946965,0.0002768642,0.00056314416,0.0019228982,0.0003291964],"about_ca_topic_score_codex":0.0004914795,"about_ca_topic_score_gemma":0.00003276525,"teacher_disagreement_score":0.9610774,"about_ca_system_score_codex":0.0001460648,"about_ca_system_score_gemma":0.00007497363,"threshold_uncertainty_score":0.9999106},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011412008,0.00008880741,0.98266935,0.0038940974,0.00007095073,0.00030410258,0.00010741809,0.0011743719,0.00027887808],"genre_scores_gemma":[0.9918829,0.00034682464,0.007411873,0.000017136228,0.0000026662558,0.00014965273,0.00008586112,0.000013825177,0.00008921613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984831,0.00016140573,0.00030194275,0.00045012022,0.0002682939,0.00033513023],"domain_scores_gemma":[0.9971611,0.00025486675,0.000075483025,0.0023701694,0.000054570144,0.000083826155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027462453,0.00020998003,0.00023975217,0.00027671177,0.00050489925,0.00037698806,0.0036368908,0.00015747806,0.0000015558352],"category_scores_gemma":[0.00006301487,0.00017498145,0.00003427542,0.0011192111,0.000112911584,0.00051093026,0.00015078396,0.0005704367,0.000025042811],"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.000050248887,0.00011456522,0.00001865431,0.00003687466,0.000022841734,0.000016563914,0.000116158415,0.99284637,0.00022142194,0.0025787884,0.0015590447,0.0024184627],"study_design_scores_gemma":[0.0006540574,0.00016442737,0.00008328507,0.00019494098,0.0000062046784,0.00001403043,0.0004650362,0.9914223,0.000075014825,0.0065299207,0.00018035929,0.00021040057],"about_ca_topic_score_codex":0.00015202191,"about_ca_topic_score_gemma":0.000069025264,"teacher_disagreement_score":0.98047096,"about_ca_system_score_codex":0.00007269496,"about_ca_system_score_gemma":0.00009391735,"threshold_uncertainty_score":0.71355367},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10363341,0.000033135173,0.89178973,0.00084625074,0.00020928147,0.0009717586,0.002019229,0.000341879,0.00015529753],"genre_scores_gemma":[0.9962352,0.000011780899,0.0017091141,0.00012354452,0.000039484803,0.00044573055,0.00014276092,0.000020718255,0.0012716514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717087,0.00018061484,0.0008738183,0.00067142403,0.00070328993,0.00039996117],"domain_scores_gemma":[0.99771106,0.0010897542,0.00013110365,0.0005965241,0.00019742399,0.00027415008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006235076,0.00025848864,0.0004085765,0.0008238032,0.0004439349,0.00038992998,0.00041056538,0.00015428622,0.00011648376],"category_scores_gemma":[0.00008185599,0.00021036883,0.00012102359,0.0028242755,0.000057544185,0.0001524444,0.000008272436,0.00023424989,0.0002679749],"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.000034103912,0.000078128396,0.00022378727,0.000005288151,0.000014153447,0.000005066481,0.00043967346,0.98864496,0.00013632135,0.00011279815,0.0024577256,0.007847998],"study_design_scores_gemma":[0.0009972696,0.00009904208,0.0128186075,0.000052273877,0.000017308043,0.000009206109,0.0015259258,0.9722871,0.000138644,0.0036987131,0.007929758,0.0004261346],"about_ca_topic_score_codex":0.00034115958,"about_ca_topic_score_gemma":0.00021228864,"teacher_disagreement_score":0.8926018,"about_ca_system_score_codex":0.00006265369,"about_ca_system_score_gemma":0.000053489784,"threshold_uncertainty_score":0.8578592},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025481388,0.00044617782,0.9698878,0.0017071833,0.00035071734,0.00025387862,0.00029126156,0.0015292391,0.00005235389],"genre_scores_gemma":[0.99691105,0.0003903843,0.002294338,0.000016979095,0.000015927695,0.00008113514,0.00013654128,0.000014663703,0.00013898192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983862,0.00016363616,0.00028360673,0.00055724394,0.00026147798,0.00034782357],"domain_scores_gemma":[0.9985439,0.000228562,0.000118378404,0.00093113555,0.00006742642,0.00011055394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031310142,0.00022067071,0.0002480065,0.00015905016,0.00067954935,0.00046987596,0.001517709,0.0001971713,0.0000022936897],"category_scores_gemma":[0.00023879211,0.00021224523,0.000035486264,0.00078424666,0.00009433307,0.0005917458,0.00022799193,0.00042055224,0.000021089983],"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.00028043764,0.0003836232,0.0012024718,0.0004806364,0.0007740393,0.0002548586,0.0017056321,0.43389824,0.00719446,0.0014731908,0.43299568,0.119356714],"study_design_scores_gemma":[0.00052505295,0.00014503635,0.00011920142,0.00013658559,0.000014845075,0.00004235695,0.0007034626,0.99440706,0.0004917306,0.0016768682,0.0014609653,0.00027684701],"about_ca_topic_score_codex":0.00017548077,"about_ca_topic_score_gemma":0.0000152603,"teacher_disagreement_score":0.97142965,"about_ca_system_score_codex":0.000056766752,"about_ca_system_score_gemma":0.000028852866,"threshold_uncertainty_score":0.86551094},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009010714,0.000056845616,0.98730975,0.0011972605,0.0009994154,0.0005446405,0.000411138,0.00042420172,0.00004602956],"genre_scores_gemma":[0.98800427,0.000036279285,0.010954312,0.00008796549,0.00012333039,0.0002723366,0.00006852162,0.000016305676,0.000436676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811405,0.00015215443,0.0004082826,0.00051518914,0.0002895002,0.0005208336],"domain_scores_gemma":[0.99866253,0.0005184035,0.00011396629,0.00038141035,0.00012785383,0.00019583663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006081003,0.00021578604,0.0003059007,0.00012056459,0.0006001222,0.00039104803,0.00023706153,0.00013984511,0.000005101305],"category_scores_gemma":[0.000021953283,0.000202816,0.00013916491,0.00043445648,0.000032838718,0.0004317688,0.000007958626,0.00022823359,0.00009381195],"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.00051365566,0.0023112746,0.00019759414,0.0014015358,0.0008097989,0.00021640098,0.01036215,0.91382116,0.0036571214,0.038658496,0.020430194,0.007620617],"study_design_scores_gemma":[0.0014448259,0.00021635847,0.00012971894,0.0001019382,0.00004787914,0.000041731568,0.0039483956,0.98899066,0.00042236518,0.00020512556,0.004107793,0.0003431982],"about_ca_topic_score_codex":0.00006548609,"about_ca_topic_score_gemma":0.000021949701,"teacher_disagreement_score":0.97899354,"about_ca_system_score_codex":0.00006375774,"about_ca_system_score_gemma":0.00009094875,"threshold_uncertainty_score":0.8270596},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066351728,0.000270717,0.99018806,0.00026940816,0.0008631071,0.0006346377,0.00048451533,0.00051572063,0.00013866331],"genre_scores_gemma":[0.9987765,0.00019496036,0.00009359588,0.00004265857,0.000053623862,0.00026317989,0.00023413419,0.000015126491,0.0003262472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806005,0.00012768534,0.0005201355,0.00057959417,0.00032232743,0.0003902137],"domain_scores_gemma":[0.9990051,0.00009552741,0.00016329858,0.00039195662,0.000123458,0.00022069644],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031948855,0.00026573366,0.00035542424,0.0001495899,0.0004428965,0.00037156133,0.00024359634,0.00015428431,0.0000041006547],"category_scores_gemma":[0.0000037328105,0.00024925027,0.00006645622,0.00085834804,0.00006496891,0.00050950266,0.000006798541,0.00017031001,0.000071261304],"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.00004042145,0.00018642342,0.00016783774,0.0004049703,0.000106111074,0.000024570008,0.0005495203,0.9274414,0.0014054279,0.007930898,0.008903425,0.05283898],"study_design_scores_gemma":[0.0009860152,0.00009190973,0.0011217921,0.00008880684,0.000022139044,0.000062166364,0.00028618137,0.9898565,0.00014481958,0.0002596672,0.006725243,0.00035477287],"about_ca_topic_score_codex":0.00023191379,"about_ca_topic_score_gemma":0.000025060212,"teacher_disagreement_score":0.9921413,"about_ca_system_score_codex":0.00005484483,"about_ca_system_score_gemma":0.00003316518,"threshold_uncertainty_score":0.99999595},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022691852,0.00047004982,0.99631923,0.00014780858,0.0009976004,0.0007905937,0.00013375476,0.00090401364,0.000010041174],"genre_scores_gemma":[0.95293236,0.000020892669,0.046186738,0.000044870805,0.000022219429,0.00059197046,0.000043309996,0.000020757203,0.00013690037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986138,0.0000638906,0.00033110357,0.00049693655,0.00020051571,0.00029380288],"domain_scores_gemma":[0.99919313,0.00028543928,0.000058784222,0.00024800823,0.000080815815,0.0001338411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020611947,0.00021519828,0.00020754352,0.00018963742,0.00031060554,0.00038904836,0.00022297105,0.00010415736,0.000004092601],"category_scores_gemma":[0.000008892752,0.00020114704,0.00011736493,0.0002745624,0.000038434253,0.00014516935,0.000002870902,0.0001574462,0.000009362842],"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.000030065332,0.000059296854,0.000003939506,0.00012059155,0.00004998829,0.0000046921764,0.00013382395,0.9969512,0.000054434528,0.000571817,0.00006590482,0.0019542219],"study_design_scores_gemma":[0.00063935213,0.00027936525,0.0000040726827,0.00012531623,0.000029429762,0.000029489542,0.000058336638,0.99730724,0.0001786484,0.000037723432,0.0010897503,0.00022126206],"about_ca_topic_score_codex":0.000023150316,"about_ca_topic_score_gemma":0.000007894461,"teacher_disagreement_score":0.95270544,"about_ca_system_score_codex":0.00011369458,"about_ca_system_score_gemma":0.00004185782,"threshold_uncertainty_score":0.8202538},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010931474,0.00041738202,0.97471875,0.0005897846,0.00070352113,0.00066032395,0.020922715,0.0008595592,0.000034841363],"genre_scores_gemma":[0.9935765,0.00017751056,0.004652332,0.00002051405,0.00003615357,0.0001321743,0.0012557859,0.000016984874,0.00013200863],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813014,0.00009492963,0.00040144543,0.00082354754,0.0002162713,0.00033368665],"domain_scores_gemma":[0.99824435,0.00050548173,0.00008706835,0.00088880636,0.00009389985,0.00018037429],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00036576606,0.00028043572,0.00033255515,0.00016294263,0.00038984744,0.0010676362,0.0006805112,0.00014147437,0.00000300511],"category_scores_gemma":[0.000026962538,0.00024946898,0.000048697944,0.0005822427,0.000097472235,0.0007163097,0.000019602809,0.00022563264,0.000008071679],"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.0012635364,0.0021484399,0.0007781992,0.0046308083,0.0025188262,0.0002808826,0.0027737508,0.2532661,0.004495005,0.05173016,0.48699555,0.18911873],"study_design_scores_gemma":[0.00047466962,0.00026043374,0.0002098535,0.00025568946,0.000058653262,0.000104996274,0.00008410635,0.9828566,0.00019459288,0.0003419044,0.014838882,0.00031963494],"about_ca_topic_score_codex":0.00027658552,"about_ca_topic_score_gemma":0.0000692204,"teacher_disagreement_score":0.9924834,"about_ca_system_score_codex":0.000081474565,"about_ca_system_score_gemma":0.00011523948,"threshold_uncertainty_score":0.99999577},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029205468,0.0028589792,0.98783153,0.0014354115,0.0035662204,0.0006312419,0.00013585741,0.000591665,0.000028528524],"genre_scores_gemma":[0.99306273,0.000041608757,0.005698459,0.0002150217,0.0005365472,0.00015366892,0.000060710307,0.00003176276,0.00019950957],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751896,0.00014590433,0.000581958,0.0007555965,0.0002592242,0.00073835417],"domain_scores_gemma":[0.9985703,0.00060788175,0.000093015624,0.00039312348,0.00008507977,0.00025055307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004392405,0.00036893727,0.00043669608,0.000112254755,0.0005758431,0.00073354744,0.0004633935,0.00018173027,0.000003908762],"category_scores_gemma":[0.0000047148474,0.00030481763,0.00027105995,0.00060109224,0.000063826395,0.00027237798,0.0000068526456,0.00038859653,0.000010140097],"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.00005455208,0.000047923768,0.00000327808,0.00014970201,0.00005220052,0.000042709387,0.00015543474,0.9756075,0.0000796114,0.0009923661,0.0020372572,0.020777429],"study_design_scores_gemma":[0.0007809303,0.00018241454,0.0000109659495,0.00021387376,0.000039020113,0.000060630337,0.00007576441,0.991022,0.00002581239,0.00026764834,0.006951059,0.0003698801],"about_ca_topic_score_codex":0.00004969883,"about_ca_topic_score_gemma":0.000030307623,"teacher_disagreement_score":0.99014217,"about_ca_system_score_codex":0.00005417351,"about_ca_system_score_gemma":0.00007929643,"threshold_uncertainty_score":0.9999404},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011563976,0.0007573394,0.9837685,0.0017706954,0.0067691184,0.0022597935,0.0024262986,0.0006937773,0.00039808048],"genre_scores_gemma":[0.99644107,0.00001550509,0.001051261,0.00019731995,0.00022669614,0.0009909131,0.00011830954,0.000023227361,0.0009356791],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965529,0.00029062285,0.0010056728,0.0009552112,0.00040096525,0.0007946706],"domain_scores_gemma":[0.9968288,0.0011304886,0.00022884646,0.0011070945,0.00040990958,0.00029485696],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000976029,0.0005206742,0.00072834396,0.00019307662,0.0016561941,0.001216571,0.0013031581,0.0002403112,0.0000019051128],"category_scores_gemma":[0.00004611897,0.00039207158,0.0002703343,0.0012135152,0.00009218456,0.00023335304,0.000024231984,0.00035600777,0.000043145898],"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.00014706905,0.00021896085,0.000058204794,0.00055451586,0.00047011892,0.000014806282,0.0003955026,0.9438314,0.0002564463,0.022417739,0.028523523,0.0031117084],"study_design_scores_gemma":[0.0026695547,0.00030246968,0.00032226092,0.0009634137,0.00016680839,0.000102593585,0.0016910357,0.89335066,0.00026031124,0.00010691304,0.09928582,0.00077817205],"about_ca_topic_score_codex":0.00026202033,"about_ca_topic_score_gemma":0.000053160104,"teacher_disagreement_score":0.9952847,"about_ca_system_score_codex":0.00022634366,"about_ca_system_score_gemma":0.00017620313,"threshold_uncertainty_score":0.99985313},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019270752,0.00016618664,0.97573423,0.0010392413,0.00196048,0.0009620342,0.0004874662,0.00027153202,0.00010804891],"genre_scores_gemma":[0.9935306,0.000015158427,0.0051125665,0.00045561505,0.000053838685,0.00019098022,0.00010184013,0.000010501768,0.0005289132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980881,0.00022573279,0.00053004484,0.0006176104,0.00020008095,0.00033843136],"domain_scores_gemma":[0.9983302,0.00048459318,0.000189391,0.00048147494,0.00039122952,0.00012314599],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003034364,0.00027700773,0.00039941558,0.00019786826,0.00054697384,0.00038834813,0.0004318084,0.00015517109,0.0000031785698],"category_scores_gemma":[0.0000064453475,0.00024532003,0.0001043301,0.00072186574,0.00003865098,0.000400372,0.000009888442,0.00021006267,0.000012784629],"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.0009946782,0.0016449094,0.00024801408,0.001208883,0.00085278816,0.000010788023,0.006212832,0.90192574,0.003836318,0.070913434,0.0026535322,0.009498064],"study_design_scores_gemma":[0.010020768,0.00053223595,0.003049744,0.0005407212,0.00019008992,0.000019297895,0.005920466,0.93654716,0.0054781344,0.0013726461,0.035194278,0.0011344361],"about_ca_topic_score_codex":0.0006115543,"about_ca_topic_score_gemma":0.0005147471,"teacher_disagreement_score":0.97425985,"about_ca_system_score_codex":0.00009403437,"about_ca_system_score_gemma":0.000114177594,"threshold_uncertainty_score":0.9999999},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038491845,0.00062665856,0.9574181,0.00014211316,0.0015005622,0.0006937467,0.00049308286,0.00021528044,0.00041863535],"genre_scores_gemma":[0.9973851,0.0004844532,0.0016725945,0.000014133096,0.000045383436,0.00011466058,0.00005936256,0.000009237536,0.00021509334],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976868,0.00019640705,0.00078620884,0.00069349044,0.00034307796,0.0002939939],"domain_scores_gemma":[0.99796003,0.00028142263,0.00022345468,0.0012582587,0.00014729705,0.00012956031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000726472,0.00026387325,0.0005466754,0.0001513985,0.00032259722,0.0002794658,0.00059132307,0.00015261162,0.0000011923923],"category_scores_gemma":[0.000009037891,0.0002130426,0.00005555182,0.000448749,0.00008138058,0.00038972287,0.000032380933,0.00019291053,0.000003771608],"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.00025187922,0.0027236065,0.022530548,0.009242753,0.001850567,0.00005811624,0.0009830543,0.84239167,0.0075390968,0.01047704,0.008242894,0.0937088],"study_design_scores_gemma":[0.0012468407,0.00017441633,0.0035561344,0.0006907161,0.00008217764,0.00004498573,0.0002576532,0.99209374,0.00012313479,0.000030282761,0.0013854275,0.0003144708],"about_ca_topic_score_codex":0.0010263093,"about_ca_topic_score_gemma":0.000017583146,"teacher_disagreement_score":0.95889324,"about_ca_system_score_codex":0.0000755101,"about_ca_system_score_gemma":0.00020197194,"threshold_uncertainty_score":0.8687625},"labels":[],"label_agreement":null}]}