{"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15799904,0.00014725942,0.7969839,0.043655455,0.0003153856,0.0002106486,3.7369756e-7,0.0003112642,0.00037667598],"genre_scores_gemma":[0.7384932,0.000005027721,0.25411424,0.0070064473,0.00028095965,0.000039134848,0.0000015350327,0.000028094719,0.000031331678],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799705,0.00005134184,0.0002801315,0.00056103634,0.0004691035,0.0006413676],"domain_scores_gemma":[0.9988979,0.00015695614,0.000157553,0.0005997609,0.000064594926,0.00012322876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044738044,0.00029568787,0.00022375652,0.00008128988,0.00088853104,0.0009048268,0.0014493021,0.00007276755,0.000008049535],"category_scores_gemma":[0.00002684725,0.0001763811,0.00008169838,0.00044630142,0.00023397431,0.0005732427,0.000109939596,0.0008603979,0.000018318695],"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.00007901061,0.00015736083,0.0012233327,0.00026534358,0.00012304861,0.00020625857,0.016057862,0.05744576,0.014391497,0.014363434,0.005851382,0.8898357],"study_design_scores_gemma":[0.00070496806,0.00008096028,0.00092483725,0.000119222714,0.000017369903,0.0002887089,0.00006417247,0.97276384,0.0003530852,0.0030418413,0.021049239,0.00059175305],"about_ca_topic_score_codex":0.00003089168,"about_ca_topic_score_gemma":0.000028812256,"teacher_disagreement_score":0.9153181,"about_ca_system_score_codex":0.000014649395,"about_ca_system_score_gemma":0.00012485356,"threshold_uncertainty_score":0.8725266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024012527,0.0002704883,0.994279,0.0014649862,0.00026310695,0.00021192104,0.0000023448233,0.0007327472,0.0003741026],"genre_scores_gemma":[0.4202707,0.0000032647765,0.57677746,0.0026532558,0.00016055201,0.00006509002,0.000007289739,0.000014286074,0.000048097027],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998637,0.00003728842,0.0002590016,0.00031413985,0.00018549745,0.0005670293],"domain_scores_gemma":[0.99914724,0.00018217521,0.00014795794,0.00032844325,0.00006223996,0.00013193073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037087087,0.00017957573,0.00018152094,0.00010955064,0.00031689258,0.00023766972,0.00066173007,0.0000562823,0.000003767999],"category_scores_gemma":[0.0001117144,0.0001731322,0.000077738434,0.00021530633,0.00005096478,0.0006186691,0.00011134432,0.00009601045,0.000016378428],"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.00015708151,0.0011267953,0.025776977,0.0013342286,0.00017151648,0.00001850523,0.01579664,0.0659976,0.0092093935,0.039297733,0.14968677,0.69142675],"study_design_scores_gemma":[0.00094317656,0.000102924176,0.0017686927,0.00010826881,0.00003264378,0.000058702277,0.000024770668,0.9337899,0.0020275796,0.0042975782,0.05578801,0.0010577543],"about_ca_topic_score_codex":0.0000080602695,"about_ca_topic_score_gemma":3.255256e-7,"teacher_disagreement_score":0.8677923,"about_ca_system_score_codex":0.000039730185,"about_ca_system_score_gemma":0.00004339943,"threshold_uncertainty_score":0.7060126},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026224717,0.00070449134,0.9652174,0.0055652154,0.00025371168,0.00016789688,0.0000013173134,0.00032117098,0.0015440816],"genre_scores_gemma":[0.7114842,0.000004553132,0.28573826,0.002091408,0.00025397926,0.00003647138,0.00004900448,0.000012448324,0.00032966965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825275,0.000062828505,0.0003738851,0.00048517325,0.00045055297,0.0003748099],"domain_scores_gemma":[0.9992648,0.000095276024,0.00017863944,0.00025078465,0.00012982149,0.00008067461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021151685,0.00020372265,0.00017658235,0.00050136197,0.00039647165,0.0005091556,0.00055340386,0.000053091175,0.000014279401],"category_scores_gemma":[0.000024230132,0.00020679683,0.000080971506,0.0017941392,0.000053705466,0.0008298026,0.000105732914,0.00015041717,0.00013958327],"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.000008420526,0.00019415682,0.0011649852,0.00005603431,0.000017625262,0.00002302721,0.00018253158,0.8872837,0.001799898,0.014785001,0.025038308,0.0694463],"study_design_scores_gemma":[0.0017177584,0.000076164506,0.05518393,0.00006123631,0.000026816695,0.00009205159,0.00001821728,0.89764404,0.00044719072,0.017812287,0.025947478,0.00097280875],"about_ca_topic_score_codex":0.000043722623,"about_ca_topic_score_gemma":0.0000062120994,"teacher_disagreement_score":0.68525946,"about_ca_system_score_codex":0.000065769105,"about_ca_system_score_gemma":0.00009049887,"threshold_uncertainty_score":0.843293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084683957,0.003487933,0.98347896,0.011043355,0.00028681365,0.0005168546,0.000004421735,0.0001899,0.0001449425],"genre_scores_gemma":[0.09644088,0.000091063346,0.89714587,0.0042920997,0.00077100314,0.00024248101,0.00000481869,0.00003837982,0.0009734177],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979912,0.00016689178,0.0003908258,0.0005522864,0.00023246749,0.00066634506],"domain_scores_gemma":[0.9985779,0.0005192063,0.00023794983,0.00044469527,0.0000842565,0.00013602228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018571506,0.00025367475,0.00027150082,0.00012605557,0.0008635912,0.0006953009,0.00087416155,0.00008006975,0.0000011288893],"category_scores_gemma":[0.00011570943,0.00017836822,0.00008976607,0.00044719825,0.00006163046,0.0005941067,0.0001748713,0.00021070511,0.000015333053],"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.00029240237,0.00033900194,0.00018648819,0.0010041584,0.0002328729,0.000024648729,0.0036829556,0.021188779,0.0058779404,0.19096434,0.013745661,0.76246077],"study_design_scores_gemma":[0.00096479955,0.000039416507,0.00003437729,0.000029654018,0.00001807821,0.000032060067,0.000055033037,0.90767145,0.00011886122,0.0010597988,0.08970417,0.00027232085],"about_ca_topic_score_codex":0.000012226486,"about_ca_topic_score_gemma":0.0000032710109,"teacher_disagreement_score":0.88648266,"about_ca_system_score_codex":0.000037237074,"about_ca_system_score_gemma":0.000053421983,"threshold_uncertainty_score":0.7273645},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015027871,0.00017510874,0.9775312,0.005403438,0.00039121357,0.0005025021,0.000008327489,0.000321313,0.000639038],"genre_scores_gemma":[0.69976044,7.425337e-7,0.29203448,0.0075829513,0.00026144995,0.0001883308,0.00004066883,0.000033338256,0.00009760628],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977576,0.00006869398,0.00039506165,0.00047580583,0.0003737568,0.00092906924],"domain_scores_gemma":[0.9990024,0.00010801789,0.0002050746,0.00039821013,0.0000664304,0.00021985703],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003698392,0.0003197557,0.00026776848,0.00020108442,0.00034615447,0.0006555021,0.0007877085,0.00006909742,0.000007776468],"category_scores_gemma":[0.000032740696,0.00028394928,0.00014075988,0.00026826345,0.000059851613,0.0015058329,0.00007401539,0.00015920826,0.000041530082],"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.00053995743,0.0011513834,0.006456317,0.0036912125,0.00033448415,0.000040773517,0.029407315,0.100172594,0.44583154,0.0052246363,0.12506306,0.2820867],"study_design_scores_gemma":[0.013208344,0.00075391494,0.004805678,0.0013954574,0.00026740576,0.00039389107,0.0004516186,0.51132363,0.088784546,0.004725207,0.367506,0.006384299],"about_ca_topic_score_codex":0.000008187345,"about_ca_topic_score_gemma":9.5113006e-7,"teacher_disagreement_score":0.68549675,"about_ca_system_score_codex":0.00008279139,"about_ca_system_score_gemma":0.00006340424,"threshold_uncertainty_score":0.99996126},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71408623,0.00069430534,0.27940705,0.002558114,0.00021731928,0.00009822097,4.77835e-7,0.000041998865,0.0028962486],"genre_scores_gemma":[0.9968008,0.000014880591,0.0021488217,0.00092313974,0.000027297066,0.000003776618,1.17030616e-7,0.000004068378,0.00007708921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939084,0.00005062904,0.00013382781,0.00019112995,0.00011262834,0.00012093818],"domain_scores_gemma":[0.99961895,0.00008584292,0.000095234645,0.00014798764,0.000023537757,0.000028471575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022611198,0.00008502756,0.000109195746,0.000017028062,0.00013547964,0.000105245,0.00020439159,0.000021340142,0.0000042685706],"category_scores_gemma":[0.000012101257,0.00005300475,0.000017592272,0.00007682092,0.00008805527,0.00020903345,0.000043762724,0.00006736375,0.0000012848751],"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.00039370815,0.0003629823,0.051370602,0.0013009143,0.0003131669,0.00009711452,0.15430418,0.007946841,0.011454058,0.67157537,0.03554623,0.06533483],"study_design_scores_gemma":[0.003296763,0.0011137616,0.07162573,0.0031997934,0.00008177715,0.0003123389,0.003349882,0.8272989,0.00955329,0.061605517,0.015649533,0.002912735],"about_ca_topic_score_codex":0.000043196495,"about_ca_topic_score_gemma":0.0000069149983,"teacher_disagreement_score":0.81935203,"about_ca_system_score_codex":0.000006651873,"about_ca_system_score_gemma":0.0000072514003,"threshold_uncertainty_score":0.2161471},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07181891,0.000892156,0.9259796,0.00059695734,0.000044309254,0.00023242374,0.000002374928,0.00024502169,0.00018821305],"genre_scores_gemma":[0.64947927,0.000041125808,0.34954035,0.00076259946,0.00007515441,0.000030125055,0.000025312238,0.0000369546,0.000009119244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00003028145,0.00041159635,0.00023674022,0.00019932252,0.00026551692],"domain_scores_gemma":[0.9993118,0.00006157972,0.0001712746,0.00033390263,0.000051759314,0.000069662245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013900215,0.00020390002,0.00020943962,0.00012016923,0.0001898572,0.00005728673,0.00027993706,0.000076082244,0.000008460142],"category_scores_gemma":[0.000026351843,0.00022458858,0.00006207713,0.00015619467,0.00008554859,0.00015311102,0.000046334964,0.00025240795,0.000042608917],"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.0000073936208,0.000027224778,0.000069361726,0.000048710015,0.000023275668,5.0438535e-7,0.0004955408,0.95013624,0.0045865932,0.000015722575,0.000021642223,0.04456779],"study_design_scores_gemma":[0.00042199594,0.000011824456,0.0000748939,0.00010102143,0.000020387017,0.0000071853997,0.00015734693,0.9955635,0.0030783091,0.0000130151975,0.00031722354,0.00023328494],"about_ca_topic_score_codex":0.0000043983146,"about_ca_topic_score_gemma":9.136415e-7,"teacher_disagreement_score":0.5776603,"about_ca_system_score_codex":0.000099279016,"about_ca_system_score_gemma":0.000011091327,"threshold_uncertainty_score":0.9158457},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062595844,0.00008565,0.8917371,0.044546306,0.00037295133,0.00030919735,0.0000025979798,0.00011758533,0.00023277444],"genre_scores_gemma":[0.8475799,6.661131e-7,0.14015771,0.011857389,0.0003329932,0.000012373514,0.0000015036355,0.000018299927,0.000039145332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981377,0.00009047538,0.0003331449,0.00050724327,0.00052201987,0.00040942262],"domain_scores_gemma":[0.9985953,0.00017359934,0.00019110812,0.00087739143,0.000108868655,0.00005374582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034545816,0.00022693243,0.00022476791,0.000066350585,0.00032650886,0.00029709705,0.0024791094,0.00004274689,0.0000041657104],"category_scores_gemma":[0.00001496139,0.00013407643,0.00012522044,0.00062595983,0.00029676585,0.00030385825,0.0008368783,0.00019979056,0.000016862992],"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.00010091323,0.00088435935,0.042039882,0.00044484602,0.00015107446,0.000060298324,0.010419729,0.42660394,0.0075610513,0.052024942,0.17513955,0.2845694],"study_design_scores_gemma":[0.0008486331,0.000093620816,0.23221995,0.00015595912,0.000033268534,0.000052062926,0.00006045645,0.73441607,0.00038928987,0.01148662,0.019555815,0.0006882502],"about_ca_topic_score_codex":0.00042078973,"about_ca_topic_score_gemma":0.0001097331,"teacher_disagreement_score":0.78498405,"about_ca_system_score_codex":0.00008935712,"about_ca_system_score_gemma":0.00008597102,"threshold_uncertainty_score":0.5467478},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9777623,0.000040136125,0.0088810185,0.01119675,0.000014757606,0.00023369947,0.0000039239276,0.000078011275,0.0017894255],"genre_scores_gemma":[0.9884741,0.0000036576544,0.008685655,0.0027427485,0.000013785223,0.000012820644,0.0000023234718,0.000012501761,0.000052444204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991561,0.00004805786,0.00022433474,0.00018009824,0.00019794717,0.00019347374],"domain_scores_gemma":[0.99925476,0.00023986684,0.000101792364,0.0003329721,0.000035910074,0.00003470638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032288005,0.00013612218,0.0001613445,0.00003971771,0.00018863223,0.000030274745,0.0002702921,0.000038594848,0.000013727701],"category_scores_gemma":[0.0000550405,0.00009219437,0.00008497822,0.00024592574,0.00011538491,0.00006233176,0.000011290832,0.00016375094,0.0000078923495],"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.00018394316,0.00072166073,0.00048535218,0.00021453596,0.00007261964,0.000008441004,0.0048204437,0.0020290827,0.14018515,0.82389987,0.017827569,0.009551331],"study_design_scores_gemma":[0.00027903076,0.00007354665,0.0019223988,0.00022024618,0.00007336619,0.0000060528305,0.00024577722,0.0016561486,0.009067645,0.9853295,0.0007909249,0.00033532968],"about_ca_topic_score_codex":0.0000010575679,"about_ca_topic_score_gemma":6.5142933e-7,"teacher_disagreement_score":0.16142966,"about_ca_system_score_codex":0.000010291791,"about_ca_system_score_gemma":0.000012583845,"threshold_uncertainty_score":0.37595776},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010911268,0.000045487115,0.9769579,0.008326756,0.000053532392,0.0004073197,0.0000027091014,0.00047493464,0.0028200774],"genre_scores_gemma":[0.52094877,0.000027477074,0.47594947,0.002775956,0.00004617549,0.000079101745,0.000011265586,0.000018660292,0.00014312615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829376,0.00010103097,0.00042681518,0.00040754446,0.0003274145,0.0004434549],"domain_scores_gemma":[0.9985077,0.00043579045,0.00034385282,0.00046392958,0.00017718613,0.00007153333],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006013756,0.00022291146,0.00026894844,0.0001415946,0.0005787816,0.00020055275,0.0011130436,0.000069367925,0.0000052648784],"category_scores_gemma":[0.00004857805,0.00017027711,0.0001295794,0.00044031622,0.00011890738,0.0007680392,0.00014469991,0.0001469545,0.000010396326],"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.00005558913,0.00010650027,0.000036554073,0.000044830056,0.000021453758,0.000002260767,0.00095166237,0.940899,0.00047505752,0.039805323,0.011129949,0.00647178],"study_design_scores_gemma":[0.00040630088,0.00007220868,0.00011268577,0.00007522333,0.0000091067595,0.000008446719,0.000012516647,0.9727761,0.00015428991,0.025978483,0.00018002978,0.00021459324],"about_ca_topic_score_codex":0.00002459275,"about_ca_topic_score_gemma":9.645258e-7,"teacher_disagreement_score":0.51003754,"about_ca_system_score_codex":0.000037344307,"about_ca_system_score_gemma":0.00007473966,"threshold_uncertainty_score":0.6943699},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00224722,0.001904149,0.9936564,0.001245947,0.00013819392,0.00021832404,0.0000015634076,0.0005474805,0.000040733823],"genre_scores_gemma":[0.3589839,0.000024092766,0.63892645,0.001686751,0.0001846305,0.00013003085,0.000004203212,0.000021630047,0.000038305723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813515,0.000071996954,0.0004519471,0.0005907413,0.0002345187,0.00051565736],"domain_scores_gemma":[0.99923944,0.000057096022,0.00018890787,0.00033631656,0.00008636542,0.00009187083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002292012,0.00023960613,0.0002684384,0.0002525895,0.00020002377,0.0004056258,0.00077898556,0.00009335118,7.411558e-7],"category_scores_gemma":[0.000010441194,0.00024783215,0.000077527744,0.00035249905,0.000038454564,0.00035387877,0.00011309906,0.00011980155,0.000005334908],"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.0000029662865,0.000035414192,0.000043365435,0.000036540285,0.000007214525,0.000009994769,0.00023216674,0.80752933,0.00017291255,0.0000703578,0.00037300523,0.19148675],"study_design_scores_gemma":[0.00043266144,0.000028800587,0.000022826882,0.000109596534,0.000004184764,0.000051034953,0.0000073346696,0.9954214,0.00024948778,0.000100338046,0.0032605953,0.0003117536],"about_ca_topic_score_codex":0.000054375247,"about_ca_topic_score_gemma":0.00000471606,"teacher_disagreement_score":0.35673666,"about_ca_system_score_codex":0.000113459435,"about_ca_system_score_gemma":0.00007373724,"threshold_uncertainty_score":0.9999974},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09426926,0.0000014044009,0.89821076,0.004201866,0.000035861216,0.0029316244,0.000002789152,0.0002516026,0.00009480457],"genre_scores_gemma":[0.911433,2.3420871e-7,0.07988486,0.0025791419,0.000054363863,0.005944037,0.00009270949,0.000009068824,0.0000025764596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987967,0.00002458965,0.00024953132,0.000332261,0.00034947981,0.0002474355],"domain_scores_gemma":[0.9990618,0.000006940095,0.00017102821,0.00050097733,0.00011420597,0.00014499575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026038362,0.00014145576,0.000095174866,0.00009198583,0.0002785703,0.00043805985,0.0005849476,0.000041095205,0.000005442437],"category_scores_gemma":[0.000008077221,0.000120678924,0.000025392612,0.0005197446,0.000045467637,0.0012599101,0.00003650413,0.00015015366,0.00006633897],"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.00035687315,0.0010765718,0.007928386,0.00036112498,0.00003665111,0.0000054371976,0.009819651,0.0042190445,0.24800742,0.37984148,0.006119871,0.34222752],"study_design_scores_gemma":[0.0023690823,0.00084990135,0.053966716,0.0001542842,0.000022028467,0.000050512223,0.00033085386,0.735763,0.014982031,0.00320242,0.1867737,0.0015354785],"about_ca_topic_score_codex":0.00001464191,"about_ca_topic_score_gemma":0.000012352057,"teacher_disagreement_score":0.81832594,"about_ca_system_score_codex":0.00003124602,"about_ca_system_score_gemma":0.000047035905,"threshold_uncertainty_score":0.4921144},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73428965,0.000026605647,0.24423711,0.020673495,0.00025417708,0.000069142894,2.6686916e-7,0.00010131914,0.00034824634],"genre_scores_gemma":[0.9542525,6.43211e-7,0.04004621,0.0055697346,0.00010171695,0.0000060680195,4.1519857e-7,0.000010628425,0.000012093319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988707,0.00003618946,0.00021989478,0.00031141087,0.00028318493,0.00027863635],"domain_scores_gemma":[0.9990345,0.0002012866,0.00018054472,0.00050096406,0.00003617011,0.000046508976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037480783,0.00014251792,0.00013928558,0.000060609003,0.00025445342,0.00013331565,0.0010305402,0.00003745409,0.0000062634167],"category_scores_gemma":[0.00008531341,0.00009091594,0.00006486007,0.0002763155,0.00012339013,0.00012594915,0.00012565473,0.00045636456,0.000009972032],"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.000032731987,0.00025197328,0.0073097954,0.0002189436,0.00006067343,0.00008832802,0.009092038,0.028771933,0.16988072,0.6530202,0.008419123,0.12285352],"study_design_scores_gemma":[0.00023023582,0.000051106657,0.0037539864,0.00010101549,0.0000049154496,0.00003261543,0.000016903936,0.95252174,0.0020046593,0.04017971,0.000816019,0.00028708126],"about_ca_topic_score_codex":0.000005077383,"about_ca_topic_score_gemma":0.0000020002544,"teacher_disagreement_score":0.9237498,"about_ca_system_score_codex":0.000005682641,"about_ca_system_score_gemma":0.000038938484,"threshold_uncertainty_score":0.37074444},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021666156,0.00010022956,0.9724277,0.0016665603,0.0014200561,0.00030807004,2.904544e-7,0.0003451688,0.0020657268],"genre_scores_gemma":[0.95474374,0.0000013168113,0.03942327,0.0048520206,0.0007699745,0.000043108666,0.000004115451,0.000027521786,0.00013491961],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806803,0.00004865195,0.00047055737,0.00056109746,0.00021857648,0.00063309976],"domain_scores_gemma":[0.99887496,0.00031567874,0.00026263515,0.0003109958,0.0001231945,0.00011252634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010598038,0.00023896222,0.0002340451,0.00019787693,0.00043299905,0.00044288984,0.0005090905,0.0001171559,0.000006758544],"category_scores_gemma":[0.00008868874,0.00022358145,0.00012949601,0.0004076752,0.00003454524,0.00051993836,0.00006666643,0.00028169557,0.000014552647],"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.00086626766,0.0003877451,0.001070496,0.00044231585,0.00020874792,0.00008913003,0.0048365192,0.2954029,0.012398119,0.1519223,0.026289757,0.5060857],"study_design_scores_gemma":[0.00087927724,0.00017007247,0.00029792488,0.00027751006,0.000006776704,0.000054822285,0.000107157044,0.994694,0.00022868696,0.0007918069,0.0021112347,0.0003807187],"about_ca_topic_score_codex":0.000021355085,"about_ca_topic_score_gemma":0.000016333715,"teacher_disagreement_score":0.9330776,"about_ca_system_score_codex":0.000117563424,"about_ca_system_score_gemma":0.000025486528,"threshold_uncertainty_score":0.91173863},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057030063,0.0011274389,0.9322396,0.0029663187,0.00015557144,0.00019359795,9.48325e-7,0.0026804523,0.0036060147],"genre_scores_gemma":[0.784427,0.00017863698,0.21421136,0.0010177614,0.000059433933,0.000041720225,0.000011059109,0.000045680656,0.000007387062],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891025,0.000011444066,0.00024764414,0.00021805201,0.00012507086,0.00048754847],"domain_scores_gemma":[0.9992208,0.00007593863,0.000049250993,0.00057841284,0.000019553165,0.000056042052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000079107,0.00021434619,0.000198296,0.000064742664,0.00024642787,0.00007887495,0.0005646897,0.00010414151,0.0000024576573],"category_scores_gemma":[0.00002576175,0.00021804468,0.00004492889,0.000309884,0.00016530279,0.00020508608,0.000070107126,0.00050843594,0.000041784548],"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.0000058010723,0.000018097766,0.00011465129,0.000020487396,0.0000115827615,0.0000041815606,0.00008293928,0.98765105,0.0012080789,0.0011393307,0.00025089385,0.009492911],"study_design_scores_gemma":[0.00080599124,0.0000334161,0.0004898891,0.0003959073,0.0000161008,0.000009645713,0.000070203016,0.9922778,0.0004778932,0.002370658,0.0024927834,0.000559721],"about_ca_topic_score_codex":0.000002533562,"about_ca_topic_score_gemma":0.0000048394445,"teacher_disagreement_score":0.7273969,"about_ca_system_score_codex":0.0001770698,"about_ca_system_score_gemma":0.000008038847,"threshold_uncertainty_score":0.8891604},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15024169,0.00019563845,0.8405007,0.008142739,0.00025592567,0.00018471805,3.592323e-7,0.00025099525,0.00022722525],"genre_scores_gemma":[0.88358253,0.000004192146,0.10963598,0.0065208813,0.00022277501,0.000005849574,0.0000049783794,0.00001381634,0.00000900925],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789166,0.00007809378,0.0004884999,0.00037826897,0.00045893327,0.00070452795],"domain_scores_gemma":[0.9990908,0.000117669086,0.00025910832,0.0003546879,0.000077973906,0.000099787496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000966819,0.00027061906,0.0002170316,0.00030013986,0.00047383262,0.0006463898,0.0011741929,0.0000855207,0.0000014774431],"category_scores_gemma":[0.000019528889,0.00019980433,0.000074075935,0.0008582677,0.00013411618,0.0014424032,0.00026276163,0.0005111596,0.00002786446],"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.000038077746,0.00006347482,0.0011403938,0.00012461316,0.000011992595,0.000091021604,0.014123747,0.23681223,0.00021628133,0.002508417,0.0010914023,0.74377835],"study_design_scores_gemma":[0.0005776952,0.000031539617,0.01167304,0.00013584956,0.000004303243,0.000070295144,0.000098405115,0.9820736,0.00002912931,0.00066241913,0.0043259487,0.00031777678],"about_ca_topic_score_codex":0.000054820957,"about_ca_topic_score_gemma":0.000012652051,"teacher_disagreement_score":0.7452614,"about_ca_system_score_codex":0.00008625721,"about_ca_system_score_gemma":0.00010424464,"threshold_uncertainty_score":0.8147784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014398925,0.00018112385,0.98060024,0.0028921573,0.00008277515,0.0006348501,0.0000069465095,0.0002388147,0.00096414273],"genre_scores_gemma":[0.7617294,0.0000015563769,0.23557435,0.0017034825,0.000200805,0.00007911649,0.000020413006,0.000025620377,0.00066521973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972031,0.000035250945,0.0008355483,0.000622594,0.000864431,0.00043905896],"domain_scores_gemma":[0.9976616,0.0009750603,0.00036595436,0.00047635924,0.0003878572,0.00013320481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391342,0.00020119149,0.0002536857,0.00028074463,0.0004498257,0.0003410467,0.0005834405,0.00011458444,0.00003983369],"category_scores_gemma":[0.00025944214,0.00017112456,0.00015972229,0.0006394391,0.00009585654,0.0006447278,0.00005197002,0.00012587135,0.00005774789],"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.000055588513,0.000050849278,0.00022284234,0.000010927906,0.0000065188387,0.000001617744,0.00040071202,0.88079077,0.0030836249,0.0028730487,0.003199143,0.10930436],"study_design_scores_gemma":[0.00045675173,0.000018733026,0.00029729313,0.000011616894,0.000011536926,0.0000010904067,0.00010191966,0.8969196,0.00055141526,0.07439288,0.026996117,0.00024101367],"about_ca_topic_score_codex":0.000009487858,"about_ca_topic_score_gemma":0.0000022687777,"teacher_disagreement_score":0.74733055,"about_ca_system_score_codex":0.00005680024,"about_ca_system_score_gemma":0.00003727248,"threshold_uncertainty_score":0.69782573},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066961655,0.00020931281,0.9827738,0.009341409,0.00005047892,0.00041138852,0.0000024004778,0.00032863885,0.00018642718],"genre_scores_gemma":[0.4921736,0.0000018380758,0.50666195,0.0010328579,0.00004246001,0.00006402137,0.000007299583,0.000007124513,0.000008827313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987241,0.000020161238,0.00029351917,0.0003955223,0.00023198519,0.00033472638],"domain_scores_gemma":[0.9991451,0.00005583434,0.00020452819,0.00044425068,0.000079161386,0.00007114072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000209378,0.00015845777,0.00021153326,0.00009154529,0.00017063157,0.00018872731,0.00081912644,0.00006805233,0.0000018882207],"category_scores_gemma":[0.000050579216,0.00015274425,0.000103272156,0.00042377127,0.000067789944,0.0003496649,0.000072108334,0.00012368419,0.0000064854494],"study_design_candidate":"design_other","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.00001316253,0.00023187924,0.000022988488,0.0001690608,0.000020569014,0.00000640083,0.0025848954,0.00023674748,0.047715366,0.13411322,0.00061162806,0.8142741],"study_design_scores_gemma":[0.0023914215,0.00063020753,0.0028893221,0.0009652382,0.00012521599,0.00004302183,0.00028373481,0.6006102,0.100230925,0.2597884,0.030214736,0.0018275862],"about_ca_topic_score_codex":0.000004782333,"about_ca_topic_score_gemma":1.9408773e-7,"teacher_disagreement_score":0.8124465,"about_ca_system_score_codex":0.000028691074,"about_ca_system_score_gemma":0.00007495563,"threshold_uncertainty_score":0.62287295},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052570184,0.00032883062,0.98536336,0.006683223,0.0004950745,0.0014114896,0.00006463451,0.00025169697,0.0001446769],"genre_scores_gemma":[0.10701819,0.0000036442161,0.8836157,0.004591454,0.00074013305,0.0023588417,0.000754596,0.00004837558,0.0008690912],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803543,0.000056525943,0.0005107642,0.0006612049,0.0002465368,0.0004895413],"domain_scores_gemma":[0.99872446,0.000077397985,0.00029121435,0.0003566251,0.00043872482,0.00011156107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019104074,0.0002914089,0.0003212206,0.00012040172,0.00044236737,0.000904484,0.0006059013,0.00011716424,0.000026813552],"category_scores_gemma":[0.000027675842,0.0002655499,0.00011935858,0.00032221002,0.000047802696,0.0014536027,0.00005978639,0.00013791547,0.000028997734],"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.00005094377,0.00027421396,0.00007170996,0.00057469687,0.00013044513,0.0000053970093,0.00157968,0.014817363,0.14840662,0.0010972238,0.41577658,0.4172151],"study_design_scores_gemma":[0.0014397571,0.000055057844,0.0004089233,0.00007228044,0.000012555894,0.000013783153,0.000022339005,0.99041665,0.00040091033,0.00034119582,0.0064293393,0.00038719238],"about_ca_topic_score_codex":0.00005305928,"about_ca_topic_score_gemma":0.000007785031,"teacher_disagreement_score":0.9755993,"about_ca_system_score_codex":0.00007203592,"about_ca_system_score_gemma":0.00006931975,"threshold_uncertainty_score":0.9999797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077093234,0.00093013037,0.98614067,0.0032294153,0.00062378484,0.00016297925,0.000007883133,0.0003650295,0.0008307668],"genre_scores_gemma":[0.9245591,0.000004694101,0.072929256,0.0017369491,0.00044830184,0.0000456431,0.000045791294,0.000018767996,0.00021148258],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801683,0.000057513134,0.00039163925,0.0005689031,0.00046797155,0.0004971473],"domain_scores_gemma":[0.9992933,0.000026219865,0.00019449029,0.00033016768,0.000064401196,0.00009140685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022516333,0.00023991911,0.00024699778,0.000084453844,0.00031210948,0.00046956982,0.0007625065,0.0000691429,0.0000041678063],"category_scores_gemma":[0.0000058709984,0.00021534412,0.00008526182,0.00039914445,0.00008045135,0.00068805506,0.00016767533,0.0001788626,0.0001017095],"study_design_candidate":"design_other","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.000014322339,0.00048068954,0.00096311833,0.00024800596,0.000030416753,0.00028312413,0.0009245571,0.0032563887,0.016567642,0.018660942,0.102569595,0.8560012],"study_design_scores_gemma":[0.0022004463,0.00009406789,0.0060006455,0.00033694116,0.000017321385,0.00012716568,0.000029905555,0.79531604,0.00037915612,0.001039688,0.19335368,0.0011049322],"about_ca_topic_score_codex":0.00012123643,"about_ca_topic_score_gemma":0.00000578742,"teacher_disagreement_score":0.9168498,"about_ca_system_score_codex":0.0000770208,"about_ca_system_score_gemma":0.00004017647,"threshold_uncertainty_score":0.8781478},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025825673,0.00018710936,0.99368423,0.0017057031,0.00036342462,0.00065050053,0.0000011325873,0.00028467516,0.00054065493],"genre_scores_gemma":[0.42699286,0.0000016683252,0.5721979,0.00055304554,0.0001253642,0.000068743146,0.000015712152,0.000019340376,0.000025356649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776924,0.00004964727,0.00042867588,0.00060483266,0.00049195485,0.0006556584],"domain_scores_gemma":[0.9986734,0.0001808428,0.00031995165,0.00030916318,0.00040285193,0.00011380379],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011661847,0.00023493315,0.000225791,0.00025643257,0.0007150995,0.00029796181,0.0005552707,0.00007148706,0.000006286121],"category_scores_gemma":[0.00028074635,0.00025535835,0.0000812293,0.0005390343,0.00007866017,0.001270179,0.00014156858,0.0001670365,0.000012527869],"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.000038242306,0.00013063895,0.0019461364,0.000075932294,0.000040568037,0.000005047578,0.0015012397,0.870895,0.005394638,0.002522692,0.00033321392,0.11711662],"study_design_scores_gemma":[0.0013111786,0.00002427762,0.0014097065,0.00006286675,0.000023179051,0.000007766935,0.00005594665,0.9951935,0.00072915637,0.00057338347,0.00028138407,0.0003276709],"about_ca_topic_score_codex":0.000007063233,"about_ca_topic_score_gemma":0.000015254031,"teacher_disagreement_score":0.4244103,"about_ca_system_score_codex":0.00027991898,"about_ca_system_score_gemma":0.00015464854,"threshold_uncertainty_score":0.99998987},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2969018,0.000060001516,0.66675115,0.03576716,0.00012605726,0.0002785977,8.027555e-7,0.00007815599,0.00003626716],"genre_scores_gemma":[0.8943051,0.0000011838983,0.10139857,0.0041349274,0.00009678451,0.00004949401,5.34829e-7,0.0000109931125,0.0000024073618],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983808,0.00009667097,0.00033941874,0.0004176108,0.0003217352,0.00044377535],"domain_scores_gemma":[0.9991849,0.000101334444,0.00017074599,0.00039630284,0.000064054075,0.00008268298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006597742,0.00017469288,0.00021804101,0.00030330027,0.00020828797,0.00030010918,0.00164963,0.00005451669,0.0000016497155],"category_scores_gemma":[0.000027942095,0.00012197505,0.000074804775,0.0010881551,0.00012028782,0.0003219152,0.00023797574,0.0005206274,0.0000046119612],"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.00016025927,0.00048727618,0.015236047,0.00047738667,0.00006744778,0.00005756393,0.01572963,0.23701942,0.19793794,0.014513273,0.0033016328,0.5150121],"study_design_scores_gemma":[0.00065941346,0.00005671308,0.016510064,0.00012407033,0.0000053298127,0.000022416714,0.000008215277,0.9759807,0.00014793305,0.0043767253,0.0018686916,0.00023975082],"about_ca_topic_score_codex":0.00012973075,"about_ca_topic_score_gemma":0.00008221457,"teacher_disagreement_score":0.7389613,"about_ca_system_score_codex":0.000010864859,"about_ca_system_score_gemma":0.000079648846,"threshold_uncertainty_score":0.49739984},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050634355,0.0013247264,0.9894514,0.00096356095,0.00025098698,0.0012816789,0.000033529766,0.0009963477,0.0006343054],"genre_scores_gemma":[0.8760888,0.0000023734135,0.12034008,0.0005809506,0.0004593353,0.0022584754,0.000063881445,0.00005911518,0.00014701596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603444,0.00011128733,0.00082251825,0.0012223488,0.0005952373,0.0012141456],"domain_scores_gemma":[0.9981751,0.00026937405,0.0005099635,0.0005911476,0.00028644933,0.0001679693],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008074768,0.00051024347,0.00060679886,0.00021449225,0.0006652394,0.0010561164,0.0013939756,0.00016235291,7.003494e-7],"category_scores_gemma":[0.00018224158,0.00046273792,0.00019491802,0.00065529725,0.00007822277,0.00088213687,0.00014818575,0.00025823322,0.000020185968],"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.000028703334,0.002412877,0.026999202,0.028346084,0.00023047785,0.00019041098,0.004540275,0.809241,0.0035761523,0.07112003,0.019799927,0.03351486],"study_design_scores_gemma":[0.0015959034,0.000042537013,0.0008424631,0.0004676103,0.000051143907,0.00008488047,0.0002218134,0.9946057,0.00003417445,0.00020084855,0.001090735,0.0007621702],"about_ca_topic_score_codex":0.00018659464,"about_ca_topic_score_gemma":0.000007937278,"teacher_disagreement_score":0.8710253,"about_ca_system_score_codex":0.000207642,"about_ca_system_score_gemma":0.0001396073,"threshold_uncertainty_score":0.99998087},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44721693,0.000077612814,0.54678637,0.004818402,0.0007667705,0.000091015594,0.0000012304049,0.0001420009,0.000099667064],"genre_scores_gemma":[0.9035467,0.000005065868,0.09546484,0.0007578902,0.0001698797,0.000022824044,0.000016183685,0.000012656827,0.000003950174],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815863,0.00005234168,0.00030903498,0.0005679612,0.00035519278,0.000556814],"domain_scores_gemma":[0.9992283,0.000071431925,0.00014296852,0.0004048785,0.000044437715,0.00010799196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033952843,0.00023478808,0.00019736924,0.00015239183,0.00024792293,0.00033129082,0.000809902,0.000078034616,0.000006668208],"category_scores_gemma":[0.000042149382,0.00021678713,0.00008467706,0.00067740097,0.00010854355,0.0003305842,0.00017015092,0.0005806679,0.000026618773],"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.00047800053,0.0013250972,0.007176627,0.0004960378,0.00013038023,0.00033162924,0.01519349,0.057163112,0.19922149,0.06322556,0.01000906,0.6452495],"study_design_scores_gemma":[0.0016704416,0.00011885074,0.0071217655,0.00010906866,0.000007704083,0.000015828096,0.000022844699,0.97642887,0.0014196599,0.002306299,0.010172723,0.0006059251],"about_ca_topic_score_codex":0.000038465052,"about_ca_topic_score_gemma":0.000017809529,"teacher_disagreement_score":0.91926575,"about_ca_system_score_codex":0.000033094355,"about_ca_system_score_gemma":0.0000588453,"threshold_uncertainty_score":0.88403225},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7244086,0.0004501948,0.2723488,0.00017398658,0.00005242695,0.000054137,4.3718325e-7,0.000019234196,0.002492166],"genre_scores_gemma":[0.9869743,0.0000033845895,0.011344831,0.0014372008,0.00019494664,4.990871e-7,0.000018445384,0.000012175915,0.000014238553],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999029,0.000025820505,0.00024715415,0.0002767265,0.000117183365,0.00030413954],"domain_scores_gemma":[0.999603,0.000014056819,0.00013856914,0.00013833451,0.00004939968,0.000056639255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036643897,0.00012654526,0.00013449098,0.000042735177,0.00008340137,0.000018226698,0.00018764698,0.000083243285,0.0000027836747],"category_scores_gemma":[0.000055668155,0.000107881686,0.00007556728,0.00013186625,0.00011328298,0.0000024217043,0.000096052485,0.000075565295,0.000003494237],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036454137,0.000030542982,0.002159542,0.000034915996,0.000015144549,0.000016452228,0.000031824016,0.00018344884,0.9793603,0.00007068748,0.00011715228,0.017943544],"study_design_scores_gemma":[0.0008946601,0.000313392,0.015444967,0.00010617608,0.000024601231,0.00007229962,0.00009860847,0.0010849942,0.973166,0.00020978299,0.0080329105,0.0005516488],"about_ca_topic_score_codex":0.00000520478,"about_ca_topic_score_gemma":0.0000014948652,"teacher_disagreement_score":0.26256564,"about_ca_system_score_codex":0.0000069819366,"about_ca_system_score_gemma":0.000020484258,"threshold_uncertainty_score":0.43992877},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019456227,0.0016681355,0.9530848,0.04002189,0.00022453198,0.0024153613,0.0000011110338,0.00035652416,0.00028198236],"genre_scores_gemma":[0.24754745,0.000010711388,0.74457705,0.0052908626,0.00035069408,0.0020218508,0.0000033826652,0.000053494066,0.00014453525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663633,0.00021254765,0.000763888,0.0008762427,0.0006142441,0.00089672656],"domain_scores_gemma":[0.99740225,0.0007805929,0.00048822397,0.0010411241,0.00017591019,0.00011186904],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0028697818,0.00041547685,0.00037287766,0.000082901344,0.0013266101,0.0015042162,0.0025703192,0.00010444262,0.0000036520735],"category_scores_gemma":[0.000117920456,0.00025442033,0.00020767671,0.0006307531,0.00012378154,0.0012500633,0.00031056063,0.00045086135,0.000054776745],"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.000012958678,0.00005324617,0.00016473397,0.00017992241,0.000104638246,0.000005386979,0.0021749302,0.5962647,0.020179618,0.0010680096,0.0018119068,0.3779799],"study_design_scores_gemma":[0.0004745109,0.000015983449,0.00014494931,0.00019335441,0.00005265134,0.00009568164,0.00021737225,0.9921405,0.00028503285,0.00039451968,0.0056030895,0.00038239447],"about_ca_topic_score_codex":0.000050929306,"about_ca_topic_score_gemma":0.000015129799,"teacher_disagreement_score":0.39587572,"about_ca_system_score_codex":0.00015043234,"about_ca_system_score_gemma":0.00019375,"threshold_uncertainty_score":0.9999908},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005143325,0.0005116219,0.98793334,0.0029024428,0.00022683837,0.0005191013,0.0000022173435,0.0021478073,0.00061330455],"genre_scores_gemma":[0.49986145,0.00001746222,0.49828896,0.0013783947,0.000052577427,0.00017231521,0.000007190212,0.000027717897,0.00019393055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977028,0.000051435727,0.00044181867,0.00076647254,0.0004011576,0.0006363649],"domain_scores_gemma":[0.99873376,0.000091763635,0.00030113975,0.00048146702,0.00025934688,0.00013250932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004189235,0.00032260187,0.00034479657,0.00016789616,0.00044272366,0.00041033287,0.0011457521,0.00011027829,0.0000016059091],"category_scores_gemma":[0.000064259504,0.0003088197,0.00012492567,0.00053464563,0.00008048406,0.00064355694,0.000118292606,0.00017118918,0.000026363972],"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.00064094097,0.0006517097,0.0034440055,0.0037377644,0.00027144043,0.00020273612,0.011570903,0.6616376,0.019557659,0.0037867958,0.025939146,0.26855928],"study_design_scores_gemma":[0.0011208785,0.000040669034,0.0001705212,0.00022874663,0.000012381444,0.000058014146,0.0000603694,0.99437547,0.00024381491,0.00011381391,0.0031388951,0.00043643903],"about_ca_topic_score_codex":0.000031916778,"about_ca_topic_score_gemma":0.0000058219443,"teacher_disagreement_score":0.49471813,"about_ca_system_score_codex":0.0003456721,"about_ca_system_score_gemma":0.00016142592,"threshold_uncertainty_score":0.9999364},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2686,0.000030495235,0.71689105,0.0072537316,0.0003130083,0.00016496386,7.4368324e-7,0.00054480985,0.0062011993],"genre_scores_gemma":[0.843038,0.0000014951033,0.13799222,0.01871751,0.00011960619,0.000026956011,0.000002856521,0.000013816208,0.000087553075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867445,0.000021705902,0.0002798292,0.00029083935,0.0003741666,0.00035899083],"domain_scores_gemma":[0.99920756,0.000020812233,0.00015668558,0.00042553182,0.00007161051,0.000117829135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002604275,0.00016597309,0.00016133787,0.00016975775,0.00024836796,0.0005926548,0.0008785611,0.000070933034,0.00007129938],"category_scores_gemma":[0.000018510673,0.0001557347,0.00007957226,0.00034055588,0.000116034615,0.0014956715,0.00009843356,0.00031965115,0.0006075232],"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.000101344114,0.00075669,0.025140319,0.0005445226,0.0001615385,0.000032899745,0.017611,0.0005293883,0.40083596,0.037775457,0.041100964,0.4754099],"study_design_scores_gemma":[0.0047419146,0.00020358784,0.050220553,0.0003390985,0.00006839668,0.00017966994,0.00012613603,0.72257686,0.008273121,0.008727629,0.20115106,0.0033920018],"about_ca_topic_score_codex":0.0000060904026,"about_ca_topic_score_gemma":0.0000026840867,"teacher_disagreement_score":0.72204745,"about_ca_system_score_codex":0.000010977338,"about_ca_system_score_gemma":0.000057692956,"threshold_uncertainty_score":0.7808685},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112518474,0.0027199958,0.8841339,0.00025815325,0.00006977682,0.00015381456,0.000005784033,0.000024636332,0.000115475406],"genre_scores_gemma":[0.96000963,0.00007532144,0.038335804,0.0008851178,0.00018175619,0.000025849426,0.00023291935,0.000030789644,0.00022281031],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877125,0.00011903508,0.00029421138,0.00035793075,0.00014511678,0.00031243326],"domain_scores_gemma":[0.999392,0.000016934418,0.00018820906,0.00025332108,0.00007401651,0.000075524826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023492606,0.00018588046,0.0001717489,0.000048125996,0.00013162084,0.000019112927,0.00022051368,0.00013601847,0.0000064654855],"category_scores_gemma":[0.000045713103,0.00019398316,0.00007472366,0.00010414454,0.00015777821,0.000007890307,0.000043342206,0.000080448044,0.0000072860885],"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.000071871975,0.00002933451,0.002554654,0.00002138624,0.000022429584,1.7535973e-7,0.000015849935,0.38635302,0.6013297,0.00002899262,0.008985196,0.0005873854],"study_design_scores_gemma":[0.0011983823,0.00026098787,0.015019134,0.00003588992,0.000055980126,0.000025034808,0.00002764866,0.97295976,0.006598697,0.00022153657,0.0030535294,0.0005434244],"about_ca_topic_score_codex":0.000011535489,"about_ca_topic_score_gemma":0.0000018739725,"teacher_disagreement_score":0.84749115,"about_ca_system_score_codex":0.000038837657,"about_ca_system_score_gemma":0.000056461733,"threshold_uncertainty_score":0.79104036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010836979,0.0007301245,0.9847465,0.0005711297,0.0002859141,0.00048809536,0.0000033786116,0.00091953215,0.0014183435],"genre_scores_gemma":[0.29382518,0.000015357838,0.7048976,0.00059693796,0.00013594529,0.0001976184,0.000013108543,0.00013247765,0.00018580847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810916,0.000086872344,0.00046792993,0.00039466334,0.00022954897,0.00071182643],"domain_scores_gemma":[0.99931264,0.00012553381,0.00010909727,0.00024825608,0.0000785725,0.0001259297],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007708143,0.00031262665,0.0003022616,0.000110292196,0.0002989438,0.00019323047,0.00023273854,0.00012109276,0.000019095452],"category_scores_gemma":[0.0001758099,0.0003353155,0.00010461363,0.00034836208,0.000059011287,0.0003277342,0.000017921133,0.00024693675,0.00002297225],"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.0000060614607,0.000020950965,0.00069083663,0.0002683169,0.000032608634,0.0000022747372,0.00063981,0.9780455,0.0077020843,0.00032651197,0.0010867943,0.011178207],"study_design_scores_gemma":[0.0012364474,0.000020679186,0.0001922882,0.00010690257,0.000032456075,0.000014991852,0.000081166305,0.98839515,0.0011259725,0.00037578013,0.007856454,0.0005616991],"about_ca_topic_score_codex":0.0000034401191,"about_ca_topic_score_gemma":8.9788836e-7,"teacher_disagreement_score":0.2829882,"about_ca_system_score_codex":0.00010518259,"about_ca_system_score_gemma":0.000036112786,"threshold_uncertainty_score":0.9999099},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008491338,0.0001963253,0.9839183,0.0008887229,0.00012792628,0.0002966458,0.0000014883414,0.0006139083,0.0054653143],"genre_scores_gemma":[0.2943852,0.000011716336,0.704715,0.00042773335,0.00005228951,0.000044404725,0.000006453576,0.000029568597,0.00032764784],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978518,0.00028288143,0.0005646619,0.0005061983,0.00041940098,0.00037509215],"domain_scores_gemma":[0.99876374,0.00009992199,0.0003967977,0.00046590593,0.00017734317,0.00009632089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007006744,0.00023992635,0.000338242,0.00021221428,0.00018323107,0.00016035466,0.00056860474,0.00009967424,0.0000099354165],"category_scores_gemma":[0.00006851933,0.0002384636,0.0001026637,0.0006100678,0.00011159525,0.0006937423,0.000060499857,0.00016860252,0.00012444546],"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.00013995553,0.0012920642,0.0043676957,0.002418528,0.00033837403,0.00013617346,0.009967103,0.1050224,0.6771902,0.019789513,0.11667483,0.06266317],"study_design_scores_gemma":[0.0035669238,0.0005141725,0.0023122353,0.0014088834,0.00011469719,0.0003495794,0.00027806743,0.94781,0.022174332,0.008597542,0.010197595,0.002675981],"about_ca_topic_score_codex":0.000029070561,"about_ca_topic_score_gemma":0.0000012209271,"teacher_disagreement_score":0.84278756,"about_ca_system_score_codex":0.00007304395,"about_ca_system_score_gemma":0.00012580451,"threshold_uncertainty_score":0.97242635},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03172188,0.00022910001,0.9650287,0.0017749085,0.00013348399,0.00012542873,0.0000013708931,0.00010733647,0.00087777653],"genre_scores_gemma":[0.94504005,0.0000012830508,0.05387869,0.00086583715,0.000070199516,0.00002514436,0.0000085851825,0.000013213793,0.000097003925],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.000042031785,0.00036589382,0.00046543815,0.00029604224,0.00046376232],"domain_scores_gemma":[0.9995261,0.000016631882,0.00016461396,0.000239209,0.000008600174,0.0000448895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025354544,0.0001832259,0.00020481889,0.000088312874,0.00013355465,0.00023232916,0.0005682366,0.00005430213,0.000003782262],"category_scores_gemma":[0.0000067267065,0.00018107865,0.000042490425,0.0002911098,0.000034698805,0.00052628556,0.0000963035,0.00014792338,0.00006105623],"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.00005681226,0.0015057505,0.03830744,0.00070647884,0.00005994828,0.0013423809,0.002178686,0.26427642,0.4027897,0.1143689,0.009160599,0.16524687],"study_design_scores_gemma":[0.0035746568,0.00007312714,0.06818456,0.00061279023,0.000013504581,0.00012919275,0.000056918085,0.9016,0.0047852793,0.0029690498,0.016323958,0.0016769256],"about_ca_topic_score_codex":0.000105822044,"about_ca_topic_score_gemma":0.000012350485,"teacher_disagreement_score":0.91331816,"about_ca_system_score_codex":0.00005323241,"about_ca_system_score_gemma":0.000021924456,"threshold_uncertainty_score":0.73841727},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009851001,0.00016959058,0.9871596,0.0011410777,0.00009830868,0.00019005641,6.554964e-7,0.00070995756,0.00067976036],"genre_scores_gemma":[0.62177676,0.000006103587,0.3773312,0.0007859927,0.000027221005,0.000020098956,0.000007718961,0.000011015937,0.000033857472],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805325,0.00019858668,0.0003968617,0.000563541,0.00037113606,0.00041659232],"domain_scores_gemma":[0.9990029,0.00003884192,0.00028872536,0.0004221881,0.00013328926,0.00011408186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051070645,0.00020944464,0.00026197737,0.00043222273,0.0003907251,0.00040795864,0.00056580384,0.00008180803,0.000011619284],"category_scores_gemma":[0.00009323857,0.00021337406,0.00012002338,0.0020057997,0.0000762004,0.00062112533,0.000068084504,0.0001642621,0.000009680451],"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.000017498292,0.00020134842,0.0036959099,0.00006490637,0.00026131564,0.000025564554,0.001826525,0.9665734,0.0046115993,0.0047881952,0.0019376152,0.015996113],"study_design_scores_gemma":[0.00028030985,0.000015741694,0.00061896903,0.00003160018,0.000103184306,0.000013919024,0.000010301047,0.9953212,0.0019500983,0.0002386681,0.0011212387,0.0002947611],"about_ca_topic_score_codex":0.000019433919,"about_ca_topic_score_gemma":0.0000010732148,"teacher_disagreement_score":0.6119258,"about_ca_system_score_codex":0.00009430966,"about_ca_system_score_gemma":0.00010983307,"threshold_uncertainty_score":0.8701142},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22822407,0.0005187492,0.76476395,0.0032097297,0.00033795444,0.00016198936,6.688331e-7,0.00012529409,0.0026576172],"genre_scores_gemma":[0.9931219,0.000005128846,0.004870227,0.0017915557,0.00010838444,0.000014668974,7.791157e-7,0.000011514456,0.000075808995],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854183,0.00013443633,0.00030512357,0.0004154856,0.0002468222,0.0003562993],"domain_scores_gemma":[0.9995278,0.00006553158,0.000099014906,0.00020265303,0.000019587193,0.00008537982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005153001,0.00016693382,0.00022590162,0.000090827176,0.00013568443,0.00027730665,0.00029969608,0.00007507953,0.000002880208],"category_scores_gemma":[0.000030278177,0.0001517823,0.000037134585,0.00027743232,0.000050741888,0.00047825483,0.000041708197,0.00020936965,0.000011355453],"study_design_candidate":"design_other","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.00007279876,0.00034129195,0.20788515,0.0005554592,0.00015519874,0.00059078,0.050553698,0.014274065,0.0053351396,0.037337814,0.02474389,0.6581547],"study_design_scores_gemma":[0.016134312,0.0012301968,0.3051215,0.0032382563,0.00010606581,0.0012829604,0.0026919013,0.51851404,0.001598447,0.008036136,0.13485216,0.007194047],"about_ca_topic_score_codex":0.000029662575,"about_ca_topic_score_gemma":0.000015251169,"teacher_disagreement_score":0.7648979,"about_ca_system_score_codex":0.00007005351,"about_ca_system_score_gemma":0.00005995169,"threshold_uncertainty_score":0.61895025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0470584,0.00023231539,0.95100355,0.0008459477,0.0002391604,0.00034442978,0.00003312537,0.00018716327,0.000055931545],"genre_scores_gemma":[0.13777304,0.000022614311,0.8610492,0.00085831963,0.00007316484,0.000052379404,0.000083815234,0.0000208333,0.00006663445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979926,0.000022662869,0.00050288107,0.0007230937,0.00034938823,0.00040937786],"domain_scores_gemma":[0.99812615,0.000059428046,0.00037429057,0.0012304821,0.00009966546,0.00010999274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019804045,0.00027702667,0.00033324663,0.00013072975,0.00023431695,0.00011842168,0.001022608,0.000072689705,0.000012899578],"category_scores_gemma":[0.00006153365,0.00021863203,0.000052435425,0.00025928233,0.00025929307,0.0036753605,0.0004286054,0.00021099966,0.000094337294],"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.00025311112,0.0016138441,0.02581025,0.0028440594,0.00039321932,0.00012205734,0.009562964,0.058803376,0.073487476,0.07821779,0.022010755,0.7268811],"study_design_scores_gemma":[0.0023426241,0.00008586144,0.0061704735,0.0005090877,0.000017419894,0.00007247947,0.0004778385,0.9826266,0.000933203,0.0005927432,0.0053743324,0.0007973018],"about_ca_topic_score_codex":0.0001826999,"about_ca_topic_score_gemma":0.000016782898,"teacher_disagreement_score":0.92382324,"about_ca_system_score_codex":0.00003217607,"about_ca_system_score_gemma":0.00005961865,"threshold_uncertainty_score":0.8915556},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05000691,0.00042327258,0.9459471,0.0019647535,0.00028370586,0.00023746587,0.0000012259607,0.000083665196,0.0010519068],"genre_scores_gemma":[0.89011234,0.0000016783908,0.108172365,0.0014677782,0.0002048388,0.000020053054,0.000004845927,0.000007688416,0.0000083953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981352,0.00009974449,0.00051666494,0.00036770353,0.00039496357,0.00048570454],"domain_scores_gemma":[0.99903387,0.0001761316,0.0002690871,0.0004115432,0.00005559758,0.000053768625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018971042,0.00017759512,0.0002351263,0.00016316598,0.00013615526,0.0002004942,0.0014340088,0.000057214987,9.992638e-7],"category_scores_gemma":[0.000037648177,0.00013476016,0.00007672874,0.000816253,0.00008357785,0.00033020266,0.00010495478,0.00025995006,0.000012894783],"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.00017781644,0.0014419495,0.059408166,0.0018357633,0.00020114046,0.001108129,0.048391644,0.35002837,0.019200506,0.017304892,0.017678317,0.48322332],"study_design_scores_gemma":[0.0043286677,0.00025397554,0.046513114,0.0015447112,0.000043709435,0.00050158636,0.0019623262,0.846507,0.0010412958,0.0015071277,0.09367541,0.002121065],"about_ca_topic_score_codex":0.00006855611,"about_ca_topic_score_gemma":0.0000061589067,"teacher_disagreement_score":0.8401055,"about_ca_system_score_codex":0.000036585207,"about_ca_system_score_gemma":0.00006563405,"threshold_uncertainty_score":0.54953605},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27380815,0.000039679402,0.72090286,0.004458665,0.00003571316,0.0001431876,0.00001270856,0.00008207139,0.00051694125],"genre_scores_gemma":[0.99697566,0.0000015105957,0.002034229,0.00029712412,0.00012310981,0.000041165888,0.00044245744,0.000021547748,0.0000631959],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890536,0.00003080719,0.00030209438,0.0002485719,0.0001768667,0.0003362716],"domain_scores_gemma":[0.99929374,0.000040386105,0.00017504834,0.0003235689,0.00006657793,0.00010065483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033945456,0.00015311065,0.00014782249,0.00003552534,0.00038435296,0.00011443806,0.00026306248,0.00004226527,0.000047217407],"category_scores_gemma":[0.00000619807,0.00014676587,0.00006648128,0.00021960662,0.00009417983,0.00014949929,0.00004977306,0.00023155783,0.0000928573],"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.00007207977,0.00052422634,0.010561869,0.00004080147,0.00007163767,0.0000015293518,0.0009020968,0.000088188004,0.031674545,0.9210134,0.0075518023,0.02749781],"study_design_scores_gemma":[0.0040585008,0.00010722015,0.03974525,0.0004384393,0.00036797437,0.000012524661,0.0017428569,0.3795924,0.010111084,0.4116165,0.14974733,0.0024599056],"about_ca_topic_score_codex":0.000037691763,"about_ca_topic_score_gemma":0.0000019828008,"teacher_disagreement_score":0.72316754,"about_ca_system_score_codex":0.00003925671,"about_ca_system_score_gemma":0.000030500403,"threshold_uncertainty_score":0.5984939},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027698457,0.00022298643,0.94172436,0.029777141,0.000117165495,0.00017824405,9.0600514e-7,0.00010822242,0.00017250376],"genre_scores_gemma":[0.82931995,0.0000049527093,0.16989598,0.0005739193,0.000118351236,0.00001466776,0.0000036701829,0.0000068220634,0.00006172068],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987817,0.000042659965,0.0001798014,0.00029410343,0.00030322175,0.00039850766],"domain_scores_gemma":[0.99915355,0.00012366776,0.00021426589,0.00035681925,0.00009082774,0.000060855575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006680444,0.00012839361,0.00012292674,0.000089918496,0.00082353683,0.00016702086,0.000619471,0.00005068186,0.0000010749357],"category_scores_gemma":[0.00004143236,0.000102771264,0.00007133455,0.00051509053,0.00017558645,0.00056590105,0.0001644598,0.000173665,0.000005490202],"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.000059816535,0.0008841466,0.0089761885,0.00045228194,0.00017606949,0.000059362024,0.007264017,0.135259,0.3966008,0.150739,0.023409745,0.27611956],"study_design_scores_gemma":[0.000833274,0.00008012259,0.102775864,0.00017244549,0.00005759676,0.00011698304,0.00016768185,0.88116276,0.006771059,0.003810492,0.0033213932,0.0007303403],"about_ca_topic_score_codex":0.00003401586,"about_ca_topic_score_gemma":0.00003941615,"teacher_disagreement_score":0.80162144,"about_ca_system_score_codex":0.00006594215,"about_ca_system_score_gemma":0.00007035117,"threshold_uncertainty_score":0.6334063},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4210384,0.00019154335,0.5504815,0.026977733,0.00032523647,0.000173115,0.0000017854488,0.00009606729,0.00071461085],"genre_scores_gemma":[0.9972873,0.000008283161,0.00033862074,0.0022201857,0.000039822102,0.000028854074,9.546725e-7,0.000006354933,0.00006962448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989236,0.00013612797,0.0002752435,0.0002914784,0.00017953216,0.00019401671],"domain_scores_gemma":[0.99884933,0.00063691154,0.00015785272,0.00026372776,0.0000513053,0.00004089267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004500052,0.00011536287,0.00014450794,0.000047181835,0.00017664403,0.00007963544,0.00030860328,0.000053870423,0.000032670836],"category_scores_gemma":[0.00006189742,0.000060984654,0.000059089034,0.0001646603,0.00021833321,0.00026085228,0.000057977944,0.00011799023,0.0000122095225],"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.00017959601,0.00043340682,0.03792872,0.00023710701,0.0002917832,0.000047012087,0.0031731047,0.030007767,0.007899729,0.6689319,0.13812748,0.11274238],"study_design_scores_gemma":[0.0044242446,0.0006279274,0.11523156,0.002550908,0.00006107408,0.00045406827,0.00016349542,0.5483262,0.0010581053,0.3194668,0.0058022756,0.0018333446],"about_ca_topic_score_codex":0.0000061618744,"about_ca_topic_score_gemma":0.0000012160854,"teacher_disagreement_score":0.5762489,"about_ca_system_score_codex":0.000019746823,"about_ca_system_score_gemma":0.000015239464,"threshold_uncertainty_score":0.24868819},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12734915,0.000121767865,0.86226356,0.009552181,0.00017082685,0.0003512924,0.0000076069946,0.00009048246,0.00009315408],"genre_scores_gemma":[0.84303826,0.0000022406966,0.15449704,0.002195109,0.0001841183,0.00004461372,0.000006164756,0.000014204926,0.000018262479],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982534,0.000102088954,0.00029891855,0.00055903994,0.0002928156,0.00049372955],"domain_scores_gemma":[0.99899787,0.00038578082,0.00016831697,0.00032073632,0.00005273387,0.00007458431],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060888147,0.00025499435,0.00024946244,0.00009107198,0.00023654226,0.00037518315,0.00074688176,0.00007022322,0.000001914305],"category_scores_gemma":[0.000047047626,0.00013650549,0.00004358578,0.00027201016,0.0002085941,0.00024416577,0.000057685378,0.00017103061,0.0000061873125],"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.00114074,0.00046742693,0.008498827,0.00084056717,0.0002616593,0.0005591769,0.013344916,0.28937337,0.005098609,0.034879908,0.009171684,0.63636315],"study_design_scores_gemma":[0.017716832,0.0011269423,0.007480984,0.004199626,0.0000764634,0.0011992088,0.0005546178,0.944704,0.0005021426,0.007438177,0.012245915,0.0027550803],"about_ca_topic_score_codex":0.0000044757376,"about_ca_topic_score_gemma":0.0000030016918,"teacher_disagreement_score":0.71568906,"about_ca_system_score_codex":0.000034070712,"about_ca_system_score_gemma":0.000065066764,"threshold_uncertainty_score":0.5566532},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008264902,0.0003172012,0.981133,0.007466944,0.00009174648,0.00011573447,2.8207293e-7,0.0006029894,0.0020072032],"genre_scores_gemma":[0.60918725,0.000030849566,0.3885881,0.0019758325,0.000034846806,0.000018188965,4.5264767e-7,0.000012296188,0.0001522092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984089,0.00008061221,0.00036161143,0.0004997062,0.0002413509,0.0004077782],"domain_scores_gemma":[0.99925035,0.00009101893,0.00013993359,0.00038402225,0.00005919795,0.00007545089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038399603,0.00018247013,0.00020601097,0.00022974012,0.00013268666,0.0001510132,0.0007677708,0.000063633684,0.000005056856],"category_scores_gemma":[0.000028570164,0.00013802775,0.0000540909,0.00035654748,0.00008516396,0.0006784807,0.00013644667,0.0001185966,0.00003747674],"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.000042856216,0.00024936674,0.0027945042,0.00016531452,0.000028959863,0.00013884678,0.0037133177,0.7149994,0.013004275,0.011827004,0.0076536564,0.24538253],"study_design_scores_gemma":[0.00092061213,0.000027921853,0.00026290835,0.00042511342,0.000003946878,0.000025554418,0.000014741371,0.9906329,0.0013048992,0.0048078103,0.000993777,0.00057981897],"about_ca_topic_score_codex":0.000024317575,"about_ca_topic_score_gemma":0.0000019304155,"teacher_disagreement_score":0.60092235,"about_ca_system_score_codex":0.00007153732,"about_ca_system_score_gemma":0.0000764236,"threshold_uncertainty_score":0.56286085},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82620794,0.004464699,0.16196075,0.0063108294,0.00012233679,0.000736316,0.00007941769,0.00005161767,0.00006609306],"genre_scores_gemma":[0.9919051,0.0001858208,0.006826768,0.0006764122,0.00016344461,0.00010118023,0.000040900297,0.000024365243,0.00007601659],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836046,0.00021946935,0.00047287284,0.0004522268,0.0001447399,0.00035025575],"domain_scores_gemma":[0.9982111,0.0004677039,0.00046333295,0.0005663288,0.0002008335,0.000090739995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057772506,0.00024150762,0.00038483442,0.000034855126,0.00021608837,0.000079750964,0.0004777385,0.00016456432,3.4257846e-7],"category_scores_gemma":[0.0010977167,0.00016041762,0.00011510922,0.000070139344,0.00033524306,0.000016686103,0.000222747,0.000099025296,8.366052e-7],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080559915,0.0002548583,0.026715476,0.001123467,0.00021865542,0.000003217767,0.00045526767,0.0037059658,0.94789207,0.0010159891,0.0024233863,0.015386076],"study_design_scores_gemma":[0.048975524,0.0088327695,0.0717586,0.011957665,0.0013136289,0.00030188417,0.015873568,0.15798423,0.08053735,0.0033719619,0.58830535,0.0107874945],"about_ca_topic_score_codex":0.000091112284,"about_ca_topic_score_gemma":0.000044550317,"teacher_disagreement_score":0.8673547,"about_ca_system_score_codex":0.000020881354,"about_ca_system_score_gemma":0.00003248467,"threshold_uncertainty_score":0.6541641},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09724024,0.00014222934,0.778702,0.11819545,0.000049914222,0.0002604868,0.000002531974,0.0002018986,0.0052052545],"genre_scores_gemma":[0.77716666,0.000004663444,0.22081137,0.0019021166,0.000049494407,0.000015723424,0.000004235821,0.000004607721,0.000041126565],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992383,0.000023844597,0.00019862692,0.0002047948,0.00015395161,0.00018045117],"domain_scores_gemma":[0.99948853,0.00004854626,0.00010435585,0.00030988935,0.000019433572,0.000029225832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025968632,0.00007537448,0.00010076479,0.000056734232,0.00008501208,0.00008665206,0.0007635433,0.000020045776,0.0000014045828],"category_scores_gemma":[0.000020229667,0.000055594035,0.000020449485,0.0004218026,0.00005436297,0.00025765356,0.000048273196,0.00009349352,0.000014516861],"study_design_candidate":"design_other","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.0000025010606,0.00006226432,0.00021887619,0.000015363734,0.000002910932,0.0000054476172,0.003361938,0.00064953824,0.016368857,0.0012563289,0.0018571251,0.97619885],"study_design_scores_gemma":[0.0004701589,0.00005108803,0.026341368,0.00013434232,0.000007335421,0.000015437648,0.00009953773,0.9681873,0.0007548064,0.0030518589,0.00061452657,0.00027226206],"about_ca_topic_score_codex":0.00005388849,"about_ca_topic_score_gemma":0.000006506019,"teacher_disagreement_score":0.9759266,"about_ca_system_score_codex":0.000015894395,"about_ca_system_score_gemma":0.000040537205,"threshold_uncertainty_score":0.22670591},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010397553,0.00069193693,0.9869849,0.0010489484,0.00020710375,0.00033579205,0.000016355047,0.000026127798,0.0002912628],"genre_scores_gemma":[0.88870126,0.0001295515,0.10638635,0.0032309259,0.000999803,0.000100062854,0.0002063474,0.000041111125,0.0002046068],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842083,0.000027788497,0.00029819776,0.00042330942,0.00011459835,0.00071526266],"domain_scores_gemma":[0.99911654,0.000013867245,0.00018613365,0.00048797636,0.00006316414,0.0001323354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045701375,0.0002458754,0.00023588889,0.000027890776,0.0008771573,0.00029586244,0.00059663167,0.0002605503,0.0000065437557],"category_scores_gemma":[0.00002227844,0.00021470836,0.00014541636,0.000026498712,0.0002549439,0.000016952134,0.00035400855,0.00020323045,0.000007780521],"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.0005159135,0.00017179262,0.001763421,0.00020344165,0.00022877641,0.000020894699,0.00030064225,0.102511525,0.008829024,0.0001260718,0.017757012,0.8675715],"study_design_scores_gemma":[0.0018389128,0.00015842324,0.0009455929,0.00004858823,0.000017717775,0.000025056941,0.00008591509,0.974303,0.00016288715,0.000087808636,0.021871177,0.00045488766],"about_ca_topic_score_codex":0.000009907429,"about_ca_topic_score_gemma":0.0000143803545,"teacher_disagreement_score":0.88059855,"about_ca_system_score_codex":0.00002000014,"about_ca_system_score_gemma":0.000044105884,"threshold_uncertainty_score":0.8755553},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84487444,0.009260836,0.10046142,0.04304687,0.000083760606,0.0002899712,9.148054e-7,0.00036964085,0.0016121397],"genre_scores_gemma":[0.9816818,0.0009797536,0.015923891,0.0012896458,0.000018412098,0.00008839451,0.000001269446,0.000008239939,0.0000085866395],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875945,0.00013801848,0.00036440376,0.00028043336,0.00020117334,0.0002565243],"domain_scores_gemma":[0.99764705,0.00032159375,0.0007565736,0.0011358289,0.00010485837,0.000034094934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005971524,0.0001332434,0.00017508352,0.000089356545,0.00046857542,0.00026139288,0.0020366183,0.00006943817,7.4380563e-7],"category_scores_gemma":[0.00013100322,0.00010549647,0.000022808672,0.00051859545,0.00078890426,0.00079403067,0.00060422835,0.0002095706,9.843865e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010985984,0.00024487835,0.12885699,0.0003907782,0.0000630411,0.000009824687,0.01025983,0.00010051779,0.007827666,0.23341842,0.0025899615,0.6161282],"study_design_scores_gemma":[0.0044877315,0.0003510293,0.059007224,0.0020634374,0.000051560462,0.0001396266,0.0060196123,0.6934835,0.04715139,0.13109751,0.05333036,0.0028170287],"about_ca_topic_score_codex":0.00009338511,"about_ca_topic_score_gemma":0.00041298885,"teacher_disagreement_score":0.693383,"about_ca_system_score_codex":0.00002471777,"about_ca_system_score_gemma":0.0000635292,"threshold_uncertainty_score":0.43020213},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26764178,0.00027624622,0.7302367,0.0013175101,0.00017287687,0.00009697795,7.219296e-8,0.00013439647,0.00012344074],"genre_scores_gemma":[0.9206022,0.000014186498,0.078320794,0.000832969,0.00019529673,0.000008274822,5.4170636e-7,0.000014954342,0.0000107648375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981082,0.00011477523,0.00043811204,0.0005749481,0.0002613396,0.00050262007],"domain_scores_gemma":[0.99933964,0.00008413378,0.0001735015,0.00022134504,0.00009569261,0.0000856644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004849024,0.00019657625,0.0001967952,0.00023149571,0.00027698494,0.000397916,0.0004961011,0.000083097475,0.000009964504],"category_scores_gemma":[0.00016134095,0.0002066416,0.000031841777,0.00059681095,0.0004924212,0.00094224623,0.0001994496,0.00030409708,0.00006557234],"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.000049166872,0.000076067394,0.0088007655,0.00006769333,0.00001134945,0.000049764545,0.015836636,0.03281621,0.04934917,0.00957624,0.00001748051,0.8833495],"study_design_scores_gemma":[0.0000306489,0.0000510822,0.00089716824,0.0000979189,0.000004631204,0.000029057757,0.00032698232,0.9828299,0.006405465,0.008844657,0.00019573656,0.00028672518],"about_ca_topic_score_codex":0.000114144874,"about_ca_topic_score_gemma":0.000073766845,"teacher_disagreement_score":0.9500137,"about_ca_system_score_codex":0.00010153207,"about_ca_system_score_gemma":0.000057489717,"threshold_uncertainty_score":0.84266},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026635954,0.0001214561,0.9902742,0.004873535,0.00018267141,0.00013380912,0.0000092590835,0.00033581734,0.0014056871],"genre_scores_gemma":[0.5961292,0.0000073653,0.40253517,0.0011963563,0.00006629259,0.0000059781187,0.000018230063,0.000012083433,0.00002933361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998073,0.000052101488,0.0004135607,0.00071444723,0.000411995,0.00033492962],"domain_scores_gemma":[0.99571943,0.00006427954,0.00064301695,0.0034004457,0.00008702037,0.0000858095],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0004177902,0.00022114936,0.00036616946,0.00013205576,0.00060477946,0.0006881669,0.0057138996,0.00015660955,0.0000011101264],"category_scores_gemma":[0.00019376377,0.00020799533,0.000047637197,0.00012826748,0.00015876158,0.0008738552,0.0012846043,0.00047976567,0.000010049731],"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.000054852597,0.00035394446,0.0021328295,0.00014146917,0.000040771825,0.000009127045,0.0015080842,0.76976496,0.0010971987,0.001955559,0.04003434,0.18290687],"study_design_scores_gemma":[0.00028826654,0.000032951877,0.00028862775,0.00020319001,0.00000746493,0.0000019454749,0.000006294069,0.99706584,0.00051686313,0.00087638554,0.00046979694,0.00024235203],"about_ca_topic_score_codex":0.000026334139,"about_ca_topic_score_gemma":0.0000030805327,"teacher_disagreement_score":0.59346557,"about_ca_system_score_codex":0.00002199647,"about_ca_system_score_gemma":0.00009578006,"threshold_uncertainty_score":0.9996657},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62542933,0.0014668193,0.33357304,0.037759073,0.0005013358,0.00046647113,4.835473e-7,0.00010689838,0.00069651456],"genre_scores_gemma":[0.99737346,0.00003431652,0.0009598752,0.0012396635,0.0003171777,0.000052957836,3.4281086e-7,0.000009464479,0.000012727603],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985032,0.00026828298,0.00034519634,0.00033429757,0.00032176188,0.00022726502],"domain_scores_gemma":[0.99920976,0.00014950735,0.00017528154,0.00019732429,0.0002152284,0.00005291566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092932186,0.00012769901,0.00021104579,0.00009117723,0.00036927586,0.00015002395,0.00036123392,0.00006022134,0.0000031437698],"category_scores_gemma":[0.000077515346,0.00008457424,0.00004371529,0.00054381887,0.00014916569,0.00028587168,0.00013589172,0.00033306787,0.0000017184921],"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.0011592797,0.0007163636,0.0037155927,0.0025383523,0.00061337353,0.000017197388,0.20163794,0.03660454,0.08013738,0.060731456,0.017697332,0.5944312],"study_design_scores_gemma":[0.0012234414,0.00067078543,0.0046405373,0.0020089434,0.000024607216,0.000052627594,0.007242376,0.8795181,0.035182063,0.00023903018,0.06837962,0.00081787095],"about_ca_topic_score_codex":0.00004657679,"about_ca_topic_score_gemma":0.000025961534,"teacher_disagreement_score":0.84291357,"about_ca_system_score_codex":0.000043973825,"about_ca_system_score_gemma":0.00006376554,"threshold_uncertainty_score":0.34488374},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30501986,0.0016175838,0.68091065,0.000993795,0.00015469825,0.0001811629,0.000005003217,0.0015498695,0.009567417],"genre_scores_gemma":[0.8560767,0.000078616475,0.14353704,0.00018096552,0.000038138092,0.000020446427,0.0000037026794,0.00003765059,0.000026720265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864024,0.000014082632,0.00040104106,0.00030307742,0.00018371451,0.00045781705],"domain_scores_gemma":[0.99941134,0.00017788305,0.00007685216,0.00024151623,0.000031829248,0.000060583774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107673535,0.00023048071,0.00044062242,0.00040313002,0.00007600003,0.00004853545,0.000250546,0.00010600891,0.00007802547],"category_scores_gemma":[0.00013227855,0.0002236239,0.00013356387,0.0011132457,0.00011171833,0.00020920011,0.000025897565,0.0003546224,0.000026452037],"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.000005636701,0.00002948378,0.00017216195,0.00008000584,0.00027743325,0.000023498382,0.0002183531,0.5507361,0.007266431,0.00007856568,0.00018238093,0.44092992],"study_design_scores_gemma":[0.00018422242,0.000037307385,0.00015226591,0.00017631789,0.00017699938,0.0000053196723,0.00007237474,0.9973375,0.0013205875,0.000107070555,0.00015711346,0.00027288366],"about_ca_topic_score_codex":0.0000021050791,"about_ca_topic_score_gemma":9.867261e-7,"teacher_disagreement_score":0.55105686,"about_ca_system_score_codex":0.000081459286,"about_ca_system_score_gemma":0.000002416036,"threshold_uncertainty_score":0.9119118},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018623691,0.0004822173,0.9701761,0.010002475,0.0001226736,0.0003902894,0.0000020753835,0.00011360095,0.00008690023],"genre_scores_gemma":[0.7896292,0.000032494638,0.20710933,0.0028626071,0.00009584266,0.00014797089,0.000045950823,0.0000124853295,0.000064068685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865717,0.000064885346,0.00029845163,0.00045001306,0.0002499033,0.00027957957],"domain_scores_gemma":[0.9989971,0.0002507928,0.00017283973,0.00035784175,0.00012539179,0.00009606158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003378728,0.00018634411,0.00016204063,0.00015528608,0.00047649775,0.00029288253,0.00041453447,0.000053776002,0.0000015017032],"category_scores_gemma":[0.00008479011,0.00018281079,0.000042462747,0.00033280306,0.00007364127,0.00028057673,0.000059312533,0.00011673348,0.000014802488],"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.000105747014,0.00026385687,0.00010309746,0.00012760429,0.000021594862,0.000009936789,0.0026203133,0.49439988,0.00078414625,0.008224898,0.0012377396,0.4921012],"study_design_scores_gemma":[0.00073498307,0.00010048999,0.0023835618,0.00007567583,0.000013319293,0.00003497507,0.00002413905,0.9925597,0.000052648043,0.0018428207,0.0019197514,0.00025795924],"about_ca_topic_score_codex":0.000012921667,"about_ca_topic_score_gemma":0.000006991418,"teacher_disagreement_score":0.7710056,"about_ca_system_score_codex":0.00006986996,"about_ca_system_score_gemma":0.00007568671,"threshold_uncertainty_score":0.7454808},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4438659,0.0013906999,0.5339148,0.004584472,0.0008646118,0.00021986086,0.000007821015,0.0016319444,0.013519867],"genre_scores_gemma":[0.9917373,0.000005176992,0.0054108733,0.0020734642,0.0004373025,0.00002329401,0.0000023870964,0.000061527404,0.0002486834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992186,0.000006206989,0.00014590893,0.000098804376,0.00013099553,0.00039950793],"domain_scores_gemma":[0.9997454,0.000037304933,0.000009513015,0.00009498764,0.000012309279,0.000100464014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007693267,0.00017886466,0.00013422199,0.00015892343,0.00008171557,0.00025218056,0.00012422452,0.00004368078,0.000014645913],"category_scores_gemma":[0.00001196844,0.00016917485,0.000048556256,0.00032811833,0.000023609045,0.00023243572,0.000023645016,0.00019449955,0.00038402187],"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.000031129137,0.000012973706,0.00012286988,0.0012194174,0.0000928733,0.00008317253,0.079447985,0.4232148,0.20903404,0.0001032301,0.09956509,0.18707243],"study_design_scores_gemma":[0.0003823956,0.000089871835,0.0015822694,0.0018251472,0.000078329176,0.00009421228,0.000831165,0.88343287,0.009779499,0.00015166489,0.100350745,0.001401862],"about_ca_topic_score_codex":0.000025325124,"about_ca_topic_score_gemma":0.0000026516404,"teacher_disagreement_score":0.5478714,"about_ca_system_score_codex":0.000076497905,"about_ca_system_score_gemma":0.000022946779,"threshold_uncertainty_score":0.689875},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036920615,0.008192533,0.9365404,0.015032823,0.00024437404,0.0001081512,6.686393e-7,0.00038114088,0.002579279],"genre_scores_gemma":[0.9679003,0.00019320795,0.029307613,0.0024234185,0.000026945654,0.000012637903,0.0000016969052,0.000010250106,0.00012397856],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991293,0.000051979718,0.00019045355,0.00027034347,0.0001882375,0.00016970967],"domain_scores_gemma":[0.99940115,0.00009479193,0.00004883017,0.00036854466,0.00004594959,0.00004071582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018789283,0.00011500826,0.000118949676,0.00015716055,0.000127316,0.00023992293,0.00067222194,0.000026916647,0.000013685353],"category_scores_gemma":[0.00002072303,0.00009989563,0.000060714956,0.0005750093,0.00007374316,0.00035310886,0.00013447112,0.00021124813,0.000040461473],"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.000009748993,0.00007478103,0.00011444421,0.00021108217,0.000041245425,0.00001799092,0.0024244115,0.0015035517,0.029865388,0.2947522,0.015776625,0.6552085],"study_design_scores_gemma":[0.0006405024,0.00012955001,0.00069447386,0.0018316577,0.00002098744,0.000029058241,0.000039994142,0.9068265,0.006648755,0.009821103,0.07252769,0.0007897097],"about_ca_topic_score_codex":0.0000011392887,"about_ca_topic_score_gemma":4.6024113e-7,"teacher_disagreement_score":0.9309796,"about_ca_system_score_codex":0.000020249796,"about_ca_system_score_gemma":0.00005221708,"threshold_uncertainty_score":0.40736255},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0107774995,0.0032004432,0.9589608,0.02586633,0.00020428863,0.00021819735,7.5700143e-7,0.00019732848,0.00057438697],"genre_scores_gemma":[0.5054751,0.0001581879,0.46271464,0.030271614,0.000064786145,0.00020285927,0.000017372175,0.00001601064,0.0010794373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989376,0.00006177987,0.00023588614,0.00035492005,0.00013893387,0.0002708773],"domain_scores_gemma":[0.99922585,0.00009696884,0.00008118659,0.00041235174,0.00013466662,0.000048961687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022619645,0.00015196949,0.00016735999,0.00014684169,0.00052506063,0.00026767884,0.00081593386,0.00003828886,0.000006435501],"category_scores_gemma":[0.00004173815,0.00014178529,0.00008624278,0.0004894496,0.00007371548,0.00034022095,0.00025473334,0.000121026416,0.0000072331204],"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.00006927716,0.00015125657,0.00058215915,0.00017427739,0.000097131,0.0000037920431,0.00078436115,0.0043720063,0.050029766,0.23631415,0.092387944,0.61503386],"study_design_scores_gemma":[0.00220627,0.000026518574,0.00066496624,0.00026417026,0.00002737657,0.0000058778255,0.00001232141,0.7465131,0.0020394383,0.006879242,0.2408248,0.0005358851],"about_ca_topic_score_codex":0.0000016190626,"about_ca_topic_score_gemma":0.0000017687518,"teacher_disagreement_score":0.7421411,"about_ca_system_score_codex":0.000033350956,"about_ca_system_score_gemma":0.00009355154,"threshold_uncertainty_score":0.57818365},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13814111,0.00020280406,0.83644366,0.013515673,0.00014046286,0.00028470915,0.0000066147504,0.00012205203,0.011142938],"genre_scores_gemma":[0.9961432,0.0000013763583,0.0015440902,0.0015586223,0.00011013223,0.00015256797,0.00001702619,0.000012544249,0.00046040706],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992378,0.000013251761,0.00017636067,0.00024948202,0.000089133144,0.00023398115],"domain_scores_gemma":[0.9996515,0.00001754147,0.00007193604,0.00018910231,0.000032041808,0.000037896214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007716682,0.00012648139,0.0001285197,0.000060620565,0.000216779,0.00011202417,0.00019330923,0.000020527272,0.00006648328],"category_scores_gemma":[0.0000024561994,0.000117798816,0.00006038524,0.00022961498,0.000038473616,0.00009520809,0.000038935763,0.00012438197,0.000060462535],"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.000012026997,0.00017628424,0.0060166954,0.000094127085,0.00006177176,9.749832e-7,0.00023740319,0.00017432106,0.013079767,0.9129837,0.02481235,0.04235054],"study_design_scores_gemma":[0.0012826872,0.000024716583,0.002465545,0.00034125196,0.000109301785,0.0000010717583,0.0005492628,0.11308591,0.003779196,0.71122164,0.16633898,0.0008004361],"about_ca_topic_score_codex":0.000027295491,"about_ca_topic_score_gemma":2.5779522e-7,"teacher_disagreement_score":0.8580021,"about_ca_system_score_codex":0.000012705272,"about_ca_system_score_gemma":0.000060117953,"threshold_uncertainty_score":0.48036963},"labels":[],"label_agreement":null}]}