{"meta":{"query_hash":"1657edd551df","filters":{"venue":"Parallel Processing Letters"},"cohort_total":54,"direct_labels_cover":0,"predictions_cover":54,"exported":54,"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/1657edd551df","api":"https://metacan.xera.ac/api/v1/cohort?venue=Parallel+Processing+Letters"},"results":[{"id":"W1607694089","doi":"10.1142/s012962641000017x","title":"COPING WITH DECOHERENCE: PARALLELIZING THE QUANTUM FOURIER TRANSFORM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Queen's University","funders":"","keywords":"Quantum decoherence; Computer science; Quantum computer; Scalability; Computation; Computational complexity theory; Fourier transform; Theoretical computer science; Quantum; Quantum Fourier transform; Fast Fourier transform; Algorithm; Computational science; Quantum error correction; Quantum mechanics; Physics","score_opus":0.008926463917114678,"score_gpt":0.22950308301609124,"score_spread":0.22057661909897655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607694089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062395923,0.00025994235,0.9257278,0.0008693305,0.000071192015,0.000082661005,0.00003109805,0.000667691,0.009894445],"genre_scores_gemma":[0.6330227,0.0004456766,0.36304483,0.00012665965,0.00014567137,0.00011318216,0.000055749617,0.00017098489,0.0028745874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994686,0.0001523057,0.000024037576,0.00007434959,0.00019178385,0.00008885218],"domain_scores_gemma":[0.9987431,0.0005424691,0.00008220992,0.0004713705,0.0001137833,0.000047122237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012489246,0.000499277,0.00063290854,0.00034176925,0.0007417515,0.0011270934,0.0011568415,0.00077435427,0.0014717509],"category_scores_gemma":[0.0040974184,0.00024728166,0.0003868581,0.00057689677,0.0019461624,0.0025104065,0.0015767111,0.0013493919,0.0003939532],"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.0004540652,0.00015949247,0.0011517858,0.00011926806,0.000053412667,0.00034621212,0.0005760379,0.35656404,0.033646684,0.45561582,0.0028412063,0.14847197],"study_design_scores_gemma":[0.000051155348,0.00008110444,0.00016806352,0.000010688458,0.000013630052,0.0000952008,0.000059584625,0.78611684,0.009571579,0.1998114,0.004002313,0.000018355799],"about_ca_topic_score_codex":0.0012017642,"about_ca_topic_score_gemma":0.0015265747,"teacher_disagreement_score":0.0014717509,"about_ca_system_score_codex":0.00050454895,"about_ca_system_score_gemma":0.0010874253,"threshold_uncertainty_score":0.006605029},"labels":[],"label_agreement":null},{"id":"W1658056400","doi":"10.1142/s0129626412500089","title":"DETERMINISTIC SAMPLE SORT FOR GPUS","year":2012,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"Carleton University","funders":"","keywords":"Merge sort; sort; Computer science; Sorting algorithm; Parallel computing; Sorting; Sample (material); Algorithm","score_opus":0.030169005202916807,"score_gpt":0.28704899431932235,"score_spread":0.2568799891164055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1658056400","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030974014,0.00047543034,0.9528952,0.00060512853,0.0002775259,0.0000881975,0.00051379047,0.0055771545,0.008593625],"genre_scores_gemma":[0.41509527,0.00037110588,0.57355934,0.000562239,0.000115864575,0.00025213187,0.0011098746,0.00081821094,0.008115897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789137,0.0003115124,0.00013545019,0.00034712304,0.0010083597,0.00030607046],"domain_scores_gemma":[0.9973597,0.0006678452,0.00017038964,0.0010891804,0.0006016362,0.00011130637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008071439,0.0005526746,0.0007612703,0.00051542337,0.00093159784,0.0021356307,0.0017076259,0.0007351748,0.009191922],"category_scores_gemma":[0.0052190563,0.00036386802,0.0006127727,0.0014532087,0.00090470834,0.0025927445,0.0019039016,0.0014192091,0.0017689401],"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.0014779264,0.00019552482,0.0033053774,0.000519671,0.00014388732,0.00018889541,0.0002245804,0.20193811,0.03194714,0.37086922,0.044295263,0.3448944],"study_design_scores_gemma":[0.00015323282,0.00013009935,0.00052358635,0.000028137836,0.000036747126,0.00014548609,0.000056655335,0.8016429,0.029554458,0.13016444,0.03752044,0.00004374751],"about_ca_topic_score_codex":0.0064793187,"about_ca_topic_score_gemma":0.009156344,"teacher_disagreement_score":0.009191922,"about_ca_system_score_codex":0.0016849057,"about_ca_system_score_gemma":0.002980045,"threshold_uncertainty_score":0.030750096},"labels":[],"label_agreement":null},{"id":"W1964127017","doi":"10.1142/s0129626406002447","title":"INHERENTLY PARALLEL GEOMETRIC COMPUTATIONS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","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":"Queen's University","funders":"","keywords":"Speedup; Computation; Computer science; Polygon (computer graphics); Property (philosophy); Object (grammar); Set (abstract data type); Transformation (genetics); Algorithm; Convex polygon; Regular polygon; Mathematics; Theoretical computer science; Parallel computing; Geometry; Artificial intelligence","score_opus":0.017298382996036202,"score_gpt":0.24480158369137642,"score_spread":0.22750320069534022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964127017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021014566,0.000572899,0.9380253,0.0004583979,0.00017865947,0.000072925664,0.00011481924,0.0008460938,0.038716376],"genre_scores_gemma":[0.32543483,0.001377954,0.65460813,0.00021202078,0.00024107304,0.00024095444,0.0003609217,0.00034174786,0.017182343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999482,0.00007902345,0.00002386289,0.00009472095,0.00026407652,0.000056482193],"domain_scores_gemma":[0.9995359,0.00012320979,0.000032291187,0.00021614571,0.00006791629,0.000024498717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034555898,0.00067727716,0.00053845067,0.00055763684,0.00068569265,0.0014174944,0.001102158,0.0006378131,0.006829095],"category_scores_gemma":[0.0015062855,0.00034684877,0.00070151687,0.00092505163,0.0013291789,0.002704455,0.0021909103,0.0012225057,0.0016113067],"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.000087398264,0.000041186333,0.00038967305,0.00018374727,0.000030604402,0.00018088163,0.00019339808,0.09631146,0.014464508,0.79102933,0.005292651,0.091795176],"study_design_scores_gemma":[0.00003962203,0.000040827945,0.0002031987,0.000018360439,0.00001805785,0.0002738579,0.00004775124,0.33856538,0.0055608684,0.6129195,0.042298853,0.000013753038],"about_ca_topic_score_codex":0.0006088243,"about_ca_topic_score_gemma":0.0009909199,"teacher_disagreement_score":0.006829095,"about_ca_system_score_codex":0.0006089096,"about_ca_system_score_gemma":0.00062308065,"threshold_uncertainty_score":0.022845566},"labels":[],"label_agreement":null},{"id":"W1969579322","doi":"10.1142/s0129626405002374","title":"THE IMPROVED PARALLEL ICGS METHOD FOR LARGE AND SPARSE UNSYMMETRIC LINEAR SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Matrix Theory and Algorithms","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Conjugate gradient method; Computation; Parallel computing; Sparse matrix; Algorithm; Matrix (chemical analysis); Parallel algorithm; Coefficient matrix; Scheme (mathematics); Distributed memory; Linear system; Mathematical optimization; Shared memory; Mathematics","score_opus":0.016758634540363967,"score_gpt":0.2780497384753776,"score_spread":0.26129110393501365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969579322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050117956,0.00016137936,0.9919614,0.00014717026,0.00009392757,0.000043318843,0.000037610767,0.00039280203,0.002150687],"genre_scores_gemma":[0.08228246,0.00024328394,0.9117288,0.000115427865,0.00008732642,0.00017342968,0.00015837523,0.0001826692,0.0050282655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000069190886,0.000009997251,0.000032427073,0.00013967189,0.000019040943],"domain_scores_gemma":[0.9997129,0.00007455189,0.000025622936,0.00005115849,0.00011106748,0.000024719386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044624007,0.000626319,0.00054608047,0.00044188916,0.0003590377,0.00041050813,0.0010314093,0.0005381025,0.0021724158],"category_scores_gemma":[0.00091371953,0.00024537885,0.00037997382,0.0007963637,0.00056372426,0.00064725295,0.00063181797,0.0007457073,0.0006517249],"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.00019308244,0.000098060365,0.00090784073,0.0002667978,0.000058368078,0.00026132615,0.00015575408,0.6404199,0.030021198,0.07055564,0.012322276,0.24473968],"study_design_scores_gemma":[0.000025715946,0.00002885314,0.00008842543,0.0000047493877,0.0000054073353,0.00005089238,0.000007377107,0.9847333,0.0031758286,0.005466583,0.006403743,0.000009267714],"about_ca_topic_score_codex":0.0034656147,"about_ca_topic_score_gemma":0.0031698714,"teacher_disagreement_score":0.0034656147,"about_ca_system_score_codex":0.0003470742,"about_ca_system_score_gemma":0.0015252387,"threshold_uncertainty_score":0.0072674155},"labels":[],"label_agreement":null},{"id":"W1973439009","doi":"10.1142/s0129626412500090","title":"BLOCK-PARALLEL SYSTOLIC-ARRAY ARCHITECTURE FOR 2-D NTT-BASED FRAGILE WATERMARK EMBEDDING","year":2012,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Digital Filter Design and Implementation","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 Calgary","funders":"Department of Foreign Affairs and Trade, Australian Government","keywords":"Digital watermarking; Computer science; Field-programmable gate array; Block (permutation group theory); Authentication (law); Watermark; Adder; Computer hardware; Throughput; Embedding; Computer security; Image (mathematics); Telecommunications; Artificial intelligence; Wireless; Mathematics","score_opus":0.025750987857405743,"score_gpt":0.28312300293066295,"score_spread":0.2573720150732572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973439009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063916296,0.00054382917,0.9266825,0.00013909423,0.00014474952,0.00011000427,0.00010091557,0.0022936305,0.0060690283],"genre_scores_gemma":[0.49300483,0.0004932326,0.49796116,0.00014166109,0.00008443866,0.00018903382,0.00038051448,0.00006910703,0.0076760002],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998641,0.00003099313,0.000012073774,0.000025237832,0.00005442816,0.000013085724],"domain_scores_gemma":[0.99977237,0.000058760907,0.000033018325,0.000038826147,0.00008387279,0.0000131464885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026633232,0.00039690084,0.00023911348,0.0003870584,0.00024311159,0.00041572217,0.00063662184,0.0003668962,0.0036886765],"category_scores_gemma":[0.00042859538,0.0001534437,0.00025760944,0.00051186373,0.00021486357,0.0005975697,0.00020955694,0.0003320245,0.0012124059],"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.0009092709,0.00020520548,0.0012770859,0.00035700965,0.00009016663,0.00036718056,0.00017755736,0.08716655,0.4140456,0.022454271,0.0047016796,0.4682484],"study_design_scores_gemma":[0.00016624424,0.0016124835,0.0015294943,0.00004481257,0.00007414403,0.00066737144,0.00004068217,0.80012864,0.16478723,0.006552474,0.024342336,0.000054011813],"about_ca_topic_score_codex":0.00081724644,"about_ca_topic_score_gemma":0.0018152525,"teacher_disagreement_score":0.0036886765,"about_ca_system_score_codex":0.00038747684,"about_ca_system_score_gemma":0.0005718869,"threshold_uncertainty_score":0.01233983},"labels":[],"label_agreement":null},{"id":"W1977041333","doi":"10.1142/s0129626411000072","title":"ON THE SURFACE AREAS AND AVERAGE DISTANCES OF MESHES AND TORI","year":2011,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","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":"Brock University","funders":"","keywords":"Polygon mesh; Lemma (botany); Torus; Surface (topology); Graph; Mathematics; Product (mathematics); Computer science; Geometry; Combinatorics","score_opus":0.02520157010959262,"score_gpt":0.21100405287633692,"score_spread":0.1858024827667443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977041333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43406945,0.004207899,0.48983043,0.0009137775,0.00018089594,0.00005174883,0.00057777273,0.00039943325,0.069768615],"genre_scores_gemma":[0.953388,0.0020970523,0.035768397,0.00009795971,0.0004667708,0.00010387529,0.000488321,0.00028911626,0.007300602],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995931,0.00009946443,0.0000191153,0.00010340031,0.00012336829,0.00006166411],"domain_scores_gemma":[0.9970432,0.0018810462,0.00030823937,0.00025616577,0.00031118587,0.00020023994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062855124,0.00065564475,0.0005568553,0.0025654167,0.00064400624,0.0015093861,0.0008217264,0.0007024277,0.004985978],"category_scores_gemma":[0.0053677573,0.0003135725,0.00043389303,0.0014608603,0.0018583509,0.0043044863,0.0013314913,0.00082047685,0.0007630716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048609363,0.000018988412,0.0013688037,0.00007565227,0.000017059196,0.00009256107,0.00019159247,0.029285027,0.0044874027,0.9392175,0.0012909394,0.023905853],"study_design_scores_gemma":[0.000010393566,0.00005672874,0.0022854044,0.000021955579,0.000017334336,0.00031375603,0.00013341449,0.13636948,0.002252884,0.8532261,0.0052891253,0.000023274813],"about_ca_topic_score_codex":0.0005242562,"about_ca_topic_score_gemma":0.00034332732,"teacher_disagreement_score":0.004985978,"about_ca_system_score_codex":0.00060971564,"about_ca_system_score_gemma":0.00015454157,"threshold_uncertainty_score":0.016679764},"labels":[],"label_agreement":null},{"id":"W1985747745","doi":"10.1142/s0129626405002349","title":"IMPROVING SCHEDULING OF COMMUNICATION INTENSIVE PARALLEL APPLICATIONS ON HETEROGENEOUS COMPUTING ENVIRONMENTS","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Fundação de Amparo à Pesquisa do Estado de São Paulo","keywords":"Computer science; Scheduling (production processes); Distributed computing; Latency (audio); Telecommunications network; Parallel computing; Performance metric; Computer network; Mathematical optimization","score_opus":0.011760413580007435,"score_gpt":0.2297897431250932,"score_spread":0.21802932954508578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985747745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17665996,0.00029046455,0.81976664,0.00019249703,0.00003769784,0.00009518258,0.000038963142,0.00041171085,0.0025069166],"genre_scores_gemma":[0.9065346,0.00026977406,0.09159219,0.00004029983,0.000026745583,0.00009859623,0.0000681413,0.00008401922,0.001285657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993197,0.00025972165,0.000025011332,0.00008942657,0.00021120395,0.00009493978],"domain_scores_gemma":[0.9993599,0.0002832055,0.00010263668,0.00012794287,0.000075669945,0.00005056053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011000596,0.00062140555,0.0007599507,0.0003126218,0.00036565884,0.00078698137,0.0009172195,0.00048476012,0.00053642056],"category_scores_gemma":[0.0031052702,0.00027706852,0.00035302137,0.0005043631,0.0003648696,0.0010074371,0.000780598,0.00063111354,0.00017333394],"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.00007260603,0.000053342512,0.000574505,0.00002331282,0.000012494696,0.000025778325,0.000023203293,0.97521794,0.0040737945,0.0039172107,0.00019186416,0.015813837],"study_design_scores_gemma":[0.0000027135015,0.000020530606,0.000051808438,8.4975915e-7,0.0000020044927,0.0000031824225,0.0000031887475,0.99828833,0.0006194172,0.0008610736,0.00014591774,8.983509e-7],"about_ca_topic_score_codex":0.0035866087,"about_ca_topic_score_gemma":0.0024814776,"teacher_disagreement_score":0.0035866087,"about_ca_system_score_codex":0.00083978876,"about_ca_system_score_gemma":0.0013292585,"threshold_uncertainty_score":0.007131517},"labels":[],"label_agreement":null},{"id":"W1985919329","doi":"10.1142/s012962640600271x","title":"THREE COUNTEREXAMPLES TO DISPEL THE MYTH OF THE UNIVERSAL COMPUTER","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computability, Logic, AI 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":"Queen's University","funders":"","keywords":"Turing machine; Counterexample; Computer science; Universal Turing machine; Computable function; Computation; Function (biology); Turing; Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language","score_opus":0.012982692665661022,"score_gpt":0.2118979385103161,"score_spread":0.1989152458446551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985919329","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09178342,0.010987175,0.25951254,0.23419721,0.0053266273,0.00019404496,0.000395332,0.0018768333,0.39572683],"genre_scores_gemma":[0.9030404,0.003322673,0.048576437,0.021971196,0.0023364772,0.00047543395,0.00019678423,0.00035977608,0.019720716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995414,0.0019367812,0.00019360415,0.0008472754,0.0010253035,0.0005830076],"domain_scores_gemma":[0.98681086,0.0081482185,0.00052158633,0.0029571617,0.0009654822,0.00059671653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00526376,0.0008614049,0.00090854464,0.0017475315,0.0036245394,0.0057853456,0.002488379,0.005612186,0.006496001],"category_scores_gemma":[0.020397946,0.00056458486,0.0013927169,0.0007706386,0.036121245,0.012342545,0.0069502625,0.007977565,0.0013096425],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020069217,0.000010270363,0.00008176547,0.00002536445,0.000005956725,0.000056512326,0.00020467283,0.0004628726,0.000070128255,0.9942848,0.00323605,0.0015414401],"study_design_scores_gemma":[0.000017423909,0.000009854982,0.00007621563,0.000034410357,0.000003994209,0.00010714292,0.000106212654,0.0016808338,0.0002596686,0.98594636,0.011744982,0.000012912045],"about_ca_topic_score_codex":0.0012562075,"about_ca_topic_score_gemma":0.00080365426,"teacher_disagreement_score":0.006496001,"about_ca_system_score_codex":0.0024592748,"about_ca_system_score_gemma":0.0010926448,"threshold_uncertainty_score":0.027837753},"labels":[],"label_agreement":null},{"id":"W1986045283","doi":"10.1142/s0129626409000031","title":"A short note on the surface area of star graphs","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Graph theory and applications","field":"Mathematics","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":"Brock University","funders":"","keywords":"Star (game theory); Surface (topology); Mathematics; Computer science; Function (biology); Combinatorics; Discrete mathematics; Geometry; Mathematical analysis","score_opus":0.048625659628929285,"score_gpt":0.3028729877952868,"score_spread":0.25424732816635753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986045283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062394604,0.03286927,0.6469955,0.020653112,0.04717878,0.000083955936,0.00086866395,0.0020011324,0.18695499],"genre_scores_gemma":[0.6122507,0.03181632,0.17209274,0.007608309,0.06427248,0.0001989639,0.0010016811,0.003520649,0.10723817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995797,0.00008224215,0.000031571963,0.000103317805,0.00015881415,0.00004425205],"domain_scores_gemma":[0.99890983,0.00064387766,0.000059958675,0.00011275871,0.00018740473,0.00008605704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077150424,0.0010743252,0.00096181245,0.0018000758,0.0011705311,0.0017474339,0.0013213187,0.0011787994,0.0073049427],"category_scores_gemma":[0.002706014,0.0003986649,0.0011900681,0.0016437209,0.0015760642,0.0048956415,0.0015673678,0.0034234424,0.00284503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042495354,0.000031164003,0.00033898867,0.00026552202,0.00002984742,0.00056171336,0.00019904136,0.0035219858,0.0070027923,0.8846226,0.04096535,0.0624184],"study_design_scores_gemma":[0.000007379183,0.00006688242,0.00047386458,0.000042492422,0.00002196518,0.000507345,0.00005002106,0.0117727155,0.0025501316,0.9086248,0.07584305,0.000039372444],"about_ca_topic_score_codex":0.0005064539,"about_ca_topic_score_gemma":0.00045807794,"teacher_disagreement_score":0.0073049427,"about_ca_system_score_codex":0.0005937076,"about_ca_system_score_gemma":0.00024930786,"threshold_uncertainty_score":0.024437428},"labels":[],"label_agreement":null},{"id":"W199059760","doi":"10.1142/s0129626401000646","title":"ON THE NECESSITY OF FORMAL MODELS FOR REAL-TIME PARALLEL COMPUTATIONS","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"Queen's University","funders":"","keywords":"Turing machine; Computer science; Computation; Universal Turing machine; Super-recursive algorithm; Model of computation; Time hierarchy theorem; Turing machine examples; Probabilistic Turing machine; Theoretical computer science; Hierarchy; NSPACE; Description number; Real number; Time complexity; Theory of computation; Formal proof; Turing; Algorithm; Discrete mathematics; Mathematics; Programming language","score_opus":0.029055490845501485,"score_gpt":0.26925065723311803,"score_spread":0.24019516638761654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W199059760","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053613156,0.00092276535,0.91361713,0.0096382545,0.000253927,0.00012806301,0.00018281586,0.0007214572,0.020922365],"genre_scores_gemma":[0.7785933,0.0010080391,0.21136004,0.0014946251,0.00052777294,0.0006554808,0.00041641342,0.00033600486,0.0056083305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994134,0.0022377814,0.0004997014,0.00082060485,0.0016856516,0.000622165],"domain_scores_gemma":[0.9640697,0.023392487,0.0025885222,0.0059357965,0.0025815233,0.0014320851],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073231044,0.0009151633,0.001202209,0.0011906686,0.002442155,0.0056845327,0.00253356,0.0023508596,0.004459222],"category_scores_gemma":[0.027229983,0.0010636664,0.0024403445,0.00096088735,0.009985324,0.01842737,0.004505999,0.0058517577,0.0009536544],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017448301,0.000017559443,0.00008490735,0.000040766936,0.0000045829966,0.000052711075,0.0001797492,0.0042350073,0.0003260321,0.993468,0.00031419183,0.0012590275],"study_design_scores_gemma":[0.000020367894,0.000018572717,0.000039775732,0.000023275441,0.000006187048,0.00006327295,0.000072186696,0.029235035,0.0004903399,0.9670415,0.0029759838,0.000013584993],"about_ca_topic_score_codex":0.0012559018,"about_ca_topic_score_gemma":0.0011196246,"teacher_disagreement_score":0.0073231044,"about_ca_system_score_codex":0.002891101,"about_ca_system_score_gemma":0.0021087273,"threshold_uncertainty_score":0.038728714},"labels":[],"label_agreement":null},{"id":"W1994164933","doi":"10.1142/s0129626405002350","title":"A Genetic Algorithm for Energy Aware Task Scheduling in Heterogeneous Systems","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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":"St. Francis Xavier University","funders":"","keywords":"Computer science; Dynamic voltage scaling; Energy consumption; Scheduling (production processes); Genetic algorithm; Algorithm; Simulated annealing; Parallel computing; Distributed computing; Real-time computing; Mathematical optimization; Mathematics; Engineering","score_opus":0.013487425533249298,"score_gpt":0.24661113962341505,"score_spread":0.23312371409016575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994164933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014898994,0.0003400033,0.9824592,0.00016682572,0.00004916201,0.00006215313,0.000024579493,0.00030794903,0.001691093],"genre_scores_gemma":[0.35566238,0.00046045927,0.64018744,0.00014762615,0.000051193838,0.00039847015,0.00015542723,0.000083815285,0.0028530646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996989,0.00011132106,0.000013136799,0.000045440913,0.000097134485,0.000034130073],"domain_scores_gemma":[0.9996995,0.0001839728,0.00002798825,0.000016108299,0.00005880691,0.000013731328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175923,0.00070693326,0.00067678647,0.000684982,0.0006022316,0.0006074318,0.000884102,0.0010133934,0.0008783634],"category_scores_gemma":[0.0019162712,0.00038192872,0.0005847254,0.0007463888,0.0005690628,0.0005387913,0.00046861655,0.00070437207,0.00018172314],"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.00003063579,0.000027456612,0.00024024954,0.000024217206,0.00003226835,0.000039828392,0.00003193058,0.947476,0.0014651546,0.006675121,0.00056510395,0.043391984],"study_design_scores_gemma":[0.000020526692,0.000019578674,0.00007253516,0.0000045242564,0.00000788005,0.000012647889,0.0000058167384,0.9954335,0.00032376204,0.003382608,0.00071276946,0.0000038189837],"about_ca_topic_score_codex":0.0077125323,"about_ca_topic_score_gemma":0.005232779,"teacher_disagreement_score":0.0077125323,"about_ca_system_score_codex":0.0009817694,"about_ca_system_score_gemma":0.0013599622,"threshold_uncertainty_score":0.015335321},"labels":[],"label_agreement":null},{"id":"W1996861426","doi":"10.1142/s0129626410000181","title":"ENTANGLEMENT VERIFICATION WITH AN APPLICATION TO QUANTUM KEY DISTRIBUTION PROTOCOLS","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Information and Cryptography","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":"Queen's University","funders":"","keywords":"Quantum entanglement; Quantum key distribution; Computer science; Qubit; Quantum cryptography; Theoretical computer science; Protocol (science); Quantum teleportation; Bell state; Cryptography; Quantum network; Quantum; Quantum mechanics; Quantum information; Algorithm; Physics","score_opus":0.011362266725238879,"score_gpt":0.2682450890524754,"score_spread":0.2568828223272365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996861426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016493293,0.00026120144,0.9764157,0.0006205285,0.00008402422,0.00013278933,0.00002541774,0.00025634776,0.0057107406],"genre_scores_gemma":[0.57481563,0.000604718,0.4185698,0.00020658015,0.00019960606,0.00034035085,0.000055238834,0.00013690349,0.0050711455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764353,0.00091266894,0.00011172137,0.0002414298,0.0008897759,0.00020089778],"domain_scores_gemma":[0.99549675,0.0029871021,0.00020647637,0.0008178995,0.00035922378,0.00013256127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027350972,0.0005526322,0.0006468873,0.0009925531,0.0009733453,0.0014515773,0.0012015799,0.0015611501,0.003286569],"category_scores_gemma":[0.008977471,0.0004153724,0.00062332145,0.0011838524,0.0034237844,0.0025606968,0.0034024802,0.0026603115,0.0005880239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010479479,0.000121177254,0.0003769969,0.00012434035,0.000024133347,0.00035286308,0.00025437283,0.04303482,0.013541887,0.86643463,0.0011356582,0.07449444],"study_design_scores_gemma":[0.00006757786,0.00013343144,0.00018407183,0.000040885134,0.0000241125,0.0002797575,0.000028781047,0.5415895,0.021538336,0.4268007,0.00926211,0.000050728486],"about_ca_topic_score_codex":0.0005346941,"about_ca_topic_score_gemma":0.00038281598,"teacher_disagreement_score":0.003286569,"about_ca_system_score_codex":0.0008000157,"about_ca_system_score_gemma":0.0011363708,"threshold_uncertainty_score":0.014464736},"labels":[],"label_agreement":null},{"id":"W2002346262","doi":"10.1142/s0129626410000223","title":"ON THE IMPORTANCE OF BEING QUANTUM","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Queen's University","funders":"","keywords":"Champion; Tournament; Computer chess; Computer science; Quantum; Artificial intelligence; Center (category theory); Quantum computer; Natural (archaeology); Mathematics; Political science; Law; History; Quantum mechanics; Physics","score_opus":0.009436269288148325,"score_gpt":0.23207731980678123,"score_spread":0.2226410505186329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002346262","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05260286,0.00808519,0.049457476,0.10638528,0.003157124,0.000049780538,0.00009388828,0.00011123085,0.78005713],"genre_scores_gemma":[0.95708513,0.0049647707,0.008109408,0.0099310335,0.0013788932,0.00007557415,0.00004371169,0.00008969562,0.018321736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99797755,0.00086567755,0.000057034005,0.0003393215,0.00041017085,0.0003502861],"domain_scores_gemma":[0.9953434,0.0025777076,0.00024537838,0.00068232976,0.00070197467,0.0004491723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031603856,0.00034551977,0.0005958686,0.00063419406,0.0067436546,0.007635143,0.00094948127,0.0034608734,0.008912373],"category_scores_gemma":[0.007511726,0.0003189563,0.0003530949,0.00052078057,0.03651498,0.010099317,0.004715703,0.00457543,0.0011657702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009261664,0.0000033723015,0.0000769473,0.00001065831,0.0000017824041,0.00003262357,0.00082957663,0.00009865277,0.00007279445,0.99371743,0.0015826882,0.003564283],"study_design_scores_gemma":[0.0000083701,0.000017096836,0.0003532926,0.000047037716,0.000005704908,0.00009051923,0.0008853871,0.0004518147,0.00015002138,0.9538871,0.044087373,0.000016370239],"about_ca_topic_score_codex":0.0039041408,"about_ca_topic_score_gemma":0.0032800308,"teacher_disagreement_score":0.008912373,"about_ca_system_score_codex":0.0020549402,"about_ca_system_score_gemma":0.0016505207,"threshold_uncertainty_score":0.029814899},"labels":[],"label_agreement":null},{"id":"W2007363986","doi":"10.1142/s0129626407003137","title":"ON A UNIFIED NEIGHBOURHOOD BROADCASTING SCHEME FOR INTERCONNECTION NETWORKS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Brock University","funders":"","keywords":"Neighbourhood (mathematics); Interconnection; Hypercube; Computer science; Broadcasting (networking); Star (game theory); Computer network; Algorithm; Topology (electrical circuits); Theoretical computer science; Mathematics; Parallel computing; Combinatorics","score_opus":0.019930868390234693,"score_gpt":0.2607221117937441,"score_spread":0.2407912434035094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007363986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016898833,0.0003941176,0.97270334,0.000212356,0.000057493842,0.000076150405,0.00006180991,0.00034599664,0.00924992],"genre_scores_gemma":[0.3416731,0.0010528493,0.64462626,0.00018741997,0.00014905886,0.0003965025,0.00029540915,0.00029101653,0.011328311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.0002448821,0.00004316378,0.0001295223,0.0002946993,0.00009064414],"domain_scores_gemma":[0.99868494,0.00057360966,0.00008364983,0.00037305403,0.00021907553,0.00006568123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011201015,0.00042595502,0.0008407977,0.00081088825,0.0010804428,0.0011003976,0.0016209146,0.0010855808,0.0034684734],"category_scores_gemma":[0.004703653,0.00034552653,0.0005697933,0.0014097033,0.001326949,0.0030665596,0.002121816,0.0013724746,0.0008997927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002110141,0.00005862182,0.00023781211,0.00016926942,0.000021042137,0.00007907152,0.0005201338,0.21314313,0.017003566,0.6497725,0.005234419,0.11354937],"study_design_scores_gemma":[0.00008404221,0.00014075373,0.0001380396,0.000035386343,0.000023363908,0.00012295612,0.00006232556,0.7653248,0.00515912,0.21301891,0.015853614,0.000036732512],"about_ca_topic_score_codex":0.002257467,"about_ca_topic_score_gemma":0.0026675,"teacher_disagreement_score":0.0034684734,"about_ca_system_score_codex":0.0014541695,"about_ca_system_score_gemma":0.00088558247,"threshold_uncertainty_score":0.011603236},"labels":[],"label_agreement":null},{"id":"W2008227163","doi":"10.1142/s0129626404001969","title":"ROUTING BALANCED COMMUNICATIONS ON HAMILTON DECOMPOSABLE NETWORKS","year":2004,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Permutation (music); Upper and lower bounds; Arc (geometry); Mathematics; Combinatorics; Enhanced Data Rates for GSM Evolution; Ring (chemistry); Routing (electronic design automation); Discrete mathematics; Computer science; Telecommunications; Computer network","score_opus":0.014484763691482138,"score_gpt":0.24262264481109308,"score_spread":0.22813788111961095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008227163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33317062,0.00090310315,0.6300845,0.00045516103,0.0000863638,0.00020630947,0.00070399436,0.0005077209,0.033882238],"genre_scores_gemma":[0.9034939,0.0009673832,0.08048021,0.00014302443,0.00004841,0.00017797608,0.0006944637,0.00008939595,0.013905352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995813,0.000078397425,0.000018703373,0.000056876357,0.0001612909,0.00010337877],"domain_scores_gemma":[0.9987159,0.00073154864,0.000169112,0.00013345621,0.00018845488,0.00006159114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004938977,0.00080362055,0.00036557938,0.00070476386,0.00042628692,0.0006626583,0.0005356243,0.0003175533,0.004116422],"category_scores_gemma":[0.0017375131,0.000278215,0.00012485952,0.0006660996,0.00045810477,0.001712445,0.0007784071,0.0005345283,0.00049806543],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008809859,0.00014457577,0.0016638052,0.00045905722,0.00007163879,0.0006219188,0.0004346554,0.29446846,0.08666778,0.41631454,0.0071582645,0.19111441],"study_design_scores_gemma":[0.00006697574,0.00022989378,0.00068223197,0.000031510484,0.000026295196,0.0001700673,0.000117474025,0.741755,0.022950971,0.2228868,0.011056627,0.0000262252],"about_ca_topic_score_codex":0.0016742558,"about_ca_topic_score_gemma":0.003507341,"teacher_disagreement_score":0.004116422,"about_ca_system_score_codex":0.0010191139,"about_ca_system_score_gemma":0.00040022365,"threshold_uncertainty_score":0.013770759},"labels":[],"label_agreement":null},{"id":"W2010477552","doi":"10.1142/s0129626407003009","title":"PARALLELISM IN QUANTUM INFORMATION PROCESSING DEFEATS THE UNIVERSAL COMPUTER","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Queen's University","funders":"","keywords":"Computer science; Parallelism (grammar); Quantum computer; Perspective (graphical); Information processing; Theoretical computer science; Quantum; Universal Turing machine; Parallel computing; Turing machine; Algorithm; Artificial intelligence; Computation","score_opus":0.00850951637500192,"score_gpt":0.22495644328008732,"score_spread":0.2164469269050854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010477552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24389212,0.0045213797,0.58362794,0.02287715,0.0010258859,0.00013355757,0.00015396516,0.0011020937,0.14266595],"genre_scores_gemma":[0.95974576,0.0010617202,0.034355324,0.0007276443,0.00032025282,0.00008605607,0.000030147708,0.00010162798,0.003571508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981635,0.0005584827,0.00008286326,0.00030398238,0.0006580623,0.00023321634],"domain_scores_gemma":[0.9957936,0.0023020995,0.00019212239,0.0012220285,0.00027537037,0.00021486892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026506241,0.00036357326,0.0008891938,0.00081173674,0.0020896918,0.002929948,0.0015205577,0.0021490862,0.0022305737],"category_scores_gemma":[0.0067731733,0.00045224233,0.0005756428,0.0005292282,0.011584616,0.008468406,0.0032026798,0.0041117957,0.00048034554],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019337665,0.0000083299,0.000057839672,0.000022921444,0.0000042803563,0.000021821957,0.00011312746,0.0013939322,0.0007445437,0.9941187,0.00032088393,0.0031743469],"study_design_scores_gemma":[0.000013247493,0.000023166744,0.000034966462,0.000013985178,0.000003615169,0.000029792824,0.000028864824,0.008612823,0.00085896626,0.987542,0.0028295056,0.000009034005],"about_ca_topic_score_codex":0.00060173613,"about_ca_topic_score_gemma":0.00051527773,"teacher_disagreement_score":0.002929948,"about_ca_system_score_codex":0.0012842732,"about_ca_system_score_gemma":0.001416278,"threshold_uncertainty_score":0.014017999},"labels":[],"label_agreement":null},{"id":"W2015861674","doi":"10.1142/s0129626407003010","title":"PARALLEL ALGORITHMS FOR CELLULAR MODELS SIMULATION","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Simulation Techniques and Applications","field":"Decision Sciences","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":"Carleton University","funders":"","keywords":"DEVS; Computer science; Rollback; Parallel computing; Formalism (music); Execution time; Kernel (algebra); Discrete event simulation; Modeling and simulation; Distributed computing; Algorithm; Theoretical computer science; Simulation; Programming language; Database transaction; Mathematics","score_opus":0.18879982265575052,"score_gpt":0.42725958051064244,"score_spread":0.23845975785489193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015861674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004640877,0.00017340729,0.99010336,0.00014596929,0.00003945215,0.000040266816,0.00007670987,0.00052657624,0.0042534354],"genre_scores_gemma":[0.25371215,0.00062143,0.7368708,0.00011001079,0.0000708299,0.00059570663,0.00048453378,0.00037227423,0.0071622846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994324,0.00018112434,0.000036681602,0.00007248785,0.0002186903,0.00005850349],"domain_scores_gemma":[0.9989833,0.00054436614,0.00005754326,0.00019273449,0.00017961078,0.00004243083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078209385,0.00066594157,0.00080486666,0.000570754,0.0006923625,0.0011832148,0.0011911562,0.0007956996,0.004414967],"category_scores_gemma":[0.003243021,0.00041519586,0.0009313452,0.0007724929,0.00078584754,0.0010880729,0.0014607677,0.0012284085,0.0008336778],"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.000041621617,0.000020743944,0.00038106734,0.000070820475,0.00002615432,0.00005242193,0.0000788724,0.7368381,0.0011175093,0.22656637,0.0017983413,0.033007935],"study_design_scores_gemma":[0.000009816855,0.0000041814237,0.00002003752,0.0000042707325,0.0000029027206,0.000010239825,0.000007636309,0.95439464,0.00039360047,0.042327944,0.0028217915,0.000002866794],"about_ca_topic_score_codex":0.0056381994,"about_ca_topic_score_gemma":0.0042252694,"teacher_disagreement_score":0.0056381994,"about_ca_system_score_codex":0.0015774567,"about_ca_system_score_gemma":0.0012029089,"threshold_uncertainty_score":0.014769554},"labels":[],"label_agreement":null},{"id":"W2016502207","doi":"10.1142/s0129626409000079","title":"TOWARDS A FRAMEWORK FOR INTUITIVE PROGRAMMING OF CELLULAR AUTOMATA","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cellular Automata and Applications","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":"Queen's University","funders":"","keywords":"Cellular automaton; Computer science; Asynchronous cellular automaton; Theoretical computer science; Mobile automaton; Automaton; Simple (philosophy); Computation; Genetic programming; Programmer; Distributed computing; Automata theory; Programming language; Algorithm; Artificial intelligence","score_opus":0.019491425004029013,"score_gpt":0.2830307755182556,"score_spread":0.2635393505142266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016502207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010159909,0.00012763789,0.99613476,0.0002562403,0.00003218579,0.000048095462,0.000029585464,0.00039824258,0.0019573907],"genre_scores_gemma":[0.04642646,0.00043986016,0.9502318,0.00022313383,0.00007738379,0.00041514958,0.000105585066,0.0002470837,0.0018335733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980806,0.00072136713,0.00017579983,0.000329335,0.00054868934,0.00014411351],"domain_scores_gemma":[0.9983323,0.0007074662,0.00012620365,0.00040148193,0.00032731742,0.000105262225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031225635,0.0011477907,0.0010571051,0.0011647819,0.0013187709,0.0040564104,0.0036443798,0.0019930454,0.0034806065],"category_scores_gemma":[0.004796601,0.0010912068,0.0027911086,0.001115951,0.0044207997,0.0040595266,0.0030532584,0.0051316735,0.0013098782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010901207,0.000018710647,0.000086365566,0.000076456934,0.0000103958455,0.00007893594,0.00027294923,0.018489037,0.0015885975,0.9671103,0.0008662545,0.01139106],"study_design_scores_gemma":[0.000030520827,0.00003922317,0.000052067222,0.000082536644,0.000022907054,0.00008988245,0.00009719065,0.15736818,0.001852714,0.8054662,0.034871504,0.000027115875],"about_ca_topic_score_codex":0.001991789,"about_ca_topic_score_gemma":0.002499336,"teacher_disagreement_score":0.0040564104,"about_ca_system_score_codex":0.0014306866,"about_ca_system_score_gemma":0.0020468244,"threshold_uncertainty_score":0.016513944},"labels":[],"label_agreement":null},{"id":"W2017204622","doi":"10.1142/s0129626413500102","title":"PARALLEL ALGORITHM FOR SECOND–ORDER RESTRICTED WEAK INTEGER COMPOSITION GENERATION FOR SHARED MEMORY MACHINES","year":2013,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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 Manitoba","funders":"","keywords":"Integer (computer science); Bounded function; Order (exchange); Integer programming; Mathematics; Combinatorics; Parallel algorithm; Computer science; Parallel computing; Algorithm; Discrete mathematics","score_opus":0.020301101147326535,"score_gpt":0.25457994559020997,"score_spread":0.23427884444288344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017204622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023448594,0.00008601504,0.9688639,0.00012828775,0.000061908126,0.00016875863,0.000070351954,0.0015806826,0.0055915145],"genre_scores_gemma":[0.19444595,0.00008426448,0.7978991,0.00008673808,0.000040475326,0.00026046933,0.00038779556,0.00026795955,0.0065271812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994936,0.00008749837,0.00004077505,0.00011086979,0.00018050619,0.00008681099],"domain_scores_gemma":[0.99948186,0.00019520364,0.000030770745,0.000119472716,0.00014492116,0.00002784363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005976839,0.0007579889,0.00067511963,0.0006754243,0.0008631373,0.0008060065,0.0010142486,0.00049696164,0.0064954287],"category_scores_gemma":[0.0014140063,0.00034868554,0.00083128776,0.0008804267,0.00058727816,0.00128394,0.0011536595,0.0008620285,0.0014284872],"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.0009075938,0.00029781155,0.0014287744,0.00036625614,0.00010720398,0.00043437077,0.0004201066,0.12820506,0.04972749,0.1583575,0.009512794,0.65023506],"study_design_scores_gemma":[0.00025042877,0.000221384,0.00031426476,0.000016713468,0.000053635256,0.00028095415,0.00008095277,0.84018457,0.037810925,0.1023065,0.0184399,0.000039627517],"about_ca_topic_score_codex":0.0012411459,"about_ca_topic_score_gemma":0.002024628,"teacher_disagreement_score":0.0064954287,"about_ca_system_score_codex":0.00070075085,"about_ca_system_score_gemma":0.0012613342,"threshold_uncertainty_score":0.02172935},"labels":[],"label_agreement":null},{"id":"W2020165959","doi":"10.1142/s0129626406002782","title":"A HIGHLY CONCURRENT GROUP MUTUAL l-EXCLUSION ALGORITHM","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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":"Memorial University of Newfoundland","funders":"","keywords":"Mutual exclusion; Concurrency; Computer science; Asynchronous communication; Generalization; Critical section; Algorithm; Group (periodic table); Process (computing); Suzuki-Kasami algorithm; Extension (predicate logic); Theoretical computer science; Distributed computing; Mathematics; Programming language; Computer network","score_opus":0.008804448669416143,"score_gpt":0.2258978333368807,"score_spread":0.21709338466746456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020165959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011055083,0.0001515416,0.98178375,0.0002454994,0.000065474276,0.00013806562,0.00006201475,0.0013791448,0.0051193386],"genre_scores_gemma":[0.22126368,0.00012923464,0.768684,0.00021972509,0.00006985676,0.00027829732,0.00024759854,0.0001701939,0.008937416],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891794,0.0002480112,0.000058997386,0.00020141028,0.00041100942,0.0001626111],"domain_scores_gemma":[0.9989311,0.00035426204,0.00008856944,0.00026134067,0.0002574804,0.00010718375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010558632,0.000619784,0.0007788609,0.0005275352,0.0011871323,0.0010480742,0.002204278,0.0013132617,0.005479363],"category_scores_gemma":[0.0023556692,0.00031536835,0.00041021474,0.0008049534,0.0006149706,0.0014539403,0.0021453295,0.0009129324,0.0014876674],"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.00084239396,0.0004764258,0.0014647711,0.00023115826,0.00008804229,0.0003442747,0.00036753275,0.30616724,0.019901758,0.10959106,0.018723406,0.54180187],"study_design_scores_gemma":[0.00022319719,0.000117905845,0.0001493164,0.000013197393,0.000019896877,0.00017699458,0.00002835767,0.93143034,0.0050664945,0.04590629,0.016845638,0.000022384209],"about_ca_topic_score_codex":0.0015924695,"about_ca_topic_score_gemma":0.0019260233,"teacher_disagreement_score":0.005479363,"about_ca_system_score_codex":0.0007176638,"about_ca_system_score_gemma":0.0015030869,"threshold_uncertainty_score":0.018330276},"labels":[],"label_agreement":null},{"id":"W2021984249","doi":"10.1142/s0129626407003034","title":"COMPARING MINIMUM NEIGHBORHOOD EVALUATION SCHEMES FOR FINDING SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Multi-Objective Optimization Algorithms","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 Guelph","funders":"National Science Council","keywords":"Robustness (evolution); Fitness function; Mathematical optimization; Neighbourhood (mathematics); Computer science; Algorithm; Mathematics; Genetic algorithm","score_opus":0.08517098334736357,"score_gpt":0.3201502356648206,"score_spread":0.23497925231745703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021984249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.166894,0.002990282,0.8216618,0.00032402834,0.0001274384,0.00027844583,0.00011883244,0.00044547993,0.00715974],"genre_scores_gemma":[0.6086766,0.0009675291,0.38753158,0.00006218719,0.00004576248,0.00030268982,0.00021529401,0.00015002963,0.0020482063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768,0.0008718818,0.00020639863,0.00020292314,0.00093233876,0.0001065043],"domain_scores_gemma":[0.9903342,0.006805597,0.0005390194,0.0010205461,0.0011506288,0.00015005411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058194497,0.00076141686,0.0012565696,0.0026614543,0.00047322692,0.0011059585,0.0012715535,0.0016226711,0.001362217],"category_scores_gemma":[0.023430685,0.00032606345,0.0010624243,0.0016306612,0.00086327014,0.0022420657,0.0014239969,0.0007159321,0.00025781608],"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.0006523289,0.00012980589,0.0027192687,0.00037266914,0.00019236245,0.000076110104,0.00027333398,0.7203446,0.0065827924,0.033465173,0.001018186,0.2341733],"study_design_scores_gemma":[0.000039598788,0.0003344009,0.001418777,0.00004872811,0.000054964577,0.00009258195,0.000078642915,0.98248094,0.005735902,0.00849478,0.001181061,0.000039600713],"about_ca_topic_score_codex":0.0017972208,"about_ca_topic_score_gemma":0.0016252254,"teacher_disagreement_score":0.0058194497,"about_ca_system_score_codex":0.001265264,"about_ca_system_score_gemma":0.00055947196,"threshold_uncertainty_score":0.03077656},"labels":[],"label_agreement":null},{"id":"W2035452705","doi":"10.1142/s012962641000020x","title":"A QUANTUM CRYPTOGRAPHIC SOLUTION TO THE PROBLEM OF ACCESS CONTROL IN A HIERARCHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Queen's University","funders":"","keywords":"Hierarchy; Computer science; Access control; Cryptography; Collusion; Scheme (mathematics); Theoretical computer science; Computer security; Identity (music); Computer access control; Key (lock); Mathematics","score_opus":0.012077556865887523,"score_gpt":0.25034125917883915,"score_spread":0.23826370231295163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035452705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018281987,0.0005035779,0.95429486,0.004020983,0.00028351988,0.00016768914,0.00010418651,0.0002144061,0.022128837],"genre_scores_gemma":[0.5746583,0.0010187789,0.39903387,0.0014084539,0.00071895355,0.00032189995,0.00013435594,0.00009664162,0.02260885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975454,0.0005668157,0.00013357517,0.00031152443,0.0010580628,0.0003845368],"domain_scores_gemma":[0.99794143,0.0006500413,0.0002001178,0.0006914215,0.00035287556,0.0001641794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022595753,0.00034116802,0.00068949984,0.0008317802,0.0024384058,0.0021738375,0.0017096706,0.0020946416,0.005548125],"category_scores_gemma":[0.005126491,0.00043673988,0.0010167201,0.0011177554,0.004073075,0.005690665,0.004894336,0.0031982681,0.0010977512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004012041,0.000018319339,0.00006928193,0.000032322037,0.000010156709,0.000056505294,0.00015925098,0.002827173,0.0021766166,0.9802127,0.0026562493,0.011741283],"study_design_scores_gemma":[0.00010009598,0.00008771755,0.00015392223,0.00003711539,0.00002297472,0.00026212508,0.00009044454,0.07898984,0.0030553502,0.89231825,0.024829254,0.000052926513],"about_ca_topic_score_codex":0.00097153906,"about_ca_topic_score_gemma":0.00075536495,"teacher_disagreement_score":0.005548125,"about_ca_system_score_codex":0.0016428251,"about_ca_system_score_gemma":0.0025084442,"threshold_uncertainty_score":0.01856029},"labels":[],"label_agreement":null},{"id":"W2040195773","doi":"10.1142/s0129626406002472","title":"A PARALLEL PROBABILISTIC SYSTEM-LEVEL FAULT DIAGNOSIS APPROACH FOR LARGE MULTIPROCESSOR SYSTEMS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"VLSI and Analog Circuit Testing","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 Ottawa","funders":"","keywords":"Computer science; Probabilistic logic; A priori and a posteriori; Multiprocessing; Parallel algorithm; Identification (biology); Fault (geology); Node (physics); Parallel computing; Evolutionary algorithm; Computation; Algorithm; Artificial intelligence","score_opus":0.036607184321355436,"score_gpt":0.24671891148101482,"score_spread":0.2101117271596594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040195773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011577056,0.00007867838,0.9870712,0.000111215966,0.000010175491,0.00002385038,0.000010445008,0.00030565282,0.0008116587],"genre_scores_gemma":[0.40815926,0.0001497531,0.5897423,0.000091422975,0.000020911115,0.0000891299,0.000055082473,0.000048544654,0.0016435488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996612,0.00006615924,0.000014342053,0.000069695605,0.00016069852,0.000028052431],"domain_scores_gemma":[0.9995579,0.00021444811,0.000051830117,0.000062210194,0.000095960466,0.000017646724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050605554,0.00040509427,0.00042125734,0.00052789995,0.00045615606,0.00042469005,0.0008466512,0.0007081804,0.0010539999],"category_scores_gemma":[0.001568023,0.000238501,0.00047625042,0.0003462736,0.0005219755,0.0006859874,0.0004962991,0.00060091197,0.00020055963],"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.000045370278,0.000040205345,0.000998548,0.000051758034,0.000033620356,0.0001380575,0.000048773203,0.8715819,0.009075021,0.012822215,0.00034627822,0.10481826],"study_design_scores_gemma":[0.000007920936,0.000018674431,0.00015539315,0.000002624447,0.000008324456,0.00007959923,0.0000046502028,0.9902603,0.0018820657,0.0069283205,0.0006480834,0.0000039492415],"about_ca_topic_score_codex":0.0024886157,"about_ca_topic_score_gemma":0.002763515,"teacher_disagreement_score":0.0024886157,"about_ca_system_score_codex":0.0006426135,"about_ca_system_score_gemma":0.00084144523,"threshold_uncertainty_score":0.0049482584},"labels":[],"label_agreement":null},{"id":"W2066040291","doi":"10.1142/s0129626410000193","title":"KEY DISTRIBUTION VERSUS KEY ENHANCEMENT IN QUANTUM CRYPTOGRAPHY","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Computing Algorithms and Architecture","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":"Queen's University","funders":"","keywords":"Quantum cryptography; Quantum key distribution; Computer science; Cryptography; Key distribution; Key (lock); ID-based cryptography; Public-key cryptography; Theoretical computer science; Financial cryptography; Shared secret; Lattice-based cryptography; PKCS #1; Quantum information; Computer security; Quantum; Encryption; Quantum mechanics; Physics; Cryptosystem","score_opus":0.0100230100663497,"score_gpt":0.2420302842438384,"score_spread":0.2320072741774887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066040291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031201864,0.02499224,0.75069976,0.020146104,0.0021422284,0.00025608134,0.00008932548,0.00032742403,0.17014498],"genre_scores_gemma":[0.8541387,0.015598879,0.10326034,0.0035946912,0.003016653,0.0003487014,0.000042096915,0.00021005966,0.019789917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99646604,0.0015397957,0.0001515562,0.00051720353,0.0008871135,0.00043831454],"domain_scores_gemma":[0.9956601,0.002776622,0.00029707456,0.0009563829,0.00020473852,0.00010497106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043567894,0.00067442446,0.0012189228,0.000948061,0.0016559022,0.0027470356,0.0018043726,0.0030226891,0.004618619],"category_scores_gemma":[0.0066277822,0.00047212324,0.0007587261,0.0015333601,0.013505314,0.015430955,0.00346506,0.005294552,0.0013270412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027665887,0.000008701449,0.000014536263,0.000053260814,0.0000019121255,0.000017008459,0.000055774337,0.00055173854,0.000441558,0.99474055,0.00028717576,0.00380024],"study_design_scores_gemma":[0.000031064552,0.00006051536,0.00002518502,0.000048285725,0.000006993574,0.000117346564,0.000033718447,0.0049651,0.0017884949,0.9821445,0.010764604,0.0000141990095],"about_ca_topic_score_codex":0.00023582912,"about_ca_topic_score_gemma":0.00010562862,"teacher_disagreement_score":0.004618619,"about_ca_system_score_codex":0.0022442194,"about_ca_system_score_gemma":0.00085065846,"threshold_uncertainty_score":0.023041189},"labels":[],"label_agreement":null},{"id":"W2071889691","doi":"10.1142/s012962640700296x","title":"ASPECTS OF BIOMOLECULAR COMPUTING","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Queen's University","funders":"","keywords":"Membrane computing; DNA computing; Natural computing; Computer science; Unconventional computing; Field (mathematics); Computation; Process (computing); Theoretical computer science; Supercomputer; Distributed computing; Computational science; Parallel computing; Algorithm; Mathematics","score_opus":0.013027655964919744,"score_gpt":0.26577668498190216,"score_spread":0.25274902901698243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071889691","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007315665,0.17850728,0.21896937,0.03500422,0.004462095,0.00013020368,0.000395903,0.00054084783,0.5546745],"genre_scores_gemma":[0.5227773,0.21258105,0.12833767,0.013456686,0.021018514,0.0007161587,0.00088903785,0.0004793887,0.099744156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986494,0.00038738272,0.000078135825,0.00023018566,0.0005489903,0.00010600417],"domain_scores_gemma":[0.998767,0.0006134519,0.000062622225,0.00032060914,0.00016260933,0.00007373363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009877435,0.0007634909,0.000758046,0.0014997299,0.0016283612,0.004962681,0.001184342,0.0022025136,0.009186395],"category_scores_gemma":[0.0029337772,0.00038775787,0.0007085348,0.0022700657,0.0065826434,0.006594587,0.0022390052,0.0029164194,0.00310261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036824683,0.000005578968,0.000044020053,0.00008625862,0.0000050042368,0.000027505279,0.00006585167,0.0006014151,0.00013890925,0.9864733,0.0038324662,0.00871612],"study_design_scores_gemma":[0.0000027869808,0.0000047893063,0.00004544097,0.000042617306,0.0000021956566,0.00007691993,0.00002575316,0.0011229536,0.00008161905,0.9324106,0.06618095,0.0000034229845],"about_ca_topic_score_codex":0.0009608338,"about_ca_topic_score_gemma":0.0005191675,"teacher_disagreement_score":0.009186395,"about_ca_system_score_codex":0.0017658082,"about_ca_system_score_gemma":0.0010558154,"threshold_uncertainty_score":0.0307315},"labels":[],"label_agreement":null},{"id":"W2072081880","doi":"10.1142/s0129626405002404","title":"Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Real-Time Systems Scheduling","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":"St. Francis Xavier University","funders":"","keywords":"Shortest path problem; Dynamic priority scheduling; Computer science; Scheduling (production processes); Loop (graph theory); Mathematical optimization; Fair-share scheduling; Dynamic programming; Feedback loop; Algorithm; Parallel computing; Mathematics; Theoretical computer science; Schedule; Graph","score_opus":0.02596882797196698,"score_gpt":0.30003898314699856,"score_spread":0.2740701551750316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072081880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068778647,0.000111250716,0.9905364,0.000058553545,0.000053494154,0.00005354341,0.000020812446,0.00054187584,0.0017463089],"genre_scores_gemma":[0.37840736,0.00034368254,0.61734325,0.00010388235,0.00009244731,0.00032181572,0.0001409543,0.00026697735,0.0029796618],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996686,0.00009685506,0.000011989987,0.000050259678,0.00013394952,0.000038342758],"domain_scores_gemma":[0.9995365,0.00024761702,0.00003363687,0.00005124023,0.00010498092,0.000026131618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512515,0.00063338433,0.000508991,0.00062349613,0.0005628333,0.0003647399,0.00085667946,0.0005278473,0.0030421505],"category_scores_gemma":[0.0015582703,0.00019869524,0.0003913426,0.00064915913,0.0005660378,0.0006397485,0.0006877381,0.0008400713,0.0004236131],"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.00024106172,0.00015270356,0.0002941254,0.00021939313,0.000043788626,0.00010276446,0.00016345263,0.5168062,0.033459514,0.044752914,0.00421751,0.39954656],"study_design_scores_gemma":[0.000042483298,0.000110558125,0.00007449725,0.0000075358253,0.000008148536,0.00003813575,0.000013172678,0.9782568,0.006239009,0.011151338,0.0040469365,0.000011320914],"about_ca_topic_score_codex":0.0028719094,"about_ca_topic_score_gemma":0.0023112535,"teacher_disagreement_score":0.0030421505,"about_ca_system_score_codex":0.0005480914,"about_ca_system_score_gemma":0.0010669525,"threshold_uncertainty_score":0.010177016},"labels":[],"label_agreement":null},{"id":"W2075815517","doi":"10.1142/s0129626401000506","title":"DYNAMIC LOAD BALANCERS FOR A MULTITHREADED MULTIPROCESSOR SYSTEM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","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 Alberta","funders":"","keywords":"Computer science; Parallel computing; Load balancing (electrical power); Multiprocessing; Synchronization (alternating current); Compiler; Compile time; Distributed computing; Runtime system; Operating system; Grid; Computer network","score_opus":0.016301869036382956,"score_gpt":0.2668241556119236,"score_spread":0.2505222865755406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075815517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3222292,0.00094745914,0.66506356,0.00039425658,0.000111294765,0.00018967732,0.00007867528,0.0063775284,0.004608355],"genre_scores_gemma":[0.8328748,0.0002168902,0.16382001,0.00006278689,0.00006302096,0.0001350912,0.00013689208,0.0002329961,0.0024575111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935454,0.00013862942,0.00005425494,0.00012331674,0.00024066128,0.00008863809],"domain_scores_gemma":[0.99901783,0.00036064204,0.00013394444,0.00023804668,0.00016396743,0.00008553343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000916998,0.00041651772,0.0005181306,0.00049039203,0.0008343553,0.0012059922,0.0012024066,0.00039776915,0.001949301],"category_scores_gemma":[0.0026111682,0.00034004723,0.00027952204,0.00045576468,0.0005154172,0.0012804936,0.00058388506,0.00068402564,0.0004477279],"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.0012094101,0.00045403425,0.0051091183,0.00023343858,0.00011972658,0.00034273745,0.0004045052,0.45036164,0.17509574,0.025822407,0.0050606085,0.33578664],"study_design_scores_gemma":[0.00013834656,0.00016815795,0.00078101474,0.000005807646,0.000034676705,0.00005542215,0.000029214392,0.9718788,0.017335733,0.005908515,0.0036473598,0.000016857437],"about_ca_topic_score_codex":0.0013086374,"about_ca_topic_score_gemma":0.0017834659,"teacher_disagreement_score":0.001949301,"about_ca_system_score_codex":0.0007040791,"about_ca_system_score_gemma":0.0007329062,"threshold_uncertainty_score":0.0065211058},"labels":[],"label_agreement":null},{"id":"W2076702673","doi":"10.1142/s0129626410000211","title":"ONE-TIME PADS WITHOUT PRIOR ENCOUNTER","year":2010,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Information and Cryptography","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":"Queen's University","funders":"","keywords":"Secrecy; Encryption; Computer science; Cryptography; Key (lock); Value (mathematics); Transmission (telecommunications); Computer network; Computer security; Algorithm; Theoretical computer science; Telecommunications","score_opus":0.009509417698472166,"score_gpt":0.23317682886866495,"score_spread":0.2236674111701928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076702673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108196296,0.0011159612,0.72545046,0.0021262786,0.0011028568,0.00040255353,0.000388842,0.003652054,0.15756468],"genre_scores_gemma":[0.77346945,0.000733603,0.11859327,0.00058536144,0.00028844265,0.00029858926,0.00035819778,0.00061777397,0.105055355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99775475,0.00031872286,0.0001543685,0.0005406492,0.0008560792,0.00037545263],"domain_scores_gemma":[0.99471176,0.0008204509,0.00043943804,0.0034548233,0.0004004687,0.00017308432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089518685,0.0008080682,0.00097635324,0.00047275802,0.0012342698,0.0032810192,0.0018224716,0.0017898586,0.023581468],"category_scores_gemma":[0.0047046533,0.00065989315,0.00069470226,0.0005507242,0.0024595594,0.007340467,0.0042872755,0.0024746833,0.012438847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055954984,0.00020632683,0.0010106623,0.00033471026,0.000043238142,0.0008773303,0.00080498063,0.002886068,0.058396947,0.85574734,0.006831101,0.07230169],"study_design_scores_gemma":[0.00011852598,0.000752428,0.0007856812,0.00015040669,0.00010527282,0.004441255,0.00046600643,0.039622,0.3547783,0.3930736,0.20553023,0.00017626802],"about_ca_topic_score_codex":0.0001367038,"about_ca_topic_score_gemma":0.000136769,"teacher_disagreement_score":0.023581468,"about_ca_system_score_codex":0.00066898664,"about_ca_system_score_gemma":0.00086732913,"threshold_uncertainty_score":0.07888788},"labels":[],"label_agreement":null},{"id":"W2086944191","doi":"10.1142/s0129626414400040","title":"Evolutionary Design of Gene Networks: Forced Evolution by Genomic Parasites","year":2014,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Evolution and Genetic Dynamics","field":"Biochemistry, Genetics and Molecular Biology","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":"British Columbia Institute of Technology","funders":"National Institute of General Medical Sciences; National Institutes of Health; Russian Foundation for Basic Research","keywords":"Biology; Evolutionary biology; Gene; Computer science; Computational biology; Genetics","score_opus":0.006163644749219112,"score_gpt":0.21587547245996935,"score_spread":0.20971182771075025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086944191","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792738,0.00034971116,0.21106437,0.0011881383,0.0000728187,0.00003433442,0.000062776395,0.0003287426,0.0076253694],"genre_scores_gemma":[0.9825415,0.00012449516,0.01621391,0.00008115731,0.000010282279,0.00003693677,0.00001895863,0.000034248547,0.00093839946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998487,0.000053547647,0.0000056552376,0.000043619413,0.00002561181,0.00002286489],"domain_scores_gemma":[0.99948126,0.0002345147,0.00007538782,0.00007684202,0.000042829804,0.00008923162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035252026,0.00012391304,0.00026236486,0.0002975094,0.000428672,0.00089542405,0.0006148747,0.00057537324,0.0016107191],"category_scores_gemma":[0.0022674291,0.00026996466,0.00028108325,0.0001764555,0.0012429974,0.00113905,0.0005901502,0.0005125888,0.00017179729],"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.00017191509,0.00008053308,0.0060016685,0.00013801632,0.00008375201,0.00060500647,0.0004083256,0.44704825,0.13344756,0.38763225,0.0011391811,0.02324357],"study_design_scores_gemma":[0.000029392946,0.000047070913,0.0012722074,0.0000064307296,0.000013378412,0.00014045772,0.00006770607,0.86508256,0.006251305,0.12518367,0.0018876669,0.00001826094],"about_ca_topic_score_codex":0.00060763274,"about_ca_topic_score_gemma":0.000699977,"teacher_disagreement_score":0.0016107191,"about_ca_system_score_codex":0.00084873074,"about_ca_system_score_gemma":0.00036424684,"threshold_uncertainty_score":0.0061579347},"labels":[],"label_agreement":null},{"id":"W2098559645","doi":"10.1142/s0129626403001598","title":"PARALLEL ALGORITHMS FOR VEHICLE ROUTING PROBLEMS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Computer science; Time complexity; Routing (electronic design automation); Algorithm; Vehicle routing problem; Crew; Parallel algorithm; Routing table; Destination-Sequenced Distance Vector routing; Path (computing); Parallel computing; Computer network; Link-state routing protocol; Routing protocol","score_opus":0.03144977875051786,"score_gpt":0.2734180421681125,"score_spread":0.24196826341759464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098559645","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008982838,0.0016111056,0.9688093,0.0009908733,0.00020882238,0.00025806713,0.0002547613,0.0016202589,0.017263833],"genre_scores_gemma":[0.15678877,0.00236959,0.8254983,0.00034286827,0.00041354224,0.000994795,0.0011270703,0.000537344,0.011927776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980925,0.0005518204,0.00012221538,0.00040581686,0.0004922009,0.00033551248],"domain_scores_gemma":[0.998168,0.0011223924,0.00013486907,0.00026487597,0.00023135482,0.00007860934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018922483,0.0020855246,0.0016868407,0.0011067885,0.0015069239,0.0024732172,0.0023047633,0.001497441,0.00890703],"category_scores_gemma":[0.005984606,0.0007774464,0.001344288,0.0025140487,0.0012214391,0.0031598902,0.0022138918,0.0025576865,0.0025096496],"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.00019792,0.00022338946,0.00052192865,0.0005486643,0.0001236842,0.00012838624,0.00022676618,0.5765955,0.0013744086,0.20432365,0.021972833,0.19376285],"study_design_scores_gemma":[0.00018267684,0.000043939926,0.00010480727,0.000030864896,0.00002756393,0.0000657402,0.00007139353,0.7022539,0.0006629582,0.28197214,0.01457087,0.000013201905],"about_ca_topic_score_codex":0.004136474,"about_ca_topic_score_gemma":0.0047139577,"teacher_disagreement_score":0.00890703,"about_ca_system_score_codex":0.0020560962,"about_ca_system_score_gemma":0.002143447,"threshold_uncertainty_score":0.029796958},"labels":[],"label_agreement":null},{"id":"W2102904242","doi":"10.1142/s012962640300115x","title":"PARALLEL REAL-TIME COMPUTATION OF NONLINEAR FEEDBACK FUNCTIONS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Embedded Systems Design Techniques","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":"Queen's University","funders":"","keywords":"Speedup; Computer science; Computation; Parallelism (grammar); Parallel computing; Parallel algorithm; Function (biology); Nonlinear system; Parallel processing; Algorithm","score_opus":0.020308987197996783,"score_gpt":0.2619376575746751,"score_spread":0.2416286703766783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102904242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19742027,0.00044296,0.78996116,0.00048336873,0.00008337335,0.00003545899,0.000038907187,0.0009835317,0.010551051],"genre_scores_gemma":[0.85466814,0.00018113607,0.14199665,0.000046473873,0.000033843593,0.00005350895,0.000041792777,0.00009650819,0.0028819626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99970406,0.0000713362,0.000013905395,0.000045944707,0.000113670765,0.00005103875],"domain_scores_gemma":[0.99899846,0.0006223521,0.000092775525,0.000121392186,0.00012376624,0.00004132872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000795407,0.0005294974,0.00057493,0.00028401546,0.0004328295,0.00061169436,0.00057639525,0.0004984102,0.00256383],"category_scores_gemma":[0.0030933367,0.00025897202,0.00033763517,0.00033137467,0.0008715048,0.0011212742,0.00085594924,0.0006608231,0.00033635084],"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.00053886545,0.0000724012,0.0007980125,0.00015327217,0.000037998714,0.00019259135,0.00016971961,0.8679781,0.021435259,0.045641948,0.00091727026,0.062064633],"study_design_scores_gemma":[0.00003362018,0.000030121593,0.000074984615,0.0000036419347,0.000004845969,0.000021745836,0.000013464619,0.975602,0.005168316,0.018558195,0.00048544473,0.0000036237113],"about_ca_topic_score_codex":0.0014566053,"about_ca_topic_score_gemma":0.0017850703,"teacher_disagreement_score":0.00256383,"about_ca_system_score_codex":0.00058772723,"about_ca_system_score_gemma":0.0006075346,"threshold_uncertainty_score":0.00857687},"labels":[],"label_agreement":null},{"id":"W2111012197","doi":"10.1142/s0129626406002496","title":"VOTING MECHANISMS IN ASYNCHRONOUS BYZANTINE ENVIRONMENTS","year":2006,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed systems and fault tolerance","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":"Université du Québec en Outaouais","funders":"","keywords":"Asynchronous communication; Voting; Computer science; Byzantine fault tolerance; Quantum Byzantine agreement; Byzantine architecture; Distributed computing; Mechanism (biology); Computer network; Fault tolerance","score_opus":0.0067876714183110224,"score_gpt":0.20582957849625697,"score_spread":0.19904190707794595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111012197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06954865,0.00043494586,0.91985244,0.00056647946,0.000107299646,0.00021503842,0.00007478089,0.000983137,0.008217223],"genre_scores_gemma":[0.7334625,0.00054850534,0.25411314,0.00021073343,0.00021982341,0.00067832856,0.00012726686,0.00014293668,0.010496774],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99441457,0.0022800837,0.00046063768,0.0009595904,0.0012252778,0.00065982697],"domain_scores_gemma":[0.99175006,0.003978241,0.0013525209,0.001767472,0.0008441812,0.00030755592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048974818,0.0007806709,0.00094018615,0.0011839512,0.0016666047,0.0035227973,0.0019843867,0.001991646,0.003300329],"category_scores_gemma":[0.011327785,0.0005236559,0.0006630667,0.0008772305,0.002688241,0.006524981,0.002592984,0.0016287953,0.00085202866],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026510362,0.000064182,0.00046754317,0.00015312571,0.000028005263,0.00024484313,0.0007520745,0.033888053,0.0074447533,0.9232696,0.0013786949,0.032043982],"study_design_scores_gemma":[0.00042784197,0.00031969056,0.00027635097,0.000089264584,0.00007369081,0.000352388,0.00024217734,0.24821442,0.020670578,0.6890437,0.040207278,0.00008270463],"about_ca_topic_score_codex":0.00043609884,"about_ca_topic_score_gemma":0.00037199384,"teacher_disagreement_score":0.0048974818,"about_ca_system_score_codex":0.0009473975,"about_ca_system_score_gemma":0.000816684,"threshold_uncertainty_score":0.025900662},"labels":[],"label_agreement":null},{"id":"W2116466593","doi":"10.1142/s0129626403001483","title":"Predicated Partial Redundancy Elimination using a Cost Analysis","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization 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 Victoria","funders":"","keywords":"Redundancy (engineering); Computer science; Exploit; Compiler; Partial evaluation; Probabilistic logic; Computation; Data-flow analysis; Transformation (genetics); Static analysis; Parallel computing; Theoretical computer science; Algorithm; Programming language; Data flow diagram; Artificial intelligence","score_opus":0.02689541465424579,"score_gpt":0.2847682013409979,"score_spread":0.2578727866867521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116466593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03380383,0.00012194996,0.961667,0.00018310559,0.00002506104,0.000075698794,0.00007716157,0.0007502222,0.003295962],"genre_scores_gemma":[0.5671341,0.00025498783,0.42938587,0.000080225145,0.00004286614,0.00017062238,0.00016934624,0.00024048846,0.0025214632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988883,0.0002212287,0.000045610126,0.000071739196,0.0006674523,0.000105753024],"domain_scores_gemma":[0.99861693,0.0006568319,0.00013810737,0.0003097823,0.00025865564,0.000019683666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083641347,0.0006104015,0.00047193922,0.00096979825,0.00038287,0.00081847387,0.00064653164,0.00036049294,0.0015578215],"category_scores_gemma":[0.0024727385,0.000301595,0.0007754564,0.00076896383,0.00067805796,0.001131833,0.0006294565,0.00067135296,0.00027378404],"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.00023118476,0.00010959623,0.0017139076,0.00027053806,0.00007533437,0.00039943465,0.000104438026,0.5127247,0.050645795,0.22107972,0.0031879544,0.20945735],"study_design_scores_gemma":[0.0000149217,0.00008367032,0.0003261623,0.000011796475,0.000035336932,0.00015128487,0.000013297329,0.9278542,0.023799479,0.04460027,0.0030928748,0.000016760256],"about_ca_topic_score_codex":0.0007752743,"about_ca_topic_score_gemma":0.00082765316,"teacher_disagreement_score":0.0015578215,"about_ca_system_score_codex":0.0006152174,"about_ca_system_score_gemma":0.0011895836,"threshold_uncertainty_score":0.0052114725},"labels":[],"label_agreement":null},{"id":"W2120769788","doi":"10.1142/s0129626403001446","title":"TRADE-OFFS BETWEEN LOAD AND DEGREE IN VIRTUAL PATH LAYOUTS","year":2003,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Network packet; Degree (music); Computer science; Upper and lower bounds; Path (computing); Routing (electronic design automation); Path length; Topology (electrical circuits); Mathematics; Distributed computing; Computer network; Combinatorics","score_opus":0.030558346507360036,"score_gpt":0.24207847059098714,"score_spread":0.2115201240836271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120769788","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59983045,0.0011206744,0.38386977,0.0013507933,0.00006316979,0.000109005305,0.00022392794,0.0004820354,0.0129502015],"genre_scores_gemma":[0.9499425,0.00095579325,0.046130296,0.00010836801,0.00008873625,0.000063815896,0.00012395895,0.00020030157,0.0023861548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977964,0.0007892537,0.00012508903,0.00033685807,0.00044773042,0.0005046534],"domain_scores_gemma":[0.9668024,0.02391861,0.0030466989,0.0034217376,0.0014540401,0.0013566063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025274435,0.00102081,0.00094728416,0.0011805581,0.0014812103,0.002543355,0.0015047925,0.0010417541,0.0029305567],"category_scores_gemma":[0.026708167,0.0007515208,0.00048971054,0.0012325805,0.0023560512,0.008362561,0.002295403,0.0011089778,0.00056582683],"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.000950755,0.0002515344,0.009699838,0.0003403663,0.00008589056,0.0003126074,0.0008969921,0.70903033,0.04020724,0.17070478,0.0018688815,0.065650746],"study_design_scores_gemma":[0.00013961701,0.00070023775,0.0031326967,0.000073749536,0.00009450916,0.000899148,0.00061717024,0.7221793,0.025733436,0.2417771,0.004557684,0.000095299285],"about_ca_topic_score_codex":0.0005929004,"about_ca_topic_score_gemma":0.0012203923,"teacher_disagreement_score":0.0029305567,"about_ca_system_score_codex":0.0014919101,"about_ca_system_score_gemma":0.00059118884,"threshold_uncertainty_score":0.01336658},"labels":[],"label_agreement":null},{"id":"W2138779000","doi":"10.1142/s0129626413500023","title":"PARALLEL CONSTRUCTION OF DATA CUBES ON MULTI-CORE MULTI-DISK PLATFORMS","year":2013,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Database Systems and Queries","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":"Carleton University","funders":"","keywords":"Online analytical processing; Computer science; Data cube; Cube (algebra); Sorting; Very large database; Parallel computing; Speedup; Data warehouse; Aggregate (composite); sort; Core (optical fiber); Database; Data mining; Algorithm; Mathematics","score_opus":0.08356213875085854,"score_gpt":0.3058545924301158,"score_spread":0.22229245367925726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138779000","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13054189,0.00048798698,0.85594344,0.00047503522,0.00014589663,0.0002991547,0.00042646172,0.00528867,0.0063913767],"genre_scores_gemma":[0.23319902,0.00025642064,0.7620602,0.000114221286,0.000028732033,0.0003115273,0.0012394615,0.00025586796,0.002534445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884975,0.00022286337,0.00008288591,0.00014684197,0.0005485239,0.00014907561],"domain_scores_gemma":[0.9979505,0.0005925734,0.00010010653,0.00057276787,0.0006625987,0.00012148454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086859113,0.00059208804,0.00073220045,0.0007708292,0.00095309573,0.0011583319,0.0014953791,0.00045807418,0.002235664],"category_scores_gemma":[0.0029912842,0.00046080703,0.00092040084,0.0020415287,0.0006620583,0.0017475113,0.001730415,0.00095586444,0.00076021336],"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.00086290797,0.00030824557,0.0043103453,0.00048820887,0.0001635577,0.00054906425,0.0006418364,0.42189878,0.04511684,0.036262415,0.018707277,0.47069064],"study_design_scores_gemma":[0.000110311026,0.00014862228,0.0007804611,0.0000152483535,0.000020146226,0.00013397382,0.0001940653,0.9384754,0.028932516,0.019584823,0.011574088,0.00003044198],"about_ca_topic_score_codex":0.004665238,"about_ca_topic_score_gemma":0.0058182217,"teacher_disagreement_score":0.004665238,"about_ca_system_score_codex":0.0007911952,"about_ca_system_score_gemma":0.0017363945,"threshold_uncertainty_score":0.009276152},"labels":[],"label_agreement":null},{"id":"W2150687976","doi":"10.1142/s0129626407003149","title":"A TAXONOMY OF TASK SCHEDULING ALGORITHMS IN THE GRID","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","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":"Queen's University","funders":"","keywords":"Computer science; Distributed computing; Fair-share scheduling; Scheduling (production processes); Two-level scheduling; Grid; Grid computing; Dynamic priority scheduling; Architecture; Fixed-priority pre-emptive scheduling; Rate-monotonic scheduling; Algorithm; Mathematical optimization; Mathematics; Computer network; Quality of service","score_opus":0.0292541471935389,"score_gpt":0.25723512097692447,"score_spread":0.22798097378338555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150687976","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006011646,0.0108646,0.96294415,0.001384494,0.00051148474,0.0004319529,0.0003679016,0.0012668051,0.016216876],"genre_scores_gemma":[0.04181231,0.017292507,0.93264663,0.00042541328,0.00042204716,0.00069101393,0.0009633767,0.00021662025,0.0055301287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854124,0.000309786,0.00025141798,0.00020976648,0.0005553254,0.00013246622],"domain_scores_gemma":[0.99889356,0.00036262063,0.000076926735,0.00024594215,0.0003527312,0.00006830192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015275789,0.00095519156,0.0009861012,0.0020782987,0.001480456,0.00302078,0.0019642278,0.0018203858,0.0022804064],"category_scores_gemma":[0.0038514773,0.0006352291,0.0010940165,0.005333445,0.0010231341,0.0036388831,0.0010018479,0.0021624505,0.0018964299],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009884489,0.00014774974,0.0011078822,0.0010478899,0.00004582166,0.0002512632,0.00044979766,0.060163178,0.0044744415,0.63821024,0.017718468,0.2762844],"study_design_scores_gemma":[0.00005980241,0.00014490656,0.00080585404,0.00030769978,0.000033400767,0.0007606697,0.00022127072,0.22130065,0.0023727736,0.52683073,0.24708176,0.000080538885],"about_ca_topic_score_codex":0.0025985688,"about_ca_topic_score_gemma":0.0012651923,"teacher_disagreement_score":0.00302078,"about_ca_system_score_codex":0.0009926765,"about_ca_system_score_gemma":0.0017043402,"threshold_uncertainty_score":0.008078694},"labels":[],"label_agreement":null},{"id":"W2163564159","doi":"10.1142/s0129626407003058","title":"AUTHENTICATED QUANTUM KEY DISTRIBUTION WITHOUT CLASSICAL COMMUNICATION","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quantum key distribution; Computer science; Key (lock); Quantum; Channel (broadcasting); Quantum channel; Quantum cryptography; Theoretical computer science; Quantum capacity; Computer security; Computer network; Quantum network; Quantum computer; Quantum information; Quantum mechanics; Physics","score_opus":0.016213095829305284,"score_gpt":0.2759224845860343,"score_spread":0.259709388756729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163564159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009940786,0.0006964906,0.9648367,0.0012514486,0.0004637164,0.00016411468,0.000107982494,0.0004860689,0.022052653],"genre_scores_gemma":[0.539329,0.0012759513,0.42572626,0.0012736754,0.00067148416,0.0005139985,0.0002856592,0.00025043538,0.030673586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9928637,0.002108673,0.00037618115,0.001209733,0.0029031003,0.00053864677],"domain_scores_gemma":[0.9946238,0.001413726,0.00037647155,0.0024483693,0.0009687571,0.00016897736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030944028,0.0005705394,0.0010085006,0.00075156486,0.0014036335,0.0033468253,0.0023713976,0.0026101228,0.0077333897],"category_scores_gemma":[0.0093660345,0.00047332252,0.0006224657,0.001228594,0.0035414987,0.008027395,0.0036256607,0.0027863176,0.003478312],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023657556,0.000047355963,0.000097060416,0.00011319033,0.000028528173,0.00009956029,0.0001536156,0.004914007,0.0058885706,0.9441835,0.0024880946,0.041749876],"study_design_scores_gemma":[0.00016482956,0.00020537406,0.000109780885,0.00008171873,0.000046280325,0.00043344093,0.0000802926,0.13222015,0.023172252,0.7902473,0.053145804,0.000092714065],"about_ca_topic_score_codex":0.00030710708,"about_ca_topic_score_gemma":0.00019202287,"teacher_disagreement_score":0.0077333897,"about_ca_system_score_codex":0.0012013436,"about_ca_system_score_gemma":0.0017830941,"threshold_uncertainty_score":0.02587074},"labels":[],"label_agreement":null},{"id":"W2166306467","doi":"10.1142/s0129626407003046","title":"HOW SOLUTION DENSITY AFFECTS THE FINDING OF SPATIALLY ROBUST SOLUTIONS","year":2007,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Evolutionary Algorithms and Applications","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 Guelph","funders":"National Science Council","keywords":"Robustness (evolution); Mathematical optimization; Computer science; Parameter space; Mathematics; Algorithm; Statistics","score_opus":0.031801629663492925,"score_gpt":0.24488169129398402,"score_spread":0.2130800616304911,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166306467","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78954947,0.00082891394,0.20282713,0.0006422705,0.000057768186,0.00010634969,0.000106894506,0.00037776362,0.005503376],"genre_scores_gemma":[0.97791207,0.00013400255,0.021414293,0.000036391866,0.000012575301,0.000040287272,0.000046734054,0.000062378625,0.0003413746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973507,0.00091654924,0.00021203524,0.00044638017,0.00082657125,0.00024787796],"domain_scores_gemma":[0.94961494,0.041430473,0.0030730774,0.003156973,0.002176212,0.00054830307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005878791,0.0006038849,0.0009187471,0.001460783,0.00066771335,0.0019265797,0.00095721456,0.0015448661,0.00168212],"category_scores_gemma":[0.061981127,0.0005679687,0.0006657858,0.00079601014,0.0021121195,0.0029649283,0.0017596688,0.0010767822,0.0002653793],"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.00068417256,0.00026730757,0.02439209,0.000517467,0.00036691665,0.00074869377,0.00079586,0.77228063,0.082988225,0.031725228,0.0007076275,0.08452588],"study_design_scores_gemma":[0.00012013804,0.0009931448,0.02026032,0.00008858745,0.00025715385,0.0013352695,0.00046677364,0.8723318,0.06440046,0.037460063,0.0021448054,0.00014140853],"about_ca_topic_score_codex":0.0010763459,"about_ca_topic_score_gemma":0.000661758,"teacher_disagreement_score":0.005878791,"about_ca_system_score_codex":0.0006491817,"about_ca_system_score_gemma":0.0005073594,"threshold_uncertainty_score":0.031090379},"labels":[],"label_agreement":null},{"id":"W2325643405","doi":"10.1142/s0129626416500055","title":"On the Conditional Diagnosability of Hyper-Buttery Graphs and Related Networks","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Brock University","funders":"","keywords":"Hypercube; Interconnection; Scheme (mathematics); Reliability (semiconductor); Measure (data warehouse); Graph; Computer science; Mathematics; Theoretical computer science; Discrete mathematics; Computer network; Data mining","score_opus":0.011522049754263972,"score_gpt":0.2096169302629729,"score_spread":0.19809488050870894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2325643405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1708242,0.0014239824,0.81074363,0.0017007387,0.00012040535,0.000057352154,0.0002901369,0.0002827604,0.014556799],"genre_scores_gemma":[0.95149225,0.001531636,0.041926716,0.0002629229,0.00025524126,0.00014085119,0.0003905355,0.00008545321,0.003914513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992673,0.00025056227,0.00003414646,0.00014765817,0.00017999591,0.00012036862],"domain_scores_gemma":[0.9904627,0.0076574613,0.0006567954,0.00039970895,0.00053887966,0.00028445278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014260109,0.0005464955,0.00044462146,0.0010662397,0.0006022184,0.0009817455,0.0009786848,0.0008136491,0.0024196254],"category_scores_gemma":[0.011926816,0.00027518385,0.0006693202,0.0010066029,0.0028453642,0.0030344056,0.0016161442,0.0019175119,0.00014736781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085967666,0.000031525826,0.0010799181,0.0001272312,0.000028855216,0.00021586561,0.00023911287,0.24712421,0.0020485849,0.7317459,0.0019476705,0.015325107],"study_design_scores_gemma":[0.000015138586,0.000025315105,0.00048238624,0.000025434165,0.000011973289,0.00007576342,0.00005677644,0.42241088,0.00059409766,0.5752137,0.0010745717,0.0000140116945],"about_ca_topic_score_codex":0.002900589,"about_ca_topic_score_gemma":0.0018390233,"teacher_disagreement_score":0.002900589,"about_ca_system_score_codex":0.0012321913,"about_ca_system_score_gemma":0.00083272427,"threshold_uncertainty_score":0.00894022},"labels":[],"label_agreement":null},{"id":"W2414459484","doi":"10.1142/s0129626416500092","title":"On Optimal Scheduling Algorithms for Well-Structured Workflows in the Cloud with Budget and Deadline Constraints","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"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; Ontario Tech University","funders":"Atlantic Canada Opportunities Agency","keywords":"Computer science; Cloud computing; Knapsack problem; Scheduling (production processes); Computation; Algorithm; Provisioning; Mathematical optimization; Parallel computing; Mathematics","score_opus":0.015112630697936865,"score_gpt":0.24705642427945915,"score_spread":0.23194379358152228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2414459484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013353908,0.00087307673,0.9812355,0.0005583262,0.00009089945,0.00013427023,0.00012293231,0.00023050314,0.0034004517],"genre_scores_gemma":[0.20463167,0.0018052373,0.7890227,0.00032416536,0.00020073939,0.0003997916,0.00043063555,0.00026846866,0.0029166637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844104,0.0006074866,0.0000833974,0.00030587416,0.0002964705,0.00026567437],"domain_scores_gemma":[0.9957848,0.0032408994,0.00030727778,0.0002462563,0.00027362397,0.0001470535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030808744,0.0020906227,0.0017297264,0.001127218,0.0011917526,0.0022005287,0.0017650285,0.0020994344,0.0034001123],"category_scores_gemma":[0.00893464,0.0010387949,0.001270095,0.002515698,0.0017797168,0.0042615826,0.0018678816,0.002467301,0.00093684904],"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.00018607378,0.00017472765,0.00033645926,0.0002055203,0.000043328502,0.000045674067,0.00010141878,0.8976986,0.0013415819,0.05805611,0.002538148,0.039272334],"study_design_scores_gemma":[0.00005643355,0.000044420547,0.00006751101,0.000024063345,0.0000104095025,0.000017655444,0.000037984217,0.93261665,0.00047942603,0.06564778,0.0009885919,0.000009087315],"about_ca_topic_score_codex":0.004419274,"about_ca_topic_score_gemma":0.004436319,"teacher_disagreement_score":0.004419274,"about_ca_system_score_codex":0.0024824385,"about_ca_system_score_gemma":0.003923418,"threshold_uncertainty_score":0.01801145},"labels":[],"label_agreement":null},{"id":"W2418965201","doi":"10.1142/s0129626416500080","title":"Pitfalls in Memory Consistency Modelling","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization 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 Calgary","funders":"","keywords":"Consistency (knowledge bases); Consistency model; Computer science; Sequential consistency; Data consistency; Theoretical computer science; Distributed computing; Artificial intelligence","score_opus":0.023773302472192795,"score_gpt":0.2452968953228121,"score_spread":0.2215235928506193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2418965201","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008869835,0.0039952784,0.95392525,0.014173357,0.000980286,0.00017803625,0.0002708256,0.0019242978,0.015682835],"genre_scores_gemma":[0.2902539,0.005405469,0.6869109,0.004877081,0.0011123032,0.0007796724,0.00043725796,0.0018395876,0.008383703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9721556,0.011987917,0.0033938468,0.0029235368,0.0079866415,0.0015524927],"domain_scores_gemma":[0.94695836,0.022881143,0.002622568,0.017961632,0.008879855,0.00069639547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.026051283,0.0013923753,0.0019851907,0.0023859139,0.0030939819,0.007752239,0.009432787,0.0040126177,0.005196761],"category_scores_gemma":[0.07016413,0.0018032445,0.0024819933,0.0036162864,0.008846247,0.02273645,0.0071896305,0.009988497,0.0020749252],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094757,0.00004364747,0.0008552213,0.00053479354,0.000055201417,0.00026411706,0.001018723,0.019651921,0.0006872096,0.9140772,0.010360789,0.05235628],"study_design_scores_gemma":[0.000028776187,0.000044545417,0.00015587205,0.00041428814,0.000036721474,0.00048009,0.00038701677,0.04419635,0.0029410352,0.9155605,0.03566679,0.000088044544],"about_ca_topic_score_codex":0.0050806105,"about_ca_topic_score_gemma":0.0046387445,"teacher_disagreement_score":0.026051283,"about_ca_system_score_codex":0.003529508,"about_ca_system_score_gemma":0.0047706403,"threshold_uncertainty_score":0.13777399},"labels":[],"label_agreement":null},{"id":"W2522877794","doi":"10.1142/s0129626416500122","title":"Limitations of Coverability Trees for Context-Free Parallel Communicating Grammar Systems and Why these Grammar Systems are not Linear Space","year":2016,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"DNA and Biological Computing","field":"Biochemistry, Genetics and Molecular Biology","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":"Bishop's University","funders":"","keywords":"Decidability; Computer science; Context (archaeology); Theoretical computer science; Grammar; Context-free grammar; Rule-based machine translation; Tree (set theory); Programming language; Mathematics; Combinatorics; Artificial intelligence; Linguistics","score_opus":0.07896733959060385,"score_gpt":0.27018019728767195,"score_spread":0.19121285769706808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2522877794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13077882,0.00084990443,0.8392154,0.0043795607,0.00008663305,0.00014541773,0.0006677593,0.0013094075,0.022567116],"genre_scores_gemma":[0.83624643,0.00074219453,0.1556944,0.0007603587,0.00018427365,0.00034470743,0.00067032245,0.0005409213,0.0048164683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961676,0.0012021912,0.00022693725,0.0007253872,0.0012023185,0.00047547882],"domain_scores_gemma":[0.9701138,0.023879636,0.001083829,0.0033957905,0.0012093686,0.00031764663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029147172,0.00043451515,0.000671825,0.0011359775,0.0014123679,0.0027970327,0.0012744816,0.0013342395,0.0056459117],"category_scores_gemma":[0.022515658,0.00080119603,0.001409555,0.0011309044,0.0042688423,0.010805913,0.0020549244,0.0036929268,0.0007797873],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052659467,0.000029795048,0.0010496927,0.00011341591,0.000022597485,0.00023514852,0.0009284312,0.018305136,0.0027504521,0.94924647,0.0013439482,0.025922284],"study_design_scores_gemma":[0.000009980358,0.000016514097,0.0002951959,0.000027118718,0.000013455335,0.00013633555,0.00010722041,0.04339291,0.002594634,0.9480814,0.005308499,0.000016807271],"about_ca_topic_score_codex":0.0019893697,"about_ca_topic_score_gemma":0.0017959396,"teacher_disagreement_score":0.0056459117,"about_ca_system_score_codex":0.0018230686,"about_ca_system_score_gemma":0.0015140675,"threshold_uncertainty_score":0.0188874},"labels":[],"label_agreement":null},{"id":"W253312643","doi":"10.1142/s0129626409000055","title":"LOCATING THE MEDIAN OF A TREE IN REAL TIME","year":2009,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Data Mining Algorithms and Applications","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":"Queen's University","funders":"","keywords":"Tree (set theory); Computer science; Mathematics; Combinatorics","score_opus":0.014852441517855279,"score_gpt":0.2575654061639926,"score_spread":0.2427129646461373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W253312643","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.181518,0.00015693514,0.8163413,0.00018595907,0.000024894622,0.000021890248,0.00006155446,0.00035834088,0.0013310113],"genre_scores_gemma":[0.8565512,0.000092973474,0.14217666,0.000029893243,0.000014169495,0.0000321472,0.00008841759,0.00006036287,0.00095416885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926275,0.00020303953,0.000030888208,0.0002111444,0.00015620656,0.00013605089],"domain_scores_gemma":[0.9968239,0.0019530631,0.00048855826,0.00028164085,0.000289075,0.0001637983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017246307,0.00041020534,0.0008618836,0.0007037061,0.00065225654,0.0015535576,0.0009272423,0.0010575,0.0015024066],"category_scores_gemma":[0.00826533,0.00041541932,0.00032413844,0.0008254286,0.0009999379,0.0022876726,0.0009473383,0.0006593965,0.00034699086],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042611724,0.00004343019,0.0026349907,0.00003720244,0.000022813732,0.00014278926,0.00015152078,0.9402652,0.007065242,0.016422607,0.00058651005,0.032201637],"study_design_scores_gemma":[0.000007805945,0.000042717227,0.0002812441,0.0000028115155,0.0000035752405,0.00004353911,0.00005392234,0.98553836,0.0020483134,0.011660363,0.00031003926,0.000007296948],"about_ca_topic_score_codex":0.001934296,"about_ca_topic_score_gemma":0.0018153681,"teacher_disagreement_score":0.001934296,"about_ca_system_score_codex":0.0009627219,"about_ca_system_score_gemma":0.001130858,"threshold_uncertainty_score":0.009120822},"labels":[],"label_agreement":null},{"id":"W2771947453","doi":"10.1142/s0129626417500074","title":"A Parallel Local Search Algorithm for Clustering Large Biological Networks","year":2017,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","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":"Lakehead University; Algoma University","funders":"","keywords":"Cluster analysis; Computer science; Set (abstract data type); Algorithm; Cluster (spacecraft); Canopy clustering algorithm; Quality (philosophy); CURE data clustering algorithm; Correlation clustering; Data stream clustering; Data mining; Artificial intelligence","score_opus":0.02437830927219367,"score_gpt":0.28141181851827246,"score_spread":0.2570335092460788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771947453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003763298,0.00022920496,0.99223775,0.00012033759,0.00003099956,0.0000712568,0.00008238264,0.0023967938,0.0010679453],"genre_scores_gemma":[0.06142708,0.00018130676,0.9324805,0.00015375613,0.00003948547,0.00046061084,0.000529387,0.0005073181,0.0042204685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993857,0.00014688307,0.00003112845,0.0001467961,0.0002446244,0.000044862558],"domain_scores_gemma":[0.99938834,0.00020338074,0.00007163519,0.000120394805,0.00017112955,0.00004515899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096273614,0.00086065335,0.0010953727,0.0013541767,0.0011527389,0.000988806,0.0017899164,0.0011336365,0.0041875876],"category_scores_gemma":[0.0023785806,0.0005770257,0.0008586453,0.0020968993,0.0008241287,0.0010047264,0.0013569173,0.0013329122,0.0024136675],"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.00032389953,0.00011750996,0.0009275171,0.00028052108,0.00017699448,0.00019608195,0.00027227245,0.57088536,0.019177673,0.01982387,0.018176164,0.3696422],"study_design_scores_gemma":[0.00005654163,0.00003851192,0.00013855402,0.0000100053385,0.000015797454,0.00007170239,0.000021064487,0.98170483,0.003226751,0.010466634,0.004235471,0.000014151999],"about_ca_topic_score_codex":0.005132589,"about_ca_topic_score_gemma":0.0073737297,"teacher_disagreement_score":0.005132589,"about_ca_system_score_codex":0.0011713187,"about_ca_system_score_gemma":0.0014942958,"threshold_uncertainty_score":0.01400888},"labels":[],"label_agreement":null},{"id":"W2897010537","doi":"10.1142/s012962641850010x","title":"The Importance of Applying Security Practices in Wireless Communication: Bluetooth Low Energy and RFID","year":2018,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Bluetooth and Wireless Communication 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":"Algoma University; Lakehead University","funders":"","keywords":"Sophistication; Bluetooth; Computer science; Exploit; Wireless; Computer security; Bluetooth Low Energy; Field (mathematics); Radio-frequency identification; Identification (biology); Internet of Things; Energy (signal processing); Creativity; Internet privacy; Telecommunications","score_opus":0.020213664032749285,"score_gpt":0.27184189503237577,"score_spread":0.2516282309996265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897010537","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024351237,0.09449242,0.3177132,0.3357529,0.009413763,0.00021305114,0.00004193538,0.0006068053,0.21741478],"genre_scores_gemma":[0.47789863,0.10457796,0.24047004,0.06173406,0.0094595095,0.00045630086,0.00007918687,0.0006346394,0.10468972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9926426,0.0026305856,0.00036541207,0.0005931874,0.0034994553,0.00026879823],"domain_scores_gemma":[0.9885173,0.006269953,0.0011802675,0.001098104,0.0025034063,0.0004309633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056688813,0.000692354,0.00033440575,0.0010790866,0.0026841213,0.0066370503,0.0011089118,0.0039886283,0.0032079723],"category_scores_gemma":[0.0112182,0.00046681138,0.00031737078,0.0014153004,0.011927866,0.009283714,0.0029974435,0.006955665,0.0023973044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013218173,0.00017210885,0.0023925104,0.0012996198,0.000038682796,0.00083159516,0.012699318,0.0013915559,0.012745157,0.47809184,0.035466075,0.45473936],"study_design_scores_gemma":[0.000024144803,0.0002537457,0.0020636355,0.0014263099,0.00003125395,0.0028559722,0.0064351796,0.0019162893,0.010530951,0.20873928,0.7655917,0.0001315735],"about_ca_topic_score_codex":0.0014096079,"about_ca_topic_score_gemma":0.0015829598,"teacher_disagreement_score":0.0066370503,"about_ca_system_score_codex":0.0017072407,"about_ca_system_score_gemma":0.0016908926,"threshold_uncertainty_score":0.029980242},"labels":[],"label_agreement":null},{"id":"W2913550238","doi":"10.1142/s0129626418500111","title":"Using Convolution and Deep Learning in Gomoku Game Artificial Intelligence","year":2018,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Artificial Intelligence in Games","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":"Algoma University; Lakehead University","funders":"","keywords":"Computer science; Artificial intelligence; Artificial neural network; Deep learning; Convolutional neural network; Game tree; Machine learning; Tree (set theory); Convolution (computer science); Sequential game; Game theory; Mathematics","score_opus":0.06885911131113163,"score_gpt":0.32108509519682515,"score_spread":0.2522259838856935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913550238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3440039,0.0012686714,0.64296424,0.0009997995,0.0001643168,0.00007028698,0.00009865032,0.0019518028,0.008478317],"genre_scores_gemma":[0.93446726,0.00021828382,0.063169524,0.00016324507,0.000019077412,0.000024680661,0.00007471196,0.000031900367,0.0018313258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996954,0.00008016339,0.000017020664,0.00006706447,0.00007209466,0.00006823],"domain_scores_gemma":[0.99968576,0.00014486781,0.000029970466,0.00004066765,0.000068831134,0.000029974239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064671005,0.00062288705,0.0004744498,0.00049192907,0.00031493508,0.00088280486,0.000652208,0.000781464,0.000826525],"category_scores_gemma":[0.001945553,0.00032080067,0.00038511635,0.0005792395,0.0006409232,0.0016198532,0.0008632923,0.0010480897,0.00018841244],"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.00032074313,0.00023773404,0.0056761173,0.0001127144,0.00012493705,0.00025312777,0.00018506,0.6034319,0.021297975,0.01808459,0.0017179985,0.3485571],"study_design_scores_gemma":[0.0000029304501,0.000019240504,0.0006236683,0.0000044099556,0.000007198612,0.000013162079,0.0000086849805,0.9931837,0.0023856224,0.0034260731,0.000319332,0.0000059946055],"about_ca_topic_score_codex":0.010895547,"about_ca_topic_score_gemma":0.010269731,"teacher_disagreement_score":0.010895547,"about_ca_system_score_codex":0.0010083123,"about_ca_system_score_gemma":0.0007532473,"threshold_uncertainty_score":0.021664262},"labels":[],"label_agreement":null},{"id":"W2964204686","doi":"10.1142/s0129626417400035","title":"A Comparison of Big Data Frameworks on a Layered Dataflow Model","year":2017,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":24,"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 à Montréal","funders":"","keywords":"Dataflow; Computer science; SPARK (programming language); Abstraction; Big data; Semantics (computer science); Programming paradigm; Analytics; Programming language; Data modeling; Execution model; Theoretical computer science; Software engineering; Data science; Data mining","score_opus":0.15044143720392847,"score_gpt":0.3750884397476739,"score_spread":0.22464700254374545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964204686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12073049,0.0030869762,0.8379721,0.0024968921,0.000325433,0.00036537217,0.0005190773,0.005255705,0.029248012],"genre_scores_gemma":[0.6266447,0.002402418,0.36195055,0.000665132,0.00012597245,0.00040533653,0.0010964855,0.0011896008,0.005519826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951303,0.0012031222,0.00032620097,0.00045419188,0.0021198336,0.0007663608],"domain_scores_gemma":[0.9927938,0.0022813578,0.00035897415,0.0023435482,0.0012599669,0.0009624656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067021614,0.0008732728,0.0008649687,0.0016106501,0.0013514258,0.0059737433,0.003215521,0.0016578853,0.0026491713],"category_scores_gemma":[0.011919772,0.0007960849,0.0023117804,0.0020543642,0.0025811682,0.0077718906,0.0043558176,0.0029796895,0.00053336174],"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.0006830432,0.00030024868,0.004257258,0.00036491454,0.00015358956,0.00032816085,0.0011681798,0.12590952,0.0041105147,0.80292696,0.0058448105,0.053952824],"study_design_scores_gemma":[0.00013714179,0.00027969122,0.0023622815,0.00029291114,0.0001286019,0.00032939276,0.0007126798,0.7004786,0.005409493,0.24414834,0.045547448,0.00017342235],"about_ca_topic_score_codex":0.010560419,"about_ca_topic_score_gemma":0.006109865,"teacher_disagreement_score":0.010560419,"about_ca_system_score_codex":0.0027550298,"about_ca_system_score_gemma":0.004836983,"threshold_uncertainty_score":0.035444796},"labels":[],"label_agreement":null},{"id":"W3097870658","doi":"10.1142/s0129626420400095","title":"A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks","year":2020,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Brock University","funders":"","keywords":"Interconnection; Computer science; Perspective (graphical); Resilience (materials science); Vulnerability (computing); Development (topology); Graph theory; Distributed computing; Theoretical computer science; Computer network; Artificial intelligence; Mathematics; Computer security","score_opus":0.07882330602952328,"score_gpt":0.2734465681261355,"score_spread":0.1946232620966122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097870658","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014777979,0.35157117,0.03232463,0.2899004,0.27306572,0.00010473906,0.0010492556,0.00032333145,0.050182957],"genre_scores_gemma":[0.033165257,0.38664284,0.01884293,0.17919345,0.30178234,0.00029865757,0.0007740248,0.00051974144,0.078780636],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981218,0.0005600671,0.00022271581,0.00034449107,0.0005901379,0.00016075802],"domain_scores_gemma":[0.9927758,0.0049836584,0.00037309268,0.00019942322,0.0014646765,0.00020334021],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003048322,0.0014804805,0.0010470753,0.002693074,0.0024371198,0.004479498,0.002607264,0.005877262,0.0101089785],"category_scores_gemma":[0.009331363,0.0004958712,0.0014483478,0.0036713332,0.0035780899,0.006877088,0.0012601027,0.009908181,0.004436559],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008918064,0.000024086432,0.00025049114,0.0013739895,0.000048693622,0.00054052373,0.00038126795,0.0015481126,0.0016153648,0.24534099,0.7077885,0.04099873],"study_design_scores_gemma":[0.0000072508674,0.000039157163,0.00031195197,0.00061296666,0.000020201682,0.00032826894,0.00013231408,0.00082357955,0.00024208461,0.078719884,0.91873235,0.00002999568],"about_ca_topic_score_codex":0.0046845074,"about_ca_topic_score_gemma":0.0072602616,"teacher_disagreement_score":0.0101089785,"about_ca_system_score_codex":0.0038097352,"about_ca_system_score_gemma":0.0022458697,"threshold_uncertainty_score":0.033817887},"labels":[],"label_agreement":null},{"id":"W4241500372","doi":"10.1142/s0129626402000811","title":"ANALYSIS OF A LATENCY HIDING BROADCASTING ALGORITHM ON A RECONFIGURABLE OPTICAL INTERCONNECT","year":2002,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Queen's University","funders":"","keywords":"Control reconfiguration; Computer science; Broadcasting (networking); Latency (audio); Interconnection; Algorithm; Port (circuit theory); Transmission (telecommunications); Computer network; Parallel computing; Telecommunications; Embedded system; Engineering; Electronic engineering","score_opus":0.021607830667969206,"score_gpt":0.22716015325844918,"score_spread":0.20555232259047998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241500372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18386362,0.00018180745,0.808098,0.00026280183,0.000015825824,0.000068281195,0.0000314474,0.00027346282,0.007204707],"genre_scores_gemma":[0.88133675,0.00022447348,0.11096951,0.00006205106,0.000026827413,0.00012037324,0.00006109977,0.0001496724,0.007049321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995461,0.00011996015,0.0000161036,0.00005507439,0.00014947915,0.00011337437],"domain_scores_gemma":[0.9975915,0.0017135869,0.00029216724,0.000108734355,0.000218752,0.00007528563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010687817,0.0004815065,0.00045893737,0.00048243313,0.00055789866,0.00079139805,0.0011668624,0.00066381594,0.0024051962],"category_scores_gemma":[0.004392616,0.0002944348,0.0003431575,0.0005068881,0.0009587059,0.0010542184,0.0005523591,0.0006306974,0.00027937445],"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.00018653904,0.000048154216,0.00074045965,0.00006874984,0.000019643676,0.00013607756,0.00020343016,0.82844365,0.017613703,0.12370005,0.0008498139,0.027989784],"study_design_scores_gemma":[0.0000063525413,0.0000138133555,0.000036440615,0.0000017056267,0.000002828855,0.000009999899,0.0000049407486,0.99534565,0.0010849894,0.0033834565,0.00010736663,0.0000023884768],"about_ca_topic_score_codex":0.0035511893,"about_ca_topic_score_gemma":0.0021159097,"teacher_disagreement_score":0.0035511893,"about_ca_system_score_codex":0.0019083176,"about_ca_system_score_gemma":0.0012118228,"threshold_uncertainty_score":0.013845861},"labels":[],"label_agreement":null},{"id":"W4244021806","doi":"10.1142/s0129626401000622","title":"A NOTE ON COMMUNICATION-EFFICIENT DETERMINISTIC PARALLEL ALGORITHMS FOR PLANAR POINT LOCATION AND 2D VORONOÏ DIAGRAM","year":2001,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Computational Geometry and Mesh Generation","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":"Planar; Computation; Computer science; Interconnection; Algorithm; Diagram; Point (geometry); Point-to-point; Parallel algorithm; Point location; Parallel computing; Mathematics; Telecommunications; Geometry","score_opus":0.026668098113129653,"score_gpt":0.2859733324838822,"score_spread":0.25930523437075254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244021806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019405772,0.0010735589,0.99189514,0.00071595033,0.00044359863,0.000027067445,0.00006234053,0.0005032975,0.0033384892],"genre_scores_gemma":[0.08142922,0.0026696734,0.90801334,0.0006565029,0.0008253524,0.00019780923,0.00035130503,0.0004601391,0.005396629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977653,0.0006386144,0.00016707127,0.00027191086,0.0009733942,0.00018365278],"domain_scores_gemma":[0.9973807,0.0016156355,0.00010044058,0.0005267515,0.00033067138,0.00004580079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001771883,0.00090568425,0.0009870158,0.00071223825,0.0010472314,0.0016725775,0.002027399,0.00086175546,0.003623961],"category_scores_gemma":[0.0068590534,0.0007470637,0.0010252574,0.0020370753,0.0013739988,0.0037285679,0.0019758635,0.0021321685,0.0015506698],"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.0002886378,0.000050694696,0.0005731507,0.000360442,0.0000842847,0.0002483092,0.00016757601,0.25126848,0.00559416,0.52578896,0.027010642,0.18856467],"study_design_scores_gemma":[0.000079749196,0.00006727953,0.00024553473,0.000052140684,0.000040978142,0.00021626432,0.000041052346,0.640131,0.0077926065,0.2672245,0.084050104,0.000058815032],"about_ca_topic_score_codex":0.004604114,"about_ca_topic_score_gemma":0.0047753835,"teacher_disagreement_score":0.004604114,"about_ca_system_score_codex":0.0014832132,"about_ca_system_score_gemma":0.0014115282,"threshold_uncertainty_score":0.012123346},"labels":[],"label_agreement":null},{"id":"W4392191621","doi":"10.1142/s0129626423400170","title":"A Note to Non-adaptive Broadcasting","year":2024,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"ICT Impact and Policies","field":"Engineering","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":"Concordia University","funders":"","keywords":"Broadcasting (networking); Computer science; Theoretical computer science; Mathematics; Parallel computing; Algorithm; Computer network","score_opus":0.014463550809815227,"score_gpt":0.2600133300125373,"score_spread":0.24554977920272206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392191621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021400249,0.019279236,0.8222149,0.041615307,0.006259332,0.00014939987,0.0002117665,0.0006808042,0.0881889],"genre_scores_gemma":[0.64768976,0.025874611,0.24876814,0.014540383,0.0101689305,0.00046072382,0.00030546382,0.0006738453,0.051518146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970745,0.0010099326,0.00009392129,0.0005818726,0.0009032138,0.00033663618],"domain_scores_gemma":[0.98265564,0.012948584,0.000485398,0.0021090761,0.0013437304,0.00045755133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029434408,0.00051876635,0.00077763165,0.00063917803,0.0013166718,0.0021659744,0.002667208,0.0016881644,0.0066284854],"category_scores_gemma":[0.016670011,0.0003723538,0.00074926537,0.0017491925,0.002751003,0.007353508,0.0020283435,0.0068083634,0.0013549796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016257902,0.00008374031,0.0008106438,0.00035433256,0.0000335753,0.00033706467,0.00032735703,0.022119481,0.0031957247,0.85393596,0.0416847,0.07695487],"study_design_scores_gemma":[0.00004259494,0.00019061276,0.0007989828,0.00012937184,0.00004983634,0.0005219779,0.00025031547,0.13415192,0.0023403538,0.7435261,0.11794149,0.000056327077],"about_ca_topic_score_codex":0.0029975523,"about_ca_topic_score_gemma":0.002979511,"teacher_disagreement_score":0.0066284854,"about_ca_system_score_codex":0.002108323,"about_ca_system_score_gemma":0.0014268096,"threshold_uncertainty_score":0.022174478},"labels":[],"label_agreement":null},{"id":"W4403196427","doi":"10.1142/s0129626424500099","title":"On Broadcast Schemes of Knödel Graphs","year":2024,"lang":"en","type":"article","venue":"Parallel Processing Letters","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":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematics; Combinatorics; Discrete mathematics; Parallel computing","score_opus":0.030750054428905466,"score_gpt":0.28698438863705156,"score_spread":0.2562343342081461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403196427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43626657,0.0016040683,0.4694795,0.0014708764,0.00026972548,0.00024816068,0.0005765586,0.0005898694,0.08949476],"genre_scores_gemma":[0.93175834,0.0011460816,0.056818448,0.0003395156,0.00010527617,0.00018937443,0.00026675072,0.00012698222,0.009249278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.00038461483,0.00003719262,0.00011759189,0.00025707047,0.00020558343],"domain_scores_gemma":[0.99660575,0.0019154372,0.00031456738,0.0007350068,0.00028131428,0.00014785027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012248992,0.00032501353,0.00034121776,0.0008407664,0.0011657781,0.0010105425,0.00064250454,0.0006757002,0.0045836135],"category_scores_gemma":[0.0061830725,0.0002514379,0.0003355449,0.0009238696,0.0018360225,0.0024800722,0.0016365749,0.0012801546,0.00054910354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007365487,0.000012017177,0.0001405904,0.00004913111,0.0000032407736,0.000028675968,0.00021724415,0.008258101,0.0027948304,0.97780776,0.0012245865,0.009390135],"study_design_scores_gemma":[0.000058044847,0.00010443501,0.00027223412,0.00006902653,0.00001607457,0.00014671343,0.00026939064,0.069573484,0.005586662,0.9105945,0.013269447,0.000039961837],"about_ca_topic_score_codex":0.0013926731,"about_ca_topic_score_gemma":0.0013633929,"teacher_disagreement_score":0.0045836135,"about_ca_system_score_codex":0.0015041321,"about_ca_system_score_gemma":0.0007851637,"threshold_uncertainty_score":0.015333772},"labels":[],"label_agreement":null},{"id":"W4408042918","doi":"10.1142/s0129626425500021","title":"Dimensional Broadcast Schemes for Generalized Knödel Graphs","year":2025,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Cooperative Communication and Network Coding","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":"Concordia University","funders":"","keywords":"Computer science; Mathematics; Theoretical computer science; Combinatorics; Discrete mathematics","score_opus":0.03188071808304565,"score_gpt":0.3001099265790213,"score_spread":0.26822920849597565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408042918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39290732,0.00094121456,0.55696857,0.00077608746,0.00016614312,0.00019428841,0.00048637134,0.00061556115,0.046944544],"genre_scores_gemma":[0.92542475,0.0004811566,0.0685794,0.00019977031,0.00004340158,0.00015622804,0.00024331237,0.000080501566,0.0047915373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992938,0.00024089924,0.000031510208,0.00010266679,0.00019124245,0.00013987845],"domain_scores_gemma":[0.99828976,0.00073106494,0.00019939846,0.0004497106,0.00021147763,0.00011851342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073122245,0.00022475407,0.00035655044,0.0006061343,0.0009017427,0.0008315599,0.0007040744,0.0005723995,0.0031719091],"category_scores_gemma":[0.0033894402,0.00018881312,0.00033103648,0.00065288745,0.001187519,0.0016845209,0.0011803776,0.00085585465,0.00034670235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015834946,0.000024464101,0.0004538872,0.000103599436,0.000012526826,0.00006846407,0.0003805274,0.022428943,0.0123539055,0.937131,0.0025048146,0.024379443],"study_design_scores_gemma":[0.00009610441,0.00019166309,0.0008545858,0.00008766895,0.000030442396,0.00038567113,0.00064347795,0.17328633,0.01641458,0.7858386,0.022067275,0.00010364021],"about_ca_topic_score_codex":0.0011891996,"about_ca_topic_score_gemma":0.0016113321,"teacher_disagreement_score":0.0031719091,"about_ca_system_score_codex":0.0012988516,"about_ca_system_score_gemma":0.0006482339,"threshold_uncertainty_score":0.010611117},"labels":[],"label_agreement":null},{"id":"W4417192292","doi":"10.1142/s0129626425500148","title":"Proxy Quantum Games","year":2025,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","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":"Business Development Bank of Canada","funders":"","keywords":"Quantum; Unitary state; Game theory; Stochastic game; Quantum pseudo-telepathy; Maximization; Class (philosophy); Nash equilibrium","score_opus":0.009933293531759634,"score_gpt":0.2645762052592971,"score_spread":0.25464291172753745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417192292","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056979727,0.00036433025,0.8717188,0.00081381656,0.0001310993,0.00034576794,0.00029386813,0.00024881717,0.069103755],"genre_scores_gemma":[0.8985589,0.00046416742,0.083275564,0.00040020983,0.00009656506,0.00036068607,0.00018645525,0.00007585336,0.016581634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998431,0.0006624476,0.00007771168,0.00023284365,0.00035505075,0.00024083775],"domain_scores_gemma":[0.99856335,0.00065180165,0.00017963615,0.00025280387,0.0001711707,0.00018120829],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011335976,0.0009177829,0.00088421826,0.0005079795,0.00076737866,0.002358692,0.0015239517,0.0012913358,0.009143859],"category_scores_gemma":[0.0038360697,0.00033934496,0.0008520441,0.0005390977,0.0025432475,0.0032576013,0.002050286,0.0016167584,0.0006004165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029788669,0.000023184575,0.00013260427,0.000029601648,0.0000103280245,0.00006985336,0.000058888265,0.029097188,0.00056162593,0.96539056,0.0006390713,0.0039572753],"study_design_scores_gemma":[0.000037695685,0.0000469223,0.00012996078,0.000017737791,0.00001123866,0.00006797438,0.000060660503,0.32610893,0.00072114967,0.6667593,0.0060209045,0.000017574128],"about_ca_topic_score_codex":0.0019152425,"about_ca_topic_score_gemma":0.0015740613,"teacher_disagreement_score":0.009143859,"about_ca_system_score_codex":0.0017480238,"about_ca_system_score_gemma":0.0013910016,"threshold_uncertainty_score":0.030589283},"labels":[],"label_agreement":null}]}