{"meta":{"query_hash":"04a5b40e35b7","filters":{"topic":"Numerical Methods and Algorithms"},"cohort_total":452,"direct_labels_cover":0,"predictions_cover":452,"exported":452,"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/04a5b40e35b7","api":"https://metacan.xera.ac/api/v1/cohort?topic=Numerical+Methods+and+Algorithms"},"results":[{"id":"W1041293701","doi":"10.1049/iet-cdt.2014.0188","title":"Accuracy‐aware processor customisation for fixed‐point arithmetic","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Latency (audio); Benchmark (surveying); Word (group theory); FLOPS; Microarchitecture; Fixed-point arithmetic; Fixed point; Parallel computing; Computer hardware; Floating point; Computer engineering; Arithmetic; Algorithm; Mathematics","score_opus":0.039268405653066156,"score_gpt":0.3119840696708274,"score_spread":0.27271566401776126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1041293701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05723535,0.0006302336,0.934366,0.00007628865,0.00006682714,0.00009941303,0.00003798784,0.0021740012,0.0053139394],"genre_scores_gemma":[0.61850196,0.00037879808,0.37596735,0.00009379917,0.00004250536,0.00012522399,0.0001721101,0.00046386887,0.0042545227],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993193,0.00010012871,0.00005100315,0.00011447224,0.00034618066,0.000068960086],"domain_scores_gemma":[0.9991516,0.0002551758,0.000115824914,0.00025830397,0.00020474859,0.000014419008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041836474,0.0006647314,0.00031828284,0.00057109626,0.00021875497,0.00050003716,0.0009276156,0.00036510482,0.0024163683],"category_scores_gemma":[0.0018382462,0.00027841295,0.00045280508,0.00052075624,0.00029230578,0.0008136263,0.0005173847,0.0006575916,0.0005359838],"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.00027549113,0.00008531324,0.0016322973,0.00028056916,0.000057771147,0.0001610637,0.00016638447,0.26097342,0.1631131,0.008590626,0.0019247566,0.5627392],"study_design_scores_gemma":[0.000060492002,0.0004323537,0.0018005689,0.00004521258,0.00007262239,0.0004461636,0.00005116899,0.82475656,0.14450552,0.0068248753,0.020956073,0.000048382568],"about_ca_topic_score_codex":0.0007079533,"about_ca_topic_score_gemma":0.001438245,"teacher_disagreement_score":0.0024163683,"about_ca_system_score_codex":0.00040975492,"about_ca_system_score_gemma":0.00047783766,"threshold_uncertainty_score":0.008083582},"labels":[],"label_agreement":null},{"id":"W104575591","doi":"","title":"Can we work around numerical methods? an insight","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Van der Pol oscillator; Oscillation (cell signaling); Resistor; Stability (learning theory); Physics; Relaxation oscillator; Work (physics); Hill differential equation; Mathematics; Differential equation; Computer science; Nonlinear system; Ordinary differential equation; Quantum mechanics; Voltage; Exact differential equation","score_opus":0.1645280250281555,"score_gpt":0.40720624538023387,"score_spread":0.24267822035207837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W104575591","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044774944,0.10939775,0.31823608,0.36042506,0.016016498,0.00013564205,0.00045127928,0.0006547893,0.19020541],"genre_scores_gemma":[0.3387772,0.16157277,0.2670676,0.07925677,0.03718562,0.0013075835,0.00059179816,0.0012237676,0.11301687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99660766,0.001865814,0.00014529485,0.00027852785,0.0009282783,0.0001744982],"domain_scores_gemma":[0.99077725,0.005836878,0.00036475566,0.0011309048,0.0015623551,0.00032790462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006140263,0.0009790937,0.0009994721,0.0018930096,0.0012265817,0.0059824027,0.0024043405,0.0037441612,0.021611078],"category_scores_gemma":[0.023033094,0.00046120034,0.0007732331,0.0014531625,0.00993073,0.011870469,0.0035517714,0.006444294,0.0039965217],"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.0000093102835,0.000016738973,0.00017795849,0.0001578206,0.0000094661555,0.000030713956,0.00030454912,0.00094999897,0.000050322273,0.9549765,0.019344019,0.023972642],"study_design_scores_gemma":[0.0000071651707,0.00001001632,0.00007683687,0.00031125123,0.0000030292115,0.000039994236,0.00012003209,0.002530323,0.000040659248,0.9145105,0.08234036,0.000009798635],"about_ca_topic_score_codex":0.0019017074,"about_ca_topic_score_gemma":0.0011493334,"teacher_disagreement_score":0.021611078,"about_ca_system_score_codex":0.002121834,"about_ca_system_score_gemma":0.0022445684,"threshold_uncertainty_score":0.0722962},"labels":[],"label_agreement":null},{"id":"W121426693","doi":"","title":"Closest Approximations to Real Numbers.","year":2005,"lang":"en","type":"article","venue":"Ars Combinatoria","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Approximations of π; Applied mathematics","score_opus":0.016039097992457063,"score_gpt":0.28864665079401153,"score_spread":0.27260755280155446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W121426693","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059619397,0.0038394276,0.9539614,0.0009943148,0.0014625556,0.000052573974,0.00028639217,0.00057392573,0.032867618],"genre_scores_gemma":[0.23411478,0.0060500004,0.7094604,0.00096839375,0.0013146495,0.00032736742,0.0011647415,0.0010982924,0.045501363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99518037,0.0019318933,0.00033005927,0.0006887934,0.0016380418,0.0002309758],"domain_scores_gemma":[0.989012,0.0052985516,0.0007813624,0.0032329345,0.0012890113,0.00038623106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002995975,0.0012049386,0.00152851,0.0032513833,0.0013888619,0.0051176194,0.0021667639,0.0021417863,0.018659571],"category_scores_gemma":[0.05140623,0.00071723614,0.0010689823,0.003254709,0.0026363565,0.005997512,0.004760174,0.0048830765,0.009301202],"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.00021329895,0.000052999603,0.0005833107,0.00034075213,0.00008054422,0.00008317867,0.00028189115,0.038715336,0.0009546205,0.80188,0.019957189,0.13685693],"study_design_scores_gemma":[0.000029427913,0.00003807899,0.0001654505,0.00016605672,0.000022640546,0.00017198289,0.00014026772,0.090039626,0.0011179989,0.855982,0.052101545,0.000025013664],"about_ca_topic_score_codex":0.0014096999,"about_ca_topic_score_gemma":0.0020807497,"teacher_disagreement_score":0.018659571,"about_ca_system_score_codex":0.0016339102,"about_ca_system_score_gemma":0.0012316393,"threshold_uncertainty_score":0.062422454},"labels":[],"label_agreement":null},{"id":"W126608498","doi":"","title":"Concurrent programming and composite Newton methods","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Saskatchewan","funders":"","keywords":"Newton's method; Convergence (economics); A priori and a posteriori; Local convergence; Computer science; Steffensen's method; Newton's method in optimization; Mathematical optimization; Nonlinear system; Newton fractal; Algebraic equation; Mathematics; Applied mathematics; Algorithm; Iterative method","score_opus":0.05110804598128221,"score_gpt":0.36767481350249875,"score_spread":0.31656676752121654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W126608498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051168078,0.00058772956,0.9854826,0.00016353223,0.00010355619,0.000073966636,0.00002641462,0.000611384,0.007834028],"genre_scores_gemma":[0.19882742,0.0011982669,0.7901382,0.00012689551,0.00015577186,0.00041091334,0.000086711516,0.0003966571,0.008659124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804413,0.00045625045,0.000085361935,0.0002795258,0.00096994464,0.00016489286],"domain_scores_gemma":[0.9963052,0.0018989055,0.00027936973,0.0005370638,0.00078200473,0.00019748374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014945704,0.0009927606,0.00069222064,0.00061595073,0.0010291924,0.00196661,0.0018105488,0.00084108487,0.0050745523],"category_scores_gemma":[0.006302498,0.00064992177,0.0008349029,0.0010871206,0.0016359907,0.0017426901,0.0023308683,0.0020216058,0.0010097043],"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.00043594753,0.00018091222,0.0022061004,0.0006863442,0.000108947694,0.00034157222,0.00086070184,0.28859195,0.012565899,0.38471487,0.0062941266,0.30301267],"study_design_scores_gemma":[0.00011848691,0.00011535361,0.0003003469,0.00007702564,0.0000478692,0.00029657412,0.00009057559,0.79845995,0.0085236775,0.14758489,0.04434437,0.000040939154],"about_ca_topic_score_codex":0.0029548712,"about_ca_topic_score_gemma":0.003008465,"teacher_disagreement_score":0.0050745523,"about_ca_system_score_codex":0.00076039304,"about_ca_system_score_gemma":0.0022412369,"threshold_uncertainty_score":0.016976118},"labels":[],"label_agreement":null},{"id":"W132978406","doi":"","title":"A computational approach to custom data representation for hardware accelerators","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"McMaster University","funders":"","keywords":"Computer science; Robustness (evolution); Scalability; Satisfiability modulo theories; Floating point; Double-precision floating-point format; Computation; Computer engineering; Algorithm; Theoretical computer science; Parallel computing; Computational science","score_opus":0.11271036209771411,"score_gpt":0.3820106181041404,"score_spread":0.26930025600642626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W132978406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004874054,0.000063066705,0.9912178,0.00030433162,0.0000456156,0.000057389047,0.000043973017,0.00031103767,0.003082795],"genre_scores_gemma":[0.09863357,0.0001751296,0.89760643,0.00015562584,0.000075345924,0.00025655844,0.00023690875,0.00022788941,0.0026325062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996684,0.00082451274,0.00025717824,0.00034819814,0.001575077,0.00031086148],"domain_scores_gemma":[0.9943658,0.0026826093,0.00041646612,0.001731657,0.00068528566,0.00011826302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035241635,0.00095151935,0.00089919014,0.0013714731,0.0011346159,0.0034715284,0.0031730072,0.0013282867,0.006175017],"category_scores_gemma":[0.011741646,0.0009103357,0.0021616975,0.0016007059,0.0028963345,0.0059179263,0.003959206,0.0038254177,0.0007664794],"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.00006837592,0.000061148385,0.000408263,0.0001858581,0.000028780101,0.000118110205,0.00017298984,0.17610207,0.0034022816,0.7645504,0.0035719161,0.05132977],"study_design_scores_gemma":[0.000023689638,0.000028000077,0.00004999443,0.000041847026,0.000012549128,0.00006949609,0.00005852269,0.6949969,0.0042205174,0.29105553,0.009423654,0.00001940417],"about_ca_topic_score_codex":0.0014697745,"about_ca_topic_score_gemma":0.0024818054,"teacher_disagreement_score":0.006175017,"about_ca_system_score_codex":0.0017758176,"about_ca_system_score_gemma":0.0026163408,"threshold_uncertainty_score":0.02065748},"labels":[],"label_agreement":null},{"id":"W138020119","doi":"","title":"Taking architecture and compiler into account in formal proofs of numerical programs","year":2012,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Compiler; Computer science; Mathematical proof; Computation; Programming language; Parallel computing; Code (set theory); Architecture; Rounding; Optimizing compiler; Point (geometry); Floating point; Compiler correctness; Set (abstract data type); Mathematics; Operating system","score_opus":0.020483212949000337,"score_gpt":0.2664808879839192,"score_spread":0.24599767503491887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W138020119","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065991143,0.00065030035,0.9869702,0.0007145756,0.0001712917,0.000048917347,0.000049015413,0.00074309454,0.004053448],"genre_scores_gemma":[0.19357707,0.001974412,0.7953684,0.00062401424,0.00033208108,0.00026434034,0.00016368652,0.0011114306,0.006584571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99095553,0.004419861,0.000811799,0.0010317112,0.002145527,0.0006356401],"domain_scores_gemma":[0.9721672,0.018883538,0.0015684488,0.0045888075,0.0025747044,0.0002172012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007102751,0.0010001184,0.00072473637,0.0013046943,0.0015806622,0.0038315735,0.0019343613,0.0018548011,0.004173008],"category_scores_gemma":[0.033484597,0.0015554405,0.002295996,0.0012702491,0.0050296835,0.00789598,0.0033295474,0.0036840318,0.0012935787],"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.00008792933,0.000031073465,0.0008356262,0.0007063711,0.00005333855,0.00037457547,0.0010811992,0.029088886,0.007936526,0.90160763,0.0015643834,0.056632463],"study_design_scores_gemma":[0.00007857011,0.00020979541,0.0007964212,0.0006016644,0.00019422233,0.0007692969,0.0003674442,0.09718401,0.032900866,0.79469454,0.07207705,0.00012603046],"about_ca_topic_score_codex":0.0017675093,"about_ca_topic_score_gemma":0.002630544,"teacher_disagreement_score":0.007102751,"about_ca_system_score_codex":0.0018324171,"about_ca_system_score_gemma":0.0033806937,"threshold_uncertainty_score":0.037563443},"labels":[],"label_agreement":null},{"id":"W1451216173","doi":"10.1016/j.csda.2015.07.015","title":"Fast and accurate computation for kernel estimators","year":2015,"lang":"en","type":"article","venue":"Computational Statistics & Data Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Humanities and Social Science Fund of Ministry of Education of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Estimator; Univariate; Computation; Algorithm; Kernel (algebra); Grid; Computational complexity theory; Kernel density estimation; Computer science; Multivariate statistics; Mathematics; Computational statistics; Polynomial; Mathematical optimization; Statistics","score_opus":0.1105769333221848,"score_gpt":0.394072255127822,"score_spread":0.2834953218056372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1451216173","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017476537,0.0001471575,0.99688643,0.000081868864,0.000044415032,0.000017562608,0.00003011928,0.00075365306,0.00029112108],"genre_scores_gemma":[0.092205696,0.00038803293,0.9027654,0.000095022035,0.000114964605,0.00016395694,0.0003063468,0.00076596456,0.0031945047],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972652,0.0007933897,0.00022924488,0.0003078203,0.0012212648,0.00018309166],"domain_scores_gemma":[0.9858445,0.007328105,0.0006720191,0.0030939218,0.0026923455,0.00036922353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002969506,0.0012300776,0.0013928297,0.0015515345,0.0007931745,0.002306638,0.0019026725,0.0015355832,0.0065762256],"category_scores_gemma":[0.038468864,0.00088821317,0.00089031534,0.0016890711,0.0009397854,0.0039443877,0.002970993,0.0033526404,0.0052223946],"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.0005248442,0.00017106898,0.0018459266,0.00048317565,0.00016092743,0.00025464204,0.00034777835,0.18019852,0.019391173,0.1327845,0.015365561,0.64847183],"study_design_scores_gemma":[0.0000495061,0.000035339373,0.00048163295,0.000032612246,0.000025532378,0.00018119633,0.00004794549,0.9057335,0.008356849,0.07882947,0.0061926167,0.00003376493],"about_ca_topic_score_codex":0.003022666,"about_ca_topic_score_gemma":0.003845321,"teacher_disagreement_score":0.0065762256,"about_ca_system_score_codex":0.0008688433,"about_ca_system_score_gemma":0.0024477479,"threshold_uncertainty_score":0.021999717},"labels":[],"label_agreement":null},{"id":"W1480546160","doi":"10.1109/iscas.2004.1329390","title":"A programmable base 2D-LNS MAC with self-generated look-up tables","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Dram; Computer science; Adder; Binary number; Accumulator (cryptography); Lookup table; Logarithm; Parallel computing; Binary data; Computer hardware; Reduction (mathematics); Computational science; Algorithm; Arithmetic; Mathematics; Latency (audio); Operating system","score_opus":0.015827535200085223,"score_gpt":0.25248664727104575,"score_spread":0.23665911207096052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1480546160","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17796189,0.0033193969,0.75428003,0.0006437469,0.0009097086,0.00030075962,0.00081599655,0.01696991,0.04479844],"genre_scores_gemma":[0.6104676,0.00068095466,0.36146656,0.00051935826,0.00032047334,0.00020356738,0.0007312432,0.00022170616,0.02538855],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972135,0.000037126916,0.000027138396,0.00006475437,0.00011893389,0.00003067579],"domain_scores_gemma":[0.99972516,0.000047871446,0.000036951464,0.0000840477,0.00008287703,0.000023092407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020753157,0.00039771627,0.00042368134,0.0006784051,0.00042894544,0.0012902662,0.0018895512,0.00028009104,0.008396791],"category_scores_gemma":[0.0004608545,0.00027464758,0.00028905366,0.00069248496,0.0003560216,0.0013800018,0.0007408681,0.00038644433,0.002591232],"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.0014714119,0.00019514571,0.0028889584,0.0008670136,0.00014083042,0.0011484071,0.00040456152,0.020607885,0.35422507,0.090922035,0.021871371,0.5052573],"study_design_scores_gemma":[0.00033180322,0.001994944,0.002011337,0.00015747004,0.00021993941,0.0029643879,0.00012603129,0.2489944,0.44970736,0.014241733,0.27902213,0.00022852051],"about_ca_topic_score_codex":0.00070237217,"about_ca_topic_score_gemma":0.0013159623,"teacher_disagreement_score":0.008396791,"about_ca_system_score_codex":0.00062529213,"about_ca_system_score_gemma":0.0006279872,"threshold_uncertainty_score":0.02809012},"labels":[],"label_agreement":null},{"id":"W1485745802","doi":"10.1049/iet-cds.2009.0329","title":"High-speed and low-power reconfigurable architectures of 2-digit two-dimensional logarithmic number system-based recursive multipliers","year":2010,"lang":"en","type":"article","venue":"IET Circuits Devices & Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Multiplication (music); Adder; Digital signal processing; Logarithm; Parallel computing; Matrix multiplication; Computer hardware; Mathematics","score_opus":0.009249921569249768,"score_gpt":0.24774499775730793,"score_spread":0.23849507618805815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485745802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23518057,0.0013267903,0.726876,0.00041471317,0.00030523032,0.00013313793,0.00011558954,0.0025696047,0.033078365],"genre_scores_gemma":[0.6604709,0.0003900756,0.32553917,0.00013771367,0.000068916255,0.000089997826,0.00014324668,0.00007631616,0.013083662],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998847,0.000025844503,0.0000093713525,0.000023751514,0.000040941286,0.000015360127],"domain_scores_gemma":[0.99985456,0.000036060756,0.000020939466,0.000038391237,0.000038450155,0.000011480513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014395769,0.00030935038,0.00019272944,0.00041950453,0.00026160726,0.0006230343,0.0005665241,0.00026930167,0.0037418797],"category_scores_gemma":[0.0005457212,0.00017176257,0.0002094493,0.00040658936,0.00020113261,0.0006379204,0.0002729745,0.00028844716,0.0011633061],"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.0007486101,0.00013423324,0.0014759675,0.00021856841,0.00004614638,0.00057851797,0.0003296045,0.03511775,0.334204,0.06583857,0.004568135,0.55674],"study_design_scores_gemma":[0.00027856536,0.0013563841,0.003640494,0.0000781579,0.000070289636,0.001803912,0.00011452335,0.56250435,0.31065032,0.025347775,0.09403679,0.000118420656],"about_ca_topic_score_codex":0.0003668736,"about_ca_topic_score_gemma":0.00096271455,"teacher_disagreement_score":0.0037418797,"about_ca_system_score_codex":0.0002818661,"about_ca_system_score_gemma":0.00026529757,"threshold_uncertainty_score":0.0125178695},"labels":[],"label_agreement":null},{"id":"W1502108548","doi":"10.48550/arxiv.1307.4097","title":"Some notes on applying computational divided differencing in optimization","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; U.S. Air Force","keywords":"Computation; Automatic differentiation; Transformation (genetics); Floating point; Point (geometry); Computer science; Algorithm; Mathematics; Finite difference; Constant (computer programming); Computational complexity theory; Program transformation; Theoretical computer science; Geometry; Mathematical analysis; Programming language","score_opus":0.09345625186291007,"score_gpt":0.21820476796161686,"score_spread":0.1247485160987068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1502108548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008528469,0.01616831,0.867525,0.018671751,0.0041642245,0.00009774543,0.00019735614,0.0007377133,0.08390943],"genre_scores_gemma":[0.23346002,0.02092907,0.6728857,0.012656689,0.0066351253,0.00046100665,0.00037835148,0.0020995985,0.050494354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984158,0.0006647911,0.00009462243,0.00016610888,0.00057755294,0.00008107584],"domain_scores_gemma":[0.99752456,0.001685766,0.00008754981,0.00037990898,0.00025096373,0.00007135487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033388948,0.0012725851,0.0010689405,0.0010238122,0.0009594543,0.0014269127,0.001966745,0.001320487,0.0060404604],"category_scores_gemma":[0.008029082,0.00044213102,0.0018894784,0.0016474937,0.004931958,0.0031909116,0.002514264,0.005572403,0.0014139282],"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.000086600856,0.000052136256,0.00033208585,0.00036550703,0.000046439807,0.00019235902,0.00021160218,0.04234375,0.0015468934,0.883561,0.014838654,0.056422982],"study_design_scores_gemma":[0.000034816283,0.00006224843,0.00037482506,0.00015259544,0.000018773595,0.00008459119,0.000049335158,0.100760676,0.0021226995,0.8334585,0.06283242,0.000048520702],"about_ca_topic_score_codex":0.004254989,"about_ca_topic_score_gemma":0.0027611258,"teacher_disagreement_score":0.0060404604,"about_ca_system_score_codex":0.0019812002,"about_ca_system_score_gemma":0.0010277276,"threshold_uncertainty_score":0.020207345},"labels":[],"label_agreement":null},{"id":"W1509016053","doi":"10.1007/11512622_17","title":"CORDIC-Augmented Sandbridge Processor for Channel Equalization","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Channel (broadcasting); Set (abstract data type); Equalization (audio); Orthogonal frequency-division multiplexing; Scheme (mathematics); Multiplexing; Parallel computing; Computer hardware; Instruction set; Rotation (mathematics); Arithmetic; Field-programmable gate array; Telecommunications; Mathematics; Programming language; Artificial intelligence","score_opus":0.032232120048418786,"score_gpt":0.3016480154376967,"score_spread":0.2694158953892779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509016053","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021235177,0.00066141796,0.94624346,0.00023883708,0.00044614004,0.00007865067,0.00015143697,0.004688946,0.02625594],"genre_scores_gemma":[0.32468185,0.0007899567,0.5895576,0.00067072874,0.00035205024,0.00012882942,0.000676906,0.00029396333,0.082848206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998852,0.000021574757,0.0000065193412,0.000017133087,0.000051533076,0.000018069377],"domain_scores_gemma":[0.9998423,0.000026694805,0.000008123757,0.000044699504,0.00006752932,0.000010565177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015172803,0.00047928604,0.0003856886,0.00029977036,0.00040217035,0.00062142126,0.0006247507,0.000556521,0.02223087],"category_scores_gemma":[0.0004679588,0.00014981127,0.0001963505,0.00042820827,0.00020133753,0.0005896897,0.0005623555,0.0005798485,0.004979507],"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.00076372386,0.00013067744,0.0004609458,0.00019349283,0.00006132121,0.00029757607,0.00010053087,0.023716934,0.108440086,0.039990567,0.027463648,0.79838043],"study_design_scores_gemma":[0.00015347908,0.00064157124,0.0009361293,0.00011161762,0.00014165662,0.001368693,0.00007913803,0.685765,0.17642291,0.021383537,0.11293243,0.00006390483],"about_ca_topic_score_codex":0.0009827745,"about_ca_topic_score_gemma":0.004023592,"teacher_disagreement_score":0.02223087,"about_ca_system_score_codex":0.0002735964,"about_ca_system_score_gemma":0.0006559748,"threshold_uncertainty_score":0.07436967},"labels":[],"label_agreement":null},{"id":"W1509427512","doi":"10.1007/978-3-540-30494-4_4","title":"A Methodology for the Formal Verification of FFT Algorithms in HOL","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fast Fourier transform; Mathematical proof; Computer science; Algorithm; Automated theorem proving; Split-radix FFT algorithm; Fixed point; Proof assistant; Formal verification; Arithmetic; Mathematics; Theoretical computer science; Programming language; Fourier transform; Fourier analysis","score_opus":0.0689537982563607,"score_gpt":0.3314530027488482,"score_spread":0.26249920449248754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1509427512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001649202,0.00009163002,0.9934269,0.00014832578,0.0000790221,0.000069726324,0.0000671135,0.0015377259,0.0029303422],"genre_scores_gemma":[0.17577696,0.0004510742,0.8138077,0.0004085271,0.00025233423,0.00044730297,0.00048203886,0.0016917685,0.0066822576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950912,0.0015882322,0.0005957189,0.0006156506,0.0016281481,0.00048104822],"domain_scores_gemma":[0.98776346,0.0073016877,0.00041429294,0.0030273343,0.0013060054,0.0001872723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005324659,0.0012104784,0.0011488484,0.0016855603,0.001852555,0.0040985686,0.0039247544,0.0016195617,0.01244674],"category_scores_gemma":[0.017896833,0.0012916063,0.0031513253,0.0010920491,0.005515294,0.007975622,0.0050054016,0.004460242,0.002647024],"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.000088338646,0.000086874585,0.0004358354,0.00036643157,0.000057280085,0.00021922006,0.0006008125,0.012738417,0.0043306155,0.9104606,0.0036576628,0.0669579],"study_design_scores_gemma":[0.000082124774,0.000069282476,0.00020198867,0.00016459585,0.00008019206,0.00023462872,0.00014553014,0.07381945,0.01365356,0.8828569,0.028628709,0.000063047526],"about_ca_topic_score_codex":0.0026304764,"about_ca_topic_score_gemma":0.002499582,"teacher_disagreement_score":0.01244674,"about_ca_system_score_codex":0.0016904789,"about_ca_system_score_gemma":0.0022965174,"threshold_uncertainty_score":0.041638494},"labels":[],"label_agreement":null},{"id":"W1519061151","doi":"","title":"Oscillator verification with probability one","year":2012,"lang":"en","type":"article","venue":"Formal Methods in Computer-Aided Design","topic":"Numerical Methods and Algorithms","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":"University of British Columbia","funders":"","keywords":"Soundness; Generalization; Computer science; Differential (mechanical device); Formal verification; Ring oscillator; Runtime verification; Task (project management); Ring (chemistry); Control theory (sociology); Theoretical computer science; Algorithm; Electronic engineering; Mathematics; Engineering; Programming language; Artificial intelligence","score_opus":0.1107677508075074,"score_gpt":0.356863359922196,"score_spread":0.24609560911468858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519061151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008714426,0.00012328592,0.9835984,0.00061735336,0.00012409064,0.00007593296,0.00012103588,0.0013882638,0.0052372366],"genre_scores_gemma":[0.71713424,0.00034737075,0.27429458,0.0008113808,0.00029400532,0.00033732798,0.0003596681,0.0006422518,0.00577915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9860453,0.0034228296,0.0007772157,0.0026224179,0.0060516493,0.0010806385],"domain_scores_gemma":[0.95654655,0.03162896,0.0014665219,0.0063847923,0.003489885,0.00048336986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076176194,0.0010781547,0.0013207394,0.0012450123,0.0012194308,0.0030382553,0.0022274314,0.0014658532,0.007384571],"category_scores_gemma":[0.04491127,0.00074310286,0.0030732097,0.0007175998,0.005658237,0.006288504,0.0046379305,0.0045216465,0.0018622075],"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.00045339044,0.0001329038,0.0014603346,0.00032701864,0.00009928873,0.0005230305,0.00035058294,0.063085005,0.0064003547,0.87537324,0.0030179813,0.048776817],"study_design_scores_gemma":[0.0001676513,0.00012141697,0.00013404073,0.00006319752,0.00006268454,0.00017608202,0.000033438482,0.30159414,0.014839085,0.6772751,0.005477433,0.00005568594],"about_ca_topic_score_codex":0.0014317163,"about_ca_topic_score_gemma":0.0010727446,"teacher_disagreement_score":0.0076176194,"about_ca_system_score_codex":0.0017999336,"about_ca_system_score_gemma":0.003610791,"threshold_uncertainty_score":0.040286303},"labels":[],"label_agreement":null},{"id":"W1519484178","doi":"10.1109/acssc.1999.831901","title":"VLSI improvements in a binary multiplier based on analog digits","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Nortel (Canada)","funders":"","keywords":"Adder; Multiplier (economics); Analog multiplier; Binary number; Computer science; CMOS; Very-large-scale integration; Electronic circuit; Arithmetic; Numerical digit; Electronic engineering; Integrated injection logic; Digital electronics; Computer hardware; Mathematics; Digital signal processing; Electrical engineering; Analog signal; Engineering; Pass transistor logic; Embedded system","score_opus":0.01807006003973717,"score_gpt":0.2774211084397337,"score_spread":0.25935104839999656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519484178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095470354,0.007173259,0.83091015,0.0013312962,0.001202656,0.0001705284,0.00014842804,0.0028281077,0.060765207],"genre_scores_gemma":[0.26183957,0.0025936847,0.7087709,0.00046779806,0.00043460654,0.000080339676,0.0002065082,0.00010400495,0.025502622],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99960846,0.00006519156,0.000031651707,0.000055873938,0.00020749573,0.000031284926],"domain_scores_gemma":[0.9993649,0.00018012238,0.00004316296,0.00010329855,0.0002838564,0.00002459919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006027972,0.00048206974,0.0002475454,0.000742058,0.00033168853,0.0008799805,0.00090158585,0.0005344078,0.007399256],"category_scores_gemma":[0.0025140413,0.00028832923,0.0003457786,0.0006445668,0.00028211044,0.0013859326,0.0005599719,0.0005330454,0.001977438],"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.0005445343,0.00018208384,0.0014769546,0.00042140877,0.00006186559,0.00030900748,0.00015852806,0.0131135,0.17312801,0.1595042,0.007826979,0.6432729],"study_design_scores_gemma":[0.000397182,0.0026129026,0.0032578039,0.00030515358,0.00036846235,0.004638184,0.00013074533,0.29934403,0.25315237,0.04666215,0.3889967,0.00013429466],"about_ca_topic_score_codex":0.000511138,"about_ca_topic_score_gemma":0.0008869075,"teacher_disagreement_score":0.007399256,"about_ca_system_score_codex":0.00043205224,"about_ca_system_score_gemma":0.0005298066,"threshold_uncertainty_score":0.024752975},"labels":[],"label_agreement":null},{"id":"W1519677650","doi":"10.1090/s0002-9939-04-07511-2","title":"A complete system of orthogonal step functions","year":2004,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Los Alamos National Laboratory; University of Alberta; University of Calgary","keywords":"Orthonormal basis; Almost everywhere; Fourier series; Function (biology); Walsh function; Mathematics; Orthogonal functions; Fourier transform; Series (stratigraphy); Interval (graph theory); Pure mathematics; Orthonormality; Mathematical analysis; Combinatorics; Physics","score_opus":0.018348357565856063,"score_gpt":0.2568266300334677,"score_spread":0.2384782724676116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1519677650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011822234,0.00041255952,0.9257948,0.00043290804,0.0006911754,0.00011956303,0.0010653372,0.00083436415,0.05882706],"genre_scores_gemma":[0.24969038,0.0014088725,0.6013062,0.001091059,0.00085411535,0.0007474221,0.004156725,0.002694655,0.13805059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99749386,0.0005090432,0.00016184404,0.0005013516,0.0008966551,0.0004372178],"domain_scores_gemma":[0.99858606,0.00016005304,0.00008391936,0.00026691883,0.00075500563,0.00014813658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016445082,0.0012615108,0.0009757376,0.0021649871,0.0013975957,0.0030859534,0.0016135804,0.0012182153,0.04341431],"category_scores_gemma":[0.0034298485,0.0006863572,0.0012114581,0.0013247405,0.0015024465,0.003272931,0.0030254694,0.0025497214,0.026474118],"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.000042926928,0.000049261045,0.00021177488,0.0001119543,0.000023337163,0.00012240352,0.0001469114,0.002408196,0.005023613,0.9202948,0.017491618,0.054073144],"study_design_scores_gemma":[0.00004467718,0.000121060104,0.0006480526,0.000072296905,0.000026468333,0.00045652196,0.00019574506,0.038861934,0.009354011,0.8251931,0.124906816,0.000119246],"about_ca_topic_score_codex":0.0011786507,"about_ca_topic_score_gemma":0.0011306556,"teacher_disagreement_score":0.04341431,"about_ca_system_score_codex":0.0009785966,"about_ca_system_score_gemma":0.0014975165,"threshold_uncertainty_score":0.14523536},"labels":[],"label_agreement":null},{"id":"W1523308008","doi":"10.48550/arxiv.1308.3399","title":"A rapid and highly accurate approximation for the error function of complex argument","year":2013,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Error function; Exponential function; Function (biology); Approximation error; Simple (philosophy); Decimal; Sigma; Representation (politics); Function approximation; Algorithm; Error analysis; Mathematics; Applied mathematics; Argument (complex analysis); Computer science; Mathematical analysis; Arithmetic; Artificial intelligence; Artificial neural network; Physics","score_opus":0.12545232923082095,"score_gpt":0.31987030420964885,"score_spread":0.1944179749788279,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1523308008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025902702,0.00013640753,0.99431396,0.000074628915,0.00009792214,0.000018951527,0.0000361784,0.00035821984,0.0023735475],"genre_scores_gemma":[0.099526756,0.00048575358,0.8898371,0.00014123488,0.00009294894,0.00013704003,0.00023090125,0.00059033284,0.008957855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994579,0.00009601997,0.00002463665,0.00005238999,0.00031899882,0.000050087558],"domain_scores_gemma":[0.9990644,0.00037010724,0.00006929125,0.00020814959,0.00025245332,0.000035578796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009311492,0.0009630917,0.00053830363,0.0007657636,0.00037634233,0.0009547448,0.0012567837,0.0010770208,0.005232253],"category_scores_gemma":[0.004447267,0.0002785895,0.00052126497,0.0006107314,0.0006004617,0.0011830307,0.0011850625,0.0014534066,0.004078882],"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.00030538416,0.00013733521,0.0011240966,0.000534863,0.00007120381,0.00049242645,0.0002925638,0.24749857,0.07002686,0.36857715,0.014123895,0.29681563],"study_design_scores_gemma":[0.000022118453,0.000055540226,0.00017226009,0.000051412186,0.000012774202,0.00038338988,0.000021004234,0.9304203,0.02330574,0.032169495,0.013350081,0.00003599755],"about_ca_topic_score_codex":0.00069761975,"about_ca_topic_score_gemma":0.0008330378,"teacher_disagreement_score":0.005232253,"about_ca_system_score_codex":0.00036306636,"about_ca_system_score_gemma":0.0006352115,"threshold_uncertainty_score":0.01750362},"labels":[],"label_agreement":null},{"id":"W1527731312","doi":"10.1109/cicc.2003.1249404","title":"Low power direct digital frequency synthesizers in 0.18 μm CMOS","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"dBc; CMOS; Direct digital synthesizer; Spurious-free dynamic range; 8-bit; Electronic engineering; Accumulator (cryptography); Frequency divider; Electrical engineering; Low-power electronics; Frequency synthesizer; Computer science; Physics; Power (physics); Phase noise; Phase-locked loop; Engineering; Power consumption","score_opus":0.012292665460283158,"score_gpt":0.25548893174215187,"score_spread":0.24319626628186872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527731312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16377142,0.0019575995,0.7857254,0.00058757956,0.00027547678,0.00075619016,0.0007028645,0.019125873,0.027097572],"genre_scores_gemma":[0.3805317,0.00041877074,0.6022957,0.00017744437,0.00007605616,0.00025637445,0.00026116683,0.00030333915,0.015679417],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939585,0.000060734106,0.00004678466,0.00012725251,0.00031314458,0.00005619253],"domain_scores_gemma":[0.9993204,0.00022978852,0.0001606937,0.000093621195,0.0001656183,0.00002997157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045895405,0.00055501686,0.00045897023,0.00042140333,0.0002657659,0.0007154134,0.0007830592,0.0003572881,0.006421695],"category_scores_gemma":[0.001630992,0.00030256005,0.00019296941,0.00035695347,0.0002641414,0.0006337355,0.00030572937,0.0004865749,0.0023071186],"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.00030049036,0.00010199012,0.001308143,0.0005582336,0.000044038097,0.00032844537,0.00040917555,0.0053772093,0.71531636,0.008369987,0.0043067955,0.2635791],"study_design_scores_gemma":[0.00024682906,0.0007740294,0.0015133256,0.00005350652,0.00007119682,0.0008752436,0.000085372645,0.028067626,0.9035934,0.0017595092,0.062915325,0.000044658307],"about_ca_topic_score_codex":0.0006924543,"about_ca_topic_score_gemma":0.0016547124,"teacher_disagreement_score":0.006421695,"about_ca_system_score_codex":0.00059538946,"about_ca_system_score_gemma":0.00042125495,"threshold_uncertainty_score":0.021482706},"labels":[],"label_agreement":null},{"id":"W1530378642","doi":"10.1002/3527600434.eap407","title":"Scientific Computing by Numerical Methods","year":2003,"lang":"en","type":"other","venue":"digital Encyclopedia of Applied Physics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Library science; Encyclopedia; Citation; Computer science; Media studies; Sociology","score_opus":0.01092870287517194,"score_gpt":0.2815704553938861,"score_spread":0.27064175251871414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1530378642","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009063086,0.025416108,0.26924655,0.004182472,0.010338092,0.00033816206,0.0013991013,0.004686414,0.6834868],"genre_scores_gemma":[0.026119886,0.047694877,0.28206867,0.0022854337,0.0064609493,0.0013864904,0.0027487352,0.004094362,0.6271407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998024,0.0003721081,0.00013567647,0.0002576033,0.001145176,0.00006553451],"domain_scores_gemma":[0.9981845,0.00063022214,0.00008235418,0.0006023985,0.00038161222,0.00011889259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014563986,0.002163173,0.003422769,0.0033941967,0.0012029588,0.0065944996,0.0018207672,0.001828311,0.10216318],"category_scores_gemma":[0.005582942,0.00081300974,0.0012489941,0.0049577337,0.0027101443,0.0043577063,0.0035982034,0.004754575,0.085407004],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023730874,0.000042400017,0.0001281133,0.0010049732,0.00005188527,0.000054499014,0.00011360486,0.0024604485,0.001005512,0.5191562,0.23985788,0.23610078],"study_design_scores_gemma":[0.000027406606,0.0000139168615,0.0001560275,0.00032482427,0.000027688864,0.00016092078,0.000016569638,0.009487611,0.00075244356,0.29856744,0.69044393,0.00002126322],"about_ca_topic_score_codex":0.0007628887,"about_ca_topic_score_gemma":0.00091757486,"teacher_disagreement_score":0.10216318,"about_ca_system_score_codex":0.0013259376,"about_ca_system_score_gemma":0.0019781422,"threshold_uncertainty_score":0.34176987},"labels":[],"label_agreement":null},{"id":"W1535381111","doi":"10.1109/iscas.2002.1010569","title":"An FPGA implementation of an on-line radix-4 CORDIC 2-D IDCT core","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Concordia University","funders":"","keywords":"CORDIC; Field-programmable gate array; Computer science; Virtex; Arithmetic; Parallel computing; Computer hardware; Adder; Mathematics; Latency (audio)","score_opus":0.06419104697258005,"score_gpt":0.4020890741059348,"score_spread":0.33789802713335476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535381111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105833896,0.00079074415,0.8674073,0.0002089669,0.0004023055,0.00030524668,0.00025958873,0.004898479,0.01989345],"genre_scores_gemma":[0.44041872,0.00029529782,0.5502622,0.00023259125,0.00006647475,0.000100209654,0.00043065063,0.00010024951,0.008093638],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998981,0.000015078531,0.0000073775773,0.00001752533,0.000045556895,0.00001638141],"domain_scores_gemma":[0.99987304,0.000022039514,0.000013001875,0.000026284606,0.00005399761,0.000011621176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012693417,0.0003534674,0.00022942969,0.0003741807,0.00015085771,0.00040100256,0.0006505198,0.000281901,0.003991277],"category_scores_gemma":[0.0002761284,0.00016194957,0.0001653359,0.00025831902,0.00012055258,0.0003137959,0.00014832689,0.00024483434,0.001133237],"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.00092745695,0.00015512803,0.0032046358,0.00046859935,0.00010453492,0.0010054555,0.00014526419,0.031344272,0.35912552,0.012183432,0.009854949,0.5814807],"study_design_scores_gemma":[0.00036213882,0.0018469036,0.006974084,0.00011962314,0.00014650582,0.0040258146,0.00007407614,0.45282322,0.44476804,0.0021190653,0.086654514,0.00008597745],"about_ca_topic_score_codex":0.00088707526,"about_ca_topic_score_gemma":0.0017274874,"teacher_disagreement_score":0.003991277,"about_ca_system_score_codex":0.00034271335,"about_ca_system_score_gemma":0.00047246562,"threshold_uncertainty_score":0.013352156},"labels":[],"label_agreement":null},{"id":"W1549231341","doi":"10.1109/ccece.1996.548100","title":"New algorithms for the exact computation of the sign of algebraic expressions","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Calgary","funders":"","keywords":"Algorithm; Sign (mathematics); Floating point; Computation; Algebraic number; Mathematics; Algebraic operation; Upper and lower bounds; Computer science","score_opus":0.060792240446100924,"score_gpt":0.308761417173449,"score_spread":0.24796917672734808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1549231341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011006793,0.00009231281,0.9978142,0.00003507918,0.000061923245,0.000023640068,0.000018910305,0.00034210182,0.0005111605],"genre_scores_gemma":[0.01610861,0.0002074549,0.9819535,0.000050340917,0.00007900171,0.00012916276,0.0001223908,0.00017379655,0.0011756809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980192,0.000368468,0.00023904478,0.00027468344,0.0009965653,0.00010210181],"domain_scores_gemma":[0.99610704,0.0017023236,0.00035562314,0.00058031105,0.0011561721,0.000098484175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016745677,0.0012442921,0.0011076201,0.0018599745,0.0006548264,0.002269826,0.002019279,0.001107415,0.0043208217],"category_scores_gemma":[0.010913744,0.00074635324,0.0011777793,0.002065767,0.0015358551,0.0044579557,0.0021557002,0.0028987427,0.0022053763],"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.00025150884,0.000084492814,0.0008592612,0.00047718413,0.00009109724,0.00015442463,0.00027515466,0.07699794,0.022281732,0.22169526,0.0069185975,0.66991335],"study_design_scores_gemma":[0.00011447481,0.00013418197,0.00032661742,0.00010745465,0.000044259657,0.00037305095,0.00007105828,0.8229711,0.021052936,0.12888846,0.02583948,0.00007692265],"about_ca_topic_score_codex":0.0006080991,"about_ca_topic_score_gemma":0.00059351267,"teacher_disagreement_score":0.0043208217,"about_ca_system_score_codex":0.0007085834,"about_ca_system_score_gemma":0.001159524,"threshold_uncertainty_score":0.014454603},"labels":[],"label_agreement":null},{"id":"W1551456964","doi":"10.1049/iet-cdt.2011.0089","title":"Decimal floating-point antilogarithmic converter based on selection by rounding: algorithm and architecture","year":2012,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Decimal; CORDIC; Computer science; Critical path method; Parallel computing; Algorithm; Floating point; Double-precision floating-point format; Standard cell; Field-programmable gate array; Latency (audio); Architecture; Arithmetic; Computer hardware; Mathematics; Integrated circuit; Engineering","score_opus":0.008669592829528056,"score_gpt":0.25062490886247935,"score_spread":0.24195531603295128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551456964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046405856,0.0008895779,0.92953146,0.00022287836,0.00016225745,0.00020975796,0.00011562722,0.004835539,0.017627023],"genre_scores_gemma":[0.40439153,0.0007300668,0.5864415,0.00017150454,0.00008860467,0.00014126964,0.00030084053,0.00011499685,0.0076197055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996953,0.00003788875,0.00003116218,0.0000633705,0.00014143127,0.00003095641],"domain_scores_gemma":[0.9998149,0.000036897134,0.000017075736,0.000044139666,0.00007812755,0.000008800639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002513782,0.0003420674,0.00036848316,0.0006762027,0.00036050702,0.0010774867,0.0010389903,0.00034670794,0.0035727476],"category_scores_gemma":[0.0005840982,0.00019348142,0.00026686484,0.0006312257,0.00029026158,0.0007521936,0.00032006964,0.0004575664,0.0016905867],"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.0005538376,0.00014038301,0.0014254302,0.00041338315,0.00005970432,0.00043339227,0.00022430487,0.02735047,0.15830193,0.055233877,0.0051166783,0.75074655],"study_design_scores_gemma":[0.00024369035,0.0011414883,0.001993835,0.00016552502,0.00014228295,0.004353511,0.00018210575,0.48792654,0.40649757,0.018283676,0.078923956,0.00014585309],"about_ca_topic_score_codex":0.00075151183,"about_ca_topic_score_gemma":0.0009937993,"teacher_disagreement_score":0.0035727476,"about_ca_system_score_codex":0.0003894709,"about_ca_system_score_gemma":0.00082881097,"threshold_uncertainty_score":0.011952102},"labels":[],"label_agreement":null},{"id":"W1559568018","doi":"10.1007/3-540-47884-1_11","title":"Formalization of Cadence SPW Fixed-Point Arithmetic in HOL","year":2002,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Rounding; Computer science; HOL; Fixed-point arithmetic; Saturation arithmetic; Correctness; Arithmetic; Division (mathematics); Fixed point; Multiplication (music); Algorithm; Floating point; Arbitrary-precision arithmetic; Mathematics; Programming language","score_opus":0.02162370347798586,"score_gpt":0.26451962028958237,"score_spread":0.2428959168115965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1559568018","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04724219,0.001332456,0.709346,0.0013321174,0.00050649507,0.0001254102,0.00044683708,0.0012862529,0.23838228],"genre_scores_gemma":[0.78084356,0.001296515,0.16900477,0.0008846044,0.0006402036,0.0002576106,0.00071247725,0.0007092334,0.04565093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993375,0.000118963646,0.000049685914,0.0001222183,0.0002647219,0.00010696915],"domain_scores_gemma":[0.9996635,0.00011511377,0.000026342579,0.00008048953,0.000088002584,0.000026640595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237856,0.00067463465,0.00066892285,0.0018806205,0.0012245366,0.0030497946,0.0015236572,0.0007709501,0.011661768],"category_scores_gemma":[0.0012657559,0.00044357456,0.0010491972,0.0016833271,0.0038952797,0.004131837,0.0019893139,0.0030941218,0.0017271108],"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.000005963854,0.0000051716765,0.000023106075,0.000018468807,0.0000022441002,0.000023633502,0.00007984885,0.000356504,0.00022429152,0.9937674,0.00049567624,0.004997733],"study_design_scores_gemma":[0.000010047932,0.000011868072,0.00008068357,0.00001872727,0.00000697332,0.00006561517,0.000053083902,0.0026316787,0.00056071975,0.98427564,0.012276392,0.000008596107],"about_ca_topic_score_codex":0.001315017,"about_ca_topic_score_gemma":0.0013337974,"teacher_disagreement_score":0.011661768,"about_ca_system_score_codex":0.0017032146,"about_ca_system_score_gemma":0.0006516851,"threshold_uncertainty_score":0.03901249},"labels":[],"label_agreement":null},{"id":"W1568449537","doi":"10.1109/iscas.2002.1010715","title":"Hardware optimized direct digital frequency synthesizer architecture with 60 dBc spectral purity","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; VHDL; Computer science; Field-programmable gate array; dBc; Sine; Electronic engineering; Frequency synthesizer; Nyquist frequency; Computer hardware; Lookup table; Sine wave; Bandwidth (computing); Phase noise; Engineering; Electrical engineering; Phase-locked loop; Telecommunications; Mathematics","score_opus":0.01049538702158869,"score_gpt":0.22954164213217132,"score_spread":0.21904625511058262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568449537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09139887,0.00062682724,0.87944186,0.00025927727,0.00020469795,0.00019077309,0.00026128461,0.008086718,0.019529773],"genre_scores_gemma":[0.4916511,0.00024395033,0.49871328,0.00012166237,0.0000863934,0.00011949494,0.0003744957,0.00014315206,0.008546428],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997178,0.000028479504,0.00001890294,0.00005191217,0.00015002216,0.000032836782],"domain_scores_gemma":[0.99983096,0.000035884947,0.000022969518,0.000030122343,0.00006598855,0.000014013482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016809421,0.0003082693,0.00033031046,0.00033128052,0.00020209186,0.0004272755,0.00049952004,0.0003051382,0.0034744178],"category_scores_gemma":[0.0003766987,0.00015851813,0.00016478317,0.00022768677,0.00013660776,0.00033428974,0.00024857186,0.0003754973,0.001143431],"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.00041571097,0.000155118,0.00093981373,0.0002624389,0.000038764934,0.00025769396,0.0000895425,0.017649015,0.55670106,0.011594919,0.004634629,0.40726125],"study_design_scores_gemma":[0.0004977467,0.0015332921,0.0034575767,0.00004595487,0.000119083445,0.0023538196,0.000046534853,0.25791025,0.6395152,0.0031712975,0.0912648,0.000084404644],"about_ca_topic_score_codex":0.0005974012,"about_ca_topic_score_gemma":0.0011363904,"teacher_disagreement_score":0.0034744178,"about_ca_system_score_codex":0.0003231147,"about_ca_system_score_gemma":0.00040612934,"threshold_uncertainty_score":0.011623085},"labels":[],"label_agreement":null},{"id":"W1568950028","doi":"10.1109/mwscas.1991.252018","title":"High speed real-time design and implementation of Cauer-type Jaumann digital filters","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Calgary","funders":"","keywords":"Digital signal processing; Integrator; Lossless compression; Multiplier (economics); Transfer function; Computer science; Digital filter; Digital delay line; Fixed-point arithmetic; Digital signal; Floating point; Computer hardware; Algorithm; Filter (signal processing); Bandwidth (computing); Data compression; Engineering; Electrical engineering; Telecommunications; Computer vision","score_opus":0.031178336389680164,"score_gpt":0.28827113702660045,"score_spread":0.2570928006369203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1568950028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04124492,0.00040673674,0.9480632,0.00012384923,0.000057490208,0.00008342088,0.00003201576,0.0008385411,0.009149893],"genre_scores_gemma":[0.4344601,0.00039614807,0.5550576,0.00008509521,0.00003597129,0.00007470211,0.00006875086,0.00010652413,0.009715107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965024,0.00005332529,0.000017731558,0.000035684436,0.00021268327,0.000030251183],"domain_scores_gemma":[0.9996301,0.000096198666,0.00005738684,0.000041724776,0.00015725395,0.000017236307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004749256,0.0003551636,0.00020720907,0.00037763486,0.00027666468,0.0009822358,0.0007472193,0.00043530905,0.0018800631],"category_scores_gemma":[0.0012486231,0.00017411831,0.00016304036,0.00028557974,0.00026789424,0.0005397682,0.00016416621,0.0003087193,0.0006549403],"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.0006259508,0.000115335475,0.001075691,0.0003191139,0.00004685737,0.00022906573,0.00044509064,0.06972605,0.41863853,0.07591216,0.002821173,0.4300449],"study_design_scores_gemma":[0.00017095926,0.0007182963,0.0010744779,0.00005601827,0.00006549706,0.00051637937,0.00007908541,0.5381557,0.39432243,0.008752572,0.056019135,0.00006949754],"about_ca_topic_score_codex":0.0011787405,"about_ca_topic_score_gemma":0.002048552,"teacher_disagreement_score":0.0018800631,"about_ca_system_score_codex":0.00067364104,"about_ca_system_score_gemma":0.0004840059,"threshold_uncertainty_score":0.0062894225},"labels":[],"label_agreement":null},{"id":"W1573955341","doi":"10.1109/acssc.2000.910637","title":"On efficient techniques for difficult operations in one and two-digit DBNS index calculus","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"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 Windsor","funders":"CMC Microsystems","keywords":"Calculus (dental); Computer science; Index (typography); Numerical digit; Arithmetic; Algebra over a field; Mathematics; Programming language; Pure mathematics","score_opus":0.03415116263574998,"score_gpt":0.29459718241634325,"score_spread":0.2604460197805933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1573955341","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059223543,0.0005178801,0.9820218,0.00019074732,0.00016918157,0.000064984095,0.00003676363,0.0009884828,0.010087838],"genre_scores_gemma":[0.051248513,0.000776109,0.9400016,0.00013071304,0.00019418487,0.00018301453,0.00012680673,0.00037901537,0.006960036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980069,0.0003805678,0.00013991659,0.00022337167,0.0010446833,0.00020460648],"domain_scores_gemma":[0.99794334,0.001104445,0.00010528295,0.00051348406,0.00026996087,0.00006346853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016890431,0.0011584951,0.0011332203,0.0021762995,0.0017026569,0.002303311,0.0019202335,0.00064774044,0.010361711],"category_scores_gemma":[0.007894023,0.00054804474,0.0011380543,0.0029779973,0.002141402,0.004039184,0.00391132,0.0027676984,0.005053156],"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.00017912171,0.000080447884,0.00035781393,0.00029851586,0.000030528718,0.00021453484,0.00056612014,0.01167889,0.008922591,0.55759186,0.008512701,0.4115668],"study_design_scores_gemma":[0.00012823577,0.0001243952,0.00033434364,0.00013641088,0.000058426423,0.00055392017,0.00023118239,0.1500707,0.017352737,0.7424664,0.08846273,0.00008062593],"about_ca_topic_score_codex":0.0013577376,"about_ca_topic_score_gemma":0.002326196,"teacher_disagreement_score":0.010361711,"about_ca_system_score_codex":0.0009797604,"about_ca_system_score_gemma":0.0014666218,"threshold_uncertainty_score":0.03466332},"labels":[],"label_agreement":null},{"id":"W1581665782","doi":"10.1109/pacrim.2001.953579","title":"ROM size reduction with low processing cost for direct digital frequency synthesis","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; Computer science; Redundancy (engineering); Reduction (mathematics); Electronic engineering; Data compression; Frequency synthesizer; Computer hardware; Algorithm; Phase-locked loop; Engineering; Telecommunications; Mathematics; Jitter","score_opus":0.0205460935419386,"score_gpt":0.2508166757484431,"score_spread":0.23027058220650448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1581665782","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07403226,0.002098244,0.909551,0.00033236895,0.00012709585,0.00007977665,0.00008572083,0.0015633004,0.012130162],"genre_scores_gemma":[0.31880626,0.0008760465,0.67242885,0.00011536644,0.00012898231,0.00010895647,0.00015525111,0.00011289245,0.007267288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99981886,0.000022443579,0.000010285302,0.000018574858,0.00012060564,0.000009335234],"domain_scores_gemma":[0.99974936,0.00011630875,0.000031701362,0.00005156929,0.000043083928,0.000007937557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013132875,0.00027147614,0.00021215685,0.00032902186,0.00016091272,0.00031941608,0.00042601002,0.00024937658,0.0034559302],"category_scores_gemma":[0.0008019514,0.00012939853,0.00015834061,0.00034452442,0.0002391397,0.0005406634,0.00034268197,0.00028574315,0.00095995865],"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.00021289472,0.00005449977,0.00031404805,0.0003529976,0.000021317377,0.00030106818,0.000073753166,0.016844774,0.38518324,0.026264276,0.0030898878,0.5672872],"study_design_scores_gemma":[0.00032182757,0.001285519,0.0016778741,0.00010788152,0.00009948904,0.0042162645,0.00006586828,0.37411633,0.50983596,0.024889106,0.08332992,0.00005412041],"about_ca_topic_score_codex":0.00018108456,"about_ca_topic_score_gemma":0.00054427114,"teacher_disagreement_score":0.0034559302,"about_ca_system_score_codex":0.00015346037,"about_ca_system_score_gemma":0.0002670598,"threshold_uncertainty_score":0.0115612745},"labels":[],"label_agreement":null},{"id":"W1583165772","doi":"10.1109/icm.2004.1434710","title":"VLSI implementation of a floating-point divider","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Western University","funders":"","keywords":"Very-large-scale integration; Computer science; Adder; CMOS; Frequency divider; Transistor count; Computer hardware; Transistor; Electronic engineering; Arithmetic; Embedded system; Electrical engineering; Engineering; Mathematics","score_opus":0.01773693422228831,"score_gpt":0.33627961255800604,"score_spread":0.3185426783357177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1583165772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12027502,0.0014606683,0.8553134,0.00036067964,0.00031071703,0.00013120714,0.0001699599,0.0047218516,0.017256485],"genre_scores_gemma":[0.55479455,0.0007253194,0.43401593,0.0002248135,0.000112425994,0.00007593214,0.00021452528,0.000100276426,0.0097362],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99985313,0.000019287661,0.000012099991,0.000034010693,0.000060710347,0.000020729163],"domain_scores_gemma":[0.99988043,0.000029381934,0.000014650665,0.000019772204,0.00004750751,0.000008144561],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013660191,0.00031012966,0.0002751883,0.0003215245,0.0002525024,0.00048632512,0.0007484508,0.00035550946,0.0050282157],"category_scores_gemma":[0.00037127445,0.00017672425,0.0002222686,0.00024732648,0.00019589573,0.00064276665,0.00021370388,0.00025646988,0.0014266954],"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.00035674014,0.00010163081,0.0011016533,0.00037681573,0.00008862123,0.00059913844,0.00020703599,0.017780352,0.5657077,0.018427197,0.0036922717,0.39156082],"study_design_scores_gemma":[0.00025719783,0.0023998946,0.0027818724,0.00007053413,0.00022001458,0.002881566,0.000120445424,0.22350086,0.6393754,0.008150061,0.120150395,0.00009186427],"about_ca_topic_score_codex":0.00039291955,"about_ca_topic_score_gemma":0.0005780906,"teacher_disagreement_score":0.0050282157,"about_ca_system_score_codex":0.00029876147,"about_ca_system_score_gemma":0.00031727215,"threshold_uncertainty_score":0.016821086},"labels":[],"label_agreement":null},{"id":"W1587360322","doi":"10.1023/a:1022236132192","title":"Fast Fourier Transforms Using the Complex Logarithmic Number System","year":2003,"lang":"en","type":"article","venue":"The Journal of VLSI Signal Processing Systems for Signal Image and Video Technology","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Logarithm; Fast Fourier transform; Arithmetic; Computer science; Point (geometry); Algorithm; Adder; Multiplication (music); Mathematics; Geometry; Telecommunications; Combinatorics","score_opus":0.029849803841538305,"score_gpt":0.3035803363279219,"score_spread":0.2737305324863836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587360322","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009410777,0.0014843523,0.97226113,0.00060146634,0.00069912255,0.00003889713,0.00007828229,0.00073990936,0.014686024],"genre_scores_gemma":[0.20138077,0.0027168493,0.76939243,0.00036719482,0.00077686826,0.00018016114,0.0003149117,0.0004978374,0.024373036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994881,0.00016591993,0.000035650653,0.000061765095,0.0002191077,0.000029484598],"domain_scores_gemma":[0.9986488,0.0006133096,0.000099091296,0.0003071452,0.0002821597,0.000049536367],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009018802,0.0007901031,0.00043865648,0.0015063687,0.0003378327,0.0020304923,0.00057835487,0.00088471384,0.010455668],"category_scores_gemma":[0.0073025185,0.00023852556,0.00034877632,0.0014254352,0.00091422553,0.0030313535,0.0010999532,0.0018437341,0.0046389075],"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.0003158739,0.00006291492,0.0004933168,0.00018244109,0.000023795154,0.0002377169,0.00017961432,0.024498323,0.030168572,0.5961543,0.0092106685,0.33847243],"study_design_scores_gemma":[0.00013198168,0.00015507732,0.00071280956,0.00014730362,0.000025323112,0.0010534864,0.00008850815,0.5396359,0.02531498,0.3534528,0.07918459,0.00009719329],"about_ca_topic_score_codex":0.00035844196,"about_ca_topic_score_gemma":0.00046181295,"teacher_disagreement_score":0.010455668,"about_ca_system_score_codex":0.0004616534,"about_ca_system_score_gemma":0.00046189106,"threshold_uncertainty_score":0.034977674},"labels":[],"label_agreement":null},{"id":"W1589823128","doi":"10.1007/978-1-4613-0171-4_5","title":"Monte Carlo Methods","year":2001,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley; Simon Fraser University","funders":"","keywords":"Computer science; Symbolic computation; Fortran; Computation; Algebra over a field; Cover (algebra); Theoretical computer science; Programming language; Computational science; Mathematics; Pure mathematics; Engineering","score_opus":0.04833335482953581,"score_gpt":0.3463114071006244,"score_spread":0.2979780522710886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1589823128","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005064968,0.002229279,0.88723505,0.0004463508,0.00049641595,0.000083503546,0.00017212969,0.0008778015,0.10795301],"genre_scores_gemma":[0.052525517,0.005900029,0.6366651,0.001253051,0.000801665,0.0006763436,0.00081886264,0.001957153,0.2994023],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983468,0.00056739984,0.00004007535,0.00019159491,0.00078270864,0.000071364055],"domain_scores_gemma":[0.9981725,0.0009845535,0.000062018196,0.00036522996,0.0003587738,0.000056893892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013934956,0.0011098699,0.0016100009,0.0015321975,0.000900523,0.002550193,0.0018579713,0.0020013426,0.052259568],"category_scores_gemma":[0.006077773,0.0007940324,0.000767518,0.0015406207,0.0013588566,0.001905255,0.0016317096,0.0025595436,0.019904835],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019459116,0.000051081417,0.00014749974,0.00018097364,0.00003741775,0.00003717872,0.00007808025,0.038909886,0.00042978761,0.7525825,0.05280263,0.15472361],"study_design_scores_gemma":[0.00002873815,0.000023518873,0.00015102814,0.00018351486,0.000032459076,0.00016686025,0.000027124352,0.17883897,0.0012770867,0.525874,0.2933604,0.000036242087],"about_ca_topic_score_codex":0.0017714942,"about_ca_topic_score_gemma":0.0022090233,"teacher_disagreement_score":0.052259568,"about_ca_system_score_codex":0.00096010265,"about_ca_system_score_gemma":0.0013736162,"threshold_uncertainty_score":0.17482567},"labels":[],"label_agreement":null},{"id":"W1590205897","doi":"10.1109/iscas.1999.777829","title":"Power implications of precision limited arithmetic in floating point FIR filters","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Royal Military College of Canada; Concordia University","funders":"","keywords":"Adder; Floating point; Finite impulse response; Single-precision floating-point format; Computer science; Reduction (mathematics); Power (physics); Arithmetic logic unit; Digital filter; Double-precision floating-point format; Floating-point unit; Filter (signal processing); Digital signal processing; Arithmetic; Algorithm; Computer hardware; Mathematics; Telecommunications","score_opus":0.02336336767547938,"score_gpt":0.2942392187956302,"score_spread":0.27087585112015083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1590205897","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89893365,0.0004125062,0.095968,0.00014667725,0.000027374172,0.000018669005,0.000054443884,0.00039190814,0.0040466944],"genre_scores_gemma":[0.9921738,0.00009076192,0.006931907,0.000019787742,0.000007610354,0.0000065117833,0.00002527497,0.000026580838,0.0007178948],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997024,0.000057130288,0.000022233438,0.000048766356,0.00012526105,0.00004418806],"domain_scores_gemma":[0.99888486,0.00073217356,0.00013957075,0.00013286473,0.00009045858,0.000020008238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024336299,0.00041222753,0.0001585606,0.0002960731,0.00027791143,0.000580027,0.00038621598,0.00021068951,0.0021007843],"category_scores_gemma":[0.001980151,0.0001628359,0.00015404343,0.00034375014,0.00038674398,0.00094535016,0.00022701651,0.0003270569,0.00025216653],"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.0014953027,0.0001065468,0.0051630214,0.00020916351,0.00003704023,0.0008004587,0.0002769928,0.07981542,0.7526262,0.0126065435,0.0003493002,0.14651407],"study_design_scores_gemma":[0.000052527623,0.0013808976,0.0062049674,0.000031515174,0.0000763895,0.0007983757,0.00012832227,0.18589538,0.7921677,0.009982623,0.0032574313,0.000023889643],"about_ca_topic_score_codex":0.00027133487,"about_ca_topic_score_gemma":0.00070530706,"teacher_disagreement_score":0.0021007843,"about_ca_system_score_codex":0.00033579709,"about_ca_system_score_gemma":0.00026592182,"threshold_uncertainty_score":0.0070278645},"labels":[],"label_agreement":null},{"id":"W1592608789","doi":"10.46298/dmtcs.450","title":"Diophantine Approximation, Ostrowski Numeration and the Double-Base Number System","year":2009,"lang":"en","type":"article","venue":"Discrete Mathematics & Theoretical Computer Science","topic":"Numerical Methods and Algorithms","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":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Mathematics; Diophantine equation; Correctness; Partition (number theory); Base (topology); Integer (computer science); Combinatorics; Order (exchange); Discrete mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.011320149882883795,"score_gpt":0.2691241931922988,"score_spread":0.257804043309415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1592608789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31944537,0.0010183274,0.65798575,0.00082559255,0.00010160987,0.00010407018,0.00019164431,0.0011441854,0.019183468],"genre_scores_gemma":[0.6952468,0.0004047742,0.2945656,0.00012653181,0.000074910015,0.0001648392,0.00027992908,0.00025857895,0.0088780755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990834,0.00023215229,0.000049618357,0.00015601031,0.00032843358,0.00015026849],"domain_scores_gemma":[0.9976494,0.0014764807,0.0002173823,0.0004291558,0.00015154152,0.00007612897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012543155,0.0005809067,0.000817373,0.0008090625,0.00073397387,0.0016436568,0.0010390843,0.00056812953,0.0032386912],"category_scores_gemma":[0.0069561666,0.0002501894,0.00046075234,0.0011506343,0.0015931042,0.0024002176,0.0010842186,0.001345321,0.0009238859],"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.0008972399,0.00014373154,0.0022190895,0.00021865283,0.00004386479,0.00011741771,0.00041917473,0.2385216,0.01363132,0.6218288,0.0033136185,0.118645534],"study_design_scores_gemma":[0.00010869389,0.000111810805,0.0004554406,0.000037054804,0.000025802268,0.00008881308,0.000055906174,0.6353218,0.00925714,0.34934416,0.0051570837,0.00003614448],"about_ca_topic_score_codex":0.001614567,"about_ca_topic_score_gemma":0.0014077491,"teacher_disagreement_score":0.0032386912,"about_ca_system_score_codex":0.0019602692,"about_ca_system_score_gemma":0.0012956156,"threshold_uncertainty_score":0.014222741},"labels":[],"label_agreement":null},{"id":"W1664525523","doi":"10.1109/ijcnn.2015.7280700","title":"A modular mixed-signal CVNS neural network architecture","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Windsor","funders":"","keywords":"Computer science; Modular design; Artificial neural network; Network architecture; Synaptic weight; Flexibility (engineering); Chip; Electronic engineering; Computer hardware; Engineering; Artificial intelligence; Mathematics; Computer network","score_opus":0.03204978977503297,"score_gpt":0.26984599190567865,"score_spread":0.23779620213064567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1664525523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054515906,0.00023162614,0.9343847,0.00016267043,0.00014795118,0.00007133359,0.0000998065,0.0019809247,0.008405128],"genre_scores_gemma":[0.7315451,0.00012933962,0.26194385,0.00015864652,0.00003784464,0.00011152006,0.00016166452,0.000040517585,0.005871437],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998259,0.000030436247,0.000009236472,0.00004644764,0.000066272514,0.00002186157],"domain_scores_gemma":[0.9998641,0.000024411382,0.00001720552,0.000024536344,0.00005845602,0.000011389869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023195718,0.00035383474,0.00023808907,0.0003072564,0.00021456936,0.00048182238,0.0011241751,0.0004362134,0.0028934279],"category_scores_gemma":[0.00038918125,0.00018511715,0.0002785048,0.00023746384,0.00023921816,0.000573554,0.0003717317,0.0003645501,0.00068632513],"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.0005717721,0.00016259195,0.0017654973,0.00037402692,0.00018057083,0.00041239246,0.00015237495,0.31643295,0.2237553,0.051892556,0.0042615836,0.40003842],"study_design_scores_gemma":[0.000041076495,0.0003285056,0.0006916989,0.000025876892,0.000057150042,0.00024021289,0.000014795792,0.92696667,0.056418914,0.005878365,0.009310677,0.000026078902],"about_ca_topic_score_codex":0.0012282946,"about_ca_topic_score_gemma":0.0022200255,"teacher_disagreement_score":0.0028934279,"about_ca_system_score_codex":0.00045089627,"about_ca_system_score_gemma":0.00040539596,"threshold_uncertainty_score":0.009679437},"labels":[],"label_agreement":null},{"id":"W1668453805","doi":"10.48550/arxiv.1504.02914","title":"Representing numeric data in 32 bits while preserving 64-bit precision","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bit (key); Computer science; Arithmetic; Algorithm; Mathematics; Computer network","score_opus":0.265045774523063,"score_gpt":0.2673925908693965,"score_spread":0.0023468163463334912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1668453805","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060781173,0.0026484756,0.81980413,0.0031462868,0.0019656953,0.0005365299,0.0032503367,0.011348707,0.09651862],"genre_scores_gemma":[0.30489436,0.0036193202,0.63295805,0.0011505012,0.00043084237,0.0005761485,0.0048113423,0.0021511714,0.049408246],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990564,0.00015017175,0.00013762449,0.00010939198,0.0004155535,0.00013079226],"domain_scores_gemma":[0.99804974,0.0002965027,0.0001234032,0.0010002025,0.00048085302,0.000049267386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009307154,0.00077876734,0.00063810794,0.0008100133,0.0008275636,0.0031366514,0.0010870135,0.00074032886,0.01542254],"category_scores_gemma":[0.005004687,0.0003293178,0.00047879224,0.0021311755,0.000803639,0.0036856602,0.0015791397,0.0015750651,0.017209155],"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.0010028628,0.0001550808,0.0019308677,0.0010358932,0.00005946345,0.0012576792,0.0015335169,0.017187776,0.13912049,0.342963,0.04530607,0.44844732],"study_design_scores_gemma":[0.00010445057,0.0003581969,0.00068618346,0.0005449871,0.000078272926,0.001295625,0.0006132833,0.03197728,0.1889783,0.11368227,0.6615494,0.00013171455],"about_ca_topic_score_codex":0.0010110042,"about_ca_topic_score_gemma":0.0011889198,"teacher_disagreement_score":0.01542254,"about_ca_system_score_codex":0.0007725581,"about_ca_system_score_gemma":0.0015893695,"threshold_uncertainty_score":0.0515936},"labels":[],"label_agreement":null},{"id":"W1678449713","doi":"10.1109/iscas.1999.777792","title":"A hybrid DBNS processor for DSP computation","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Digital signal processing; Computer science; Computation; Parallel computing; Computer architecture; Computer hardware; Algorithm","score_opus":0.02921128949537192,"score_gpt":0.3155578837134625,"score_spread":0.28634659421809056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1678449713","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034865696,0.0006778572,0.93536407,0.00021442978,0.0004646925,0.00011791833,0.00021007388,0.005192815,0.022892423],"genre_scores_gemma":[0.20536867,0.00046769882,0.7660312,0.00036918293,0.00026443336,0.00024609073,0.00074178615,0.00027764795,0.026233258],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995503,0.000041913903,0.000035104513,0.00006336487,0.00027832194,0.000030887346],"domain_scores_gemma":[0.99966395,0.00005662484,0.000021422728,0.00010323608,0.00013171647,0.000023032888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022390106,0.00036129734,0.00043181854,0.00061730476,0.00033725667,0.0008562445,0.0013324389,0.0003032916,0.01095396],"category_scores_gemma":[0.0007484294,0.00023130148,0.00024635636,0.0007837278,0.00023052342,0.001136057,0.00074739277,0.0005586556,0.0041761855],"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.0008282227,0.00011722032,0.000592043,0.00030356267,0.000052249874,0.00021104045,0.00011225699,0.010704755,0.1635367,0.06260618,0.016048308,0.74488753],"study_design_scores_gemma":[0.00037953135,0.000959621,0.0013130871,0.00013311036,0.00010973622,0.0018611558,0.00010784418,0.41332135,0.2705961,0.028839689,0.2822852,0.00009357145],"about_ca_topic_score_codex":0.00058440224,"about_ca_topic_score_gemma":0.000985426,"teacher_disagreement_score":0.01095396,"about_ca_system_score_codex":0.00038339413,"about_ca_system_score_gemma":0.0005370741,"threshold_uncertainty_score":0.036644638},"labels":[],"label_agreement":null},{"id":"W1727481168","doi":"10.1109/icecs.2000.911589","title":"Behavioural synthesis of low power floating point CORDIC processors","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Royal Military College of Canada","funders":"","keywords":"CORDIC; Computer science; Verilog; Implementation; Computer architecture; Digital signal processing; Process (computing); Embedded system; Field-programmable gate array; Computer hardware; Parallel computing; Programming language","score_opus":0.026932365588497292,"score_gpt":0.2528731336186034,"score_spread":0.22594076803010613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1727481168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05924658,0.00026318314,0.9116663,0.0001663457,0.0000867627,0.00011504214,0.00009905191,0.0018477656,0.026509047],"genre_scores_gemma":[0.7691263,0.00043852482,0.22121027,0.00012371874,0.0000326882,0.00019685141,0.00016499535,0.00021088077,0.008495794],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997378,0.00005160175,0.000017351806,0.000026335445,0.00014242891,0.000024414863],"domain_scores_gemma":[0.9997464,0.00010536669,0.00003231333,0.000035501027,0.00007008026,0.0000103475395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002217481,0.000280536,0.00013960944,0.00027601523,0.00020829837,0.00038983475,0.00044095333,0.00027392738,0.002259957],"category_scores_gemma":[0.00083385425,0.00017413922,0.00020280706,0.0001541232,0.0003437726,0.00023596859,0.00019303033,0.00033809963,0.0005796819],"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.00017695014,0.00009786897,0.0006611119,0.0005006112,0.000028794013,0.00041592785,0.00044313414,0.24004816,0.30384916,0.2166281,0.0020697592,0.23508047],"study_design_scores_gemma":[0.00010327446,0.00039610677,0.0007699122,0.00011410518,0.000047241978,0.00031470976,0.00007027095,0.7602437,0.16572164,0.043029618,0.029153984,0.000035359193],"about_ca_topic_score_codex":0.0009309035,"about_ca_topic_score_gemma":0.0011378028,"teacher_disagreement_score":0.002259957,"about_ca_system_score_codex":0.00038326858,"about_ca_system_score_gemma":0.0005206351,"threshold_uncertainty_score":0.0075603724},"labels":[],"label_agreement":null},{"id":"W1777520031","doi":"10.48550/arxiv.1508.03211","title":"Computing accurate Horner form approximations to special functions in finite precision arithmetic","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Univariate; Implementation; Heuristic; Arithmetic; Computer science; Inverse trigonometric functions; Machine epsilon; Arbitrary-precision arithmetic; Algorithm; Elementary function; Round-off error; Algebra over a field; Mathematics; Artificial intelligence; Programming language; Pure mathematics; Machine learning; Multivariate statistics","score_opus":0.12474530684167671,"score_gpt":0.2453228981624314,"score_spread":0.1205775913207547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1777520031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.089344025,0.00009774514,0.9053599,0.0001155515,0.00002673631,0.000023353832,0.000034305034,0.0010178806,0.0039804257],"genre_scores_gemma":[0.49330568,0.00015856599,0.5032895,0.000120289915,0.00003553292,0.0000740062,0.00013840824,0.0002985035,0.0025794406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885833,0.00037360875,0.00006377213,0.00013532437,0.00043718502,0.00013165126],"domain_scores_gemma":[0.99719065,0.0018339924,0.00017334234,0.00053627323,0.00021094483,0.000054722357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021200133,0.0005574429,0.0009142743,0.0006867422,0.00040449458,0.0012616989,0.0009756302,0.0008180938,0.0023874864],"category_scores_gemma":[0.010906518,0.0003974684,0.000439105,0.0008324593,0.0015532337,0.0021767053,0.0011779688,0.0013123914,0.0007234225],"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.0005404622,0.0000996935,0.0023197723,0.0002618383,0.000054789012,0.00023796195,0.00055202213,0.41638842,0.015101269,0.4321864,0.0024719138,0.12978552],"study_design_scores_gemma":[0.000027673992,0.00004837997,0.00013030342,0.000023927494,0.000009120902,0.000035392233,0.000043595846,0.803973,0.006864819,0.1876986,0.001133882,0.000011289449],"about_ca_topic_score_codex":0.0010149698,"about_ca_topic_score_gemma":0.0022068291,"teacher_disagreement_score":0.0023874864,"about_ca_system_score_codex":0.00068880036,"about_ca_system_score_gemma":0.00071003404,"threshold_uncertainty_score":0.011211872},"labels":[],"label_agreement":null},{"id":"W181038668","doi":"10.1023/a:1014798618404","title":"An Effective High-Order Interval Method for Validating Existence and Uniqueness of the Solution of an IVP for an ODE","year":2001,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"Information Technology Research Centre","keywords":"A priori and a posteriori; Interval (graph theory); Uniqueness; Ordinary differential equation; Mathematics; Initial value problem; Enclosure; Computer science; Mathematical optimization; Applied mathematics; Differential equation; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.030661094185814183,"score_gpt":0.35721351459385225,"score_spread":0.32655242040803806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W181038668","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138693815,0.00008717786,0.9831087,0.000039328108,0.000052551495,0.000036407328,0.000020127867,0.00019544437,0.0025907748],"genre_scores_gemma":[0.4417913,0.00017047585,0.55572313,0.000070344235,0.00003981084,0.00015893583,0.00007341794,0.000113682974,0.0018590519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.00026803053,0.000037113845,0.00007522175,0.0003775581,0.00005475621],"domain_scores_gemma":[0.9977323,0.0012590385,0.00015962488,0.00036227435,0.0003941947,0.000092608905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018645099,0.0005299056,0.00072520407,0.00072741864,0.00060156465,0.00092413893,0.0014893301,0.001110762,0.002400133],"category_scores_gemma":[0.0054582753,0.00027919177,0.0006304113,0.00041046238,0.0012463002,0.0010851739,0.0012137174,0.0014679254,0.00030879845],"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.0003085218,0.00015537502,0.0015955697,0.000388103,0.0000746643,0.0002479795,0.00028401398,0.686672,0.037482128,0.17370985,0.0012267824,0.09785501],"study_design_scores_gemma":[0.000007612843,0.00004918037,0.00009649935,0.000009422238,0.000006218763,0.000020815742,0.00000896075,0.9923366,0.0023694984,0.0044271727,0.0006599687,0.0000080941445],"about_ca_topic_score_codex":0.0013741121,"about_ca_topic_score_gemma":0.0009644162,"teacher_disagreement_score":0.002400133,"about_ca_system_score_codex":0.0004264119,"about_ca_system_score_gemma":0.00088325114,"threshold_uncertainty_score":0.009860575},"labels":[],"label_agreement":null},{"id":"W1814759949","doi":"10.1109/icassp.1977.1170347","title":"Hardware realization of digital signal processing elements using the residue number system.","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Realization (probability); Arithmetic; Binary number; Computer science; Computer hardware; Digital filter; Signal processing; Saturation arithmetic; Digital signal processing; Residue number system; Fast Fourier transform; Arbitrary-precision arithmetic; Algorithm; Filter (signal processing); Mathematics","score_opus":0.03236534261837413,"score_gpt":0.31520123589677357,"score_spread":0.2828358932783994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814759949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019864557,0.0008911061,0.9616892,0.00017537015,0.00027405037,0.00010888741,0.00008130782,0.0012458011,0.01566981],"genre_scores_gemma":[0.23715675,0.0008438738,0.75556225,0.00011081953,0.00009586644,0.00011878433,0.00027434688,0.00006480625,0.005772429],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997578,0.000050745133,0.000022991244,0.000033114717,0.00011481806,0.000020498604],"domain_scores_gemma":[0.9998024,0.00007062458,0.000021308302,0.000048533908,0.000047354766,0.000009770027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140141,0.00038097674,0.0003002251,0.0004211965,0.00029330124,0.00060752674,0.00045814167,0.00043935538,0.0042049643],"category_scores_gemma":[0.0010544629,0.00015708987,0.000320931,0.0003542958,0.00031092454,0.00089465023,0.0003034524,0.00049273955,0.0021547966],"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.00037537637,0.00008890464,0.00074310566,0.0006831475,0.000095236144,0.00061035185,0.0003188573,0.030067366,0.26989865,0.2294107,0.00640217,0.4613061],"study_design_scores_gemma":[0.00025471504,0.0015918514,0.0015751239,0.0002688988,0.0001699879,0.0038435212,0.00017479733,0.30470678,0.33097067,0.09779212,0.25851697,0.00013455977],"about_ca_topic_score_codex":0.00026927755,"about_ca_topic_score_gemma":0.0005030361,"teacher_disagreement_score":0.0042049643,"about_ca_system_score_codex":0.00024027993,"about_ca_system_score_gemma":0.00035265708,"threshold_uncertainty_score":0.014066994},"labels":[],"label_agreement":null},{"id":"W1848751006","doi":"10.1109/iscas.1997.621882","title":"A QR decomposition based algorithm for computing transfer functions from state equations","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"McMaster University","funders":"University of Hong Kong; University Grants Committee; City University of Hong Kong","keywords":"QR decomposition; Algorithm; Computer science; Decomposition; Transfer function; State (computer science); Inverse; Applied mathematics; Mathematics; Eigenvalues and eigenvectors","score_opus":0.04111798983804527,"score_gpt":0.29644097674276004,"score_spread":0.2553229869047148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1848751006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003919891,0.000030523894,0.9990349,0.00001773779,0.000013396874,0.000015051382,0.000010028237,0.00015839959,0.00032801664],"genre_scores_gemma":[0.012337384,0.00010590787,0.98625356,0.00002831706,0.000016871583,0.00008142176,0.00006280017,0.00009739603,0.0010163102],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945873,0.0001389654,0.000035792207,0.00007590684,0.00025600073,0.00003457955],"domain_scores_gemma":[0.99924976,0.0003635593,0.00005405847,0.00007605501,0.00023331922,0.000023206265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009891193,0.0008265848,0.0008572119,0.0006399574,0.00049131614,0.00086415233,0.0008913743,0.00083297753,0.005962507],"category_scores_gemma":[0.0029951306,0.000448664,0.0006092681,0.0006821498,0.0006004351,0.0011703131,0.0009677062,0.001478989,0.0027657778],"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.000140641,0.00008401727,0.0003234365,0.00039292572,0.00006812717,0.00018741757,0.00021038167,0.3944046,0.033756055,0.13469823,0.005225059,0.43050912],"study_design_scores_gemma":[0.00003616183,0.000054168828,0.0000771017,0.000024715486,0.000011996254,0.00010256406,0.00001666427,0.97211534,0.005129465,0.0152809145,0.007128811,0.000022119773],"about_ca_topic_score_codex":0.002022957,"about_ca_topic_score_gemma":0.0017105882,"teacher_disagreement_score":0.005962507,"about_ca_system_score_codex":0.00041716342,"about_ca_system_score_gemma":0.0010416871,"threshold_uncertainty_score":0.019946635},"labels":[],"label_agreement":null},{"id":"W1849841112","doi":"10.1109/iscas.1999.780152","title":"Simple implementations of homotopy algorithms for finding DC solutions of nonlinear circuits","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Simple (philosophy); Nonlinear system; Electronic circuit; Implementation; Homotopy; Algorithm; Computer science; Homotopy perturbation method; Homotopy analysis method; Mathematics; Electrical engineering; Engineering; Physics; Pure mathematics","score_opus":0.09759831568290088,"score_gpt":0.37664937954521743,"score_spread":0.27905106386231654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1849841112","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00203007,0.00006836275,0.9937204,0.000032036976,0.000035001558,0.000056304067,0.000034422384,0.001318455,0.002704884],"genre_scores_gemma":[0.055457838,0.00019134463,0.9394699,0.000051189167,0.000026063164,0.0003371679,0.00014261952,0.0004583343,0.0038656048],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999464,0.000084908206,0.00006272417,0.00006239209,0.00028825417,0.00003782872],"domain_scores_gemma":[0.9987513,0.00054888526,0.0000729578,0.00024898216,0.0003377253,0.000040115254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079613074,0.0013164405,0.00071585906,0.0013672847,0.00055496924,0.0010679517,0.0021195677,0.0016946072,0.01473069],"category_scores_gemma":[0.0040713595,0.00062813447,0.00059642515,0.0008476453,0.0006709791,0.0019066174,0.0010550373,0.0013495429,0.0043441406],"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.0001877923,0.00023031868,0.0008676218,0.00060755183,0.000094876355,0.00025300385,0.00031268512,0.08615021,0.03854281,0.15931973,0.0078331325,0.70560014],"study_design_scores_gemma":[0.00021637669,0.00024271573,0.00046700877,0.00013016279,0.00005635729,0.0005175481,0.00009644377,0.7629914,0.06949925,0.10800967,0.057654552,0.00011840972],"about_ca_topic_score_codex":0.00072820723,"about_ca_topic_score_gemma":0.0011271391,"teacher_disagreement_score":0.01473069,"about_ca_system_score_codex":0.00042270348,"about_ca_system_score_gemma":0.00052561617,"threshold_uncertainty_score":0.049279094},"labels":[],"label_agreement":null},{"id":"W1850700917","doi":"10.48550/arxiv.0810.4196","title":"Interval Semantics for Standard Floating-Point Arithmetic","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic; Interval (graph theory); Semantics (computer science); Floating point; Point (geometry); Interval arithmetic; Mathematics; Computer science; Programming language; Combinatorics; Mathematical analysis; Geometry","score_opus":0.07228357587110007,"score_gpt":0.32828951599594663,"score_spread":0.25600594012484656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1850700917","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009463379,0.0014618682,0.9605168,0.0005084691,0.000359415,0.000057909525,0.00024970088,0.000524056,0.026858391],"genre_scores_gemma":[0.41366,0.002557039,0.569796,0.0006640167,0.000920772,0.00050896435,0.00076287455,0.00062332273,0.010507081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767095,0.000492667,0.00030578606,0.00033445316,0.0010390403,0.0001571045],"domain_scores_gemma":[0.99859124,0.00052295194,0.00012630285,0.00028072787,0.0004023773,0.00007634363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021119046,0.0007609069,0.00056320353,0.0012778024,0.0010448277,0.004317383,0.0015610779,0.0010782671,0.0046717254],"category_scores_gemma":[0.0049041905,0.00045036862,0.00093453197,0.0014911373,0.003873313,0.0058595473,0.0018264828,0.0025325492,0.0013192212],"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.000014301878,0.000005561172,0.000030461802,0.000040270403,0.0000032250118,0.000027667704,0.00014734163,0.0016131697,0.0005135355,0.99048716,0.00055646634,0.0065609296],"study_design_scores_gemma":[0.000011584579,0.000013038377,0.000029936506,0.000031666328,0.0000063501993,0.000046867324,0.000048714046,0.008079072,0.00082986546,0.97563916,0.015253521,0.000010244632],"about_ca_topic_score_codex":0.0006819961,"about_ca_topic_score_gemma":0.0005458994,"teacher_disagreement_score":0.0046717254,"about_ca_system_score_codex":0.0011970641,"about_ca_system_score_gemma":0.0009449476,"threshold_uncertainty_score":0.015628457},"labels":[],"label_agreement":null},{"id":"W185179213","doi":"10.1007/978-3-7643-7984-1_7","title":"New Algorithms for Exact and Approximate Polynomial Decomposition","year":2007,"lang":"en","type":"book-chapter","venue":"Birkhäuser Basel eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polynomial; Decomposition; Mathematics; Algorithm; Bivariate analysis; Computation; Exponential function; Square-free polynomial; Matrix polynomial; Discrete mathematics; Combinatorics; Applied mathematics; Mathematical analysis","score_opus":0.055096295448580426,"score_gpt":0.3217164365635686,"score_spread":0.26662014111498816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W185179213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014072581,0.00030901897,0.9951344,0.00010324299,0.00007892975,0.000032154327,0.000040779163,0.00041262747,0.0024815432],"genre_scores_gemma":[0.028203197,0.0003987322,0.9659422,0.00012290118,0.00012632631,0.0001364192,0.00027200044,0.00029110507,0.004507107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977642,0.00032779475,0.00016338559,0.00048364466,0.0010898554,0.00017099277],"domain_scores_gemma":[0.997341,0.0009810609,0.00015914557,0.00081951165,0.00059470034,0.00010453596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018925132,0.0013141831,0.0012028838,0.0016478898,0.0007166519,0.0024640067,0.0021062254,0.0013103163,0.007374714],"category_scores_gemma":[0.010072156,0.0006944623,0.0012870174,0.0024389718,0.0014181647,0.0049660606,0.003859521,0.0041776984,0.0033714494],"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.00020658784,0.00009281548,0.00032604442,0.00025834405,0.000048986225,0.000059805254,0.00018713533,0.058560498,0.0070510535,0.44992727,0.011727346,0.47155404],"study_design_scores_gemma":[0.00006786559,0.00005642913,0.00014916077,0.000055967997,0.000026691634,0.00019186734,0.00005851562,0.63839376,0.0070499596,0.31893805,0.034980346,0.000031411702],"about_ca_topic_score_codex":0.0009762164,"about_ca_topic_score_gemma":0.0013792102,"teacher_disagreement_score":0.007374714,"about_ca_system_score_codex":0.0014651491,"about_ca_system_score_gemma":0.0011086166,"threshold_uncertainty_score":0.02467084},"labels":[],"label_agreement":null},{"id":"W1860567208","doi":"10.1007/11751540_6","title":"Backward Error Analysis in Computational Geometry","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Context (archaeology); Computational geometry; Floating point; Algorithm; Computation; Point (geometry); Interval arithmetic; Theoretical computer science; Mathematics; Geometry","score_opus":0.019609992187504716,"score_gpt":0.28553203587516657,"score_spread":0.26592204368766187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1860567208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025886132,0.0029339911,0.9679823,0.00086117716,0.00073384837,0.000022809361,0.00015141375,0.00027472898,0.0244511],"genre_scores_gemma":[0.21702951,0.00985205,0.57615304,0.0010550366,0.0018232657,0.00029973386,0.000820846,0.0022935316,0.19067295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989825,0.00032494482,0.000050937113,0.00010776982,0.00047779034,0.00005603072],"domain_scores_gemma":[0.9978108,0.0010655982,0.00013060977,0.00032683113,0.00058461033,0.00008155084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021769302,0.0014607371,0.0016209957,0.0019955367,0.0007924341,0.0020364125,0.0016556272,0.0012729979,0.0075494875],"category_scores_gemma":[0.0061078584,0.0006432312,0.0013100517,0.0016594573,0.002571515,0.003126661,0.00270798,0.003913102,0.0028801153],"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.000022726103,0.000012792788,0.00014493163,0.0001284339,0.00002368104,0.000031806543,0.00007708258,0.016879404,0.00097087026,0.9412095,0.0070682825,0.03343049],"study_design_scores_gemma":[0.00000858278,0.00001878709,0.00013996233,0.00005891754,0.000022563863,0.000063610474,0.000024529754,0.10491809,0.0016816355,0.8681299,0.024916,0.000017347335],"about_ca_topic_score_codex":0.0026701095,"about_ca_topic_score_gemma":0.0019288512,"teacher_disagreement_score":0.0075494875,"about_ca_system_score_codex":0.0013352571,"about_ca_system_score_gemma":0.0011574086,"threshold_uncertainty_score":0.02525556},"labels":[],"label_agreement":null},{"id":"W1872385342","doi":"10.5539/cis.v8n4p1","title":"Effects of Improved-Floor Function on the Accuracy of Bilinear Interpolation Algorithm","year":2015,"lang":"en","type":"article","venue":"Computer and Information Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilinear interpolation; Rounding; Multiplicative inverse; Modulo operation; Interpolation (computer graphics); Integer (computer science); Remainder; Multiplicative function; Inverse","score_opus":0.016077166721830193,"score_gpt":0.2682538363060319,"score_spread":0.2521766695842017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872385342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39999196,0.0033434653,0.58209956,0.000543719,0.0004507342,0.00008164914,0.00013563497,0.0034790584,0.0098741315],"genre_scores_gemma":[0.8865077,0.00047158095,0.111425325,0.0001062725,0.00005792705,0.000024396471,0.00007744935,0.00012977947,0.0011995242],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967404,0.0009614795,0.00023141687,0.0003234271,0.001322771,0.00042048254],"domain_scores_gemma":[0.9896007,0.005700958,0.0008137329,0.0017534383,0.0019388921,0.00019214612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002662481,0.00089375256,0.0006875425,0.00093131297,0.00068346394,0.0008421358,0.0009042865,0.0007021182,0.0034886173],"category_scores_gemma":[0.0147316735,0.00027270112,0.00048303755,0.0008845672,0.0006441112,0.0015977755,0.0008877834,0.0009921427,0.0006091064],"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.0070962985,0.00032215982,0.01073646,0.001040991,0.00015291722,0.00082149974,0.0007721696,0.21774727,0.17416061,0.03555554,0.0034164144,0.5481776],"study_design_scores_gemma":[0.000106265885,0.0020043491,0.0050503546,0.0001169847,0.00017157177,0.0011692831,0.0002483348,0.62903327,0.34785557,0.005085721,0.009006571,0.00015170308],"about_ca_topic_score_codex":0.0010390319,"about_ca_topic_score_gemma":0.00067862624,"teacher_disagreement_score":0.0034886173,"about_ca_system_score_codex":0.00057544204,"about_ca_system_score_gemma":0.0007114032,"threshold_uncertainty_score":0.014080703},"labels":[],"label_agreement":null},{"id":"W1872673676","doi":"10.1109/arith.1989.72826","title":"Algorithm design for a 30-bit integrated logarithmic processor","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Logarithm; Computer science; Coding (social sciences); Table (database); Subtraction; Parallel computing; Lookup table; Data compression; Arithmetic; Key (lock); Nonlinear system; Computer hardware; Algorithm; Mathematics; Operating system; Statistics","score_opus":0.04189988152922689,"score_gpt":0.29715621104923706,"score_spread":0.25525632952001015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1872673676","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019938406,0.000105249776,0.9912247,0.00009614243,0.000039782168,0.000097062955,0.00004126907,0.0011367394,0.005265147],"genre_scores_gemma":[0.056037474,0.00021541512,0.93218523,0.0001240348,0.000037498994,0.0003580833,0.00027549046,0.00016670217,0.010600132],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966574,0.000045097662,0.000025723235,0.00006224231,0.00016275642,0.000038395265],"domain_scores_gemma":[0.99979657,0.000040874867,0.00001848286,0.000023118871,0.000106297826,0.000014618872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004088121,0.0006289692,0.00045004417,0.0006302894,0.00057400006,0.0013091187,0.0013639838,0.0006760187,0.01956472],"category_scores_gemma":[0.00090060197,0.00026298797,0.0003710749,0.0006184375,0.00031992473,0.0009431941,0.0007015236,0.0006146377,0.007923861],"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.00040410273,0.00012128714,0.0009387215,0.00047995048,0.000056824945,0.00034799144,0.00026281804,0.18990964,0.046267137,0.09018752,0.01945242,0.6515716],"study_design_scores_gemma":[0.00018647945,0.00030079315,0.0003169416,0.00009490029,0.000039217484,0.0004825027,0.000102810234,0.88024026,0.020548929,0.02552062,0.07212352,0.000042981952],"about_ca_topic_score_codex":0.00185783,"about_ca_topic_score_gemma":0.0028314725,"teacher_disagreement_score":0.01956472,"about_ca_system_score_codex":0.00071619416,"about_ca_system_score_gemma":0.0015008327,"threshold_uncertainty_score":0.06545049},"labels":[],"label_agreement":null},{"id":"W1898422521","doi":"10.1109/iscas.2002.1011427","title":"A comparison of automatic word length optimization procedures","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Department of National Defence; Polytechnique Montréal","funders":"","keywords":"Word (group theory); Word length; Testbed; Computer science; Point (geometry); Algorithm; Floating point; Exploit; Mathematics; Natural language processing","score_opus":0.03247539181759063,"score_gpt":0.3406031529151868,"score_spread":0.30812776109759615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1898422521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121332936,0.0018234082,0.8535477,0.00023651162,0.00017485571,0.0006371859,0.00038016587,0.011901396,0.0099658435],"genre_scores_gemma":[0.23706298,0.0007892991,0.754831,0.00015242012,0.00004833452,0.00055495685,0.0008667922,0.002837523,0.0028566527],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9936173,0.001695339,0.00095874065,0.0005555339,0.002895857,0.0002773356],"domain_scores_gemma":[0.98179674,0.009485975,0.0014757583,0.0029373784,0.0041060685,0.00019808092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039864294,0.0010850865,0.00086096924,0.0024856615,0.00080906565,0.0014931216,0.0022671896,0.0009215601,0.0054543605],"category_scores_gemma":[0.027959602,0.00057908794,0.00082696264,0.002108934,0.0005291021,0.0020406633,0.001269648,0.0009149104,0.0015699913],"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.0015930803,0.00048657172,0.0017411432,0.000690988,0.0001627922,0.000120438395,0.0004250216,0.1015773,0.04127717,0.015360352,0.0037005853,0.8328646],"study_design_scores_gemma":[0.0004764933,0.0029373867,0.005580616,0.00024755948,0.00024703378,0.00084036274,0.00051701383,0.6568495,0.2813388,0.011628819,0.0389614,0.00037499052],"about_ca_topic_score_codex":0.0016105942,"about_ca_topic_score_gemma":0.0017779666,"teacher_disagreement_score":0.0054543605,"about_ca_system_score_codex":0.0008239517,"about_ca_system_score_gemma":0.0019501694,"threshold_uncertainty_score":0.02108252},"labels":[],"label_agreement":null},{"id":"W1906421350","doi":"10.1090/mcom/3046","title":"Rigorous numerics for analytic solutions of differential equations: the radii polynomial approach","year":2015,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":73,"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é Laval","funders":"National Science Foundation","keywords":"Mathematics; Homoclinic orbit; Nonlinear system; Polynomial; Ordinary differential equation; Bounding overwatch; Operator (biology); Interval arithmetic; Mathematical analysis; Applied mathematics; Differential equation; Partial differential equation","score_opus":0.11113804743670994,"score_gpt":0.32450365180085206,"score_spread":0.21336560436414212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906421350","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048423395,0.0015507459,0.97603774,0.0008364869,0.00025354925,0.00003106659,0.000093839546,0.00045485533,0.015899397],"genre_scores_gemma":[0.27854818,0.0055478606,0.68504494,0.00051457307,0.0010733536,0.00049791014,0.00045813588,0.0028758065,0.025439229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974456,0.0011632211,0.00012835942,0.00016748987,0.0009704489,0.00012483665],"domain_scores_gemma":[0.99628663,0.0020548303,0.00029178453,0.0005400331,0.00068534556,0.00014126055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045259004,0.0014062593,0.00093868247,0.0022208095,0.00074515434,0.0027600639,0.0018710179,0.0011705924,0.0068844226],"category_scores_gemma":[0.018117106,0.00056092325,0.0013141818,0.0013115897,0.0021016232,0.005396673,0.002633751,0.0034559139,0.0030905998],"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.00003248852,0.000017006096,0.000172013,0.00016965072,0.000016219097,0.0000586073,0.00014068495,0.04509944,0.0016473294,0.92253613,0.0040102876,0.026100053],"study_design_scores_gemma":[0.000012881565,0.000021015316,0.00015357541,0.000057883546,0.0000086471355,0.000035391127,0.000040897026,0.54651904,0.0009780675,0.43837693,0.013773954,0.000021738522],"about_ca_topic_score_codex":0.0020131385,"about_ca_topic_score_gemma":0.0012012103,"teacher_disagreement_score":0.0068844226,"about_ca_system_score_codex":0.0016446876,"about_ca_system_score_gemma":0.0013346577,"threshold_uncertainty_score":0.023935556},"labels":[],"label_agreement":null},{"id":"W1927976700","doi":"10.1109/mwscas.1997.662172","title":"Crossover and mutation in genetic algorithms employing canonical signed-digit number system","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Crossover; Mutation; Algorithm; Computer science; Genetic algorithm; Process (computing); Arithmetic; Mathematics; Artificial intelligence; Machine learning; Genetics","score_opus":0.02382034626873698,"score_gpt":0.272765932123383,"score_spread":0.24894558585464605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1927976700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015981335,0.00058878853,0.9811684,0.00009180474,0.00013265498,0.00005446819,0.000010413663,0.00027793308,0.0016942293],"genre_scores_gemma":[0.28482676,0.0010283277,0.710789,0.00012691948,0.00007509231,0.0001447467,0.00005389922,0.00008848712,0.0028666602],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888176,0.0004230198,0.00006640293,0.00016366845,0.0004009772,0.000064201886],"domain_scores_gemma":[0.9989354,0.0005730071,0.00012775247,0.00014114786,0.00018871017,0.000033893968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017187339,0.00052856276,0.00066177186,0.0008528892,0.00047887117,0.0009822526,0.0007932985,0.0008798631,0.00081325107],"category_scores_gemma":[0.005416008,0.00021593727,0.0004046095,0.0011965596,0.0012836759,0.0010803033,0.00071778585,0.0008269098,0.0003132501],"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.00024878661,0.000064469285,0.0014800273,0.00035378966,0.000063217754,0.00047877853,0.00034124064,0.32411957,0.020501208,0.23616521,0.0012813712,0.41490233],"study_design_scores_gemma":[0.0000654671,0.00025971854,0.0003581456,0.00005478318,0.00005701898,0.0006361397,0.000062059305,0.89973944,0.019796,0.06806802,0.01084748,0.00005584446],"about_ca_topic_score_codex":0.0008508777,"about_ca_topic_score_gemma":0.0008379643,"teacher_disagreement_score":0.0017187339,"about_ca_system_score_codex":0.00048979174,"about_ca_system_score_gemma":0.00084834226,"threshold_uncertainty_score":0.009089649},"labels":[],"label_agreement":null},{"id":"W1957845436","doi":"10.1109/mwscas.1997.666113","title":"Overlap resolution: continuous valued digits for hybrid architectures","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Very-large-scale integration; Signal processing; Coding (social sciences); Computation; Digital signal processing; Analog signal processing; Simple (philosophy); Computer hardware; Algorithm; Computer engineering; Arithmetic; Mathematics; Embedded system","score_opus":0.031194517763628776,"score_gpt":0.2687727839514231,"score_spread":0.23757826618779435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1957845436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034444556,0.0009060179,0.9505357,0.00018025853,0.000114095594,0.00004264002,0.000056605117,0.000860332,0.012859807],"genre_scores_gemma":[0.5316362,0.00071632303,0.45934522,0.00024208755,0.00017604705,0.00009835774,0.00014262056,0.00010303391,0.0075401026],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996567,0.00007115257,0.000020219679,0.000052253097,0.00016660058,0.000033106127],"domain_scores_gemma":[0.9995739,0.00016888644,0.000039905633,0.00011759663,0.00007327754,0.00002644306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005052304,0.00046276764,0.0003035236,0.0005950905,0.00035029848,0.0012716504,0.0006124005,0.00060306094,0.0056268172],"category_scores_gemma":[0.0014634242,0.00016336296,0.00022642854,0.00060936913,0.0006101697,0.001414154,0.00081392366,0.0006555308,0.0010760546],"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.000696352,0.000063316955,0.0004905816,0.00024639498,0.000034609304,0.00030948006,0.00019756408,0.03234906,0.075042106,0.42957833,0.0038695761,0.45712268],"study_design_scores_gemma":[0.00017790479,0.0006719309,0.00066407805,0.00017280148,0.00006814271,0.0013364345,0.00013744443,0.49685502,0.116586566,0.31952086,0.06371377,0.00009498785],"about_ca_topic_score_codex":0.00014140474,"about_ca_topic_score_gemma":0.00022904176,"teacher_disagreement_score":0.0056268172,"about_ca_system_score_codex":0.00026501215,"about_ca_system_score_gemma":0.000234327,"threshold_uncertainty_score":0.018823624},"labels":[],"label_agreement":null},{"id":"W1965811650","doi":"10.1007/s11265-013-0742-6","title":"Decimal Division Algorithms: The Issue of Partial Remainders","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Division (mathematics); Division algorithm; Divisor (algebraic geometry); Arithmetic; Decimal; Numerical digit; Mathematics; Quotient; Algorithm; Remainder; Generalization; Set (abstract data type); Operand; Computer science; Discrete mathematics; Combinatorics","score_opus":0.022434748565534686,"score_gpt":0.28391382534675375,"score_spread":0.26147907678121907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965811650","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02174728,0.055005524,0.8563906,0.011400048,0.006649906,0.00006546496,0.00023251436,0.00054698286,0.04796162],"genre_scores_gemma":[0.543012,0.04818255,0.3383673,0.0042677894,0.01973002,0.00015688599,0.00059702236,0.0012466747,0.044439755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972941,0.0010501262,0.00021113195,0.00038724605,0.0008762893,0.00018105116],"domain_scores_gemma":[0.99128634,0.004955398,0.0003717591,0.0021655883,0.0010325508,0.00018832234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040581385,0.0010601034,0.0012895106,0.0015648782,0.0011195927,0.0053877453,0.0013140474,0.0017527246,0.0057229158],"category_scores_gemma":[0.023997664,0.000577805,0.000597007,0.003317857,0.003099965,0.0077295746,0.0026095642,0.0043057287,0.0026390348],"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.00037768012,0.00004345366,0.0004832874,0.00028866998,0.00003581689,0.00014754228,0.0001763519,0.013370087,0.0013208361,0.7418936,0.026509698,0.21535307],"study_design_scores_gemma":[0.00004731501,0.00007525876,0.00017758628,0.00020918374,0.000028555116,0.00050942466,0.000083164705,0.06425136,0.003922354,0.86551386,0.065145425,0.00003663711],"about_ca_topic_score_codex":0.00033283458,"about_ca_topic_score_gemma":0.00039717674,"teacher_disagreement_score":0.0057229158,"about_ca_system_score_codex":0.0009352325,"about_ca_system_score_gemma":0.0009538003,"threshold_uncertainty_score":0.021461725},"labels":[],"label_agreement":null},{"id":"W1966566700","doi":"10.1145/1394042.1394096","title":"Detecting polynomial perfect powers (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and 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 Waterloo","funders":"","keywords":"Lacunary function; Polynomial; Perfect power; Mathematics; Finite field; Integer (computer science); Power (physics); Field (mathematics); Discrete mathematics; Combinatorics; Computer science; Pure mathematics","score_opus":0.05866989292685982,"score_gpt":0.323229655634231,"score_spread":0.2645597627073712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966566700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38307726,0.0008853202,0.58979183,0.0022204178,0.0003628966,0.00026121057,0.0012558623,0.0035278075,0.018617406],"genre_scores_gemma":[0.921375,0.00021284941,0.07247366,0.00029507396,0.00017152734,0.000057076384,0.00089044985,0.00024054176,0.0042837774],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970732,0.00048740095,0.00020023755,0.0009415798,0.0008112484,0.0004863066],"domain_scores_gemma":[0.9887321,0.006172716,0.00096449244,0.0025975034,0.0010415327,0.0004915321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018403699,0.0008002101,0.0013925578,0.0009764043,0.0010302367,0.0019118903,0.0013704749,0.0011731683,0.007927096],"category_scores_gemma":[0.017482646,0.00061126833,0.0008602394,0.0010910331,0.0029642237,0.008026002,0.0042020124,0.0014960249,0.0017995095],"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.004013799,0.00033346898,0.033834487,0.0017565084,0.00023543366,0.004029695,0.0014277222,0.09013827,0.061804,0.35204783,0.03591236,0.41446647],"study_design_scores_gemma":[0.00017734319,0.0004488672,0.0023261954,0.00014666346,0.00008876174,0.0017511827,0.00057002745,0.25876644,0.08492866,0.63590956,0.014798447,0.00008787492],"about_ca_topic_score_codex":0.0009317141,"about_ca_topic_score_gemma":0.00096640707,"teacher_disagreement_score":0.007927096,"about_ca_system_score_codex":0.0008701357,"about_ca_system_score_gemma":0.00094888924,"threshold_uncertainty_score":0.026518762},"labels":[],"label_agreement":null},{"id":"W1967444872","doi":"10.1007/s11265-013-0795-6","title":"Area Efficient Sequential Decimal Fixed-point Multiplier","year":2013,"lang":"en","type":"article","venue":"Journal of Signal Processing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"University of Saskatchewan","keywords":"Adder; Decimal; Arithmetic; Multiplier (economics); Operand; Computer science; Computation; Mathematics; Parallel computing; Algorithm; Latency (audio); Computer hardware; Telecommunications","score_opus":0.025841340555624412,"score_gpt":0.2712819439382788,"score_spread":0.2454406033826544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967444872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051342163,0.0018353005,0.9103951,0.0005065024,0.0005454374,0.00010174308,0.00032696995,0.0024085674,0.03253818],"genre_scores_gemma":[0.41932145,0.00085863075,0.54631567,0.0003873409,0.00024821705,0.00018226486,0.000500833,0.00019111707,0.031994488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996449,0.000064056374,0.000028881448,0.00008207231,0.00011881767,0.00006130575],"domain_scores_gemma":[0.99960333,0.00010189745,0.000029342014,0.00009751446,0.00014876823,0.00001923124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169674,0.0009582671,0.0005580314,0.0008454436,0.00060304714,0.0009764554,0.0009613833,0.00039947708,0.013769938],"category_scores_gemma":[0.0011961608,0.00022144699,0.00030645658,0.0011382283,0.00033551003,0.0010879459,0.00092716765,0.00057874084,0.0032609673],"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.0016257073,0.00013330752,0.00058777415,0.0003871687,0.00008041294,0.00030283834,0.00012800793,0.029416438,0.077472016,0.07900013,0.021397488,0.7894687],"study_design_scores_gemma":[0.00057324144,0.0015608204,0.0016241693,0.00023048792,0.00026832704,0.0021931,0.00020817359,0.48134166,0.21809173,0.15543562,0.13834614,0.00012652717],"about_ca_topic_score_codex":0.00085522194,"about_ca_topic_score_gemma":0.0021646165,"teacher_disagreement_score":0.013769938,"about_ca_system_score_codex":0.0005479152,"about_ca_system_score_gemma":0.0010042198,"threshold_uncertainty_score":0.046064973},"labels":[],"label_agreement":null},{"id":"W1967476488","doi":"10.1145/2457443.2457444","title":"Self-Alignment Schemes for the Implementation of Addition-Related Floating-Point Operators","year":2013,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Computer science; Field-programmable gate array; Floating point; Realization (probability); Point (geometry); Operator (biology); Computer hardware; Computer engineering; Parallel computing; Algorithm","score_opus":0.013986248498565045,"score_gpt":0.2729182783595705,"score_spread":0.25893202986100544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967476488","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047376867,0.0007012917,0.9433651,0.000106837426,0.00023672286,0.00009633647,0.000079890495,0.0018942968,0.0061427415],"genre_scores_gemma":[0.42637998,0.0005275252,0.5671507,0.00015745952,0.00015110523,0.00011090849,0.00023125579,0.00013546483,0.00515559],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99958044,0.00006727756,0.000056655652,0.000054308723,0.00020275882,0.000038597605],"domain_scores_gemma":[0.99925476,0.00019223828,0.00014008765,0.00021376833,0.00017874151,0.000020290501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004295779,0.00049590616,0.00021376483,0.00075177866,0.0004190311,0.0006473514,0.0008275917,0.0002434946,0.0030050743],"category_scores_gemma":[0.0012785632,0.0001768635,0.00029234143,0.00073079794,0.00043005767,0.001083261,0.0005332398,0.0006110208,0.00078700343],"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.0006602938,0.00013701849,0.00101569,0.00046801232,0.00006193897,0.00028129737,0.00047207339,0.019585205,0.21706764,0.1811311,0.005247516,0.57387215],"study_design_scores_gemma":[0.0001586382,0.0018232643,0.0013012922,0.00015920366,0.00012818152,0.0012770287,0.00019148836,0.26520848,0.58957356,0.049190234,0.09087576,0.00011293655],"about_ca_topic_score_codex":0.00030706782,"about_ca_topic_score_gemma":0.0006504181,"teacher_disagreement_score":0.0030050743,"about_ca_system_score_codex":0.00032853914,"about_ca_system_score_gemma":0.0005375865,"threshold_uncertainty_score":0.010053039},"labels":[],"label_agreement":null},{"id":"W1967747780","doi":"10.1007/s10703-005-2256-8","title":"Formalization of Fixed-Point Arithmetic in HOL","year":2005,"lang":"en","type":"article","venue":"Formal Methods in System Design","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Saturation arithmetic; Arithmetic; Correctness; Fixed-point arithmetic; Fixed point; HOL; Quantization (signal processing); Subtraction; Multiplication (music); Computer science; Division (mathematics); Mathematics; Arbitrary-precision arithmetic; Algorithm; Floating point; Programming language","score_opus":0.04486791107813676,"score_gpt":0.3591851560632732,"score_spread":0.31431724498513647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967747780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010135454,0.00037296407,0.9624166,0.0005435675,0.00016911759,0.00006117596,0.00014640151,0.00084275095,0.02531201],"genre_scores_gemma":[0.5860705,0.0011205357,0.3916471,0.00080485415,0.0004882488,0.00030801745,0.00058426976,0.00078751164,0.0181891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982497,0.00042471164,0.00014733008,0.00025473308,0.00070641533,0.0002171299],"domain_scores_gemma":[0.9981627,0.0008174743,0.00010621737,0.0004399532,0.00041034594,0.00006327944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024182263,0.00069955917,0.0007135315,0.001385501,0.001010145,0.0035461227,0.002096567,0.0008596493,0.007696569],"category_scores_gemma":[0.0037740704,0.0005227507,0.0014395007,0.0009910922,0.004543575,0.0047048815,0.0024670605,0.0033837478,0.0013445485],"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.000016246744,0.000010872113,0.00005100901,0.000055547152,0.000007210103,0.000028676868,0.00013380947,0.0022923376,0.00049457414,0.98782814,0.00057259435,0.00850899],"study_design_scores_gemma":[0.000025821264,0.000021620117,0.00006680589,0.000041891504,0.000018820658,0.000054123924,0.00005568172,0.012157055,0.0018826656,0.9742522,0.011407788,0.000015535006],"about_ca_topic_score_codex":0.001233792,"about_ca_topic_score_gemma":0.0010917,"teacher_disagreement_score":0.007696569,"about_ca_system_score_codex":0.0014988483,"about_ca_system_score_gemma":0.0013910804,"threshold_uncertainty_score":0.025747597},"labels":[],"label_agreement":null},{"id":"W1969155620","doi":"10.1090/s0025-5718-07-01931-x","title":"Error bounds on complex floating-point multiplication","year":2007,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Arithmetic underflow; Double-precision floating-point format; Arithmetic; Base (topology); Floating point; Single-precision floating-point format; Multiplication (music); Product (mathematics); IEEE floating point; Value (mathematics); Approximation error; Discrete mathematics; Algorithm; Combinatorics; Mathematical analysis; Geometry; Computer science; Statistics","score_opus":0.06061191258833785,"score_gpt":0.35902135795128626,"score_spread":0.2984094453629484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969155620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043344215,0.0051755616,0.84547496,0.003488718,0.0015361262,0.00006958407,0.0007059704,0.0020155732,0.098189406],"genre_scores_gemma":[0.7790099,0.003674528,0.1616793,0.0012204231,0.0014733218,0.000335085,0.0014203778,0.0023065398,0.048880585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99223375,0.0011061551,0.00041934036,0.001134657,0.004240069,0.0008659666],"domain_scores_gemma":[0.9721868,0.017151976,0.0013041357,0.0041282303,0.0045645107,0.00066436006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066934563,0.0021945846,0.0014544112,0.0027943316,0.0013316415,0.004502727,0.0024033778,0.0014665386,0.013939302],"category_scores_gemma":[0.041288935,0.0006229791,0.001288542,0.002065411,0.0045832936,0.006924685,0.0056567425,0.004534956,0.0049198135],"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.0009980913,0.00006972948,0.00222209,0.00051646616,0.00010496936,0.00042200266,0.00046612887,0.10617497,0.0046585845,0.79242224,0.014136566,0.07780816],"study_design_scores_gemma":[0.00004009782,0.00008289965,0.00065408286,0.00029305054,0.00004943625,0.00023867142,0.00010272553,0.45709231,0.008017148,0.5197058,0.013660179,0.00006362541],"about_ca_topic_score_codex":0.0027775867,"about_ca_topic_score_gemma":0.0019806875,"teacher_disagreement_score":0.013939302,"about_ca_system_score_codex":0.0032077543,"about_ca_system_score_gemma":0.0021247477,"threshold_uncertainty_score":0.046631575},"labels":[],"label_agreement":null},{"id":"W1970727540","doi":"10.1109/arith.2009.9","title":"A Decimal Floating-Point Adder with Decoded Operands and a Decimal Leading-Zero Anticipator","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Decimal; Adder; Computer science; Arithmetic; Operand; Carry-save adder; Subtraction; Microprocessor; Floating point; Parallel computing; Computer hardware; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.01647971254856314,"score_gpt":0.2883231375576311,"score_spread":0.271843425009068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970727540","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057707854,0.0025146173,0.913818,0.0008757358,0.0011107271,0.00021833825,0.0006438086,0.004428718,0.018682214],"genre_scores_gemma":[0.27053484,0.001843718,0.7053682,0.0006776663,0.000267756,0.00011728816,0.000718695,0.000120343204,0.0203514],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99970883,0.000028418208,0.00004342762,0.00005463468,0.00013186957,0.000032807],"domain_scores_gemma":[0.9997117,0.000049921713,0.00003654068,0.000038591006,0.00013826972,0.000024973535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030781934,0.00043813704,0.00039437762,0.0006521664,0.00060791976,0.00084578805,0.0010050485,0.00045188295,0.002874833],"category_scores_gemma":[0.0008339428,0.00034752782,0.0004303025,0.000774224,0.00029295107,0.0016083806,0.0005623083,0.00072943413,0.0012757296],"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.0008854299,0.00009703428,0.0007648301,0.0006322565,0.000096918666,0.0010625453,0.0002227936,0.011335818,0.36306998,0.08056629,0.01247522,0.52879083],"study_design_scores_gemma":[0.00018901641,0.001295406,0.001334495,0.0001688918,0.0003912573,0.0045738616,0.000102742524,0.15678483,0.6225758,0.018174892,0.19422118,0.00018750988],"about_ca_topic_score_codex":0.00068965595,"about_ca_topic_score_gemma":0.0017903398,"teacher_disagreement_score":0.002874833,"about_ca_system_score_codex":0.0005589587,"about_ca_system_score_gemma":0.0012327073,"threshold_uncertainty_score":0.009617209},"labels":[],"label_agreement":null},{"id":"W1971185099","doi":"10.1109/iccd.2010.5647750","title":"Combined optimal and heuristic approaches for multiple constant multiplication","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Heuristics; Pruning; Constant (computer programming); Computer science; Heuristic; Multiplication (music); Focus (optics); Mathematical optimization; Reuse; Bounded function; Algorithm; Adder; Mathematics","score_opus":0.04321531096769199,"score_gpt":0.27660089237686275,"score_spread":0.23338558140917076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971185099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003984852,0.00068417966,0.99032646,0.00012783085,0.000059869646,0.00004189164,0.000023036087,0.00030695368,0.0044449023],"genre_scores_gemma":[0.10581103,0.000610251,0.8912986,0.00011755696,0.00007129442,0.00013244437,0.00007890519,0.00012599806,0.0017539345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985232,0.00033248914,0.000069249356,0.00017469657,0.00072981603,0.00017060679],"domain_scores_gemma":[0.9987715,0.00063727895,0.00012480226,0.00018074772,0.00023441185,0.000051257248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012655021,0.0010786,0.0010830258,0.0017677492,0.0005837818,0.0012657649,0.0017609197,0.0010689283,0.0046216827],"category_scores_gemma":[0.004376089,0.00078672677,0.0008805483,0.0017335569,0.0011448697,0.0017122787,0.0010370333,0.0014116996,0.00068982417],"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.00009692303,0.0001065763,0.0003391374,0.0002736666,0.0000618136,0.00007533386,0.000053349348,0.72920763,0.0035139655,0.092560485,0.003453978,0.17025718],"study_design_scores_gemma":[0.000039436924,0.00004409151,0.000054768887,0.000025396284,0.000015738713,0.00004651687,0.00001635472,0.95768577,0.0016696003,0.036138937,0.0042492887,0.00001415888],"about_ca_topic_score_codex":0.0029425554,"about_ca_topic_score_gemma":0.004315587,"teacher_disagreement_score":0.0046216827,"about_ca_system_score_codex":0.0011674133,"about_ca_system_score_gemma":0.0025733379,"threshold_uncertainty_score":0.015461087},"labels":[],"label_agreement":null},{"id":"W1971221279","doi":"10.5555/2133429.2133586","title":"Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits","year":2010,"lang":"en","type":"article","venue":"International Conference on Computer Aided Design","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"Robustness (evolution); Polynomial; Scaling; Fixed-point arithmetic; Algorithm; Computation; Mathematics; Set (abstract data type); Electronic circuit; Fixed point; Computer science; Floating point; Arithmetic","score_opus":0.06669109764217149,"score_gpt":0.3337116421943614,"score_spread":0.26702054455218993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971221279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027235443,0.0008858892,0.9679509,0.00012547182,0.000043270942,0.00004251307,0.000021186663,0.00045094732,0.0032443784],"genre_scores_gemma":[0.6916703,0.0012492683,0.3047004,0.000113412636,0.0000895197,0.00011174073,0.00007320375,0.00020267177,0.0017893988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978377,0.0003442597,0.000098190845,0.00020819025,0.0013923238,0.00011940091],"domain_scores_gemma":[0.9970566,0.001660773,0.00031329328,0.00056056835,0.0003828501,0.000025906442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015306496,0.0011193366,0.0006483899,0.0010017863,0.00047104456,0.0010054997,0.00092904054,0.0005414991,0.0016680633],"category_scores_gemma":[0.007638833,0.0003795765,0.0007029055,0.00075304275,0.000868895,0.0017594812,0.00081022864,0.0012703357,0.00030914164],"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.00054127077,0.000060396676,0.0013307407,0.00060047524,0.00012199255,0.00039959745,0.00033513672,0.35754928,0.19029969,0.15091513,0.0011247749,0.29672146],"study_design_scores_gemma":[0.00004845551,0.00048112165,0.00083563715,0.00017921062,0.00011878063,0.00041514848,0.000048310485,0.7890674,0.14347488,0.055605102,0.009661126,0.00006485078],"about_ca_topic_score_codex":0.00043177165,"about_ca_topic_score_gemma":0.0004754077,"teacher_disagreement_score":0.0016680633,"about_ca_system_score_codex":0.00094150973,"about_ca_system_score_gemma":0.00065064756,"threshold_uncertainty_score":0.008094907},"labels":[],"label_agreement":null},{"id":"W1974678454","doi":"10.1145/1394042.1394060","title":"Computational complexity of numerical solutions of initial value problems for differential algebraic equations (abstract only)","year":2008,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and 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":"Western University","funders":"","keywords":"Mathematics; Ordinary differential equation; Polynomial; Algebraic number; Ode; Differential equation; Differential (mechanical device); Applied mathematics; Class (philosophy); Exponential function; Differential algebraic equation; Value (mathematics); Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.17770210566112915,"score_gpt":0.37951268894123513,"score_spread":0.20181058328010598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974678454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3726266,0.0015581133,0.59390295,0.0042149057,0.00026306318,0.00019679789,0.0003133405,0.00062657817,0.026297584],"genre_scores_gemma":[0.8416952,0.0005686903,0.15276931,0.00021822998,0.0001094166,0.0002085688,0.0003594564,0.00021538865,0.0038557518],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865854,0.000587331,0.0000648921,0.00015323564,0.0003692213,0.00016681752],"domain_scores_gemma":[0.982011,0.01612012,0.0004517465,0.0005841941,0.00061811117,0.00021482578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026845618,0.00066334195,0.0008103221,0.00051001966,0.0006397881,0.0016805921,0.00090286246,0.00093886984,0.00396626],"category_scores_gemma":[0.015754173,0.00033672803,0.0006986081,0.0006133208,0.0014112251,0.0016392985,0.0013985038,0.0015716149,0.0003355956],"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.0005553391,0.0001420094,0.003497668,0.00039250538,0.000075645665,0.00019129584,0.00020486148,0.8322898,0.004070608,0.08824668,0.0029729202,0.06736069],"study_design_scores_gemma":[0.000016557795,0.000023088698,0.000205263,0.000008801776,0.000005400121,0.000012642179,0.000018157489,0.98027325,0.00077810447,0.018399782,0.0002547574,0.0000042654806],"about_ca_topic_score_codex":0.003059461,"about_ca_topic_score_gemma":0.0026021565,"teacher_disagreement_score":0.00396626,"about_ca_system_score_codex":0.0013090109,"about_ca_system_score_gemma":0.0012544021,"threshold_uncertainty_score":0.014197469},"labels":[],"label_agreement":null},{"id":"W1975570043","doi":"10.1109/tcad.2011.2170988","title":"Analytical Optimization of Bit-Widths in Fixed-Point LTI Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fixed-point arithmetic; Robustness (evolution); Electronic circuit; Algorithm; Computer science; Quantization (signal processing); Range (aeronautics); Fixed point; LTI system theory; Mathematics; Floating point; Mathematical optimization; Linear system","score_opus":0.046932495312888914,"score_gpt":0.27105628319333386,"score_spread":0.22412378788044496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975570043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028823879,0.000610024,0.96473086,0.00016113975,0.000020964486,0.00003343448,0.000056895067,0.0004186772,0.005144097],"genre_scores_gemma":[0.90236056,0.0006336834,0.09478163,0.000063148706,0.00001405778,0.00011398173,0.00007180165,0.00015563786,0.001805511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955124,0.00010703733,0.000025198722,0.00006011338,0.00019703052,0.000059401424],"domain_scores_gemma":[0.9989065,0.0007068693,0.00017443579,0.00007017334,0.00012345178,0.000018494235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009332115,0.00080887246,0.00042564957,0.0004916169,0.00034617636,0.0011029441,0.00068485405,0.0005216646,0.0020249083],"category_scores_gemma":[0.0036713767,0.0004158026,0.00027971077,0.0005816516,0.00068829936,0.0010143081,0.0004975961,0.00068196293,0.00037642074],"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.00003812675,0.000009164506,0.00014542455,0.00007170698,0.000007885274,0.000025682253,0.000051605362,0.94640046,0.006772474,0.022858,0.00025804382,0.02336138],"study_design_scores_gemma":[0.000005655299,0.000019354986,0.000039826806,0.000013876435,0.000003814005,0.00000923621,0.0000092156115,0.98881793,0.0030098238,0.007727088,0.00033969482,0.000004459291],"about_ca_topic_score_codex":0.0013552791,"about_ca_topic_score_gemma":0.0016638476,"teacher_disagreement_score":0.0020249083,"about_ca_system_score_codex":0.0010564055,"about_ca_system_score_gemma":0.0007297568,"threshold_uncertainty_score":0.0076647997},"labels":[],"label_agreement":null},{"id":"W1976872979","doi":"10.1587/nolta.3.287","title":"DC operating points of transistor circuits","year":2012,"lang":"en","type":"article","venue":"Nonlinear Theory and Its Applications IEICE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Electronic circuit; Transistor; Nonlinear system; Electronic engineering; Bipolar junction transistor; Field (mathematics); Field-effect transistor; Computer science; Electrical engineering; Engineering; Mathematics; Physics; Voltage; Quantum mechanics; Pure mathematics","score_opus":0.02200192949743793,"score_gpt":0.298938791873764,"score_spread":0.27693686237632603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976872979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05558916,0.007481507,0.8163919,0.0006447319,0.00023186367,0.000121423414,0.00041092825,0.00054613187,0.11858243],"genre_scores_gemma":[0.8729923,0.00701685,0.09990887,0.00028181335,0.00028262887,0.00030692096,0.00034383158,0.00020196592,0.01866488],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997079,0.000056994442,0.000014439838,0.000058947044,0.00012621794,0.00003553716],"domain_scores_gemma":[0.9994072,0.00031228267,0.0000588732,0.000060031332,0.00013958036,0.00002201914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030815293,0.00048141312,0.0003860349,0.0014671156,0.0005158249,0.0012717721,0.0007677861,0.0008629477,0.0062038405],"category_scores_gemma":[0.0025775246,0.00023785538,0.00030099292,0.0009981836,0.0010107572,0.0013727692,0.000657937,0.0010490642,0.0014397791],"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.00006125852,0.000029331284,0.00051997934,0.0003419195,0.000016030552,0.00015529647,0.00030817997,0.074609675,0.017310074,0.8493201,0.0027710225,0.054557122],"study_design_scores_gemma":[0.000022818978,0.0000671012,0.00047606186,0.0001876561,0.000018785458,0.0004812213,0.00014965859,0.42833707,0.010970625,0.5280334,0.03121351,0.00004214492],"about_ca_topic_score_codex":0.0005186405,"about_ca_topic_score_gemma":0.00025075534,"teacher_disagreement_score":0.0062038405,"about_ca_system_score_codex":0.00065910723,"about_ca_system_score_gemma":0.00029906043,"threshold_uncertainty_score":0.02075386},"labels":[],"label_agreement":null},{"id":"W1976996892","doi":"10.1007/s10288-014-0269-0","title":"A reliable affine relaxation method for global optimization","year":2014,"lang":"en","type":"article","venue":"4OR","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"Agence Nationale de la Recherche","keywords":"Interval (graph theory); Affine transformation; Interval arithmetic; Relaxation (psychology); Constraint (computer-aided design); Computation; Operator (biology); Mathematics; Mathematical optimization; Branch and bound; Affine arithmetic; Upper and lower bounds; Global optimization; Algorithm; Local consistency; Linear inequality; Linear programming relaxation; Linear programming; Inequality; Constraint satisfaction; Statistics; Combinatorics","score_opus":0.015478581835785621,"score_gpt":0.3128095133241821,"score_spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976996892","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074130786,0.00015778313,0.99627495,0.000091497444,0.00008761384,0.000017038026,0.0000491024,0.00021056086,0.0023702472],"genre_scores_gemma":[0.06753274,0.00052115327,0.919757,0.00021115172,0.00022949437,0.00020487518,0.00027988164,0.0010370031,0.010226667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990816,0.0003203213,0.000038368107,0.00011562985,0.0003947131,0.000049330643],"domain_scores_gemma":[0.9987166,0.00051528984,0.00009436253,0.00026490103,0.00034988052,0.00005896896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016202689,0.0013184401,0.0012505673,0.0009926845,0.0006606782,0.0012058618,0.0016454065,0.001709621,0.008823407],"category_scores_gemma":[0.005107614,0.00079048413,0.0011572719,0.0010619558,0.0010991467,0.0015421015,0.0021227673,0.003766106,0.0027108958],"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.00019100032,0.0000819739,0.00026020536,0.0004140666,0.000117108815,0.00013130659,0.00016921731,0.53865623,0.009509152,0.21344368,0.014160851,0.22286509],"study_design_scores_gemma":[0.000014414108,0.000032186817,0.000048533206,0.000024099685,0.000015364765,0.000028692324,0.00000976601,0.97118795,0.0013413382,0.020123603,0.0071594,0.000014596777],"about_ca_topic_score_codex":0.0024985431,"about_ca_topic_score_gemma":0.0031376698,"teacher_disagreement_score":0.008823407,"about_ca_system_score_codex":0.00054111134,"about_ca_system_score_gemma":0.0011750337,"threshold_uncertainty_score":0.029517174},"labels":[],"label_agreement":null},{"id":"W1977375620","doi":"10.1016/j.jsc.2008.11.003","title":"Symbolic–numeric sparse interpolation of multivariate polynomials","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Universiteit Antwerpen; Natural Sciences and Engineering Research Council of Canada; Mitacs; Fonds Wetenschappelijk Onderzoek; Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Mathematics; Interpolation (computer graphics); Polynomial; Applied mathematics; Floating point; Eigenvalues and eigenvectors; Polynomial interpolation; Algorithm; Algebra over a field; Pure mathematics; Linear interpolation; Mathematical analysis; Computer science; Image (mathematics)","score_opus":0.03533795481161242,"score_gpt":0.3080761204314586,"score_spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977375620","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04199856,0.00020371102,0.9469651,0.00032859348,0.0001627683,0.000022537135,0.00008276622,0.00040358488,0.009832407],"genre_scores_gemma":[0.69939876,0.00042726457,0.29044774,0.0001120044,0.00015983566,0.00004923301,0.00025496667,0.00027527747,0.008875026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960786,0.00012818628,0.00001398946,0.000030813833,0.00018178453,0.00003743863],"domain_scores_gemma":[0.9991086,0.00035059315,0.00008759146,0.00022971681,0.00018477532,0.000038753256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062957883,0.00038626275,0.00057522487,0.00074810995,0.00045336937,0.0008657166,0.0005765337,0.00045590047,0.004700074],"category_scores_gemma":[0.0049419724,0.00021764525,0.00033190328,0.0014911558,0.0007727204,0.0012283969,0.0011519761,0.0011472054,0.0007466399],"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.00031943747,0.00008359745,0.0010877443,0.00014724347,0.00003876902,0.0001594476,0.00019103364,0.30139482,0.0111401295,0.45345473,0.0043425644,0.22764051],"study_design_scores_gemma":[0.000012696334,0.000020917587,0.00012928751,0.000012953267,0.000005121131,0.000041401778,0.000021928972,0.94014204,0.0028731201,0.053479772,0.0032521777,0.000008629954],"about_ca_topic_score_codex":0.0016844205,"about_ca_topic_score_gemma":0.0030220093,"teacher_disagreement_score":0.004700074,"about_ca_system_score_codex":0.00047470923,"about_ca_system_score_gemma":0.0007631872,"threshold_uncertainty_score":0.015723288},"labels":[],"label_agreement":null},{"id":"W1978606610","doi":"10.1109/cjece.2006.259201","title":"Arithmetic formats for implementing artificial neural networks on FPGAs","year":2006,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Artificial neural network; Computer science; Field-programmable gate array; Arithmetic; Computer architecture; Artificial intelligence; Parallel computing; Embedded system; Mathematics","score_opus":0.011188931007590863,"score_gpt":0.2157850787090465,"score_spread":0.20459614770145565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978606610","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.078383125,0.001787181,0.84718275,0.0005863409,0.0008560452,0.00059968745,0.0015181964,0.02282535,0.046261396],"genre_scores_gemma":[0.47607875,0.0010309259,0.49458998,0.0005670352,0.0002304549,0.0008495468,0.00233795,0.0010622223,0.023253206],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9992236,0.0001520301,0.00015443868,0.000086728964,0.00027077214,0.00011238406],"domain_scores_gemma":[0.9986156,0.00043058864,0.00014057562,0.0003285836,0.0004420334,0.000042586707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065172394,0.0012159141,0.00047376083,0.0015271367,0.0006981638,0.0021970524,0.0023178349,0.0005985447,0.020986214],"category_scores_gemma":[0.0031978593,0.00049625704,0.00041847044,0.0019639968,0.00048562637,0.0017463072,0.0009280891,0.00096999493,0.003942966],"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.0019693524,0.00021532494,0.0018246695,0.0012097328,0.00013728994,0.00080738356,0.00040602015,0.037822895,0.04257477,0.11149403,0.044963546,0.7565751],"study_design_scores_gemma":[0.0010010174,0.0014091403,0.0020456717,0.0009900793,0.00041725155,0.0014084362,0.00065672747,0.32799384,0.35787052,0.10822143,0.19775778,0.00022811053],"about_ca_topic_score_codex":0.0024567074,"about_ca_topic_score_gemma":0.004553573,"teacher_disagreement_score":0.020986214,"about_ca_system_score_codex":0.0010836461,"about_ca_system_score_gemma":0.0010364703,"threshold_uncertainty_score":0.07020593},"labels":[],"label_agreement":null},{"id":"W1979413078","doi":"10.1117/12.619393","title":"Error analysis of data mapping using 2-dimensional logarithmic number systems","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Logarithm; Computer science; Algorithm; Floating point; Round-off error; Representation (politics); Reduction (mathematics); Variance (accounting); Error analysis; Approximation error; Matching (statistics); Arithmetic; Mathematics; Statistics","score_opus":0.040864030863281484,"score_gpt":0.29457176718950745,"score_spread":0.25370773632622595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979413078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11500226,0.00040536342,0.8814512,0.00013406944,0.000067985144,0.00003595819,0.00007835423,0.0006277757,0.0021970312],"genre_scores_gemma":[0.76475966,0.00038424297,0.23116206,0.000066202345,0.000044624023,0.00009949139,0.00021471521,0.0002901388,0.0029789011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973109,0.00055918563,0.00014792864,0.00025249616,0.0016168316,0.00011268058],"domain_scores_gemma":[0.99017733,0.00622945,0.0008026767,0.0012572769,0.0014612665,0.0000719837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017826724,0.0006138132,0.00047387148,0.0013675927,0.00031076986,0.0007992972,0.000654072,0.00043897986,0.0014316378],"category_scores_gemma":[0.016504599,0.0001940203,0.00028526952,0.0012464011,0.0007333276,0.0017673571,0.0009508483,0.0005196857,0.00027847505],"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.0011672748,0.00011943263,0.007878328,0.00036718583,0.00006801388,0.00034817276,0.0003916449,0.6058368,0.04620067,0.0717749,0.00131135,0.26453623],"study_design_scores_gemma":[0.000009006034,0.00007291073,0.0010426678,0.000015337277,0.000005447365,0.00012049342,0.000023555236,0.95721257,0.033859752,0.0064110495,0.0012068202,0.0000204175],"about_ca_topic_score_codex":0.00063390884,"about_ca_topic_score_gemma":0.0004908843,"teacher_disagreement_score":0.0017826724,"about_ca_system_score_codex":0.00079366297,"about_ca_system_score_gemma":0.0005630084,"threshold_uncertainty_score":0.009427786},"labels":[],"label_agreement":null},{"id":"W1983773458","doi":"10.1109/ifsa-nafips.2013.6608407","title":"Interval-based analysis of BOCR (benefits, opportunities, costs and risks) models evaluated by multiple experts","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Alberta","funders":"","keywords":"Analytic hierarchy process; Analytic network process; Context (archaeology); Interval (graph theory); Interval arithmetic; Computer science; Multiplication (music); Operations research; Division (mathematics); Risk analysis (engineering); Mathematics; Arithmetic","score_opus":0.14719113117872992,"score_gpt":0.327590490150952,"score_spread":0.18039935897222206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983773458","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016249541,0.00013843694,0.9811859,0.000106691725,0.000013472949,0.00006719985,0.000055207704,0.000053488475,0.0021299706],"genre_scores_gemma":[0.60900253,0.00037459502,0.3891634,0.000054330627,0.000038707152,0.00037380194,0.00016791315,0.000036664955,0.00078812835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9893497,0.006641118,0.00036655925,0.0009049991,0.0024365515,0.00030109572],"domain_scores_gemma":[0.9818116,0.014303184,0.0017819122,0.00050886685,0.0013769793,0.00021746695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012754258,0.001624005,0.0013660957,0.0034218503,0.00052509963,0.0025563962,0.0015953287,0.00092281826,0.0020369135],"category_scores_gemma":[0.02252529,0.00050159247,0.0015702216,0.0020073003,0.0012753068,0.0023197785,0.0014926234,0.0015317241,0.00015093165],"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.000067823894,0.00006274797,0.0016280973,0.00023259268,0.00015755548,0.00007684831,0.0002761772,0.915508,0.0013147636,0.04781569,0.00029004738,0.03256977],"study_design_scores_gemma":[0.000007599757,0.00008717882,0.00031429916,0.000038526534,0.000038332622,0.00002505858,0.00009699925,0.9676884,0.00065359334,0.03047381,0.00055189955,0.000024276631],"about_ca_topic_score_codex":0.0035054286,"about_ca_topic_score_gemma":0.0021997686,"teacher_disagreement_score":0.012754258,"about_ca_system_score_codex":0.002101869,"about_ca_system_score_gemma":0.0018682656,"threshold_uncertainty_score":0.067451775},"labels":[],"label_agreement":null},{"id":"W1987780915","doi":"10.1145/1347375.1347379","title":"Compile-time and instruction-set methods for improving floating- to fixed-point conversion accuracy","year":2008,"lang":"en","type":"article","venue":"ACM Transactions on Embedded Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Algorithm; Scaling; Compile time; Floating point; Adder; Fixed point; Parallel computing; Subtraction; Parameterized complexity; Instruction set; Context (archaeology); Compiler; Arithmetic; Mathematics","score_opus":0.035407701208323566,"score_gpt":0.33431376450631906,"score_spread":0.2989060632979955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987780915","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07796154,0.0014899612,0.90213794,0.00019287386,0.00011864576,0.00007807306,0.00008691284,0.011316865,0.0066171507],"genre_scores_gemma":[0.49074775,0.00076038745,0.5031293,0.00011778817,0.00010078435,0.00015763512,0.0002970255,0.0022597876,0.0024295794],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803597,0.00033655547,0.00012970272,0.00023685282,0.0011116802,0.00014929206],"domain_scores_gemma":[0.9953448,0.0017952,0.00051518437,0.0010884064,0.0011911357,0.000065247536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012965198,0.0011211215,0.00048297996,0.0018233097,0.00040299087,0.0011794413,0.0011770121,0.00037155632,0.0023654376],"category_scores_gemma":[0.0074022855,0.0003985338,0.00068628654,0.0012894707,0.0006834271,0.0014535383,0.00067424774,0.0012318306,0.0008165517],"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.00051540066,0.00017092304,0.005658572,0.0003964259,0.00010779931,0.00009466095,0.00032587576,0.17959061,0.103231244,0.026010852,0.00241302,0.6814846],"study_design_scores_gemma":[0.000076829434,0.00055175304,0.0028037305,0.00012275108,0.00016115578,0.00015559631,0.00007897022,0.6953816,0.27633294,0.0099257035,0.014325277,0.00008361864],"about_ca_topic_score_codex":0.0013931103,"about_ca_topic_score_gemma":0.0018484885,"teacher_disagreement_score":0.0023654376,"about_ca_system_score_codex":0.0009719131,"about_ca_system_score_gemma":0.0014746757,"threshold_uncertainty_score":0.007913172},"labels":[],"label_agreement":null},{"id":"W1987899988","doi":"10.1109/eeei.2010.5661940","title":"Instruction set extensions for computation on complex floating point numbers","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Subtraction; Parallel computing; Speedup; Instruction set; Arithmetic; Computation; Multiplier (economics); Floating point; Instructions per cycle; Multiplication (music); Set (abstract data type); Computer hardware; Algorithm; Programming language; Central processing unit; Mathematics","score_opus":0.05662785870432474,"score_gpt":0.35088049656431697,"score_spread":0.2942526378599922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987899988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068364345,0.0010577929,0.9191279,0.00014497354,0.0001831135,0.00010554798,0.00013608852,0.0028863773,0.007993913],"genre_scores_gemma":[0.37202194,0.0008765914,0.6171549,0.00017241498,0.00008851807,0.00036632453,0.00060600834,0.00029955033,0.008413789],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99986637,0.000021259448,0.000016137898,0.000015388083,0.00006498588,0.000015950494],"domain_scores_gemma":[0.9998055,0.00006258108,0.000022577044,0.000039554816,0.000057801415,0.000012050153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016833303,0.00043331727,0.000225555,0.00027280356,0.00016373192,0.00027421064,0.0005108872,0.0001689262,0.0030692972],"category_scores_gemma":[0.00066764146,0.0001338525,0.00023163826,0.00038567424,0.0002219158,0.00046367943,0.00036556614,0.0005754193,0.0006551723],"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.00087312754,0.00019779682,0.0014117464,0.0005927126,0.00005163146,0.00072880945,0.0002999871,0.0711851,0.23255675,0.09791931,0.011961038,0.582222],"study_design_scores_gemma":[0.0002757003,0.0011502664,0.0017163255,0.00022857926,0.00008355665,0.0009517939,0.00006682256,0.5359993,0.25120282,0.05938334,0.14885105,0.00009036671],"about_ca_topic_score_codex":0.0002295159,"about_ca_topic_score_gemma":0.0005100284,"teacher_disagreement_score":0.0030692972,"about_ca_system_score_codex":0.00020562299,"about_ca_system_score_gemma":0.00036253495,"threshold_uncertainty_score":0.010267854},"labels":[],"label_agreement":null},{"id":"W1990081392","doi":"10.1147/rd.461.0097","title":"Fast pseudorandom-number generators with modulus 2 <sup>k</sup> or 2 <sup>k</sup> -1 using fused multiply-add","year":2002,"lang":"en","type":"article","venue":"IBM Journal of Research and Development","topic":"Numerical Methods and Algorithms","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":"IBM (Canada)","funders":"","keywords":"Pseudorandom number generator; Computer science; Algorithm; Multiplicative function; Code (set theory); Random number generation; Discrete mathematics; Arithmetic; Mathematics; Programming language","score_opus":0.10497825331795745,"score_gpt":0.35053249780029183,"score_spread":0.24555424448233437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990081392","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035778057,0.0003792279,0.9319368,0.00028319066,0.00012570944,0.0004576596,0.00057024613,0.018670911,0.011798171],"genre_scores_gemma":[0.35872102,0.00030048093,0.6261358,0.00024069226,0.00009865163,0.00087606994,0.001895096,0.0017151071,0.010017139],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981249,0.0003716449,0.00012443014,0.00021583172,0.0009879844,0.00017527408],"domain_scores_gemma":[0.99622583,0.0016775363,0.00041760702,0.0009767935,0.0005860265,0.00011622491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00169544,0.001186041,0.0007199449,0.0010728902,0.000661617,0.0010092349,0.0013712798,0.00079596956,0.010702907],"category_scores_gemma":[0.008449529,0.00054936134,0.0008960519,0.0012314023,0.0010525751,0.002025317,0.0012559873,0.0011491921,0.0071655563],"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.0019356391,0.00037925216,0.005888825,0.00076666666,0.00018463208,0.00066431967,0.00049222214,0.17337233,0.062602505,0.17405106,0.034448706,0.5452138],"study_design_scores_gemma":[0.0005521736,0.00035099228,0.0015593817,0.00014031558,0.00006446578,0.00072491093,0.00006282607,0.7625671,0.1350093,0.067744,0.031110838,0.000113731854],"about_ca_topic_score_codex":0.00090500875,"about_ca_topic_score_gemma":0.0019307046,"teacher_disagreement_score":0.010702907,"about_ca_system_score_codex":0.0009803566,"about_ca_system_score_gemma":0.0017753763,"threshold_uncertainty_score":0.03580481},"labels":[],"label_agreement":null},{"id":"W1990733120","doi":"10.1016/j.nahs.2010.05.010","title":"Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques","year":2010,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Intersection (aeronautics); Local consistency; Interval (graph theory); Nonlinear system; Interval arithmetic; Constraint satisfaction problem; Constraint satisfaction; Hybrid system; Mathematical optimization; Set (abstract data type); Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Dynamical systems theory; Mathematics; Algorithm; Artificial intelligence","score_opus":0.03962665466784618,"score_gpt":0.3365361485269545,"score_spread":0.29690949385910836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990733120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020558937,0.00009965597,0.9767163,0.000045740842,0.00001598422,0.000050994662,0.00011645741,0.00027689975,0.0021190366],"genre_scores_gemma":[0.4504565,0.00023199515,0.54645574,0.00004272946,0.000021625758,0.00028445438,0.0004945839,0.00018420361,0.0018282401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992287,0.00018162343,0.000051566818,0.0001293664,0.0003406378,0.00006801434],"domain_scores_gemma":[0.9945845,0.004393117,0.0003049762,0.00020578041,0.0003962646,0.000115478586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018873967,0.0015469312,0.0015403653,0.0021112,0.0010806447,0.0017931192,0.0019701538,0.0016042442,0.004861268],"category_scores_gemma":[0.009511312,0.0013244768,0.0016710844,0.0016814197,0.0015106471,0.0027124768,0.0022280314,0.0019938604,0.0005297253],"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.000045131947,0.00002980284,0.00018438761,0.000067302935,0.00002393689,0.000034664572,0.00003629893,0.9752901,0.00044747433,0.0074112485,0.00017534822,0.016254237],"study_design_scores_gemma":[0.0000053522435,0.00000835675,0.000037323673,0.000008196805,0.000005096409,0.000003381724,0.0000067127758,0.99290437,0.0003658617,0.00656454,0.00008590288,0.0000049636164],"about_ca_topic_score_codex":0.011778087,"about_ca_topic_score_gemma":0.0113027245,"teacher_disagreement_score":0.011778087,"about_ca_system_score_codex":0.0011846042,"about_ca_system_score_gemma":0.0016694847,"threshold_uncertainty_score":0.023419082},"labels":[],"label_agreement":null},{"id":"W1991852511","doi":"10.1145/2608628.2608671","title":"Sparse interpolation over finite fields via low-order roots of unity","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vedecká Grantová Agentúra MŠVVaŠ SR a SAV; National Science Foundation","keywords":"Interpolation (computer graphics); A priori and a posteriori; Probabilistic logic; Finite field; Mathematics; Polynomial interpolation; Monte Carlo method; Algorithm; Polynomial; Applied mathematics; Probabilistic analysis of algorithms; Order (exchange); Discrete mathematics; Degree (music); Combinatorics; Computer science; Linear interpolation; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.01579895923004991,"score_gpt":0.27607005069484997,"score_spread":0.26027109146480004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991852511","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007851551,0.000057973233,0.99073,0.000057220936,0.000011087994,0.0000143100515,0.000015803871,0.00031647948,0.00094558956],"genre_scores_gemma":[0.2931911,0.00019756366,0.70353544,0.00008821062,0.000049432434,0.00013218059,0.00011517206,0.00022388135,0.0024670567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989924,0.00034684336,0.000033325487,0.00011433116,0.00040674576,0.00010641318],"domain_scores_gemma":[0.997359,0.0015566532,0.00023994675,0.0005033331,0.00025033503,0.00009073013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576197,0.00045741425,0.0008798426,0.0008672663,0.00059935846,0.00090551516,0.0014335451,0.0007317934,0.0024722654],"category_scores_gemma":[0.008253659,0.00043619837,0.00065825466,0.0009820131,0.0014105245,0.0020304883,0.0017231625,0.0018134138,0.0008054774],"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.00021755503,0.00006192778,0.00089525664,0.00008637943,0.000035069366,0.000087118045,0.0001867307,0.6176712,0.004746481,0.2718243,0.0013420163,0.102846056],"study_design_scores_gemma":[0.00001250108,0.000017953038,0.000030476649,0.000006688909,0.0000027523395,0.000016459682,0.0000056744652,0.96295375,0.0013496643,0.034774765,0.00082098244,0.000008387171],"about_ca_topic_score_codex":0.0020418658,"about_ca_topic_score_gemma":0.0027897698,"teacher_disagreement_score":0.0024722654,"about_ca_system_score_codex":0.0008363489,"about_ca_system_score_gemma":0.0009909893,"threshold_uncertainty_score":0.008335829},"labels":[],"label_agreement":null},{"id":"W1993610964","doi":"10.5539/jmr.v6n2p104","title":"Master-Slave Algorithm for Highly Accurate and Rapid Computation of the Voigt/Complex Error Function","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"York University","funders":"York University","keywords":"Computation; Mathematics; Rational function; Decimal; Function (biology); Exponential function; Algorithm; Error function; Fast Fourier transform; Applied mathematics; Arithmetic; Mathematical analysis","score_opus":0.20538737465742396,"score_gpt":0.41598623025586595,"score_spread":0.210598855598442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993610964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010905372,0.000067736015,0.9839925,0.000092045186,0.000043121872,0.000048846337,0.000049332088,0.0010073606,0.0037936864],"genre_scores_gemma":[0.31269017,0.00011043875,0.6749146,0.00009264626,0.00004175703,0.0003042896,0.00021346277,0.00039373006,0.011238908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998123,0.00002761029,0.00000892613,0.000041361636,0.0000802579,0.000029620784],"domain_scores_gemma":[0.9998155,0.000047548165,0.000017133982,0.000050195635,0.000053652497,0.000015915344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035072755,0.00041974534,0.0005206522,0.0002599873,0.00050870975,0.0005408378,0.0009985056,0.00043024446,0.007908728],"category_scores_gemma":[0.0008551458,0.00020028923,0.00030073072,0.0003177892,0.00033410432,0.0005632809,0.0008452144,0.00066066335,0.0015601766],"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.00060523266,0.00024375015,0.0027576967,0.00038079976,0.000107758744,0.0003749582,0.00076871586,0.38228992,0.10153153,0.110552385,0.015099202,0.385288],"study_design_scores_gemma":[0.000055636254,0.000058745554,0.00026645412,0.000009160161,0.000008614141,0.00008948295,0.000025582025,0.96971333,0.014633675,0.008256704,0.006867547,0.000014958567],"about_ca_topic_score_codex":0.0018224248,"about_ca_topic_score_gemma":0.002588244,"teacher_disagreement_score":0.007908728,"about_ca_system_score_codex":0.00037691928,"about_ca_system_score_gemma":0.0009022248,"threshold_uncertainty_score":0.02645737},"labels":[],"label_agreement":null},{"id":"W1998909571","doi":"10.1109/newcas.2014.6934008","title":"Enablingy the DC solutions characterization using a fuzzy approach","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Concordia University","funders":"","keywords":"Offset (computer science); Ring oscillator; Electronic circuit; DC bias; Control theory (sociology); Fuzzy logic; Computer science; Voltage; Algorithm; Stability (learning theory); Mathematics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.05827735148414172,"score_gpt":0.2770267036821635,"score_spread":0.21874935219802177,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998909571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071711233,0.00015815056,0.9880365,0.00005908917,0.000016377655,0.00002338189,0.000038494232,0.0000793419,0.004417449],"genre_scores_gemma":[0.40571243,0.0005831237,0.58574563,0.00010869724,0.00006929284,0.00014800357,0.00011712391,0.00009254252,0.007423088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971265,0.000041524057,0.000016197104,0.0000795309,0.00013077998,0.000019375062],"domain_scores_gemma":[0.99966097,0.000121948004,0.000039326813,0.00006282957,0.00010255536,0.000012385545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597013,0.0005854766,0.00045674652,0.0017215614,0.00068356196,0.001089306,0.00067049236,0.00064675196,0.003213723],"category_scores_gemma":[0.0013606559,0.00020339187,0.0006030078,0.0006634725,0.00091693684,0.0010866268,0.00058025727,0.0008923873,0.0005252931],"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.00010373939,0.000057722595,0.0013695996,0.00028617398,0.000070158785,0.0001787374,0.00032059837,0.33929262,0.098748945,0.28848952,0.0014856034,0.2695966],"study_design_scores_gemma":[0.0000120877485,0.000065747816,0.000455178,0.000039532806,0.000027710143,0.00013414408,0.00006835563,0.8991146,0.021319695,0.06921218,0.009510231,0.00004067619],"about_ca_topic_score_codex":0.002537891,"about_ca_topic_score_gemma":0.0018346276,"teacher_disagreement_score":0.003213723,"about_ca_system_score_codex":0.00078993186,"about_ca_system_score_gemma":0.0005161832,"threshold_uncertainty_score":0.010751009},"labels":[],"label_agreement":null},{"id":"W2000965014","doi":"10.3182/20090916-3-es-3003.00028","title":"Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint propagation techniques","year":2009,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Local consistency; Intersection (aeronautics); Interval (graph theory); Nonlinear system; Constraint satisfaction problem; Interval arithmetic; Constraint satisfaction; Hybrid system; Mathematical optimization; Set (abstract data type); Mathematics; Constraint (computer-aided design); Consistency (knowledge bases); Computer science; Algorithm; Artificial intelligence; Engineering; Discrete mathematics","score_opus":0.039207515881425646,"score_gpt":0.32688308606519373,"score_spread":0.2876755701837681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000965014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017812569,0.00009521563,0.97975403,0.000038950588,0.0000147176615,0.00004972268,0.0001127836,0.00032046714,0.0018015148],"genre_scores_gemma":[0.4126487,0.00023393633,0.5843492,0.00004179039,0.00002362637,0.00028651164,0.0005455138,0.00018094722,0.0016897547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990723,0.00019734916,0.00006665246,0.00015249642,0.00042965193,0.0000814157],"domain_scores_gemma":[0.9944806,0.0044396967,0.0003202559,0.00023405386,0.0004232079,0.00010217346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019164043,0.0015044643,0.0017328259,0.0022340668,0.00098772,0.0018158236,0.0020096,0.0013915309,0.0046674013],"category_scores_gemma":[0.008836039,0.0014476349,0.0017783296,0.0017966236,0.0013767089,0.002652802,0.0022734725,0.0019334806,0.0005276059],"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.000065196684,0.000031790936,0.00020495639,0.00008152633,0.000031976353,0.000046447207,0.000047028832,0.9685344,0.00058191246,0.0068841334,0.00019752934,0.02329311],"study_design_scores_gemma":[0.0000061792434,0.000011028328,0.000043687527,0.000009471583,0.0000071624854,0.000004257435,0.000008122199,0.99273056,0.00049769954,0.0065697343,0.00010642857,0.0000057035463],"about_ca_topic_score_codex":0.011077393,"about_ca_topic_score_gemma":0.010922018,"teacher_disagreement_score":0.011077393,"about_ca_system_score_codex":0.0011017984,"about_ca_system_score_gemma":0.001601857,"threshold_uncertainty_score":0.022025824},"labels":[],"label_agreement":null},{"id":"W2001747039","doi":"10.1109/reconfig.2011.38","title":"Fixed-Point CORDIC-Based QR Decomposition by Givens Rotations on FPGA","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; QR decomposition; Field-programmable gate array; Computer science; Systolic array; Matrix (chemical analysis); Matrix decomposition; Decomposition; Parallel computing; Path (computing); Singular value decomposition; Algorithm; Eigenvalues and eigenvectors; Computer hardware; Very-large-scale integration; Embedded system","score_opus":0.031198254057931737,"score_gpt":0.2929314508790531,"score_spread":0.26173319682112134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001747039","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026450394,0.0002994453,0.9599314,0.00009384718,0.00011477559,0.00010526977,0.00011789374,0.0049345354,0.007952491],"genre_scores_gemma":[0.171735,0.00027091734,0.82272804,0.00007404978,0.000055617395,0.000103511156,0.00033359716,0.00012347817,0.004575837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995877,0.000102785365,0.000032870226,0.000070145696,0.00015945085,0.000047062433],"domain_scores_gemma":[0.999653,0.000060296174,0.00003573541,0.000076992554,0.00015752984,0.000016461434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038764812,0.0006799326,0.0005326335,0.00044286266,0.00031998206,0.0005887535,0.0008668916,0.00029926005,0.0061821705],"category_scores_gemma":[0.00093473896,0.00025079792,0.00042594527,0.000682743,0.0003231366,0.00051702897,0.00033250093,0.00037045914,0.0023544424],"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.00092001376,0.000101396705,0.0010662345,0.0005017663,0.00009815978,0.0004119464,0.00026535438,0.11709588,0.11587112,0.03995604,0.010299746,0.71341234],"study_design_scores_gemma":[0.0002914295,0.0012117764,0.00092279486,0.00010339026,0.00009653185,0.00075808575,0.000103705075,0.79803354,0.14717847,0.0061856546,0.045035142,0.000079483114],"about_ca_topic_score_codex":0.002761554,"about_ca_topic_score_gemma":0.003397778,"teacher_disagreement_score":0.0061821705,"about_ca_system_score_codex":0.00044405455,"about_ca_system_score_gemma":0.0009406951,"threshold_uncertainty_score":0.020681381},"labels":[],"label_agreement":null},{"id":"W2002724831","doi":"10.1016/j.procs.2010.04.200","title":"Efficient generated libraries for asynchronous derivative computation","year":2010,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Numerical Methods and 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":"McGill University","funders":"U.S. Department of Energy","keywords":"Computer science; Automatic differentiation; Computation; Asynchronous communication; Loop unrolling; Intrinsics; Parallel computing; Generator (circuit theory); Transformation (genetics); Program transformation; Code generation; Code (set theory); Programming language; Theoretical computer science; Compiler; Key (lock); Operating system","score_opus":0.016611026128836432,"score_gpt":0.2786232879182579,"score_spread":0.2620122617894215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002724831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025511911,0.00013482504,0.9324624,0.00012089292,0.00010917818,0.0001278469,0.00047635616,0.033181634,0.007875019],"genre_scores_gemma":[0.3044978,0.00021627362,0.66846687,0.00021879669,0.00010294548,0.0006206702,0.0024125904,0.01046223,0.013001848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988237,0.00019531934,0.0000799619,0.00016575555,0.0006025756,0.00013259117],"domain_scores_gemma":[0.9972187,0.0008854005,0.00021684133,0.000876549,0.0007099269,0.000092551265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000952802,0.0009345703,0.0006566472,0.0010080419,0.0006796949,0.0017560073,0.0023142826,0.00087622885,0.011636771],"category_scores_gemma":[0.0052201063,0.0006442914,0.00087706995,0.0009938565,0.0008182715,0.0018330469,0.0017842309,0.0017155575,0.0044015544],"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.0016982123,0.000653533,0.003411284,0.00076136104,0.000110622444,0.0010091437,0.00081655633,0.18679918,0.09727705,0.29976737,0.038212914,0.36948273],"study_design_scores_gemma":[0.00034019863,0.00019192741,0.0005385528,0.000072856186,0.000049875867,0.00030753503,0.000048037567,0.749147,0.14501715,0.056041304,0.04817878,0.00006683567],"about_ca_topic_score_codex":0.00049997924,"about_ca_topic_score_gemma":0.00068789674,"teacher_disagreement_score":0.011636771,"about_ca_system_score_codex":0.0010242639,"about_ca_system_score_gemma":0.0015584239,"threshold_uncertainty_score":0.038928866},"labels":[],"label_agreement":null},{"id":"W2004538207","doi":"10.1109/icecs.2005.4633436","title":"An efficient algorithm and architecture for natural logarithm using Maclaurin series","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Logarithm; Natural logarithm; Computer science; Algorithm; Series (stratigraphy); Computation; Architecture; Function (biology); Parallel computing; Radix (gastropod); Arithmetic; Mathematics","score_opus":0.014506328368360324,"score_gpt":0.2959944869269043,"score_spread":0.281488158558544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004538207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042199343,0.00029431388,0.99128765,0.00008466439,0.00008370906,0.00005031737,0.000032546286,0.001489613,0.002457381],"genre_scores_gemma":[0.07156713,0.00047989842,0.9239657,0.00006568062,0.00010575268,0.00010953125,0.00015824163,0.00015761131,0.0033903948],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995621,0.000073024275,0.000043555578,0.00007755252,0.00020956901,0.00003407776],"domain_scores_gemma":[0.9995819,0.00012365665,0.00003723257,0.000084311156,0.00015702637,0.000015904161],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006128031,0.00065171655,0.0005433552,0.0012735971,0.00052510615,0.00092418166,0.0010574275,0.000446356,0.004619027],"category_scores_gemma":[0.0018162541,0.000256431,0.00057317177,0.0010555303,0.00048500113,0.0015774274,0.00058555865,0.00087318965,0.002214171],"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.00021561433,0.000099701865,0.00081819517,0.00042235974,0.000071305505,0.0003605446,0.00024928604,0.04709141,0.074125744,0.14330381,0.009575802,0.72366625],"study_design_scores_gemma":[0.00020185455,0.00054963864,0.0010391894,0.00011003261,0.0000970094,0.0018503333,0.000114199196,0.70695287,0.10821592,0.09745847,0.083273634,0.00013679382],"about_ca_topic_score_codex":0.0009884264,"about_ca_topic_score_gemma":0.0013058684,"teacher_disagreement_score":0.004619027,"about_ca_system_score_codex":0.0006620195,"about_ca_system_score_gemma":0.001072433,"threshold_uncertainty_score":0.015452206},"labels":[],"label_agreement":null},{"id":"W2005309768","doi":"10.1049/el.2013.2320","title":"Improved design of high‐frequency sequential decimal multipliers","year":2014,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Arithmetic; Computer science; Mathematics; Electronic engineering; Engineering","score_opus":0.012034930226980956,"score_gpt":0.2411856296634162,"score_spread":0.22915069943643523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005309768","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16393374,0.0013727938,0.8148749,0.00020186469,0.00019805905,0.00014596162,0.00012924406,0.00095798244,0.018185545],"genre_scores_gemma":[0.65963197,0.0006244617,0.33167648,0.00007790826,0.00005935138,0.00011907789,0.00017570062,0.000042651627,0.0075923484],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99988437,0.000019244866,0.000011060761,0.000026700307,0.000043359218,0.000015201078],"domain_scores_gemma":[0.9998037,0.000036968642,0.000033217704,0.000023346825,0.000093693285,0.000009045708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017865059,0.0004203111,0.00024640758,0.00040612975,0.000238164,0.0004361545,0.0005895947,0.00024440238,0.0027111615],"category_scores_gemma":[0.00037635167,0.00021296246,0.0002110476,0.00042050867,0.00010487888,0.0004101719,0.00019330863,0.00021857442,0.00056319096],"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.0006514872,0.00014592745,0.0017076608,0.0006019792,0.000091702095,0.00043917235,0.0002074427,0.08646788,0.45591122,0.031054864,0.0040871566,0.41863352],"study_design_scores_gemma":[0.00017728796,0.001510065,0.0022674236,0.00008572595,0.00012377922,0.0012541513,0.00007677261,0.6449508,0.28605804,0.007334016,0.056113757,0.000048115333],"about_ca_topic_score_codex":0.00044696595,"about_ca_topic_score_gemma":0.000931758,"teacher_disagreement_score":0.0027111615,"about_ca_system_score_codex":0.0003157724,"about_ca_system_score_gemma":0.00056769,"threshold_uncertainty_score":0.009069681},"labels":[],"label_agreement":null},{"id":"W2008635090","doi":"10.1007/s00034-013-9586-3","title":"Decimal SRT Square Root: Algorithm and Architecture","year":2013,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Square root; Arithmetic; Computer science; Algorithm; Root (linguistics); Mathematics","score_opus":0.015508222900126567,"score_gpt":0.24455262930570038,"score_spread":0.2290444064055738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008635090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046544145,0.00054513133,0.975806,0.0004609501,0.0003596627,0.00007252617,0.00018054269,0.0041653067,0.013755401],"genre_scores_gemma":[0.06732612,0.0005608974,0.9138813,0.0003152374,0.0003054404,0.00014367951,0.00048706424,0.00077244634,0.016207831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933976,0.0001305106,0.000051244704,0.00012589419,0.00029415614,0.000058411824],"domain_scores_gemma":[0.999086,0.00017238899,0.0000563875,0.00027684844,0.00036356942,0.000044815923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068957,0.001051688,0.0008162101,0.0012156629,0.00065023464,0.0018930403,0.0013401066,0.0008973791,0.019053794],"category_scores_gemma":[0.0032676153,0.0003468678,0.00046344614,0.00181433,0.00075242587,0.0016115983,0.001496426,0.0012625301,0.015299377],"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.0003906355,0.00006738228,0.00029988677,0.00030414964,0.00002339889,0.00020289439,0.00013882759,0.015617149,0.020553464,0.12796366,0.032528985,0.8019095],"study_design_scores_gemma":[0.00026621175,0.0006126848,0.0008288392,0.00023179689,0.00009200734,0.0024738363,0.000222763,0.38928285,0.11820962,0.25018397,0.23745249,0.00014290836],"about_ca_topic_score_codex":0.00059966586,"about_ca_topic_score_gemma":0.0010448045,"teacher_disagreement_score":0.019053794,"about_ca_system_score_codex":0.0005896459,"about_ca_system_score_gemma":0.001229472,"threshold_uncertainty_score":0.06374127},"labels":[],"label_agreement":null},{"id":"W2008935098","doi":"10.1145/1557626.1557654","title":"Radius selection algorithms for sphere decoding","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Hypersphere; Decoding methods; Rounding; Selection (genetic algorithm); Algorithm; RADIUS; Computer science; Computation; List decoding; Selection algorithm; Mathematics; Artificial intelligence; Concatenated error correction code","score_opus":0.03654321661490212,"score_gpt":0.3298576156190115,"score_spread":0.2933143990041094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008935098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017795013,0.00026951949,0.9955642,0.00008676403,0.00004064078,0.000025494375,0.00002451868,0.00042333105,0.0017859364],"genre_scores_gemma":[0.09030498,0.0006988313,0.9031669,0.00015567624,0.00012253139,0.00020372246,0.00023677334,0.00044687273,0.004663754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761474,0.0009441213,0.00015354583,0.00031058132,0.0008233829,0.00015354816],"domain_scores_gemma":[0.99587667,0.0020093636,0.00032692577,0.0007079175,0.00097193953,0.000107184045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018068632,0.0012420382,0.0012359304,0.001323524,0.00094808725,0.0014269088,0.0012609451,0.0012595544,0.004082959],"category_scores_gemma":[0.012504252,0.00044756065,0.00083969114,0.0017989674,0.001259969,0.0017700951,0.0021845335,0.0015384312,0.0041418257],"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.00033993262,0.000050734045,0.0007024951,0.0001765053,0.00006722894,0.00012890517,0.0002653134,0.3993494,0.007694176,0.1546422,0.0116536785,0.4249294],"study_design_scores_gemma":[0.000038917467,0.00005157984,0.00013253401,0.000027264989,0.000011082109,0.00012625346,0.000037052207,0.94061047,0.007602766,0.0423269,0.008999429,0.00003569963],"about_ca_topic_score_codex":0.003219485,"about_ca_topic_score_gemma":0.0020111976,"teacher_disagreement_score":0.004082959,"about_ca_system_score_codex":0.0010931498,"about_ca_system_score_gemma":0.0013494523,"threshold_uncertainty_score":0.013658822},"labels":[],"label_agreement":null},{"id":"W2010355238","doi":"10.1023/b:jogo.0000042114.11969.bb","title":"Improving Interval Analysis Bounds by Translations","year":2004,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematics; Univariate; Interval (graph theory); Interval arithmetic; Simple (philosophy); Polynomial; Translation (biology); Multivariate statistics; Global optimization; Applied mathematics; Variable (mathematics); Branch and bound; Mathematical optimization; Statistics; Combinatorics; Mathematical analysis","score_opus":0.007847256506081365,"score_gpt":0.2730848919841986,"score_spread":0.26523763547811724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010355238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008087569,0.0020804317,0.9725198,0.0008832462,0.00058409973,0.00006655133,0.0001580652,0.0012505507,0.014369688],"genre_scores_gemma":[0.2880514,0.0047391234,0.68925345,0.0017483969,0.0017165424,0.00053443626,0.0009125952,0.002480782,0.010563246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99050057,0.003551659,0.0006458529,0.0013349254,0.0033294947,0.0006373807],"domain_scores_gemma":[0.962482,0.02461042,0.0014360788,0.008329836,0.0025871666,0.0005545238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009352496,0.003227664,0.0031188843,0.0037857848,0.0013214974,0.004180876,0.0038533553,0.0020243283,0.014471106],"category_scores_gemma":[0.051994048,0.0016321082,0.003024644,0.0048855864,0.0044156653,0.010205528,0.008193526,0.009079433,0.005014025],"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.0010918553,0.0002313886,0.0008605292,0.0005645038,0.0001357788,0.00021966283,0.0005139964,0.101972185,0.007428615,0.57366186,0.019342903,0.2939767],"study_design_scores_gemma":[0.00010488508,0.0001678487,0.00023012122,0.00014401138,0.00009438942,0.00009424155,0.00007590011,0.35327935,0.0048965085,0.63016975,0.010697743,0.00004525719],"about_ca_topic_score_codex":0.0015845431,"about_ca_topic_score_gemma":0.0012692411,"teacher_disagreement_score":0.014471106,"about_ca_system_score_codex":0.0016679626,"about_ca_system_score_gemma":0.0018565216,"threshold_uncertainty_score":0.049461305},"labels":[],"label_agreement":null},{"id":"W2011113670","doi":"10.1109/pacrim.2011.6032996","title":"Design rules for implementing CORDIC on FPGAs","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"CORDIC; Field-programmable gate array; Computer science; Scalability; Computation; Set (abstract data type); Digital signal processing; Wireless; Signal processing; Parallel computing; Computer architecture; Computer hardware; Embedded system; Computer engineering; Algorithm; Telecommunications","score_opus":0.18061203494185699,"score_gpt":0.3371731719745797,"score_spread":0.1565611370327227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011113670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03864313,0.00080050825,0.913526,0.0004975935,0.0002240354,0.000843271,0.0002065699,0.005564477,0.039694443],"genre_scores_gemma":[0.3174461,0.00053862855,0.6732245,0.00030818506,0.000051654148,0.00063623086,0.00025217424,0.00047885714,0.0070636766],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989133,0.00026038295,0.00018379727,0.00010257702,0.00041888055,0.00012114013],"domain_scores_gemma":[0.998176,0.00048555408,0.00023430494,0.0003564304,0.0006979234,0.000049832095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009367593,0.0006520561,0.00031101677,0.0008150595,0.00046338054,0.0012843516,0.0012562309,0.00050121295,0.0055291313],"category_scores_gemma":[0.0034880354,0.00032252658,0.000298884,0.0005372193,0.0004965315,0.000679074,0.00034797125,0.00060206285,0.0014736784],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00084702944,0.00017316047,0.0037287197,0.0014979403,0.00010744398,0.0010133556,0.0004532633,0.17370681,0.10879105,0.18009564,0.018013861,0.5115716],"study_design_scores_gemma":[0.00054370955,0.0011746965,0.0016555818,0.00052336656,0.00023640267,0.0024075664,0.0002542059,0.51270837,0.2819223,0.040452424,0.15801781,0.000103615064],"about_ca_topic_score_codex":0.0011163041,"about_ca_topic_score_gemma":0.0019484551,"teacher_disagreement_score":0.0055291313,"about_ca_system_score_codex":0.00066429406,"about_ca_system_score_gemma":0.0006863958,"threshold_uncertainty_score":0.018496811},"labels":[],"label_agreement":null},{"id":"W2012516939","doi":"10.1145/1028664.1028742","title":"Advancements in multicode optimization","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Computer science; Java; Work (physics); Operating system; Engineering","score_opus":0.01393749326547812,"score_gpt":0.2884942719769256,"score_spread":0.2745567787114475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012516939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05208263,0.01797128,0.8790326,0.0025086158,0.001012724,0.000102767735,0.0001531987,0.0018057117,0.045330457],"genre_scores_gemma":[0.34968352,0.0146080945,0.6132334,0.0012922691,0.00087625533,0.00028424687,0.00037776263,0.0016558317,0.017988589],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984072,0.00043293362,0.00008096225,0.0003266216,0.0005810661,0.00017128108],"domain_scores_gemma":[0.99551857,0.0017386571,0.00023366198,0.001206021,0.0011126541,0.00019038808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001787894,0.000968798,0.001052873,0.00088787347,0.000751544,0.00130556,0.0020032073,0.00094934186,0.006257979],"category_scores_gemma":[0.006358968,0.0004903119,0.00092727586,0.0015475065,0.00076195796,0.0028615366,0.0023460935,0.002624355,0.0014886616],"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.0003710172,0.00035741946,0.002265876,0.0009635741,0.00015803578,0.00010301036,0.00021946139,0.15709671,0.017197292,0.18827958,0.011736111,0.62125194],"study_design_scores_gemma":[0.00010206442,0.00044412352,0.0013579408,0.00035675598,0.00016355455,0.00046802982,0.00019164385,0.64447653,0.029781934,0.16131368,0.1612454,0.00009840381],"about_ca_topic_score_codex":0.0017764516,"about_ca_topic_score_gemma":0.0021789137,"teacher_disagreement_score":0.006257979,"about_ca_system_score_codex":0.0008365207,"about_ca_system_score_gemma":0.0013790171,"threshold_uncertainty_score":0.020935059},"labels":[],"label_agreement":null},{"id":"W2014487386","doi":"10.5555/1756384.1756396","title":"Feedback-free circuits in the algebra of transients","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Binary number; SIGNAL (programming language); Computer science; Automaton; Electronic circuit; State (computer science); Algorithm; Logic gate; Finite-state machine; Theoretical computer science; Mathematics; Arithmetic; Engineering; Electrical engineering; Programming language","score_opus":0.03612889004025523,"score_gpt":0.2530820898465178,"score_spread":0.2169531998062626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014487386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09862713,0.00014836583,0.8933976,0.00015841959,0.000051696406,0.000068350506,0.00013160011,0.00063478213,0.0067819543],"genre_scores_gemma":[0.89825565,0.00016808786,0.09697839,0.000097487595,0.000045774035,0.00013967462,0.00017398247,0.00007239028,0.0040686033],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991474,0.00021460181,0.0000666623,0.00017623261,0.0003003707,0.00009462235],"domain_scores_gemma":[0.99833894,0.0009929673,0.00020429351,0.0001278908,0.00023703049,0.00009879666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093479815,0.00042983145,0.00053822895,0.0005866899,0.00063937117,0.0013162888,0.0006953325,0.0005208764,0.004100157],"category_scores_gemma":[0.0036661774,0.00024110333,0.0008901458,0.0004714947,0.0015914917,0.002561609,0.0007476674,0.0009157027,0.0003698284],"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.00014022242,0.000050206214,0.0006663709,0.000061684004,0.00002504931,0.00013786546,0.00014348775,0.15877824,0.00566482,0.8227984,0.0004561649,0.01107749],"study_design_scores_gemma":[0.000027496606,0.000051407278,0.00013145774,0.000015376803,0.000014179777,0.000056206485,0.00002292317,0.59703547,0.0052732527,0.39537665,0.0019790544,0.000016447544],"about_ca_topic_score_codex":0.0012614244,"about_ca_topic_score_gemma":0.0009805294,"teacher_disagreement_score":0.004100157,"about_ca_system_score_codex":0.0010525575,"about_ca_system_score_gemma":0.00077711046,"threshold_uncertainty_score":0.01371634},"labels":[],"label_agreement":null},{"id":"W2017750614","doi":"10.1145/990353.990359","title":"Approximate computation of pseudovarieties","year":2003,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Citation; Library science; Media studies; Sociology; Computer science","score_opus":0.024985936368930442,"score_gpt":0.2747962690646332,"score_spread":0.2498103326957028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017750614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1979879,0.0005987797,0.78034383,0.00043849254,0.00015464883,0.00003097729,0.00021758872,0.0009042951,0.019323463],"genre_scores_gemma":[0.91849345,0.00026040024,0.07515755,0.00009004171,0.000103623934,0.00003660419,0.00028879315,0.00021208866,0.0053575006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922216,0.00019517321,0.0000448432,0.00013537431,0.00031064777,0.00009181653],"domain_scores_gemma":[0.9987185,0.00056053826,0.00007852722,0.0003656147,0.00016491163,0.00011184389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008462943,0.00041283018,0.00080761325,0.0011941418,0.0006533338,0.0029106475,0.0011662368,0.00049486355,0.0049014366],"category_scores_gemma":[0.0045844056,0.00030639087,0.000755451,0.0011873959,0.0018244236,0.006011728,0.003009914,0.0013652861,0.00045883615],"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.00014995137,0.00001495898,0.00091705454,0.00007472973,0.00002088621,0.00008445124,0.00019878578,0.019715354,0.002005605,0.95841855,0.0011403093,0.017259423],"study_design_scores_gemma":[0.000018203938,0.00003210342,0.00027121732,0.00001927636,0.000012671825,0.00009932205,0.00007542459,0.17820401,0.003250171,0.8136157,0.0043879463,0.000013992695],"about_ca_topic_score_codex":0.0004433947,"about_ca_topic_score_gemma":0.0005037913,"teacher_disagreement_score":0.0049014366,"about_ca_system_score_codex":0.0010236015,"about_ca_system_score_gemma":0.00033311994,"threshold_uncertainty_score":0.01639694},"labels":[],"label_agreement":null},{"id":"W2018509468","doi":"10.3166/jesa.37.1059-1074","title":"Méthodes ensemblistes pour l'étalonnage géométrique","year":2003,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Interval (graph theory); Mathematics; Measure (data warehouse); Dimension (graph theory); Calibration; Pessimism; Set (abstract data type); Algorithm; Computer science; Statistics; Philosophy; Combinatorics; Data mining; Epistemology","score_opus":0.055147246743053054,"score_gpt":0.312045663456103,"score_spread":0.25689841671304997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018509468","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017995664,0.00029893927,0.9971826,0.00002419747,0.000019246094,0.000011499011,0.000020116826,0.00010990871,0.00053389324],"genre_scores_gemma":[0.06845465,0.00094649976,0.9272838,0.000043372882,0.00006759488,0.00017260548,0.00015166556,0.00035488576,0.0025248937],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998103,0.000735368,0.00009516709,0.00029306262,0.00069954764,0.000073777206],"domain_scores_gemma":[0.9939646,0.0045692525,0.00026720788,0.00035337973,0.0007231538,0.00012242026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051716673,0.0015879008,0.0011387613,0.002146026,0.00069658906,0.0014694206,0.0012750512,0.0011162795,0.0042359983],"category_scores_gemma":[0.013968157,0.00059611653,0.001461382,0.0011929463,0.0015894776,0.0020899493,0.0017517194,0.0038494838,0.0013044315],"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.0002446835,0.000066463836,0.0017052365,0.00059653213,0.000119865595,0.0001165167,0.0008762027,0.26566333,0.011354541,0.35614222,0.002004424,0.36111],"study_design_scores_gemma":[0.000035486773,0.00012926686,0.0006323792,0.00017665501,0.000043810913,0.00018516093,0.000103328406,0.8637993,0.007529163,0.10507088,0.022240672,0.000053867792],"about_ca_topic_score_codex":0.0021144554,"about_ca_topic_score_gemma":0.0016738392,"teacher_disagreement_score":0.0051716673,"about_ca_system_score_codex":0.00073969417,"about_ca_system_score_gemma":0.0007111998,"threshold_uncertainty_score":0.027350724},"labels":[],"label_agreement":null},{"id":"W2021921500","doi":"10.1016/j.procs.2014.05.129","title":"Exploring Rounding Errors in Matlab Using Extended Precision","year":2014,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Rounding; Computer science; MATLAB; Floating point; Double-precision floating-point format; Decimal; Algorithm; Single-precision floating-point format; Computational science; Class (philosophy); Computation; Point (geometry); Arithmetic; Programming language; Artificial intelligence; Mathematics","score_opus":0.1226172758066115,"score_gpt":0.32507375397142,"score_spread":0.20245647816480852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021921500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033651195,0.0003607016,0.985829,0.00014435228,0.000108378525,0.000027106284,0.00008617022,0.0024997406,0.007579531],"genre_scores_gemma":[0.09868927,0.0013074509,0.8921371,0.00020023811,0.000112450405,0.00026280517,0.00032514686,0.0020800936,0.004885513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614763,0.0010528194,0.0003405981,0.0003253514,0.0019685554,0.00016515232],"domain_scores_gemma":[0.99026835,0.005753044,0.0008012055,0.0010978433,0.001948002,0.0001314882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003568018,0.00126211,0.0008285026,0.001266123,0.0005615347,0.0029434243,0.0019061647,0.0007906009,0.013208327],"category_scores_gemma":[0.02351622,0.0006018396,0.0009077226,0.001156549,0.0013734428,0.0029496877,0.0022359276,0.002066527,0.003973564],"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.00050985714,0.00009089442,0.0018337106,0.0010305047,0.0001198258,0.0013662962,0.0010631485,0.27603596,0.015068953,0.39520094,0.018500943,0.289179],"study_design_scores_gemma":[0.00013322201,0.0002253401,0.0006280687,0.00070236454,0.00008157574,0.0010622849,0.00021668801,0.61839193,0.029243004,0.220598,0.1285527,0.00016485668],"about_ca_topic_score_codex":0.0011916965,"about_ca_topic_score_gemma":0.0010718037,"teacher_disagreement_score":0.013208327,"about_ca_system_score_codex":0.00057860935,"about_ca_system_score_gemma":0.0009661935,"threshold_uncertainty_score":0.044186294},"labels":[],"label_agreement":null},{"id":"W2022319690","doi":"10.1007/s10474-013-0357-1","title":"The Gauss–Wilson theorem for quarter-intervals","year":2013,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Combinatorics; Gauss; Multiplicative function; Product (mathematics); Quadratic Gauss sum; Prime power; Gauss sum; Discrete mathematics; Order (exchange); Prime (order theory); Factorial; Integer (computer science); Mathematical analysis; Geometry","score_opus":0.019275807364991765,"score_gpt":0.29055859146033813,"score_spread":0.27128278409534634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022319690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13487013,0.0066047437,0.69107276,0.0025485589,0.0013049504,0.000045032724,0.00040197527,0.00044341516,0.16270846],"genre_scores_gemma":[0.84063125,0.0038039999,0.10233995,0.0006968711,0.0012343951,0.000104440885,0.0003269605,0.00050317514,0.050359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995473,0.00012477598,0.000024114139,0.0000778074,0.00015300736,0.00007305482],"domain_scores_gemma":[0.9985501,0.0006007377,0.00016394006,0.00021332384,0.00031253308,0.00015927575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009739706,0.0005600418,0.0006775025,0.0024691173,0.000958064,0.002413238,0.001295773,0.0008634318,0.008797577],"category_scores_gemma":[0.007043466,0.00030549074,0.0007209483,0.0013898828,0.0019247193,0.0029335776,0.0013688738,0.0020528955,0.0014512484],"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.00002386175,0.0000066450903,0.00014286865,0.000034713874,0.0000075799976,0.00004182814,0.000047445254,0.0029690466,0.00046766805,0.9861508,0.0014236353,0.008683822],"study_design_scores_gemma":[0.0000061968954,0.000007096311,0.00013399056,0.00001320952,0.0000043623063,0.000061612234,0.000021036245,0.025985045,0.00027817185,0.9687256,0.004753843,0.000009852064],"about_ca_topic_score_codex":0.0018477055,"about_ca_topic_score_gemma":0.0009996436,"teacher_disagreement_score":0.008797577,"about_ca_system_score_codex":0.0009889586,"about_ca_system_score_gemma":0.0005958402,"threshold_uncertainty_score":0.029430866},"labels":[],"label_agreement":null},{"id":"W2022327507","doi":"10.1016/j.camwa.2007.11.036","title":"Maple code of gamma algorithm for global optimization of uncertain functions over compact robust sets","year":2008,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"Ministerio de Ciencia y Tecnología; Comunidad de Madrid","keywords":"Mathematics; Maple; Code (set theory); Algorithm; Computer science; Set (abstract data type); Programming language","score_opus":0.039818188363054376,"score_gpt":0.29763876580609644,"score_spread":0.25782057744304204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022327507","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001783027,0.000093245995,0.9918208,0.000044349683,0.00003813663,0.000026427206,0.00012665235,0.0037845552,0.0022828847],"genre_scores_gemma":[0.097774334,0.00019146447,0.8948806,0.00010570587,0.000040241055,0.00036805356,0.00066646433,0.0018174255,0.0041558337],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996469,0.000120774326,0.00002381851,0.000048942322,0.00012359538,0.000035993697],"domain_scores_gemma":[0.99924207,0.00030416404,0.00004330835,0.00012458082,0.00025586423,0.000030000163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071877876,0.00075279234,0.0007287511,0.00079513073,0.00045785878,0.0009786418,0.0012995135,0.0010937966,0.021876033],"category_scores_gemma":[0.003774495,0.00035455058,0.0005425256,0.000753131,0.00035975978,0.000901515,0.0010791549,0.001533728,0.0064680907],"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.00059691264,0.00013209539,0.00072895933,0.000518013,0.00009138261,0.00030453608,0.0002484598,0.29843217,0.007614052,0.08022564,0.03260716,0.5785005],"study_design_scores_gemma":[0.00007379754,0.000065342414,0.00018287708,0.000051556144,0.000015533986,0.000102559214,0.000027608176,0.94969183,0.007890825,0.024336945,0.017534569,0.000026524229],"about_ca_topic_score_codex":0.0014705089,"about_ca_topic_score_gemma":0.0016262967,"teacher_disagreement_score":0.021876033,"about_ca_system_score_codex":0.00035483716,"about_ca_system_score_gemma":0.0010295366,"threshold_uncertainty_score":0.07318264},"labels":[],"label_agreement":null},{"id":"W2022424129","doi":"10.1007/s10846-007-9172-7","title":"AI Optimization of a Billiard Player","year":2007,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Dynamical billiards; Table (database); Computer science; Ball (mathematics); Context (archaeology); Artificial intelligence; Mathematics; Data mining; Geometry","score_opus":0.02885852018583881,"score_gpt":0.30823471746558967,"score_spread":0.2793761972797509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022424129","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1536383,0.00068869704,0.6931313,0.0032866227,0.0005587631,0.00019570801,0.00028072897,0.00028441963,0.14793538],"genre_scores_gemma":[0.86296195,0.00027675412,0.057337545,0.00023840276,0.00009537024,0.00010933647,0.00012792558,0.00011168578,0.078741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996637,0.00011294135,0.000013907167,0.0000585832,0.00007503732,0.00007573836],"domain_scores_gemma":[0.99943084,0.00028275602,0.00003801817,0.00003642824,0.000089534224,0.00012242197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007073541,0.00070540456,0.0011446712,0.0006578235,0.0010483694,0.0020917521,0.001543209,0.0020979983,0.012191514],"category_scores_gemma":[0.0024753367,0.0005657972,0.00062784087,0.0005608251,0.0016568808,0.0013905407,0.0018596887,0.0013975411,0.0009057312],"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.00036197127,0.0000955216,0.0006166041,0.00008884948,0.00005236339,0.00020410714,0.00012066796,0.77288514,0.0023644767,0.20383064,0.0051529156,0.01422674],"study_design_scores_gemma":[0.000019809355,0.0000329011,0.00006789697,0.0000066028124,0.0000058688447,0.000018004741,0.00003093792,0.981169,0.00018894531,0.017492142,0.00096169306,0.000006258277],"about_ca_topic_score_codex":0.0072901575,"about_ca_topic_score_gemma":0.00408707,"teacher_disagreement_score":0.012191514,"about_ca_system_score_codex":0.001588123,"about_ca_system_score_gemma":0.0012162032,"threshold_uncertainty_score":0.040784657},"labels":[],"label_agreement":null},{"id":"W2024141463","doi":"10.1109/icsamos.2010.5642051","title":"CORDIC-based LMMSE equalizer for Software Defined Radio","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Victoria","funders":"","keywords":"Computer science; Software-defined radio; Minimum mean square error; CORDIC; Adaptive equalizer; Equalization (audio); Real-time computing; Computer hardware; Algorithm; Decoding methods; Telecommunications; Mathematics","score_opus":0.025463356633466657,"score_gpt":0.3058052317798974,"score_spread":0.2803418751464307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024141463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033825804,0.0007781649,0.9517412,0.00030052362,0.00013197596,0.00006942544,0.000057246638,0.003563407,0.009532171],"genre_scores_gemma":[0.3844856,0.000518967,0.60281986,0.0001845957,0.00006511667,0.000100524165,0.00017618158,0.00010951774,0.01153959],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998344,0.00003599201,0.000011552946,0.0000262248,0.00007486184,0.000016982704],"domain_scores_gemma":[0.9997429,0.00006960438,0.000030680985,0.000052686806,0.000095665695,0.000008444204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024792334,0.00030633563,0.00022816705,0.00027992314,0.00026337666,0.00036529178,0.0004207976,0.00029614675,0.004374716],"category_scores_gemma":[0.0013160851,0.00010136029,0.000144327,0.00040238144,0.0002025201,0.00047164483,0.00023452703,0.0004388054,0.0008634083],"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.0005233575,0.00008934207,0.0017145934,0.00018671718,0.00004292796,0.00019999399,0.00011648171,0.12486761,0.1188479,0.06270885,0.011677095,0.6790251],"study_design_scores_gemma":[0.00006726567,0.0002744024,0.0010405214,0.00003299875,0.00003341407,0.00032084226,0.000020051571,0.8544441,0.10521456,0.0043804785,0.034147557,0.000023802542],"about_ca_topic_score_codex":0.0021191027,"about_ca_topic_score_gemma":0.005111949,"teacher_disagreement_score":0.004374716,"about_ca_system_score_codex":0.0006121831,"about_ca_system_score_gemma":0.0006929355,"threshold_uncertainty_score":0.014634848},"labels":[],"label_agreement":null},{"id":"W2025002994","doi":"10.2478/bf02475663","title":"Error autocorrection in rational approximation and interval estimates. [A survey of results.]","year":2003,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Fields Institute for Research in Mathematical Sciences","keywords":"Mathematics; Interval (graph theory); Padé approximant; Rational function; Approximation error; Function (biology); Applied mathematics; Approximation theory; Discretization error; Nonlinear system; Error function; Mathematical analysis; Discretization; Algorithm; Combinatorics","score_opus":0.09373096529857693,"score_gpt":0.36493501453191735,"score_spread":0.2712040492333404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025002994","genre_codex":"methods","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009928119,0.08074533,0.8742093,0.001259891,0.001713929,0.00006895556,0.00012975637,0.000617986,0.031326752],"genre_scores_gemma":[0.5241046,0.07448925,0.37882113,0.0017327875,0.0048778034,0.00037468653,0.0005789306,0.0012184744,0.013802377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99122506,0.004163098,0.0005368831,0.00088738714,0.0028519165,0.00033567258],"domain_scores_gemma":[0.96352524,0.027845992,0.0016996933,0.0031914383,0.003429646,0.00030798858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012946034,0.0015503509,0.002295566,0.004512013,0.00086598925,0.0029864926,0.0018090886,0.0014732014,0.0044511827],"category_scores_gemma":[0.052595533,0.0011021459,0.0026047234,0.0043183994,0.004039288,0.0033964945,0.003021863,0.0043889326,0.0013978686],"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.00041046916,0.000103002036,0.0023161017,0.001751705,0.00035030543,0.0003649695,0.00052963465,0.05641987,0.0015008039,0.6866836,0.010510045,0.23905945],"study_design_scores_gemma":[0.0000576917,0.00031620814,0.0025866763,0.00085525867,0.00037490067,0.000644505,0.00017008817,0.34534425,0.0039127604,0.5910959,0.05447904,0.00016265518],"about_ca_topic_score_codex":0.003867329,"about_ca_topic_score_gemma":0.0010473188,"teacher_disagreement_score":0.012946034,"about_ca_system_score_codex":0.0024649983,"about_ca_system_score_gemma":0.0010377285,"threshold_uncertainty_score":0.06846601},"labels":[],"label_agreement":null},{"id":"W2025617638","doi":"10.1109/newcas.2012.6328944","title":"An improved BCD adder using 6-LUT FPGAs","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Royal Military College of Canada","funders":"","keywords":"Adder; Decimal; Computer science; Lookup table; Field-programmable gate array; Arithmetic; Carry-save adder; Parallel computing; Serial binary adder; Operand; Reduction (mathematics); Computer hardware; Critical path method; Virtex; Mathematics; Engineering; Telecommunications","score_opus":0.045471257534698134,"score_gpt":0.34663499322674163,"score_spread":0.30116373569204347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025617638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37553945,0.006960464,0.5588631,0.0010962347,0.001973231,0.00043318304,0.0013595688,0.010245747,0.043529075],"genre_scores_gemma":[0.45228902,0.0014875268,0.5304778,0.00027381166,0.00015229208,0.00008136571,0.0007195336,0.00005543592,0.014463149],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997552,0.000030054007,0.000026523632,0.000035737838,0.00012373732,0.000028724047],"domain_scores_gemma":[0.99983776,0.000020414383,0.000018716237,0.000030955685,0.00007805732,0.000014027108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018311272,0.00050260324,0.00035252128,0.0007376721,0.0003245178,0.0005020622,0.000687139,0.0004102558,0.0036657525],"category_scores_gemma":[0.00032636078,0.00026393394,0.00028189318,0.0007089205,0.00012000023,0.0006326061,0.00022518286,0.00031054596,0.0011072762],"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.0007091839,0.0001331511,0.0011497735,0.00063442654,0.000105343046,0.00081086875,0.00009787966,0.030645544,0.4254738,0.013735067,0.010232038,0.5162729],"study_design_scores_gemma":[0.00036404125,0.002010518,0.0064438744,0.00022483784,0.00040787642,0.0050581447,0.000064689535,0.40589887,0.40284404,0.003943219,0.17254694,0.00019288559],"about_ca_topic_score_codex":0.0018384376,"about_ca_topic_score_gemma":0.0034349016,"teacher_disagreement_score":0.0036657525,"about_ca_system_score_codex":0.00044002326,"about_ca_system_score_gemma":0.0006074214,"threshold_uncertainty_score":0.012263119},"labels":[],"label_agreement":null},{"id":"W2029685795","doi":"10.1145/1073884.1073898","title":"Hybrid symbolic-numeric integration in multiple dimensions via tensor-product series","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilinear interpolation; Series (stratigraphy); Mathematics; Dimension (graph theory); Algorithm; Interpolation (computer graphics); Tensor product; Numerical integration; Symbolic computation; Tensor (intrinsic definition); Applied mathematics; Algebra over a field; Computer science; Pure mathematics; Mathematical analysis; Artificial intelligence","score_opus":0.021338331628177745,"score_gpt":0.2668219674510854,"score_spread":0.24548363582290764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029685795","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023529239,0.000120851655,0.968627,0.000090819114,0.000063050546,0.00003005635,0.000040730938,0.00068392215,0.006814387],"genre_scores_gemma":[0.30102775,0.00021896895,0.69370043,0.000067755056,0.00004512022,0.00010260745,0.00009149521,0.0003519536,0.004393957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995285,0.00010039591,0.000025972255,0.00003995005,0.00027090407,0.00003417008],"domain_scores_gemma":[0.9994153,0.00019345494,0.000054714776,0.0001631641,0.00013290548,0.000040422823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063145644,0.00052533764,0.00056609605,0.0006126781,0.00045972667,0.0011391736,0.001047689,0.00040104613,0.0031449732],"category_scores_gemma":[0.0017107097,0.00023714708,0.00061620056,0.0008907265,0.0009364345,0.0014644335,0.000934524,0.0011202141,0.0009183178],"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.00012753069,0.00011408839,0.0013760801,0.00021539569,0.00006177559,0.0003398808,0.00039696944,0.40338257,0.028234052,0.41532397,0.0022878647,0.14813983],"study_design_scores_gemma":[0.00000971948,0.000027666578,0.00006801776,0.0000110442315,0.000006082388,0.000053468157,0.000014393368,0.9677422,0.0050744736,0.022897527,0.004082894,0.000012605934],"about_ca_topic_score_codex":0.0012361271,"about_ca_topic_score_gemma":0.0016617476,"teacher_disagreement_score":0.0031449732,"about_ca_system_score_codex":0.00063669134,"about_ca_system_score_gemma":0.0007956685,"threshold_uncertainty_score":0.010520995},"labels":[],"label_agreement":null},{"id":"W2031541154","doi":"10.3166/jesa.37.1129-1143","title":"Caractérisation garantie d'un dispositif de mesure de grandeurs thermiques","year":2003,"lang":"fr","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Physics","score_opus":0.02850556897188387,"score_gpt":0.2908557731197455,"score_spread":0.2623502041478616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031541154","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49537483,0.0007264678,0.4939951,0.0002785015,0.00021258644,0.000100424375,0.0005152755,0.004583329,0.0042134523],"genre_scores_gemma":[0.89518124,0.00024951305,0.09833421,0.000056061544,0.000020913814,0.00006810204,0.0005747113,0.0002660712,0.0052491426],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947387,0.000043538694,0.000024330237,0.00014763628,0.00025938317,0.0000513459],"domain_scores_gemma":[0.9991379,0.0003926332,0.000079090925,0.00012964659,0.00022658687,0.000034219553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006023808,0.0009705968,0.00069757027,0.0009728336,0.00043800403,0.0011992628,0.0008161418,0.0010772066,0.00636903],"category_scores_gemma":[0.0016546809,0.0005255966,0.0007839159,0.00064267416,0.0004957601,0.0009708784,0.0004946919,0.00071449595,0.0012414096],"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.0010583238,0.0001739765,0.016670555,0.00060587656,0.00014796459,0.00087374536,0.000884692,0.17122434,0.5679108,0.002228312,0.0023610063,0.23586047],"study_design_scores_gemma":[0.00002372881,0.00040621893,0.022333002,0.0000636502,0.00008355346,0.00040453454,0.00034034537,0.58973414,0.376874,0.00136427,0.008286024,0.00008658606],"about_ca_topic_score_codex":0.003940074,"about_ca_topic_score_gemma":0.0046565067,"teacher_disagreement_score":0.00636903,"about_ca_system_score_codex":0.0005564444,"about_ca_system_score_gemma":0.00045884945,"threshold_uncertainty_score":0.021306515},"labels":[],"label_agreement":null},{"id":"W2032195315","doi":"10.1145/1839480.1839486","title":"VFloat","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"Division of Engineering Education and Centers","keywords":"Computer science; Floating point; Double-precision floating-point format; Variable (mathematics); Computer hardware; Point (geometry); Implementation; Range (aeronautics); Programming language","score_opus":0.016594330515281367,"score_gpt":0.2598416499404852,"score_spread":0.24324731942520383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032195315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007957839,0.00087489036,0.6971358,0.0001837023,0.00025549287,0.0002500431,0.007970869,0.23475936,0.05061198],"genre_scores_gemma":[0.18451297,0.001757833,0.55358404,0.0013121889,0.00023038582,0.0015137608,0.056912184,0.05771172,0.14246494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922824,0.000059782484,0.000074107535,0.00013574176,0.00035604133,0.00014605722],"domain_scores_gemma":[0.99910563,0.00020790087,0.000087861095,0.0002341591,0.00032480145,0.00003955435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651366,0.001647631,0.0006970187,0.0015178198,0.0006949986,0.002474421,0.0042737583,0.0010275866,0.07944029],"category_scores_gemma":[0.0023797282,0.00085160823,0.0013272909,0.0013271929,0.0005240673,0.0023563763,0.0013507484,0.0013283328,0.03561187],"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.0015942605,0.00017085992,0.0022175894,0.0014158268,0.00013999733,0.00047851627,0.00026255235,0.02615369,0.028049586,0.041361276,0.28347817,0.6146777],"study_design_scores_gemma":[0.00032759152,0.00036460464,0.0014177817,0.00028582444,0.00008846595,0.0010163678,0.000073342526,0.110009454,0.12112984,0.024016595,0.7410037,0.00026644612],"about_ca_topic_score_codex":0.00269078,"about_ca_topic_score_gemma":0.003378229,"teacher_disagreement_score":0.07944029,"about_ca_system_score_codex":0.0011558337,"about_ca_system_score_gemma":0.0012261239,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2035899976","doi":"10.1145/1824801.1824806","title":"Unified Tables for Exponential and Logarithm Families","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical Methods and Algorithms","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":"McMaster University","funders":"","keywords":"Logarithm; SIMD; Computer science; Table (database); Exponential function; Parallel computing; Implementation; IBM; Arithmetic; Code (set theory); Algorithm; Mathematics; Programming language","score_opus":0.0228653889092917,"score_gpt":0.283043403121976,"score_spread":0.2601780142126843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035899976","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027387294,0.0007347838,0.98019516,0.00021766909,0.00025096606,0.00006192468,0.00093676185,0.0026777764,0.012186241],"genre_scores_gemma":[0.08949967,0.001638191,0.883998,0.00041003939,0.0005127766,0.0005048949,0.0027219027,0.0032494299,0.017465066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744225,0.0005260254,0.00030273257,0.000283433,0.0012557578,0.00018986683],"domain_scores_gemma":[0.995063,0.0017140878,0.00024510603,0.0013797759,0.0014840476,0.000114011855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002526089,0.00097625365,0.0010521971,0.003248084,0.0012172178,0.004576242,0.0025923576,0.0009384043,0.025092054],"category_scores_gemma":[0.016399233,0.00077156746,0.0012799931,0.0036091942,0.0011434953,0.00774602,0.0020551768,0.0021669115,0.011072876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097267904,0.000025334195,0.00052143907,0.00019955338,0.000016551912,0.000115198716,0.0002046909,0.017616943,0.0015969059,0.81522524,0.0291534,0.13522752],"study_design_scores_gemma":[0.000044315973,0.000045002864,0.00026762986,0.00014730435,0.00002467946,0.0003584813,0.00009172847,0.13925415,0.005268731,0.6874223,0.16700462,0.000071061695],"about_ca_topic_score_codex":0.0012708767,"about_ca_topic_score_gemma":0.0014786546,"teacher_disagreement_score":0.025092054,"about_ca_system_score_codex":0.0013574654,"about_ca_system_score_gemma":0.0016784151,"threshold_uncertainty_score":0.08394134},"labels":[],"label_agreement":null},{"id":"W2036246933","doi":"10.5555/1894483.1894505","title":"Reducing expression size using rule-based integration","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Scope (computer science); Computer science; Expression (computer science); Process (computing); Transformation (genetics); Programming language","score_opus":0.027340931217327835,"score_gpt":0.31231600818373284,"score_spread":0.284975076966405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036246933","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01210594,0.00032395803,0.97712874,0.00025139542,0.00013585662,0.00015832872,0.00009587392,0.0047353567,0.005064589],"genre_scores_gemma":[0.13621823,0.00036416846,0.85331374,0.00043115823,0.00009507062,0.00021712048,0.00050658244,0.001612767,0.0072412323],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939156,0.0010296564,0.0005224254,0.00061271584,0.0035841577,0.00033551382],"domain_scores_gemma":[0.98441803,0.008917862,0.00047535583,0.0029057227,0.0031171432,0.00016595052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024895414,0.001296055,0.0019789028,0.0017952619,0.0008334125,0.0025338081,0.0034419962,0.0012720398,0.011870838],"category_scores_gemma":[0.019210823,0.0010964355,0.00188458,0.0014572532,0.0012961365,0.0036149344,0.002646254,0.0035788824,0.004259266],"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.0004433304,0.00035856085,0.0016933309,0.0004718251,0.0001452716,0.0006206624,0.00038228752,0.104671344,0.03818764,0.0337746,0.010280914,0.8089702],"study_design_scores_gemma":[0.00011049647,0.00010433876,0.00039785804,0.000090258065,0.00020855587,0.000281195,0.0001109264,0.92032474,0.03138001,0.035798885,0.011150801,0.000041992356],"about_ca_topic_score_codex":0.00350951,"about_ca_topic_score_gemma":0.0059992606,"teacher_disagreement_score":0.011870838,"about_ca_system_score_codex":0.00086447643,"about_ca_system_score_gemma":0.0020533204,"threshold_uncertainty_score":0.039711893},"labels":[],"label_agreement":null},{"id":"W2036317424","doi":"10.1002/pamm.200700154","title":"Analysis of the blunting anti‐wrapping strategy","year":2007,"lang":"en","type":"article","venue":"PAMM","topic":"Numerical Methods and 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":"McMaster University; University of Toronto","funders":"","keywords":"Ode; Interval (graph theory); Interval arithmetic; Computer science; Dependency (UML); Convergence (economics); Algorithm; Applied mathematics; Mathematical optimization; Mathematics; Artificial intelligence; Mathematical analysis; Combinatorics","score_opus":0.025083209900294442,"score_gpt":0.3058342940222182,"score_spread":0.28075108412192373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036317424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14628816,0.00045597678,0.8301462,0.00021619984,0.00009441857,0.00006858067,0.000023837218,0.00019094296,0.022515688],"genre_scores_gemma":[0.931173,0.00032437645,0.059228845,0.00007862812,0.00004439605,0.00006965335,0.000029546909,0.0000703367,0.008981112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997807,0.000061053724,0.0000089700925,0.000027060716,0.00009399515,0.000028238212],"domain_scores_gemma":[0.99937856,0.00024305805,0.000087697554,0.00008031241,0.00014072005,0.00006960636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056863064,0.00036129783,0.00044580147,0.00046237168,0.00029994073,0.0006083495,0.00064084964,0.00058768445,0.003563376],"category_scores_gemma":[0.001717078,0.00017952625,0.00032107084,0.00020354183,0.00085416203,0.00053246727,0.0009439363,0.000557996,0.00044758865],"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.0001646316,0.00010069316,0.0012837398,0.0001651918,0.000049016533,0.00043570044,0.00022020734,0.4147669,0.040125005,0.46937558,0.0018282618,0.07148515],"study_design_scores_gemma":[0.0000062938752,0.000064027125,0.00014994512,0.000010014352,0.0000059208096,0.000045870715,0.00001574453,0.9805157,0.0032704417,0.014943437,0.0009654319,0.000007150658],"about_ca_topic_score_codex":0.0005213333,"about_ca_topic_score_gemma":0.00017985694,"teacher_disagreement_score":0.003563376,"about_ca_system_score_codex":0.000350088,"about_ca_system_score_gemma":0.00034126153,"threshold_uncertainty_score":0.011920691},"labels":[],"label_agreement":null},{"id":"W2038133488","doi":"10.1016/j.jsc.2007.11.005","title":"Approximate factorization of multivariate polynomials using singular value decomposition","year":2007,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Mathematics; Singular value decomposition; Factorization; Multivariate statistics; Generalization; Applied mathematics; Set (abstract data type); Decomposition; Algorithm; Mathematical analysis; Statistics; Computer science","score_opus":0.02778806671875694,"score_gpt":0.35593004644580806,"score_spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038133488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014965446,0.00022299106,0.98284054,0.00010500194,0.00007462622,0.000016686747,0.000044750825,0.00023922832,0.0014906304],"genre_scores_gemma":[0.34332356,0.00080321834,0.64963484,0.000077939585,0.00015269584,0.00007104159,0.00031899233,0.00018222774,0.005435506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994961,0.00012961999,0.000022128721,0.000042049276,0.00025524484,0.00005478008],"domain_scores_gemma":[0.9991819,0.00032502983,0.00007105079,0.0001531948,0.00021742535,0.000051357987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070887886,0.000797678,0.0011113706,0.0009529014,0.0004618002,0.0011115851,0.0005749517,0.0005786992,0.0039273407],"category_scores_gemma":[0.0034745468,0.00033613096,0.00067218015,0.0011585723,0.0006313075,0.0014636563,0.00079074106,0.0011755063,0.0012523327],"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.00041016008,0.00018349382,0.0010658343,0.0003072704,0.00013270916,0.00028525788,0.00021632333,0.48895633,0.021397285,0.16606702,0.0057071685,0.3152711],"study_design_scores_gemma":[0.000012893341,0.000025281546,0.000080487065,0.0000098263945,0.000008147058,0.000032160442,0.000021672058,0.975009,0.0016934641,0.021730855,0.0013689877,0.0000072158296],"about_ca_topic_score_codex":0.003233185,"about_ca_topic_score_gemma":0.004210585,"teacher_disagreement_score":0.0039273407,"about_ca_system_score_codex":0.0003958883,"about_ca_system_score_gemma":0.00094893004,"threshold_uncertainty_score":0.013138294},"labels":[],"label_agreement":null},{"id":"W2039344137","doi":"10.1007/bf02985637","title":"A Very Mean Value Theorem","year":2003,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mean value theorem (divided differences); Mathematics; Mean value; Mathematical economics; Statistics; Mathematical analysis; Picard–Lindelöf theorem; Fixed-point theorem","score_opus":0.04306645498068984,"score_gpt":0.3171031996934598,"score_spread":0.27403674471276995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039344137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012105112,0.007335935,0.8562574,0.017956946,0.0031962066,0.00004785642,0.00031423685,0.0003789598,0.10240721],"genre_scores_gemma":[0.62732106,0.00795177,0.21030973,0.017569214,0.012344978,0.00050724566,0.00047612842,0.0007982857,0.12272168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977596,0.00054329325,0.00009236068,0.000568545,0.00085295486,0.00018314556],"domain_scores_gemma":[0.9962424,0.0021766084,0.00017786006,0.0006297171,0.00061901903,0.000154412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029575415,0.0008526418,0.0014850412,0.0013642295,0.001490204,0.0032042982,0.0017357409,0.0026184742,0.0076115294],"category_scores_gemma":[0.012310175,0.0005441852,0.0017307338,0.0011931633,0.004688006,0.006291374,0.0032881843,0.0058513167,0.0023541544],"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.000013226232,0.000008204815,0.00008878448,0.000045769855,0.00002678699,0.000021492957,0.000050220675,0.0006331661,0.00036333504,0.9828636,0.0055458727,0.01033958],"study_design_scores_gemma":[0.0000052651494,0.0000061589476,0.00008127745,0.000010587601,0.000008280462,0.00006353972,0.000006855539,0.0028276122,0.00021988779,0.98876524,0.007998274,0.000007062777],"about_ca_topic_score_codex":0.00043557037,"about_ca_topic_score_gemma":0.0002499681,"teacher_disagreement_score":0.0076115294,"about_ca_system_score_codex":0.0013264555,"about_ca_system_score_gemma":0.0010104014,"threshold_uncertainty_score":0.025463164},"labels":[],"label_agreement":null},{"id":"W2041704512","doi":"10.1117/12.680289","title":"Sublinear constant multiplication algorithms","year":2006,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods 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":"University of Calgary","funders":"","keywords":"Sublinear function; Multiplication (music); Constant (computer programming); Integer (computer science); Mathematics; Conjecture; Radix (gastropod); Multiplication algorithm; Arithmetic; Computer science; Discrete mathematics; Algorithm; Combinatorics; Binary number","score_opus":0.013678987667445096,"score_gpt":0.24871162010369466,"score_spread":0.23503263243624956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041704512","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019334607,0.0019094499,0.93844116,0.0014696482,0.00035264625,0.00010877596,0.00023235033,0.0021408289,0.03601056],"genre_scores_gemma":[0.25968596,0.00129088,0.71081746,0.00080384425,0.00032893335,0.00029121697,0.00050313154,0.00059218373,0.025686352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983271,0.0003262788,0.000101071535,0.00039456022,0.0005970491,0.0002539327],"domain_scores_gemma":[0.99718815,0.0014182127,0.0002047713,0.0007538898,0.0003334396,0.00010148019],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012038914,0.0008689144,0.0006697308,0.0010516875,0.0007928518,0.0029012454,0.0018613437,0.00094857207,0.014135027],"category_scores_gemma":[0.0069654183,0.00043623455,0.00061991607,0.0012883911,0.0012997313,0.004958345,0.0025894751,0.0024245335,0.0045215283],"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.00044473363,0.0001006881,0.00065559626,0.0004226932,0.000036594953,0.00009739314,0.00028466032,0.038117055,0.009091712,0.59752136,0.018422078,0.33480546],"study_design_scores_gemma":[0.00017921193,0.00012973807,0.00024365523,0.00010056157,0.000033361306,0.00039506928,0.00010228458,0.43531752,0.018119885,0.48431528,0.061021913,0.00004150864],"about_ca_topic_score_codex":0.0010864411,"about_ca_topic_score_gemma":0.0017067703,"teacher_disagreement_score":0.014135027,"about_ca_system_score_codex":0.0019651458,"about_ca_system_score_gemma":0.0012524185,"threshold_uncertainty_score":0.04728639},"labels":[],"label_agreement":null},{"id":"W2042103381","doi":"10.1145/1723112.1723183","title":"Fine-grained vs. coarse-grained shift-and-add arithmetic in FPGAs (abstract only)","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Implementation; Latency (audio); Parallel computing; Block size; Block (permutation group theory); Computer architecture; Arithmetic; Embedded system; Mathematics; Programming language; Key (lock); Operating system; Telecommunications","score_opus":0.01227076361614016,"score_gpt":0.2707499696870888,"score_spread":0.25847920607094865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042103381","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61675406,0.0013712513,0.36701658,0.00022722293,0.00016529953,0.00013918063,0.0002074803,0.0024096663,0.011709301],"genre_scores_gemma":[0.8271634,0.00021517705,0.1698935,0.00005014913,0.000015814096,0.000037145608,0.0001274962,0.000051392268,0.002445869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999793,0.000026668553,0.00001855416,0.00003697047,0.00009006544,0.000034711004],"domain_scores_gemma":[0.9995191,0.00017188049,0.000067243345,0.00012451438,0.000099247285,0.000018100596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002348045,0.0002928165,0.00022679887,0.0002747238,0.00019976054,0.0005365704,0.00046404754,0.00016203408,0.0049637686],"category_scores_gemma":[0.0009809475,0.00015598802,0.00015805612,0.00030552686,0.00025659046,0.00079884793,0.00025611458,0.0002816157,0.0005189563],"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.0016747611,0.00018547243,0.0048718504,0.0004864394,0.000089394,0.0002715914,0.00013454715,0.42847726,0.18369685,0.01720141,0.0035991594,0.35931122],"study_design_scores_gemma":[0.0001965174,0.0012200652,0.005423215,0.00006257278,0.00008353271,0.00038089388,0.00013058385,0.77260154,0.19056536,0.009319849,0.019965455,0.000050330786],"about_ca_topic_score_codex":0.002494228,"about_ca_topic_score_gemma":0.005182387,"teacher_disagreement_score":0.0049637686,"about_ca_system_score_codex":0.0005113785,"about_ca_system_score_gemma":0.00056788535,"threshold_uncertainty_score":0.016605437},"labels":[],"label_agreement":null},{"id":"W2042105004","doi":"10.1016/j.jcta.2006.04.002","title":"The small octagon with longest perimeter","year":2006,"lang":"en","type":"article","venue":"Journal of Combinatorial Theory Series A","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Perimeter; Regular polygon; Mathematics; Trigonometry; Series (stratigraphy); Unit (ring theory); Interval (graph theory); Combinatorics; Arithmetic; Algorithm; Computer science; Mathematical analysis; Geometry; Mathematics education","score_opus":0.006864764530871105,"score_gpt":0.21850662028562967,"score_spread":0.21164185575475858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042105004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69836324,0.00154811,0.13881898,0.0024448696,0.00079640496,0.000121108336,0.00083093776,0.000589462,0.156487],"genre_scores_gemma":[0.9365325,0.0005512816,0.0403595,0.00032843582,0.00021965033,0.000058479513,0.00041331083,0.00021835166,0.021318503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997925,0.00004422594,0.000009994409,0.00005047689,0.00006244802,0.00004033721],"domain_scores_gemma":[0.9995228,0.00017293308,0.00006752783,0.00006589917,0.000053958884,0.00011687386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013405138,0.00032363881,0.0006926219,0.0008907732,0.0011031327,0.0019046158,0.0006523815,0.0010610926,0.009088211],"category_scores_gemma":[0.001675565,0.00038574077,0.00035313243,0.00083123386,0.0014584882,0.001414294,0.0012161869,0.0012129482,0.0012777268],"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.000664297,0.000088271896,0.0018820197,0.00023974612,0.000024798632,0.00078508136,0.0003378516,0.011296216,0.010454424,0.8838125,0.016090486,0.07432431],"study_design_scores_gemma":[0.00012717191,0.00011108921,0.001140337,0.000042676547,0.000022618855,0.00087677024,0.00041304066,0.041783754,0.002872336,0.930385,0.022189507,0.000035626934],"about_ca_topic_score_codex":0.0007518654,"about_ca_topic_score_gemma":0.00075899216,"teacher_disagreement_score":0.009088211,"about_ca_system_score_codex":0.00030912276,"about_ca_system_score_gemma":0.0003773576,"threshold_uncertainty_score":0.030403137},"labels":[],"label_agreement":null},{"id":"W2042528220","doi":"10.1109/tc.2012.35","title":"High-Speed Parallel Decimal Multiplication with Redundant Internal Encodings","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":44,"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 Saskatchewan","funders":"","keywords":"Arithmetic; Decimal; Multiplication (music); Multiplication algorithm; Adder; Multiplier (economics); Computer science; Critical path method; Reduction (mathematics); Mathematics; Numerical digit; Parallel computing; Algorithm; Binary number; Telecommunications","score_opus":0.02156385517594522,"score_gpt":0.2647108640006778,"score_spread":0.24314700882473256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042528220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32214683,0.0008357544,0.65255696,0.00019424665,0.00016026913,0.000089740766,0.00025819708,0.0040051397,0.019752935],"genre_scores_gemma":[0.6914211,0.00034416732,0.29947805,0.00006598277,0.000041775256,0.000060824736,0.00041072696,0.000097771175,0.008079715],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998568,0.000023449307,0.000012144383,0.000029261671,0.00005990081,0.000018354074],"domain_scores_gemma":[0.9997727,0.00006178694,0.00003337917,0.00006421725,0.00006120236,0.0000066185016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017877108,0.0003908311,0.0002566553,0.0004684062,0.00023209765,0.0004425423,0.00047773088,0.00017150545,0.0023187206],"category_scores_gemma":[0.00051772996,0.00018478016,0.00022848228,0.0005403591,0.00017329081,0.00057806395,0.00025949228,0.00022108835,0.0006532307],"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.0007033073,0.0001623505,0.0019226113,0.0004230005,0.00008479104,0.0007430704,0.0002272862,0.08093324,0.36689582,0.041739598,0.004624607,0.50154036],"study_design_scores_gemma":[0.0001311294,0.0006280869,0.0013779434,0.000050990184,0.000114465634,0.0014289829,0.00006492763,0.5444551,0.41405138,0.011796165,0.025853304,0.000047469555],"about_ca_topic_score_codex":0.0004287184,"about_ca_topic_score_gemma":0.0009048812,"teacher_disagreement_score":0.0023187206,"about_ca_system_score_codex":0.00024667557,"about_ca_system_score_gemma":0.00038496417,"threshold_uncertainty_score":0.0077568293},"labels":[],"label_agreement":null},{"id":"W2042775942","doi":"10.1142/s0218126604001970","title":"NOVEL DESIGN AND FPGA IMPLEMENTATION OF DA-RNS FIR FILTERS","year":2004,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","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":"Concordia University","funders":"","keywords":"Field-programmable gate array; Finite impulse response; Residue number system; Modulo; Computer science; Chinese remainder theorem; Binary number; Digital signal processing; Modulo operation; Computer hardware; Digital filter; Power of two; Filter (signal processing); Embedded system; Arithmetic; Algorithm; Mathematics","score_opus":0.04245574951914673,"score_gpt":0.2995850500938043,"score_spread":0.2571293005746576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042775942","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121542014,0.00076107867,0.8602201,0.00023862706,0.00019288152,0.00013429763,0.00014060922,0.0025649825,0.014205527],"genre_scores_gemma":[0.45995593,0.00041046666,0.53008527,0.00009757506,0.00006388086,0.00007602364,0.00020387032,0.00003480228,0.009072166],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998715,0.000020588222,0.000013161065,0.000025623533,0.000051533352,0.000017678425],"domain_scores_gemma":[0.99986947,0.00002824729,0.00001987229,0.000024803034,0.00004909947,0.000008481972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019858597,0.0003223578,0.0001963492,0.00033287297,0.00020882653,0.00036564126,0.00051604275,0.00027839304,0.0025280986],"category_scores_gemma":[0.00033974522,0.00015764056,0.00018464666,0.00016859874,0.00014181578,0.00031847833,0.00011881947,0.00022345576,0.00065717346],"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.000488778,0.000097862205,0.0012893615,0.0002826109,0.000078041674,0.0005841104,0.00015950165,0.02006683,0.5033189,0.021261083,0.002800531,0.4495724],"study_design_scores_gemma":[0.00021409935,0.0014078892,0.0033687777,0.00006583379,0.0001268556,0.0029457689,0.0000560435,0.2718829,0.65231836,0.0029937678,0.064567685,0.000052019743],"about_ca_topic_score_codex":0.0005081708,"about_ca_topic_score_gemma":0.001361824,"teacher_disagreement_score":0.0025280986,"about_ca_system_score_codex":0.00032295397,"about_ca_system_score_gemma":0.00037736836,"threshold_uncertainty_score":0.008457363},"labels":[],"label_agreement":null},{"id":"W2045916343","doi":"10.1145/2684746.2689146","title":"Area Optimization of Arithmetic Units by Component Sharing for FPGAs (Abstract Only)","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 British Columbia","funders":"","keywords":"Floating point; Integer (computer science); Field-programmable gate array; Floating-point unit; Subtraction; Multiplication (music); Arithmetic; Component (thermodynamics); Computer science; Division (mathematics); Point (geometry); Reduction (mathematics); Saturation arithmetic; Parallel computing; Computer hardware; Arbitrary-precision arithmetic; Mathematics; Algorithm; Operating system","score_opus":0.09614450303270765,"score_gpt":0.3081711610447928,"score_spread":0.21202665801208515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045916343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45185953,0.0027041584,0.5297986,0.00018727228,0.00010744368,0.000057428188,0.000099538454,0.0015925152,0.013593467],"genre_scores_gemma":[0.8985787,0.00028482787,0.098577894,0.000029324787,0.000022662882,0.000026003449,0.00006735937,0.0001103097,0.0023028546],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99974865,0.00004518298,0.000013849898,0.00004359205,0.00010833523,0.000040468753],"domain_scores_gemma":[0.9998155,0.000051782798,0.000037621765,0.00003690842,0.000047847385,0.000010331631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016448429,0.00054526964,0.0002683421,0.00034420448,0.00019650522,0.00039589396,0.0006083417,0.00011618947,0.0026194518],"category_scores_gemma":[0.0003817345,0.00012229441,0.00025772123,0.0005612794,0.00016018892,0.000577347,0.00030370505,0.00021434159,0.00035198499],"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.00069758657,0.000109257046,0.0016348151,0.00032105617,0.00013183894,0.00018439404,0.000083117506,0.25344536,0.258223,0.012357259,0.0034397312,0.4693727],"study_design_scores_gemma":[0.00006890358,0.001122719,0.0026116201,0.00003682555,0.00014085046,0.0005458554,0.00007822377,0.7066526,0.2674962,0.0062697,0.014944137,0.000032242577],"about_ca_topic_score_codex":0.00072473974,"about_ca_topic_score_gemma":0.0014239439,"teacher_disagreement_score":0.0026194518,"about_ca_system_score_codex":0.0003973466,"about_ca_system_score_gemma":0.00038214013,"threshold_uncertainty_score":0.008762896},"labels":[],"label_agreement":null},{"id":"W2049681033","doi":"10.1007/s00034-011-9365-y","title":"A Novel Decimal Logarithmic Converter Based on First-Order Polynomial Approximation","year":2011,"lang":"en","type":"article","venue":"Circuits Systems and Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Logarithm; Binary number; Polynomial; Mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.04721050248321819,"score_gpt":0.248157145433304,"score_spread":0.2009466429500858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049681033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031360064,0.0024480931,0.91739446,0.00047586957,0.0007545675,0.0001951427,0.00020426979,0.005270283,0.041897297],"genre_scores_gemma":[0.56554335,0.0017598736,0.4055151,0.00079843006,0.00035380953,0.00013861328,0.0003515886,0.00025534158,0.025283962],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995103,0.0000622391,0.000033656554,0.00012877793,0.00020784647,0.000057287227],"domain_scores_gemma":[0.99969125,0.000072755225,0.000019841633,0.000086326574,0.00010113998,0.000028769966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000321363,0.0005782923,0.0008068944,0.0008665398,0.0008307117,0.0025511174,0.0014581188,0.00077145785,0.009693323],"category_scores_gemma":[0.00075570296,0.00025257535,0.00033153204,0.0012004606,0.0004424065,0.0024167565,0.00092243945,0.0011411085,0.0038069347],"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.0010978763,0.00047274065,0.00082328403,0.00081595534,0.000058615646,0.00053859653,0.00022822995,0.0124261025,0.18586951,0.10265959,0.013914393,0.68109506],"study_design_scores_gemma":[0.0002442442,0.00096497894,0.0007414759,0.00019914642,0.00016106818,0.0041236617,0.00016642528,0.44520417,0.34916607,0.051547397,0.14732233,0.00015905176],"about_ca_topic_score_codex":0.00034797256,"about_ca_topic_score_gemma":0.0005455093,"teacher_disagreement_score":0.009693323,"about_ca_system_score_codex":0.00050612644,"about_ca_system_score_gemma":0.0005879337,"threshold_uncertainty_score":0.03242743},"labels":[],"label_agreement":null},{"id":"W2051963701","doi":"10.1145/345542.345581","title":"On accelerated methods to evaluate sums of products of rational numbers","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Waterloo","funders":"","keywords":"Speedup; Multiplication (music); Computation; Decimal; Integer (computer science); Greatest common divisor; Binary number; Rational number; Representation (politics); Computer science; Mathematics; Algorithm; Arithmetic; Parallel computing; Discrete mathematics; Combinatorics","score_opus":0.06789637576108613,"score_gpt":0.4056871926815203,"score_spread":0.33779081692043417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051963701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018419642,0.00077408075,0.9734558,0.00017734259,0.00013628861,0.000052882573,0.000038272825,0.00085436425,0.0060913083],"genre_scores_gemma":[0.13725398,0.0009408264,0.8518486,0.00013792807,0.0001623492,0.000250618,0.000179612,0.00053524907,0.008690785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990656,0.00026897827,0.00003914016,0.00007377951,0.00047312264,0.00007927202],"domain_scores_gemma":[0.9979145,0.0011949035,0.00013375464,0.00022488688,0.0004660342,0.00006588581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018215291,0.0010910633,0.0008483645,0.0010544374,0.0005301807,0.0010123376,0.0012118166,0.000636563,0.006496688],"category_scores_gemma":[0.007561537,0.00043274864,0.00059777475,0.0013971445,0.0009591386,0.0022289644,0.0013541784,0.0014288144,0.0024026954],"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.00058095774,0.0001425957,0.0018566248,0.0005971903,0.000112633184,0.00036816712,0.00050778093,0.36011034,0.01736052,0.25158802,0.007608529,0.35916653],"study_design_scores_gemma":[0.000092118076,0.00007880659,0.0002499839,0.00006141726,0.000019238323,0.000100542085,0.000050171926,0.90006834,0.0053093317,0.082933135,0.01101643,0.000020445386],"about_ca_topic_score_codex":0.0021713285,"about_ca_topic_score_gemma":0.0032805887,"teacher_disagreement_score":0.006496688,"about_ca_system_score_codex":0.00060959393,"about_ca_system_score_gemma":0.0010009424,"threshold_uncertainty_score":0.021733642},"labels":[],"label_agreement":null},{"id":"W2052784918","doi":"10.1016/j.jsc.2010.08.010","title":"High-precision numerical integration: Progress and challenges","year":2010,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Lawrence Berkeley National Laboratory","keywords":"Realm; Field (mathematics); Mathematics; Relation (database); Numerical integration; Integer (computer science); Computer science; Programming language; Data mining; Pure mathematics; Mathematical analysis","score_opus":0.025112515337038656,"score_gpt":0.3043765023234904,"score_spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052784918","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034401294,0.5006759,0.34043607,0.06986557,0.0050243773,0.00007901775,0.00031847513,0.002061132,0.047138173],"genre_scores_gemma":[0.3955154,0.30044487,0.26874754,0.0052162292,0.011821836,0.00021593901,0.0006679209,0.00082315895,0.016547171],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960949,0.00089972623,0.00018560137,0.00037764898,0.0022471533,0.00019502884],"domain_scores_gemma":[0.9778021,0.012946035,0.000537548,0.0023791925,0.0055153477,0.0008198153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011470582,0.0009790647,0.002500325,0.0015083855,0.0010333143,0.006411951,0.00415234,0.0038634497,0.0070729954],"category_scores_gemma":[0.02402678,0.0007670822,0.00065844454,0.0030523383,0.0048309434,0.0109897405,0.0037243953,0.005978284,0.0035558175],"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.0005829232,0.00026533668,0.0021610605,0.0030094024,0.00013376799,0.000114955605,0.0005749392,0.022356315,0.0034045463,0.37469116,0.038889114,0.55381644],"study_design_scores_gemma":[0.00021182103,0.00024886456,0.0012718816,0.0012221282,0.00009034826,0.00033004055,0.0007543749,0.17112783,0.0041375305,0.6555912,0.16487041,0.00014356973],"about_ca_topic_score_codex":0.0010449074,"about_ca_topic_score_gemma":0.0011048433,"teacher_disagreement_score":0.011470582,"about_ca_system_score_codex":0.0013000303,"about_ca_system_score_gemma":0.0024848816,"threshold_uncertainty_score":0.060662985},"labels":[],"label_agreement":null},{"id":"W2056994687","doi":"10.1007/s00454-013-9489-x","title":"The Small Octagons of Maximal Width","year":2013,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Combinatorics","score_opus":0.014528169664538388,"score_gpt":0.2586883984759491,"score_spread":0.24416022881141072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056994687","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38495407,0.0037195769,0.3193076,0.0027001528,0.0009408358,0.00020702877,0.0012780317,0.0007676561,0.28612506],"genre_scores_gemma":[0.87759227,0.0012390789,0.068844646,0.00072862604,0.00033363863,0.00024691768,0.0006884631,0.0005216908,0.049804747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957305,0.00010097547,0.000021573596,0.00010252267,0.00012280178,0.000079047764],"domain_scores_gemma":[0.9991216,0.00034812585,0.00009672455,0.00014693139,0.00012961628,0.00015706039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026394526,0.0006310037,0.00089202635,0.0010656823,0.0009577619,0.0025740576,0.0010503929,0.00085337984,0.01195413],"category_scores_gemma":[0.0043840846,0.0006907788,0.0004337425,0.00084761466,0.0019952888,0.002013561,0.0018456093,0.0021577997,0.0020305628],"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.00028034992,0.000029418537,0.00034868292,0.000115145725,0.000013192127,0.00008830424,0.00023077789,0.0025611254,0.0027264273,0.9572154,0.0072171073,0.029174075],"study_design_scores_gemma":[0.00008636565,0.00005270346,0.00055312173,0.00006402329,0.000017843326,0.0002576153,0.00036642465,0.01589876,0.0020751394,0.952262,0.028336626,0.000029421024],"about_ca_topic_score_codex":0.00065008254,"about_ca_topic_score_gemma":0.0006299747,"teacher_disagreement_score":0.01195413,"about_ca_system_score_codex":0.00031924894,"about_ca_system_score_gemma":0.0003660931,"threshold_uncertainty_score":0.039990544},"labels":[],"label_agreement":null},{"id":"W2057565823","doi":"10.1007/s10589-014-9687-3","title":"CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":339,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Thread (computing); Modular design; Fortran; MATLAB; Computer science; Parallel computing; Programming language; Algorithm; Computational science","score_opus":0.017438595689403612,"score_gpt":0.24961380206272565,"score_spread":0.23217520637332204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057565823","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035774405,0.00016794307,0.9442099,0.00015329427,0.00012795835,0.00010943293,0.00037771248,0.04653558,0.00474081],"genre_scores_gemma":[0.12470104,0.00024948717,0.8358855,0.00041877414,0.00009489687,0.00094965874,0.0016197896,0.028712135,0.0073686684],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968002,0.0010107756,0.00028610442,0.00041232095,0.0011330585,0.00035759233],"domain_scores_gemma":[0.9927291,0.0047155316,0.0003144475,0.0012191907,0.0007301682,0.00029150944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355189,0.0025843668,0.0017397832,0.0013344384,0.0010980174,0.0030325023,0.0057745306,0.002454899,0.034239862],"category_scores_gemma":[0.015538161,0.002101523,0.002711503,0.0010961212,0.0021893387,0.0040639457,0.0049358234,0.0041870167,0.0072229197],"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.0025471202,0.00062937156,0.0039699003,0.001640475,0.0005153744,0.00080840354,0.0009418541,0.26607114,0.014147939,0.18504153,0.110258564,0.41342825],"study_design_scores_gemma":[0.0005495378,0.00013109793,0.0002747544,0.00011765491,0.000071662,0.0001628212,0.00006174093,0.8204925,0.009502192,0.12830582,0.0402349,0.00009529094],"about_ca_topic_score_codex":0.0020129413,"about_ca_topic_score_gemma":0.0036039592,"teacher_disagreement_score":0.034239862,"about_ca_system_score_codex":0.0007586296,"about_ca_system_score_gemma":0.0026102704,"threshold_uncertainty_score":0.114543736},"labels":[],"label_agreement":null},{"id":"W2059261580","doi":"10.1016/s0168-9274(01)00155-6","title":"Some recent advances in validated methods for IVPs for ODEs","year":2002,"lang":"en","type":"article","venue":"Applied Numerical Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Ode; Ordinary differential equation; Initial value problem; Interval (graph theory); Mathematics; Applied mathematics; Scheme (mathematics); Differential equation; Mathematical analysis","score_opus":0.060865229531314506,"score_gpt":0.37347211835876865,"score_spread":0.31260688882745413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059261580","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003537923,0.033837758,0.95100504,0.0010802902,0.0015333254,0.00008258125,0.00012950537,0.0002825611,0.0085110925],"genre_scores_gemma":[0.14947942,0.07984749,0.7406742,0.0020204054,0.004111718,0.0005731129,0.0008895776,0.0016048107,0.020799251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957567,0.0018458656,0.0003891828,0.00040447543,0.0014523074,0.00015139027],"domain_scores_gemma":[0.9877202,0.0062210327,0.0006649106,0.0018674557,0.003307126,0.00021929812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007715923,0.001748697,0.0021669206,0.0021358095,0.0010926167,0.0030809082,0.003832507,0.0024092875,0.0049217353],"category_scores_gemma":[0.024562122,0.001190736,0.002834114,0.0020927556,0.0028566604,0.003613171,0.0043086223,0.0044969707,0.0019620985],"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.00020172125,0.00013527938,0.0019603784,0.003613893,0.00047601337,0.00029227315,0.0003646985,0.13823481,0.007915967,0.4317889,0.009147807,0.4058684],"study_design_scores_gemma":[0.00005852636,0.00021708442,0.0016390425,0.0010861817,0.00024507532,0.00039727692,0.00010833585,0.64215046,0.012360966,0.21146303,0.13001584,0.00025822944],"about_ca_topic_score_codex":0.003089721,"about_ca_topic_score_gemma":0.0022911755,"teacher_disagreement_score":0.007715923,"about_ca_system_score_codex":0.0013591213,"about_ca_system_score_gemma":0.0017573953,"threshold_uncertainty_score":0.040806174},"labels":[],"label_agreement":null},{"id":"W2059686924","doi":"10.1016/j.mejo.2013.10.012","title":"Design and verification of a frequency domain equalizer","year":2013,"lang":"en","type":"article","venue":"Microelectronics Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Frequency domain; Algorithm; Equalizer; Domain (mathematical analysis); Adaptive equalizer; Generator (circuit theory); Floating point; Mathematics; Power (physics); Telecommunications; Decoding methods","score_opus":0.0142688880469125,"score_gpt":0.2513518802033457,"score_spread":0.2370829921564332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059686924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016746035,0.00012170621,0.97794455,0.00023798532,0.00008492258,0.00013763698,0.000049862556,0.00087280513,0.003804366],"genre_scores_gemma":[0.63804847,0.0002244503,0.35530442,0.0002439746,0.00005305308,0.00017633653,0.000115230716,0.00007584776,0.005758108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989311,0.00025978163,0.000059392434,0.00014219935,0.0004979108,0.00010957119],"domain_scores_gemma":[0.99895346,0.00042945662,0.000111251844,0.00016671361,0.00030572136,0.000033387554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010930576,0.00053273916,0.00073880656,0.00033452726,0.0005704174,0.0015713023,0.0012141289,0.0015124464,0.0037738855],"category_scores_gemma":[0.0027661696,0.0003689542,0.00052749447,0.00016592405,0.0006139998,0.001016673,0.0009542029,0.00073604233,0.0010133475],"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.0008854523,0.00023470107,0.0022589243,0.00066775776,0.00035388028,0.0009920456,0.00032577792,0.43807775,0.2868965,0.084854096,0.0032547207,0.1811984],"study_design_scores_gemma":[0.00016946511,0.00048348043,0.00047876913,0.000053401618,0.000088526314,0.00048502433,0.000047619294,0.8326922,0.15131398,0.0052763848,0.008874402,0.0000366399],"about_ca_topic_score_codex":0.0014808071,"about_ca_topic_score_gemma":0.0012847455,"teacher_disagreement_score":0.0037738855,"about_ca_system_score_codex":0.00066787563,"about_ca_system_score_gemma":0.0016038088,"threshold_uncertainty_score":0.012624919},"labels":[],"label_agreement":null},{"id":"W2062703889","doi":"10.1145/860854.860886","title":"Exploiting fast hardware floating point in high precision computation","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computation; Floating point; Computer science; Double-precision floating-point format; Reduction (mathematics); Iterative method; Point (geometry); Algorithm; Software; Single-precision floating-point format; IEEE floating point; Computational science; Parallel computing; Mathematics","score_opus":0.02638337230332419,"score_gpt":0.28914833203101586,"score_spread":0.26276495972769165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062703889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013189701,0.0004422256,0.9818755,0.00015050863,0.00007917855,0.000028782328,0.000011334954,0.00045937463,0.0037633365],"genre_scores_gemma":[0.26056534,0.000855787,0.73530126,0.00008849088,0.00007618859,0.00009264013,0.000050219463,0.00017987144,0.0027901912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990828,0.0001688128,0.000034540084,0.000085799526,0.00054880255,0.00007918913],"domain_scores_gemma":[0.998566,0.00057199574,0.00012749653,0.00049305026,0.00020379874,0.000037718033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010243483,0.00073993456,0.00064115424,0.00054429885,0.00052234926,0.00086496543,0.0012654768,0.0007638748,0.002158036],"category_scores_gemma":[0.004156512,0.00038292512,0.00063761225,0.00081154343,0.0015214889,0.0016029594,0.0015668717,0.0013824268,0.0011387743],"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.0003814819,0.00007773299,0.0016339541,0.0004894953,0.00010730785,0.0005076051,0.00040912163,0.33524695,0.09934083,0.28064647,0.0031705839,0.27798852],"study_design_scores_gemma":[0.000100087425,0.000258834,0.00038391733,0.00007829819,0.00005423764,0.0004432114,0.000044289594,0.8148576,0.06866199,0.09500789,0.020044705,0.00006487979],"about_ca_topic_score_codex":0.0015046843,"about_ca_topic_score_gemma":0.0013414449,"teacher_disagreement_score":0.002158036,"about_ca_system_score_codex":0.0004379932,"about_ca_system_score_gemma":0.0009286697,"threshold_uncertainty_score":0.007219374},"labels":[],"label_agreement":null},{"id":"W2062719800","doi":"10.1090/s0025-5718-02-01419-9","title":"Rapid multiplication modulo the sum and difference of highly composite numbers","year":2002,"lang":"en","type":"article","venue":"Mathematics of Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Modulo; Mathematics; Rounding; Multiplication (music); Fast Fourier transform; Correctness; Arithmetic; Computation; Discrete mathematics; Algorithm; Combinatorics; Computer science","score_opus":0.03163010017467035,"score_gpt":0.26836416721988715,"score_spread":0.2367340670452168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062719800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010303064,0.00063230644,0.946139,0.00062335323,0.0014177912,0.00006368246,0.00013735892,0.0027861486,0.037897307],"genre_scores_gemma":[0.12429582,0.0009372205,0.8351493,0.00046240605,0.0007571531,0.00014067299,0.00036997598,0.002294786,0.035592664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854666,0.00021165714,0.00008306544,0.00033925072,0.0007124278,0.00010689581],"domain_scores_gemma":[0.9985184,0.0005526711,0.00009445165,0.00043004422,0.00033064914,0.00007386975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013109053,0.0011383308,0.0007012873,0.0014349027,0.00081446284,0.0032070165,0.0011370021,0.0005950834,0.018453397],"category_scores_gemma":[0.006479994,0.00051462784,0.0010368273,0.0014302315,0.0017040855,0.0060260375,0.002750366,0.0022901674,0.010626165],"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.00034197263,0.000051842504,0.0003710775,0.00025411867,0.000037906113,0.0003609246,0.0004522592,0.0055504064,0.031230971,0.6547036,0.025101475,0.28154352],"study_design_scores_gemma":[0.000088852656,0.00016321057,0.00035726884,0.000089773566,0.00004297215,0.00074923434,0.00013900212,0.082222834,0.08643981,0.5949469,0.2346721,0.00008797391],"about_ca_topic_score_codex":0.0005845407,"about_ca_topic_score_gemma":0.0011362236,"teacher_disagreement_score":0.018453397,"about_ca_system_score_codex":0.00079523155,"about_ca_system_score_gemma":0.0006239777,"threshold_uncertainty_score":0.06173271},"labels":[],"label_agreement":null},{"id":"W2063302371","doi":"10.1109/reconfig.2009.22","title":"A Scalable Architecture for Multivariate Polynomial Evaluation on FPGA","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Computer science; Scalability; Parallel computing; Acceleration; Polynomial; Computation; Hardware acceleration; Architecture; Exploit; Computer architecture; Computer engineering; Embedded system; Algorithm; Mathematics; Operating system","score_opus":0.03858036621161746,"score_gpt":0.34307656679680976,"score_spread":0.3044962005851923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063302371","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07877722,0.0017273962,0.88811624,0.0002897223,0.0003050706,0.00024357818,0.0003284471,0.009673472,0.020538906],"genre_scores_gemma":[0.47979492,0.00069873553,0.5107111,0.0001245377,0.00011456835,0.00017307168,0.0006832371,0.00012654859,0.0075733294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99982053,0.00003166425,0.000010105332,0.00002982344,0.00007521144,0.000032669912],"domain_scores_gemma":[0.9998667,0.000029431842,0.000011385836,0.000029744771,0.00004933148,0.0000132495725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001850284,0.0004432047,0.00035777705,0.0005314266,0.00026647028,0.0004486623,0.0007175468,0.00024030995,0.0071318313],"category_scores_gemma":[0.00038937715,0.000171452,0.00024302052,0.0006343969,0.00014778378,0.00058672315,0.00030749905,0.00038979406,0.0015236281],"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.0006639497,0.00013402224,0.001457252,0.00041446922,0.00011172621,0.0005627371,0.000082792874,0.05060183,0.16016723,0.018948263,0.02226987,0.7445859],"study_design_scores_gemma":[0.0004673121,0.0017695545,0.0051464,0.00014161451,0.00017842677,0.0017569168,0.00011037872,0.78741926,0.1111555,0.011707519,0.08002975,0.00011740726],"about_ca_topic_score_codex":0.0015199172,"about_ca_topic_score_gemma":0.0027794694,"teacher_disagreement_score":0.0071318313,"about_ca_system_score_codex":0.0003771033,"about_ca_system_score_gemma":0.00052682846,"threshold_uncertainty_score":0.023858368},"labels":[],"label_agreement":null},{"id":"W2063927241","doi":"10.1109/cjece.2013.6704691","title":"Leading one detectors and leading one position detectors - An evolutionary design methodology","year":2013,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Field-programmable gate array; Computer science; Electronic circuit; Detector; Application-specific integrated circuit; Shuffling; Gate array; Electronic engineering; Computer hardware; Engineering; Electrical engineering","score_opus":0.0399000260591533,"score_gpt":0.23769146724618168,"score_spread":0.19779144118702838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063927241","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014098507,0.00044700052,0.97916585,0.0001208843,0.000034580728,0.000076471464,0.000023110371,0.00018398688,0.0058496264],"genre_scores_gemma":[0.18838929,0.0005520414,0.8047253,0.00010532413,0.000017070257,0.00020735209,0.00007056146,0.00006200574,0.0058710556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99966955,0.0000815173,0.00001770186,0.00006185213,0.00013364533,0.000035700778],"domain_scores_gemma":[0.9997342,0.00008634287,0.00003015288,0.000037077683,0.00009799786,0.000014205258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073509145,0.00042115475,0.0003343366,0.00060608983,0.00038223414,0.0007475413,0.0010206958,0.00054084044,0.0015538255],"category_scores_gemma":[0.00084530184,0.0002839811,0.00057483715,0.0005272233,0.00056531717,0.000511321,0.00044445068,0.0005858989,0.00030400025],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006110401,0.00009282368,0.002253416,0.00033444914,0.00011843379,0.00028934557,0.00036328874,0.4629945,0.06346485,0.14300306,0.0015357762,0.32548904],"study_design_scores_gemma":[0.00004665252,0.0003095686,0.0007319341,0.00007970303,0.0000939382,0.0005005481,0.00006860995,0.90740836,0.0261171,0.037198484,0.027403876,0.000041330935],"about_ca_topic_score_codex":0.0011563496,"about_ca_topic_score_gemma":0.0013088793,"teacher_disagreement_score":0.0015538255,"about_ca_system_score_codex":0.00070808287,"about_ca_system_score_gemma":0.00090114784,"threshold_uncertainty_score":0.0051980615},"labels":[],"label_agreement":null},{"id":"W2065013830","doi":"10.1007/s10898-006-9045-9","title":"Comparison Between Baumann and Admissible Simplex Forms in Interval Analysis","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematics; Simplex; Bounding overwatch; Combinatorics; Upper and lower bounds; Interval (graph theory); Simplex algorithm; Regular polygon; Linear programming; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.021915825753188636,"score_gpt":0.3418294468815145,"score_spread":0.3199136211283259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065013830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046480242,0.0013134438,0.9421914,0.00024109354,0.000093939554,0.000051551855,0.000081184095,0.00016418118,0.009382929],"genre_scores_gemma":[0.5794023,0.0020293032,0.41153076,0.0001232697,0.00013349458,0.0001628416,0.00026090673,0.00045562538,0.0059015388],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667054,0.0020281847,0.00017747909,0.00026199804,0.00075317227,0.00010862547],"domain_scores_gemma":[0.9836376,0.012690124,0.000583068,0.0013823764,0.001349497,0.0003574118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006574796,0.00075747987,0.0014800662,0.0024943382,0.0008175436,0.0033367802,0.0012700551,0.001438827,0.0048059905],"category_scores_gemma":[0.03233295,0.00059926504,0.0009060075,0.0029928589,0.002510951,0.004192488,0.0025102585,0.0016143895,0.0005844705],"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.00028915206,0.000055927703,0.0009827762,0.00014934807,0.000041799725,0.00003163211,0.0003051676,0.13578923,0.00066673197,0.7282936,0.0009465686,0.1324481],"study_design_scores_gemma":[0.000015556465,0.00009426034,0.00035953408,0.000058557558,0.000021635573,0.000052789706,0.00011209246,0.6325312,0.00048601345,0.36381158,0.0024285603,0.000028214636],"about_ca_topic_score_codex":0.0015091505,"about_ca_topic_score_gemma":0.0019028435,"teacher_disagreement_score":0.006574796,"about_ca_system_score_codex":0.0011785086,"about_ca_system_score_gemma":0.0010871963,"threshold_uncertainty_score":0.034771264},"labels":[],"label_agreement":null},{"id":"W2065170636","doi":"10.1109/iscas.2012.6271961","title":"High-frequency sequential decimal multipliers","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Arithmetic; Adder; Computer science; Multiplier (economics); Multiplication (music); Parallel computing; Mathematics; Latency (audio); Telecommunications","score_opus":0.027341261062669295,"score_gpt":0.2916909146422373,"score_spread":0.26434965357956797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065170636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08885627,0.0015332758,0.8814555,0.00024712938,0.00035879033,0.000093893716,0.00014872353,0.0012516655,0.026054846],"genre_scores_gemma":[0.5050302,0.0011516619,0.47698918,0.00015616788,0.00018947753,0.000088196575,0.000278676,0.000073527575,0.016042877],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998266,0.000024891586,0.000014101459,0.000032869742,0.00008475574,0.000016835666],"domain_scores_gemma":[0.99969923,0.000074280346,0.00002830644,0.000046104036,0.00013681738,0.00001526194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023642529,0.00036843334,0.00022191241,0.0005467974,0.00030387277,0.000429356,0.000425791,0.0002087107,0.0052657705],"category_scores_gemma":[0.0007130716,0.00013872962,0.0001595426,0.00067404343,0.0001760248,0.00058636564,0.00026348516,0.0002597574,0.001342108],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005599099,0.000092142414,0.0013730025,0.00046445726,0.00005321688,0.0003305974,0.00014339578,0.016122496,0.18717334,0.044756446,0.0062106336,0.7427204],"study_design_scores_gemma":[0.00021052799,0.0016895118,0.004274143,0.00016960007,0.00018552374,0.004384942,0.00017481728,0.28031868,0.45119226,0.0429366,0.21437389,0.00008956219],"about_ca_topic_score_codex":0.00021512718,"about_ca_topic_score_gemma":0.0006217595,"teacher_disagreement_score":0.0052657705,"about_ca_system_score_codex":0.0001800893,"about_ca_system_score_gemma":0.00037265546,"threshold_uncertainty_score":0.017615736},"labels":[],"label_agreement":null},{"id":"W2067086525","doi":"10.1109/synasc.2013.17","title":"Common Factors in Fraction-Free Matrix Reduction","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Fraction (chemistry); Factoring; Gaussian elimination; Reduction (mathematics); Integer matrix; Computation; Context (archaeology); Matrix (chemical analysis); Mathematics; Gaussian; Integer (computer science); Combinatorics; Discrete mathematics; Algebra over a field; Algorithm; Computer science; Pure mathematics; Symmetric matrix; Computational chemistry; Nonnegative matrix; Physics","score_opus":0.020456668224993854,"score_gpt":0.30352576031411216,"score_spread":0.2830690920891183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067086525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09096403,0.0007901343,0.8901054,0.00026422567,0.00016167742,0.000099396,0.0001341615,0.0019363534,0.015544689],"genre_scores_gemma":[0.71435964,0.00069280935,0.27047935,0.00032452945,0.00021808156,0.00020123442,0.0003709639,0.000865192,0.012488182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843115,0.0002814884,0.00007823408,0.00030735866,0.00071751693,0.00018433598],"domain_scores_gemma":[0.9970993,0.0011643787,0.00026150528,0.0009720605,0.0004166638,0.00008619862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010065247,0.0009537348,0.0007192602,0.0013364366,0.0010169264,0.0016946275,0.00068205915,0.0005495989,0.0057837414],"category_scores_gemma":[0.007588099,0.00033509734,0.0007372438,0.0009331026,0.0023064634,0.003270838,0.0014857472,0.0009507005,0.0016259406],"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.0002594394,0.00010548224,0.0010778536,0.00022823091,0.00004884522,0.00031660052,0.0008078715,0.048624218,0.020240659,0.7984072,0.004878915,0.12500478],"study_design_scores_gemma":[0.000038442115,0.00019426589,0.00034407488,0.000051455172,0.000028117853,0.00035444187,0.00016264358,0.13946745,0.048461746,0.7870131,0.023817442,0.00006684479],"about_ca_topic_score_codex":0.0009711037,"about_ca_topic_score_gemma":0.0008513871,"teacher_disagreement_score":0.0057837414,"about_ca_system_score_codex":0.0005904104,"about_ca_system_score_gemma":0.0005606613,"threshold_uncertainty_score":0.019348502},"labels":[],"label_agreement":null},{"id":"W2067308523","doi":"10.1145/2016567.2016570","title":"Rounding coefficients and artificially underflowing terms in non-numeric expressions","year":2011,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Rounding; Irrational number; Monomial; Mathematics; Point (geometry); Invariant (physics); Rational number; Discrete mathematics; Applied mathematics; Computer science","score_opus":0.08829774085748635,"score_gpt":0.3313756011568825,"score_spread":0.24307786029939618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067308523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08502964,0.0003768393,0.8950648,0.0011660287,0.0004636797,0.000066150606,0.000048122056,0.0009149183,0.016869782],"genre_scores_gemma":[0.5276054,0.00059717335,0.4607891,0.00057688303,0.0003672537,0.000119825076,0.00009056644,0.0012390978,0.008614687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9955584,0.0012003417,0.00032056475,0.0005020077,0.0020474228,0.000371186],"domain_scores_gemma":[0.9927771,0.0025706668,0.00070366176,0.0031911347,0.0006338584,0.00012358277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041402057,0.00090720906,0.00081587426,0.00090493157,0.0010388136,0.002850118,0.0016000972,0.00063675264,0.0043237642],"category_scores_gemma":[0.024928516,0.0005042432,0.00082537514,0.00090409047,0.0045728306,0.004449368,0.0036645562,0.0029208115,0.001323616],"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.00033815965,0.000043828248,0.0011636023,0.00022494838,0.000032957832,0.0004934399,0.0011092402,0.02997094,0.018125188,0.8707217,0.0021089837,0.07566697],"study_design_scores_gemma":[0.0000842913,0.00018494467,0.00062505977,0.0001951796,0.000090969465,0.00053088163,0.00054503477,0.11330944,0.061877012,0.78349507,0.03897212,0.0000899593],"about_ca_topic_score_codex":0.0003829963,"about_ca_topic_score_gemma":0.0005065485,"teacher_disagreement_score":0.0043237642,"about_ca_system_score_codex":0.00084460573,"about_ca_system_score_gemma":0.0007145951,"threshold_uncertainty_score":0.021895826},"labels":[],"label_agreement":null},{"id":"W2068652665","doi":"10.1119/1.4872408","title":"An Unusual Exponential Graph","year":2014,"lang":"en","type":"article","venue":"The Physics Teacher","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Royal University","funders":"","keywords":"Exponential function; Graph; Mathematics; Function (biology); Combinatorics; Discrete mathematics; Mathematical analysis","score_opus":0.02062481537719853,"score_gpt":0.28986439225460325,"score_spread":0.26923957687740474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068652665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2377119,0.004845288,0.5132866,0.018400872,0.0020720481,0.00020321019,0.0025558579,0.003615888,0.2173084],"genre_scores_gemma":[0.8913121,0.0027760405,0.061468467,0.0046062004,0.0010352714,0.0001803875,0.0012985795,0.001173043,0.036149923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954504,0.00011016048,0.000012587603,0.00013090167,0.00012289324,0.00007836797],"domain_scores_gemma":[0.9969836,0.0015133971,0.0002567024,0.0004307615,0.0005097272,0.00030580428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004718065,0.00034649434,0.00038763386,0.0013876336,0.001075004,0.0014698887,0.000935984,0.0010385603,0.011240829],"category_scores_gemma":[0.0071034073,0.00034704426,0.00045487646,0.0009487764,0.0014476562,0.0034313367,0.0009541038,0.0017214508,0.001565525],"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.000053983495,0.00003396064,0.0009357908,0.000112722526,0.000016569478,0.00036874,0.00025333365,0.00311183,0.0025952216,0.95158195,0.024792999,0.016142877],"study_design_scores_gemma":[0.00002660598,0.0000381096,0.001461061,0.000042201144,0.000016192409,0.00096487155,0.00015305779,0.023030896,0.0012797852,0.9208969,0.05205021,0.00004015196],"about_ca_topic_score_codex":0.0012294896,"about_ca_topic_score_gemma":0.0010845467,"teacher_disagreement_score":0.011240829,"about_ca_system_score_codex":0.0008731543,"about_ca_system_score_gemma":0.00051340956,"threshold_uncertainty_score":0.037604332},"labels":[],"label_agreement":null},{"id":"W2070144710","doi":"10.1109/cnsr.2010.50","title":"Analysis and Implementation of a Simple Method to Add Noise to a Channel Using Non-uniform Sampling","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Atlantic Canada Opportunities Agency","keywords":"Variance (accounting); Channel (broadcasting); Sampling (signal processing); Noise (video); Computer science; Simple (philosophy); Algorithm; Statistics; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.03716850048353386,"score_gpt":0.40431595797198217,"score_spread":0.3671474574884483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070144710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056145072,0.0001548765,0.94099295,0.00010937882,0.00008087008,0.00012644667,0.000021495674,0.0008702968,0.0014986114],"genre_scores_gemma":[0.4753712,0.0001643903,0.52187735,0.000056013072,0.00003167169,0.00009508828,0.00005307127,0.00009594874,0.0022552945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989699,0.00016644661,0.000038482798,0.00009649879,0.00066681835,0.00006196512],"domain_scores_gemma":[0.9983713,0.0007193799,0.00014506196,0.00034544943,0.0003761896,0.000042569915],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000864696,0.0004135299,0.00041141253,0.00044783592,0.00044829573,0.000532365,0.0008568407,0.00040329059,0.0018223729],"category_scores_gemma":[0.0037007981,0.00022634564,0.00032306634,0.00035634433,0.0006008189,0.00071535003,0.00033530153,0.00045585725,0.0002952137],"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.0010392282,0.00039283946,0.0038128777,0.00066528335,0.0001817959,0.00036793508,0.0004581542,0.12335647,0.32033604,0.0478632,0.001423326,0.5001029],"study_design_scores_gemma":[0.00009815403,0.0006900057,0.0020368958,0.000028518425,0.000070407565,0.00035394254,0.000050498104,0.72760147,0.25760654,0.0029408073,0.008473305,0.00004948653],"about_ca_topic_score_codex":0.0015753545,"about_ca_topic_score_gemma":0.0019498531,"teacher_disagreement_score":0.0018223729,"about_ca_system_score_codex":0.0006602068,"about_ca_system_score_gemma":0.0009158572,"threshold_uncertainty_score":0.0060964823},"labels":[],"label_agreement":null},{"id":"W2070355633","doi":"10.1117/12.558895","title":"On converting numbers to the double-base number system","year":2004,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":34,"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":"Base (topology); Implementation; Computer science; Arithmetic; Diophantine equation; Algorithm; Theoretical computer science; Mathematics; Discrete mathematics; Programming language","score_opus":0.014722486056792819,"score_gpt":0.25269303779023833,"score_spread":0.2379705517334455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070355633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029434841,0.0012653518,0.9267641,0.0009760598,0.0006771248,0.00007641111,0.00009370991,0.0007913968,0.039921086],"genre_scores_gemma":[0.34082645,0.0030072588,0.6361385,0.0010611147,0.0004728964,0.00022453506,0.00034652685,0.00045864884,0.017464036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988073,0.00027196185,0.0000717496,0.00021931603,0.0005224623,0.00010710977],"domain_scores_gemma":[0.9982424,0.0009543238,0.000091291804,0.00046850363,0.00019015148,0.000053363816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013648284,0.0005366435,0.0006138731,0.0010410204,0.0009763211,0.0025831207,0.00125231,0.00060789514,0.0074606645],"category_scores_gemma":[0.0064507304,0.00035732117,0.00041429463,0.0014054853,0.0030274044,0.006264815,0.0022073141,0.0026058136,0.0024126146],"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.00007927235,0.00002549904,0.00013361801,0.00011807987,0.00000587416,0.000040885767,0.0001735061,0.0058547454,0.0046031903,0.92440456,0.0018835805,0.062677175],"study_design_scores_gemma":[0.000032648724,0.0000861962,0.00010484843,0.00008940126,0.000008881705,0.0001742635,0.00014392674,0.032706577,0.014987967,0.91166997,0.039965,0.000030396137],"about_ca_topic_score_codex":0.00038683412,"about_ca_topic_score_gemma":0.00026369424,"teacher_disagreement_score":0.0074606645,"about_ca_system_score_codex":0.0006972014,"about_ca_system_score_gemma":0.00057020836,"threshold_uncertainty_score":0.024958372},"labels":[],"label_agreement":null},{"id":"W2073665305","doi":"10.1016/j.camwa.2010.02.013","title":"MAPLE code for the gamma algorithm for global optimization of uncertain functions in economy and finance","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Algorithm; Mathematical optimization; Code (set theory); Monotonic function; Finance; Set (abstract data type); Computer science; Economics","score_opus":0.016541387212247117,"score_gpt":0.2789701868669476,"score_spread":0.26242879965470045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073665305","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028445076,0.00023650524,0.9684059,0.00019694152,0.00013288241,0.00007595539,0.0012390735,0.018247835,0.008620374],"genre_scores_gemma":[0.086886816,0.0004197777,0.8873755,0.00025369826,0.000101198886,0.0008036782,0.0027209055,0.010848062,0.010590403],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962175,0.0001262964,0.000028193092,0.000046968617,0.000118238095,0.00005851028],"domain_scores_gemma":[0.9986858,0.00067975925,0.0000647825,0.00016132585,0.00035527092,0.00005311617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010291522,0.0010075393,0.0011118419,0.00096678047,0.0006438108,0.0013809871,0.0020945838,0.0016219892,0.0703098],"category_scores_gemma":[0.005812579,0.00059646263,0.00087275996,0.0011902966,0.00041089868,0.0015147266,0.0012086538,0.0025313736,0.016432438],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047716234,0.00021959787,0.0012139474,0.00081073743,0.00015341723,0.00040007674,0.00033385036,0.35041416,0.003772993,0.16644539,0.12448088,0.35127777],"study_design_scores_gemma":[0.00016683873,0.000045511493,0.0002879945,0.000075527125,0.000020971565,0.000116286064,0.00003504391,0.8858594,0.0047783097,0.0582251,0.050344422,0.000044607732],"about_ca_topic_score_codex":0.0030183913,"about_ca_topic_score_gemma":0.0032295915,"teacher_disagreement_score":0.0703098,"about_ca_system_score_codex":0.0006397384,"about_ca_system_score_gemma":0.0017618237,"threshold_uncertainty_score":0.2352097},"labels":[],"label_agreement":null},{"id":"W2073762939","doi":"10.1145/2631948.2631964","title":"Computing GCRDs of approximate differential polynomials","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Waterloo","funders":"","keywords":"Computer science; Differential (mechanical device); Mathematics; Physics","score_opus":0.01434590155827235,"score_gpt":0.2700452675961688,"score_spread":0.25569936603789645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073762939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052394252,0.00006478757,0.94551337,0.000042148673,0.000024155383,0.000028856026,0.0000743492,0.00060501386,0.0012530322],"genre_scores_gemma":[0.3710818,0.000094001814,0.6262983,0.000029932191,0.000026475946,0.000045385354,0.0003105594,0.00014594595,0.001967486],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993451,0.0000915585,0.000041240357,0.00013192561,0.0003071777,0.00008309517],"domain_scores_gemma":[0.99869734,0.0005324604,0.00014320035,0.00025398037,0.00029847224,0.00007452603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008204807,0.00054107344,0.0006603512,0.0012053434,0.00041738222,0.0011458521,0.00070314243,0.0004975081,0.0030709258],"category_scores_gemma":[0.0061234166,0.00029412674,0.0004518358,0.0010235723,0.00080427015,0.0017164848,0.0013461694,0.00077869085,0.0007653634],"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.00041001168,0.000087187786,0.00461534,0.00027453527,0.000057128123,0.00042507314,0.00046794087,0.28329453,0.053705007,0.20574218,0.0026800453,0.448241],"study_design_scores_gemma":[0.00002824457,0.000094393115,0.00051855826,0.000018239301,0.000009957922,0.00015499281,0.00011590483,0.90927577,0.021933772,0.063459,0.004372092,0.000019004492],"about_ca_topic_score_codex":0.001270389,"about_ca_topic_score_gemma":0.0019631921,"teacher_disagreement_score":0.0030709258,"about_ca_system_score_codex":0.00053917454,"about_ca_system_score_gemma":0.000841521,"threshold_uncertainty_score":0.010273278},"labels":[],"label_agreement":null},{"id":"W2074109325","doi":"10.1145/354880.354899","title":"Embedded ISA support for enhanced floating-point to fixed-point ANSI-C compilation","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Library science; Engineering; Architecture; Compiler; Point (geometry); Computer science; Telecommunications; Operating system; Geography; Archaeology; Mathematics","score_opus":0.01897660976313449,"score_gpt":0.30742453534076214,"score_spread":0.28844792557762766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074109325","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04080195,0.0003825416,0.87210345,0.00017390186,0.00025465127,0.000138694,0.00028837475,0.06286007,0.022996396],"genre_scores_gemma":[0.40038162,0.0004124961,0.5824348,0.00022978174,0.00017877806,0.00022199676,0.0016496052,0.0064494796,0.008041463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992661,0.000103960636,0.00006274667,0.00008592255,0.0003824084,0.000098898505],"domain_scores_gemma":[0.99758685,0.000513809,0.00013371404,0.0008469077,0.00085678045,0.000061926796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007482753,0.0009344813,0.0005321874,0.0007690316,0.00034965738,0.0010165311,0.0016344805,0.00041027748,0.0076642423],"category_scores_gemma":[0.004268202,0.000382172,0.0004600311,0.00063233933,0.0003498736,0.0007619645,0.00070995756,0.0012023161,0.0039967895],"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.0009847789,0.0003148629,0.003411684,0.0007302638,0.00012707073,0.0007043927,0.00056212477,0.071763925,0.19769621,0.050468486,0.034535356,0.6387009],"study_design_scores_gemma":[0.00020999792,0.00036365862,0.0032706687,0.00021205326,0.00011210317,0.0005600515,0.000058245725,0.586851,0.27738917,0.013721756,0.11713913,0.000112146474],"about_ca_topic_score_codex":0.0010669103,"about_ca_topic_score_gemma":0.0011502249,"teacher_disagreement_score":0.0076642423,"about_ca_system_score_codex":0.00052053167,"about_ca_system_score_gemma":0.0010139602,"threshold_uncertainty_score":0.025639415},"labels":[],"label_agreement":null},{"id":"W2075202684","doi":"10.1016/j.jal.2006.11.001","title":"Error analysis of digital filters using HOL theorem proving","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Logic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Fixed-point arithmetic; Mathematics; Digital filter; Algorithm; Mathematical proof; Parametric statistics; Fixed point; Filter (signal processing); Floating point; Discrete mathematics; Arithmetic; Computer science; Mathematical analysis","score_opus":0.04357466503073198,"score_gpt":0.3204460977775031,"score_spread":0.2768714327467711,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075202684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012245971,0.00013449856,0.9854138,0.00015129494,0.000051712574,0.0000128008105,0.000021992433,0.00022397931,0.001743951],"genre_scores_gemma":[0.80118865,0.0003849106,0.19221339,0.00021089791,0.00016623475,0.000057275178,0.00012523071,0.00030506527,0.0053483346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9959254,0.001055385,0.00023927943,0.00045571633,0.0019810654,0.0003431945],"domain_scores_gemma":[0.9726882,0.019794585,0.001236324,0.0029456369,0.0030785708,0.00025667882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053634285,0.00088610203,0.0012157173,0.0021136124,0.0008880342,0.0027071664,0.0019428014,0.0011397131,0.003884794],"category_scores_gemma":[0.023588901,0.0005243929,0.0009994288,0.0010172171,0.002592541,0.0040902137,0.002673043,0.0021935583,0.0004025898],"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.00084966427,0.00013702206,0.002784457,0.00038732254,0.00018236836,0.00027079004,0.0004052727,0.22870602,0.008285962,0.62327534,0.002442977,0.13227284],"study_design_scores_gemma":[0.00003301494,0.000045042878,0.00024728666,0.000028036604,0.000033112156,0.000060400856,0.00003160958,0.7716597,0.0077648787,0.21910119,0.0009761112,0.000019637244],"about_ca_topic_score_codex":0.0016291793,"about_ca_topic_score_gemma":0.0014281329,"teacher_disagreement_score":0.0053634285,"about_ca_system_score_codex":0.001565586,"about_ca_system_score_gemma":0.0011677113,"threshold_uncertainty_score":0.028364897},"labels":[],"label_agreement":null},{"id":"W2075451481","doi":"10.1016/j.enbuild.2006.11.008","title":"Applying uncertainty considerations to energy conservation equations","year":2007,"lang":"en","type":"article","venue":"Energy and Buildings","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Monte Carlo method; Computer science; Uncertainty quantification; Conservation of energy; Energy conservation; Mathematical optimization; Uncertainty analysis; Sensitivity analysis; Energy (signal processing); Industrial engineering; Simulation; Engineering; Mathematics; Machine learning; Statistics","score_opus":0.024311162219795335,"score_gpt":0.28167722446178206,"score_spread":0.2573660622419867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075451481","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008726691,0.0014832545,0.9748657,0.0014598076,0.0003325783,0.000020029043,0.000049316877,0.00003825763,0.013024507],"genre_scores_gemma":[0.7479958,0.00513702,0.2259992,0.00099006,0.0013350745,0.00022758177,0.00014702095,0.00030815694,0.017860098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990213,0.00044265453,0.000045258013,0.000072743984,0.00036156757,0.00005651558],"domain_scores_gemma":[0.9971584,0.002084319,0.00017102475,0.0001527455,0.00037130454,0.00006211936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019487796,0.0007593025,0.0011166295,0.0011590398,0.0008149597,0.0017683778,0.0012343075,0.0011891592,0.0023288357],"category_scores_gemma":[0.011023771,0.0005577139,0.0010656731,0.001128109,0.0020483122,0.0029779363,0.0024779271,0.0028491388,0.00020836492],"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.000015182666,0.000014786262,0.00021615757,0.000084544445,0.000027382202,0.00007099829,0.00011165382,0.19897501,0.00044306912,0.7861615,0.0010222194,0.012857466],"study_design_scores_gemma":[0.0000036074603,0.0000059456943,0.00008783561,0.000022644868,0.0000076936985,0.000014716395,0.000023567989,0.47648853,0.00022434526,0.52043116,0.0026788705,0.000011114568],"about_ca_topic_score_codex":0.0060065985,"about_ca_topic_score_gemma":0.0037888358,"teacher_disagreement_score":0.0060065985,"about_ca_system_score_codex":0.0011915977,"about_ca_system_score_gemma":0.0008418125,"threshold_uncertainty_score":0.011943281},"labels":[],"label_agreement":null},{"id":"W2075887856","doi":"10.1188/08.onf.449-454","title":"Understanding the Concept of Uncertainty in Patients With Indolent Lymphoma","year":2008,"lang":"en","type":"review","venue":"Oncology nursing forum","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"CancerCare Manitoba","funders":"","keywords":"Medicine; Lymphoma; Internal medicine; Oncology; Intensive care medicine; Dermatology; Family medicine","score_opus":0.08595756026008981,"score_gpt":0.3553679361017726,"score_spread":0.26941037584168276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075887856","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002462336,0.9972505,0.00035751006,0.0014641306,0.00013233791,0.000008765952,0.0000068257723,0.000002047718,0.0005315724],"genre_scores_gemma":[0.0062057413,0.9921416,0.0006977116,0.00060810207,0.00020350899,0.00003436717,0.000014858331,0.0000014339155,0.00009261596],"study_design_codex":"design_other","study_design_gemma":"qualitative","domain_scores_codex":[0.9962811,0.002319003,0.00045301087,0.00016198817,0.000709536,0.00007543696],"domain_scores_gemma":[0.9728732,0.023592353,0.0018851517,0.00017361442,0.001316825,0.00015881995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056325826,0.00066078524,0.0020217337,0.0036231156,0.00052248547,0.002918492,0.0015256068,0.0022919157,0.0019709957],"category_scores_gemma":[0.029697724,0.00040602274,0.0012142764,0.0044590207,0.002253829,0.004352095,0.0014841068,0.0022978878,0.00028887513],"study_design_candidate":"qualitative","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.00010159319,0.000041306455,0.0019035351,0.10037999,0.00051791954,0.00046193175,0.0022662024,0.0011289511,0.00015309891,0.015131282,0.016356457,0.8615578],"study_design_scores_gemma":[0.00014112338,0.0003329286,0.009626067,0.4075926,0.0017354914,0.008814275,0.007610698,0.0011415682,0.0004991289,0.05610064,0.506248,0.00015762259],"about_ca_topic_score_codex":0.0039072186,"about_ca_topic_score_gemma":0.004810684,"teacher_disagreement_score":0.0056325826,"about_ca_system_score_codex":0.0022414662,"about_ca_system_score_gemma":0.006224633,"threshold_uncertainty_score":0.029788256},"labels":[],"label_agreement":null},{"id":"W2078477494","doi":"10.1109/newcas.2014.6933979","title":"A hybrid arithmetic transform for precision analysis of floating-point polynomial specifications","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"McGill University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Saturation arithmetic; Polynomial; Floating point; Algorithm; Affine transformation; Arithmetic; Arbitrary-precision arithmetic; Mathematics; Computer science","score_opus":0.03482807649987794,"score_gpt":0.29225137411768154,"score_spread":0.2574232976178036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078477494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014100352,0.00010385298,0.9839002,0.000030222334,0.00002250502,0.000015872738,0.000024185341,0.00073870935,0.0010640585],"genre_scores_gemma":[0.55237734,0.00019075007,0.4455198,0.00007485576,0.00004709851,0.000080696125,0.00014130503,0.00027295295,0.001295206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879646,0.00018423941,0.000057705864,0.00013983753,0.0007401956,0.00008143149],"domain_scores_gemma":[0.9984244,0.0006955834,0.00016410432,0.0003132062,0.00036818002,0.000034515546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093479996,0.00062611484,0.00045706227,0.0012793099,0.0003019051,0.0008140412,0.00092392764,0.0004854382,0.0020783332],"category_scores_gemma":[0.0038807732,0.00021985757,0.0007403324,0.00089991785,0.0008237306,0.0013391414,0.00085603405,0.0010259036,0.00046232142],"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.00037616643,0.000103232116,0.0022337693,0.0003212034,0.00008066582,0.00020652832,0.00023579178,0.38727707,0.105103604,0.17121382,0.0013895746,0.33145857],"study_design_scores_gemma":[0.000014658515,0.00016668583,0.00026454404,0.000030995816,0.000022772727,0.00014139159,0.000023012968,0.93292624,0.03504058,0.028259572,0.0030908869,0.000018589004],"about_ca_topic_score_codex":0.00068729674,"about_ca_topic_score_gemma":0.00056358665,"teacher_disagreement_score":0.0020783332,"about_ca_system_score_codex":0.00058911473,"about_ca_system_score_gemma":0.00091758615,"threshold_uncertainty_score":0.006952703},"labels":[],"label_agreement":null},{"id":"W2079035898","doi":"10.1109/pacrim.1995.519575","title":"A high speed CORDIC algorithm","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; Rounding; Algorithm; Computer science; Simple (philosophy); Trigonometry; Trigonometric functions; Noise (video); Mathematics; Field-programmable gate array; Artificial intelligence","score_opus":0.027132771953130276,"score_gpt":0.255478677385207,"score_spread":0.22834590543207675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079035898","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031602324,0.0004352991,0.964423,0.0002235686,0.00044803292,0.00017228346,0.0001982785,0.005988095,0.024951264],"genre_scores_gemma":[0.06153556,0.00039688736,0.9079726,0.00032395648,0.00021509001,0.00027827575,0.0006483388,0.00096640445,0.027662905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999215,0.000112485184,0.000053007,0.00013206349,0.0004065122,0.000080867496],"domain_scores_gemma":[0.99906296,0.000113713526,0.000043482793,0.00021997027,0.0005058491,0.0000540677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006245658,0.0010415998,0.00065929943,0.0011213778,0.00088820397,0.0017215187,0.0015427206,0.001165103,0.033460498],"category_scores_gemma":[0.0029717814,0.0003768329,0.0004549178,0.0014005629,0.0005717202,0.0013863556,0.0012290564,0.0010877376,0.0141490465],"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.00033646257,0.00008817069,0.0007872268,0.00032519115,0.000038108737,0.00026693786,0.0001165209,0.059587885,0.01392806,0.12731928,0.08436122,0.7128449],"study_design_scores_gemma":[0.00025420127,0.00020656691,0.0003773636,0.00012615483,0.000040383882,0.0009733519,0.000064667875,0.6268078,0.034096897,0.051415868,0.2855579,0.00007883913],"about_ca_topic_score_codex":0.0021296781,"about_ca_topic_score_gemma":0.002107282,"teacher_disagreement_score":0.033460498,"about_ca_system_score_codex":0.00076416926,"about_ca_system_score_gemma":0.0013724426,"threshold_uncertainty_score":0.11193651},"labels":[],"label_agreement":null},{"id":"W2083553720","doi":"10.1109/tcad.2010.2049154","title":"Optimization of Imprecise Circuits Represented by Taylor Series and Real-Valued Polynomials","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Taylor series; Series (stratigraphy); Arbitrary-precision arithmetic; Algorithm; Floating point; Interval arithmetic; Function (biology); Implementation; Representation (politics); Mathematics; Fixed-point arithmetic; Point (geometry); Double-precision floating-point format; Selection (genetic algorithm); Upper and lower bounds; Branch and bound; Mathematical optimization; Computer science; Artificial intelligence","score_opus":0.026209392058982654,"score_gpt":0.25936216038812093,"score_spread":0.23315276832913828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083553720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03112758,0.0002453009,0.96487445,0.00009670797,0.00001831117,0.000018247889,0.000036726586,0.0001777175,0.0034049386],"genre_scores_gemma":[0.71634483,0.0004604646,0.28026786,0.00005525045,0.000024601863,0.00009972092,0.00007201944,0.00012823899,0.0025469656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990509,0.0002382124,0.000048114605,0.00013686564,0.00044067827,0.0000852244],"domain_scores_gemma":[0.9988689,0.0007271624,0.00016847464,0.00011170721,0.00011061204,0.000013104892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013527727,0.00083234557,0.0007849535,0.00051030854,0.00024808294,0.001427296,0.0009086386,0.000695902,0.0015399364],"category_scores_gemma":[0.0043236776,0.00046414154,0.0005703619,0.000900038,0.0009153272,0.0014527162,0.00052442314,0.0010326722,0.00026417588],"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.000047748326,0.000009710055,0.00011974233,0.00006725538,0.000015247984,0.000043160802,0.000045472345,0.9311335,0.004917512,0.039239153,0.00022215657,0.024139345],"study_design_scores_gemma":[0.000010441409,0.000041898245,0.000042748823,0.000012083496,0.000011353548,0.00002202614,0.000013254706,0.97815543,0.004179967,0.016694391,0.0008090001,0.0000075359785],"about_ca_topic_score_codex":0.0009292118,"about_ca_topic_score_gemma":0.0010304777,"teacher_disagreement_score":0.0015399364,"about_ca_system_score_codex":0.0010830753,"about_ca_system_score_gemma":0.0006922062,"threshold_uncertainty_score":0.007858276},"labels":[],"label_agreement":null},{"id":"W2083801841","doi":"10.1109/aspdac.2012.6165061","title":"Fixed-point accuracy analysis of datapaths with mixed CORDIC and polynomial computations","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"CORDIC; Datapath; Polynomial; Mathematics; Taylor series; Floating point; Fixed point; Algorithm; Fixed-point arithmetic; Lookup table; Computer science; Arithmetic; Parallel computing; Field-programmable gate array","score_opus":0.021126978122245385,"score_gpt":0.2937076062067979,"score_spread":0.2725806280845525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083801841","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034706604,0.00034625203,0.9628531,0.000059882015,0.000019505324,0.000019859626,0.000033425044,0.00038725632,0.0015742317],"genre_scores_gemma":[0.8043486,0.00036643076,0.1935647,0.00003982577,0.000026641186,0.00003954272,0.00007105699,0.00015040541,0.0013927894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819034,0.00020777363,0.00009211294,0.0002171963,0.001185392,0.00010721892],"domain_scores_gemma":[0.9969512,0.0013397716,0.0004302569,0.000591851,0.0006503653,0.00003652548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011739811,0.0008279328,0.0005536355,0.0011671375,0.00035508722,0.00094542216,0.001335981,0.00049580244,0.0010421735],"category_scores_gemma":[0.007777091,0.00028587502,0.00045440276,0.0009984956,0.0008716571,0.0019724981,0.0007346695,0.00091080816,0.00024037091],"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.00025304675,0.00003159745,0.0027714374,0.00024044416,0.000058756043,0.00019611082,0.00018567119,0.7979499,0.02855226,0.065336704,0.0005875094,0.10383655],"study_design_scores_gemma":[0.0000050234858,0.000074061936,0.0003228716,0.000021651667,0.000012493639,0.000096581716,0.000017300168,0.96932566,0.018415,0.010573668,0.0011236176,0.000012123554],"about_ca_topic_score_codex":0.0017357673,"about_ca_topic_score_gemma":0.0016075446,"teacher_disagreement_score":0.0017357673,"about_ca_system_score_codex":0.0014442228,"about_ca_system_score_gemma":0.00089631695,"threshold_uncertainty_score":0.010478616},"labels":[],"label_agreement":null},{"id":"W2084363214","doi":"10.1109/hldvt.2010.5496667","title":"Analysis of range and precision for fixed-point linear arithmetic circuits with feedbacks","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Heuristics; Fixed-point arithmetic; Electronic circuit; Algorithm; Range (aeronautics); Infinite impulse response; Filter (signal processing); Floating point; Digital filter","score_opus":0.014945658344899446,"score_gpt":0.28512894158239543,"score_spread":0.27018328323749596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084363214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044387273,0.0005596271,0.9518612,0.000081889346,0.0000119326305,0.000024558183,0.000028196966,0.00045523923,0.0025901855],"genre_scores_gemma":[0.82777303,0.00064504525,0.16981328,0.000041270338,0.00003313032,0.00007894574,0.000066562345,0.00015168711,0.0013971173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865,0.00024356163,0.00005988217,0.00017796746,0.0007396905,0.00012899096],"domain_scores_gemma":[0.9955688,0.0032821058,0.00043220544,0.0002948324,0.00037348783,0.000048561156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013939231,0.0005809347,0.000515983,0.0011772464,0.0002809276,0.00087981543,0.0007992099,0.000502707,0.0020245519],"category_scores_gemma":[0.009236525,0.00027281942,0.0005575901,0.00061500014,0.0010303952,0.0014330306,0.0005466455,0.0006819246,0.0002572283],"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.00045894206,0.000035602126,0.001067171,0.0003432047,0.000044572404,0.00017215761,0.00020685508,0.65807074,0.062431715,0.14596431,0.00049339037,0.13071136],"study_design_scores_gemma":[0.000021375628,0.00011623586,0.00033221988,0.000048210986,0.00001958155,0.000112651695,0.00002221921,0.92476827,0.028462168,0.045156498,0.0009160549,0.000024460347],"about_ca_topic_score_codex":0.00060320157,"about_ca_topic_score_gemma":0.00051609764,"teacher_disagreement_score":0.0020245519,"about_ca_system_score_codex":0.0008618626,"about_ca_system_score_gemma":0.0005535017,"threshold_uncertainty_score":0.0073719025},"labels":[],"label_agreement":null},{"id":"W2085969366","doi":"10.1023/b:numa.0000049478.42605.cf","title":"Interval Arithmetic, Affine Arithmetic, Taylor Series Methods: Why, What Next?","year":2004,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Affine arithmetic; Interval arithmetic; Mathematics; Taylor series; Interval (graph theory); Arithmetic; Affine transformation; Theory of computation; Arbitrary-precision arithmetic; Computation; Series (stratigraphy); Range (aeronautics); Saturation arithmetic; Discrete mathematics; Algebra over a field; Pure mathematics; Algorithm; Combinatorics; Mathematical analysis","score_opus":0.03378618326497619,"score_gpt":0.32408456002474917,"score_spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085969366","genre_codex":"review","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039204485,0.48755148,0.17076172,0.28234679,0.029332016,0.000074883275,0.00018923504,0.0006386232,0.025184743],"genre_scores_gemma":[0.13933288,0.50187343,0.1860257,0.0715104,0.07650543,0.0003761079,0.00024227348,0.0007028192,0.023430994],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965618,0.0018860222,0.00017593034,0.00035492098,0.0008434209,0.0001778477],"domain_scores_gemma":[0.9883515,0.0062026326,0.0007238947,0.00086017104,0.0033722727,0.0004895284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008940325,0.00082920236,0.0017187659,0.0016807033,0.0009675025,0.0074725207,0.0016633922,0.0049010064,0.006976532],"category_scores_gemma":[0.030408971,0.00049755984,0.00095474307,0.002930274,0.009039964,0.015022381,0.0018056278,0.009130882,0.0035654402],"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.00011874306,0.000113833965,0.0011236955,0.0019134794,0.00010113736,0.000094640345,0.00060787576,0.001403917,0.00051095407,0.5363647,0.12064672,0.33700037],"study_design_scores_gemma":[0.00004024372,0.000050113267,0.00067607313,0.0016159699,0.00005715784,0.00022356056,0.0012612834,0.0038414293,0.00031985634,0.8147137,0.17712174,0.00007880518],"about_ca_topic_score_codex":0.0027557386,"about_ca_topic_score_gemma":0.0024045405,"teacher_disagreement_score":0.008940325,"about_ca_system_score_codex":0.0014300478,"about_ca_system_score_gemma":0.002190781,"threshold_uncertainty_score":0.047281504},"labels":[],"label_agreement":null},{"id":"W2088111445","doi":"10.1109/tcad.2013.2238290","title":"On the Fixed-Point Accuracy Analysis and Optimization of Polynomial Specifications","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Polynomial; Robustness (evolution); Signal-flow graph; Algorithm; Quantization (signal processing); Mathematics; Mean squared error; Fixed point; Mathematical optimization; Computer science; Statistics","score_opus":0.04890648298728648,"score_gpt":0.2505818347307598,"score_spread":0.2016753517434733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088111445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055628424,0.00019341242,0.9929006,0.00006520474,0.000007874255,0.000011209689,0.000014883332,0.00011815365,0.0011258023],"genre_scores_gemma":[0.5480235,0.0011258026,0.44785556,0.000079908525,0.000042117746,0.00012221276,0.00012373854,0.00032378943,0.0023031647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986045,0.000450952,0.000049050355,0.00019175113,0.0006129947,0.0000908631],"domain_scores_gemma":[0.9960698,0.0029066491,0.0003169248,0.00028620195,0.00038997998,0.00003042845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021565177,0.0010409505,0.00076756993,0.00090397464,0.00033717387,0.0010328847,0.0008652787,0.0006351773,0.0018725254],"category_scores_gemma":[0.0096001625,0.00047194594,0.0009184076,0.0010250933,0.0012333667,0.0013110146,0.00068414724,0.0012970108,0.0003687998],"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.000025937708,0.000009530681,0.000116349875,0.0000640134,0.0000108165195,0.000015601014,0.000034498637,0.9389302,0.0023164076,0.028626611,0.00019425215,0.02965574],"study_design_scores_gemma":[0.0000042574275,0.000026523241,0.000041279895,0.000012977148,0.0000042270285,0.0000104866795,0.000006023084,0.9852223,0.0019557683,0.012174981,0.0005345802,0.0000066123957],"about_ca_topic_score_codex":0.003523437,"about_ca_topic_score_gemma":0.0024165784,"teacher_disagreement_score":0.003523437,"about_ca_system_score_codex":0.0014190916,"about_ca_system_score_gemma":0.0012855398,"threshold_uncertainty_score":0.011404872},"labels":[],"label_agreement":null},{"id":"W2088144429","doi":"10.1109/iscas.2012.6272100","title":"Verification of fixed-point datapaths with comparator units using Constrained Arithmetic Transform (CAT)","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Comparator; Fixed-point arithmetic; Arithmetic; Computer science; Range (aeronautics); Arbitrary-precision arithmetic; Adder; Polynomial; Algorithm; Mathematics; Parallel computing; Floating point; Engineering","score_opus":0.06349508672955911,"score_gpt":0.30127826310572176,"score_spread":0.23778317637616264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088144429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028567143,0.00020360133,0.96540403,0.000082333485,0.00006554039,0.00007166292,0.00015259888,0.0033354652,0.0021176096],"genre_scores_gemma":[0.56632113,0.00021753894,0.43079,0.00012496958,0.00006117151,0.00016665494,0.00045912465,0.0005454929,0.001313988],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961935,0.00056772184,0.0003457956,0.0005086341,0.0021377553,0.0002465494],"domain_scores_gemma":[0.9904017,0.0047554416,0.0011129247,0.0017997539,0.0018408119,0.00008941902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017498761,0.0010732935,0.00072176434,0.0015236005,0.00080915925,0.0015488148,0.002107624,0.0008545161,0.006289604],"category_scores_gemma":[0.012723762,0.00039600284,0.0011427222,0.0014669969,0.0017161556,0.004136739,0.0013799217,0.0011541009,0.00075128814],"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.0019265381,0.00020152087,0.0076882555,0.0017825356,0.0002896697,0.0011756312,0.00052420696,0.19902977,0.17164697,0.18074715,0.007005162,0.42798266],"study_design_scores_gemma":[0.00018102594,0.00063746294,0.0009913233,0.00016745164,0.00012980038,0.00085402577,0.00012988805,0.70885855,0.20068407,0.078130506,0.009139577,0.00009629337],"about_ca_topic_score_codex":0.0020846385,"about_ca_topic_score_gemma":0.0021556243,"teacher_disagreement_score":0.006289604,"about_ca_system_score_codex":0.0010074957,"about_ca_system_score_gemma":0.002457204,"threshold_uncertainty_score":0.021040797},"labels":[],"label_agreement":null},{"id":"W2089329507","doi":"10.1016/j.jalgor.2004.01.002","title":"Simple constant amortized time generation of fixed length numeric partitions","year":2004,"lang":"en","type":"article","venue":"Journal of Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Amortized analysis; Simple (philosophy); Constant (computer programming); Mathematics; Combinatorics; Algorithm; Discrete mathematics; Data structure; Computer science","score_opus":0.03443542798261186,"score_gpt":0.29426492655903175,"score_spread":0.2598294985764199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089329507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13804796,0.0008622834,0.7950985,0.0013116997,0.0008206223,0.00075947394,0.0016632385,0.028335124,0.033101097],"genre_scores_gemma":[0.41124943,0.0001846634,0.5720268,0.00041019934,0.00015083952,0.00058411324,0.0019992453,0.0029923345,0.010402425],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99741334,0.00057859195,0.00019419717,0.00046218766,0.00085457315,0.00049718126],"domain_scores_gemma":[0.9917019,0.00330868,0.00039758792,0.003148895,0.001065446,0.00037750666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305184,0.0018407642,0.001681073,0.0013500551,0.0018014471,0.0029279066,0.003477854,0.0014514751,0.029015685],"category_scores_gemma":[0.010304891,0.0008291431,0.0018672219,0.0027791364,0.0017099003,0.004068348,0.004590152,0.0017829194,0.006050242],"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.0068232073,0.0005424714,0.0030298496,0.0011373569,0.00030211805,0.00066031265,0.00071252347,0.15834807,0.045325845,0.05998935,0.06691894,0.65621],"study_design_scores_gemma":[0.0012849373,0.00039800754,0.0009029582,0.00007532941,0.00018540569,0.0003031164,0.00038316843,0.80004275,0.02861618,0.15087676,0.016830368,0.00010103518],"about_ca_topic_score_codex":0.0032786452,"about_ca_topic_score_gemma":0.0066151107,"teacher_disagreement_score":0.029015685,"about_ca_system_score_codex":0.0021676992,"about_ca_system_score_gemma":0.002978504,"threshold_uncertainty_score":0.09706718},"labels":[],"label_agreement":null},{"id":"W2089902593","doi":"10.1109/tvlsi.2008.2003004","title":"Time-Efficient Single Constant Multiplication Based on Overlapping Digit Patterns","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Adder; Constant (computer programming); Computer science; Heuristic; Algorithm; Multiplication algorithm; Arithmetic; Divide and conquer algorithms; Parallel computing; Mathematics; Combinatorics; Artificial intelligence; Binary number","score_opus":0.01695558374234841,"score_gpt":0.25498225957597764,"score_spread":0.23802667583362924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089902593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07393396,0.00037199556,0.9164175,0.00016387369,0.000080805235,0.00008559057,0.00009543684,0.0021699427,0.0066808006],"genre_scores_gemma":[0.29282558,0.00016701584,0.70269483,0.00006406143,0.000028682793,0.00008117624,0.00020725996,0.000116285366,0.00381506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.00006383433,0.000033310003,0.00009439647,0.00017109921,0.000076362536],"domain_scores_gemma":[0.99926513,0.00032386743,0.000080085185,0.00016368099,0.00013183733,0.000035438825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034282214,0.0006130002,0.00071764697,0.0008788535,0.00050050876,0.0008520343,0.0011994513,0.0004687488,0.005225482],"category_scores_gemma":[0.0017642077,0.0003285874,0.00045781926,0.0018912237,0.00042821394,0.0012810585,0.00069984386,0.00040049272,0.0012607042],"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.0006064627,0.00010607782,0.0010335436,0.00028772542,0.000047811103,0.0002944533,0.00012705397,0.10438812,0.04184648,0.029167954,0.0063406113,0.81575376],"study_design_scores_gemma":[0.0002074265,0.0003334625,0.0005494303,0.0000328759,0.00003932183,0.0006308357,0.00006610689,0.89696074,0.06377476,0.028071458,0.00929404,0.000039636394],"about_ca_topic_score_codex":0.0015520355,"about_ca_topic_score_gemma":0.0025092904,"teacher_disagreement_score":0.005225482,"about_ca_system_score_codex":0.00041668332,"about_ca_system_score_gemma":0.0010881226,"threshold_uncertainty_score":0.01748097},"labels":[],"label_agreement":null},{"id":"W2091085418","doi":"10.1051/ro:2008007","title":"La différentiation automatique et son utilisation en optimisation","year":2008,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Numerical Methods and Algorithms","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":"Université de Sherbrooke","funders":"","keywords":"Sketch; Computer science; Software; Focus (optics); Automatic differentiation; Software engineering; Key (lock); Ideal (ethics); Operations research; Engineering; Computer security; Programming language; Algorithm; Epistemology; Philosophy","score_opus":0.14849846666276098,"score_gpt":0.4375453487014911,"score_spread":0.2890468820387301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091085418","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035468456,0.023941353,0.9407453,0.0024620388,0.0009076695,0.000026630305,0.000046912333,0.00038343418,0.027939832],"genre_scores_gemma":[0.21340346,0.03940357,0.7063138,0.0018333202,0.0025954132,0.00031827064,0.00017192459,0.001138911,0.03482137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9946502,0.0024983939,0.00030404664,0.00056262023,0.0018045024,0.00018023585],"domain_scores_gemma":[0.995331,0.0033099288,0.00021410202,0.0005062155,0.00055098993,0.000087764194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050407606,0.001762232,0.0015227079,0.0018354581,0.0008823339,0.0035153213,0.0013924456,0.002070352,0.0039104824],"category_scores_gemma":[0.011001149,0.0007245451,0.001512453,0.0029701355,0.006619211,0.00413902,0.0021180937,0.006580377,0.0022217035],"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.00004687624,0.0000141709115,0.00021573006,0.00031657144,0.000035960322,0.0000946406,0.00029776624,0.019197935,0.001497754,0.8829388,0.0029825934,0.092361204],"study_design_scores_gemma":[0.00003451273,0.00007501083,0.00029961072,0.00022296752,0.00003346333,0.00036628114,0.000093201976,0.13130054,0.0039827814,0.7135149,0.1500082,0.00006850506],"about_ca_topic_score_codex":0.0038676765,"about_ca_topic_score_gemma":0.0021609077,"teacher_disagreement_score":0.0050407606,"about_ca_system_score_codex":0.0024003545,"about_ca_system_score_gemma":0.0013869123,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W2091144177","doi":"10.1117/12.452047","title":"Digital filtering using the multidimensional logarithmic number system","year":2002,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Logarithm; Digital signal processing; Reduction (mathematics); Exponential function; Digital filter; Generalization; Representation (politics); Binary number; Filter (signal processing); Massively parallel; Algorithm; Process (computing); Parallel computing; Computational science; Computer hardware; Arithmetic; Mathematics","score_opus":0.020347236851406877,"score_gpt":0.2453737323243149,"score_spread":0.225026495472908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091144177","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010172108,0.00075941876,0.9803507,0.00023432492,0.00018257285,0.00002540001,0.00003152241,0.00039887428,0.007844978],"genre_scores_gemma":[0.3050492,0.0019853744,0.6818566,0.00030920966,0.00024308202,0.000121642064,0.00012652019,0.000118651886,0.010189639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99973804,0.000068522575,0.000020787253,0.0000424437,0.00011071336,0.000019551853],"domain_scores_gemma":[0.99971825,0.00010325429,0.00003488013,0.000063613494,0.00006776666,0.000012145525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033207418,0.00034122835,0.0002915351,0.00067593594,0.00032183854,0.0011871347,0.00047588287,0.000497141,0.0035520063],"category_scores_gemma":[0.0016197698,0.00013214198,0.0002679236,0.00080286287,0.0005776632,0.0016589408,0.00067974505,0.00053241145,0.0016603747],"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.0002994438,0.000047361817,0.0013409024,0.00033086905,0.00002545838,0.00047255994,0.00030854804,0.06421991,0.092021495,0.43679222,0.0040787617,0.40006238],"study_design_scores_gemma":[0.000061282306,0.00026739776,0.00072960573,0.000097030366,0.000022774775,0.0013757305,0.0000664337,0.6963455,0.065247655,0.14678557,0.088907085,0.000093965886],"about_ca_topic_score_codex":0.000267298,"about_ca_topic_score_gemma":0.00030516586,"teacher_disagreement_score":0.0035520063,"about_ca_system_score_codex":0.00046124542,"about_ca_system_score_gemma":0.00028975584,"threshold_uncertainty_score":0.011882663},"labels":[],"label_agreement":null},{"id":"W2093566518","doi":"10.1109/synasc.2013.25","title":"Software Implementation of Numerical Algorithms in Arbitrary Precision","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"MATLAB; Computer science; Algebraic number; Class (philosophy); Software; Algorithm; Numerical analysis; Theoretical computer science; Mathematics; Programming language; Artificial intelligence","score_opus":0.01633220827336522,"score_gpt":0.31391695572249273,"score_spread":0.2975847474491275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093566518","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016290356,0.00015827303,0.9604563,0.000094580726,0.00007709022,0.0000680542,0.000483666,0.029784916,0.007248054],"genre_scores_gemma":[0.05319254,0.00061842747,0.9185113,0.00030033325,0.0000960572,0.0007025243,0.0027280885,0.010323376,0.013527434],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976119,0.00039231777,0.00030501277,0.0002296246,0.0012358974,0.00022528206],"domain_scores_gemma":[0.99649316,0.0009575296,0.00024882608,0.00079493236,0.0013570002,0.00014853111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015966963,0.0010272807,0.0009536331,0.0013145005,0.0006007668,0.0018282657,0.0038549495,0.00096696615,0.028407775],"category_scores_gemma":[0.009433714,0.0007110104,0.0009215377,0.0015417095,0.0007153684,0.0014912331,0.0018889586,0.0023173983,0.022453029],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068113115,0.0002586449,0.002291647,0.0017311008,0.00018337731,0.0008810215,0.00055517553,0.0962821,0.044829052,0.19920205,0.10852099,0.54458374],"study_design_scores_gemma":[0.00031625613,0.00018262456,0.0009212434,0.00031861712,0.000062935025,0.0012022941,0.00007254632,0.43537036,0.10835075,0.07614473,0.37689796,0.0001597666],"about_ca_topic_score_codex":0.0011168842,"about_ca_topic_score_gemma":0.0011870892,"teacher_disagreement_score":0.028407775,"about_ca_system_score_codex":0.00067348446,"about_ca_system_score_gemma":0.0015458651,"threshold_uncertainty_score":0.09503353},"labels":[],"label_agreement":null},{"id":"W2095308140","doi":"10.1007/s00283-010-9158-3","title":"A World Record in Atlantic City and the Length of the Shooter’s Hand at Craps","year":2010,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Geography","score_opus":0.03028968011135075,"score_gpt":0.29318468675765796,"score_spread":0.2628950066463072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095308140","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24546303,0.008763872,0.003015529,0.17210582,0.0167666,0.00005543355,0.015465865,0.00048659372,0.53787726],"genre_scores_gemma":[0.6842044,0.005570781,0.0019754455,0.014394854,0.004369857,0.000039095474,0.006080264,0.00053270307,0.28283265],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988477,0.000060907983,0.000040686064,0.00023014094,0.00054571463,0.00027477625],"domain_scores_gemma":[0.99681735,0.00029386513,0.00058098516,0.00021752916,0.0012922491,0.0007979699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006828884,0.00031424197,0.00027591817,0.0014493611,0.0067610806,0.003714463,0.0006818277,0.0020196836,0.02929971],"category_scores_gemma":[0.004753097,0.00029241532,0.00021850127,0.0030285649,0.0026569094,0.0030825373,0.0023663256,0.0061870823,0.006400005],"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.000495002,0.00007980429,0.075686485,0.00043043488,0.00007635981,0.0021717907,0.025503155,0.0003504927,0.0024122803,0.03956929,0.72694117,0.1262837],"study_design_scores_gemma":[0.0000070473543,0.000043480788,0.087109685,0.00025902936,0.000020243328,0.0006371383,0.0230401,0.00009315359,0.0005093651,0.0021521596,0.8860816,0.000046884812],"about_ca_topic_score_codex":0.15111889,"about_ca_topic_score_gemma":0.41461718,"teacher_disagreement_score":0.15111889,"about_ca_system_score_codex":0.004242588,"about_ca_system_score_gemma":0.002854545,"threshold_uncertainty_score":0.30047852},"labels":[],"label_agreement":null},{"id":"W2096180483","doi":"10.1155/asp.2005.3015","title":"A Low-Power Two-Digit Multi-dimensional Logarithmic Number System Filterbank Architecture for a Digital Hearing Aid","year":2005,"lang":"en","type":"article","venue":"EURASIP Journal on Advances in Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Filter bank; Computer science; Logarithm; Multiplication (music); Reduction (mathematics); Numerical digit; Arithmetic; Dynamic range; Computer hardware; Mathematics; Telecommunications","score_opus":0.01895903974653008,"score_gpt":0.3188527664335761,"score_spread":0.299893726687046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096180483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03608779,0.0004004278,0.95485854,0.00056431553,0.00027757252,0.000101128404,0.00009634677,0.0017453245,0.005868608],"genre_scores_gemma":[0.30683577,0.00046517272,0.67932177,0.00060637883,0.00021423875,0.0001610802,0.00020352914,0.000071071954,0.012121084],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986684,0.00003275803,0.000011575058,0.000029476509,0.00004756126,0.000011734386],"domain_scores_gemma":[0.99985623,0.00004244564,0.000012280174,0.000029286444,0.000043938257,0.00001571818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169381,0.00032769114,0.00026768513,0.00027787144,0.00026501645,0.0005507649,0.00067662913,0.0006292022,0.0062768017],"category_scores_gemma":[0.00052248844,0.00016916411,0.00021516104,0.00024148848,0.00021436652,0.00066362333,0.00031162758,0.00038335047,0.0025049462],"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.00085976627,0.0001260453,0.00084165065,0.00032243493,0.000054408225,0.0006304207,0.00017757717,0.008907763,0.49491003,0.01929917,0.00644214,0.4674286],"study_design_scores_gemma":[0.00048050503,0.0022933912,0.0036468003,0.00017919358,0.00022151713,0.0047894474,0.0001210324,0.5099396,0.3376569,0.008745959,0.13179344,0.00013221856],"about_ca_topic_score_codex":0.0003679035,"about_ca_topic_score_gemma":0.0010799046,"teacher_disagreement_score":0.0062768017,"about_ca_system_score_codex":0.0003301631,"about_ca_system_score_gemma":0.00039308288,"threshold_uncertainty_score":0.02099806},"labels":[],"label_agreement":null},{"id":"W2096263144","doi":"10.1109/tvlsi.2010.2048588","title":"CVNS-Based Storage and Refreshing Scheme for a Multi-Valued Dynamic Memory","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Noise margin; Computer science; Dynamic random-access memory; Chip; CMOS; Computer data storage; Electronic engineering; Noise (video); Electronic circuit; Scheme (mathematics); Margin (machine learning); Voltage; Computer hardware; Electrical engineering; Semiconductor memory; Engineering; Transistor; Telecommunications; Mathematics; Artificial intelligence","score_opus":0.024249072349999786,"score_gpt":0.3058745595877071,"score_spread":0.2816254872377073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096263144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22085711,0.001047312,0.7672987,0.00027446446,0.00044465574,0.000120812045,0.00019610702,0.0016821431,0.008078716],"genre_scores_gemma":[0.8683392,0.0001407805,0.12802476,0.00010110906,0.00003680827,0.000056198,0.00009848489,0.000025608735,0.0031770808],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998913,0.00001611059,0.000012690991,0.000027228616,0.000041483818,0.000011204225],"domain_scores_gemma":[0.99975055,0.00005126572,0.000027501763,0.00006694911,0.00008843775,0.000015241429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001630811,0.00018265635,0.00020338353,0.00024194985,0.00024868397,0.00036146754,0.0009482129,0.00027072142,0.0020709008],"category_scores_gemma":[0.000534751,0.00009966499,0.00014140487,0.00029167856,0.00023906605,0.0006536455,0.00032031935,0.00026919,0.00027128882],"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.00086972135,0.0001294816,0.0013430498,0.00031451206,0.000072876486,0.00045245487,0.0002883261,0.0683771,0.44562745,0.055122104,0.004275775,0.42312714],"study_design_scores_gemma":[0.00016399083,0.0006494635,0.001315538,0.000053031552,0.000081022474,0.0009939288,0.00007100969,0.679119,0.2753482,0.014087917,0.028031727,0.000085254134],"about_ca_topic_score_codex":0.00090587663,"about_ca_topic_score_gemma":0.0017143257,"teacher_disagreement_score":0.0020709008,"about_ca_system_score_codex":0.0003717347,"about_ca_system_score_gemma":0.00030592238,"threshold_uncertainty_score":0.006927848},"labels":[],"label_agreement":null},{"id":"W2096343316","doi":"10.1049/ip-cds:20040500","title":"Phase to sinusoid amplitude conversion techniques for direct digital frequency synthesis","year":2004,"lang":"en","type":"article","venue":"IEE Proceedings - Circuits Devices and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Amplitude; Sine; Sine wave; Mathematics; Phase (matter); Algorithm; Computer science; Electronic engineering; Control theory (sociology); Physics; Optics; Engineering; Electrical engineering; Geometry; Artificial intelligence","score_opus":0.028906789993339427,"score_gpt":0.2931598722116165,"score_spread":0.26425308221827704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096343316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018947856,0.06812494,0.9109499,0.0002903469,0.0006079607,0.00008972767,0.000060506256,0.0003862278,0.017595652],"genre_scores_gemma":[0.055004522,0.13049823,0.7946096,0.00042602635,0.0014248241,0.00029713448,0.00024211477,0.000234858,0.017262708],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9993998,0.00009872439,0.00006239684,0.00009689673,0.00032597838,0.000016263593],"domain_scores_gemma":[0.99956805,0.00021560746,0.00003738301,0.000060104016,0.00010863159,0.000010169245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040640763,0.00072536996,0.0006391884,0.0011722875,0.00034125405,0.0011087529,0.0005974991,0.0006429379,0.0063399817],"category_scores_gemma":[0.0016494343,0.00040342423,0.00056834944,0.0014369902,0.0005470359,0.0010563214,0.00056025694,0.0011128263,0.004476892],"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.0000628701,0.00004734993,0.00018851459,0.0019797669,0.000038817354,0.0001791225,0.00013624658,0.0101842545,0.03218542,0.074276045,0.006309939,0.8744116],"study_design_scores_gemma":[0.000047977013,0.00038002056,0.0005694315,0.0009205027,0.00009513112,0.0032480138,0.00008865217,0.056342047,0.04079265,0.06652379,0.8308999,0.00009183969],"about_ca_topic_score_codex":0.00023926536,"about_ca_topic_score_gemma":0.00037703448,"teacher_disagreement_score":0.0063399817,"about_ca_system_score_codex":0.0003512691,"about_ca_system_score_gemma":0.00032559998,"threshold_uncertainty_score":0.0212093},"labels":[],"label_agreement":null},{"id":"W2097232115","doi":"10.1109/newcas.2004.1359116","title":"Carry free, bit parallel approximate squarers with linear complexity and constant delay","year":2004,"lang":"en","type":"article","venue":"The 2nd Annual IEEE Northeast Workshop on Circuits and Systems, 2004. NEWCAS 2004.","topic":"Numerical Methods 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":"Royal Military College of Canada","funders":"","keywords":"Parameterized complexity; Constant (computer programming); Function (biology); Boolean function; Bit (key); Computer science; Simple (philosophy); Algorithm; Mathematics; Lookup table; Arithmetic","score_opus":0.04791621092080614,"score_gpt":0.2789545173268937,"score_spread":0.23103830640608755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097232115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032863673,0.00035940824,0.9594981,0.000118738484,0.000043502023,0.00007652426,0.00006228217,0.0010730624,0.0059046214],"genre_scores_gemma":[0.36382562,0.00048917084,0.6242136,0.00018755492,0.000074115305,0.00012658883,0.00017714534,0.0001015398,0.010804683],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99930227,0.00010000714,0.00004326749,0.000087368644,0.00043198492,0.000035182326],"domain_scores_gemma":[0.9991998,0.00025202683,0.0001719313,0.00020245441,0.00015827775,0.00001555948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004132692,0.0006065895,0.00033320347,0.00040429298,0.0002842425,0.001086632,0.0007335306,0.00039146424,0.0019457067],"category_scores_gemma":[0.0017648336,0.00031090557,0.0003192748,0.0005215498,0.0003872968,0.0011598819,0.0004201801,0.000435539,0.00064601423],"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.00073871925,0.00012713757,0.0009708457,0.00046676982,0.00013306632,0.00041005315,0.0001978408,0.20276582,0.15585504,0.120351315,0.0035417632,0.51444167],"study_design_scores_gemma":[0.0001558167,0.00069618615,0.0004964675,0.000042769083,0.00011945901,0.00091509114,0.000050394057,0.80476207,0.13633987,0.03405,0.022319058,0.000052785323],"about_ca_topic_score_codex":0.0007821233,"about_ca_topic_score_gemma":0.0029721062,"teacher_disagreement_score":0.0019457067,"about_ca_system_score_codex":0.00051033526,"about_ca_system_score_gemma":0.00059549784,"threshold_uncertainty_score":0.006509006},"labels":[],"label_agreement":null},{"id":"W2097345549","doi":"10.1109/itcc.2000.844266","title":"Parallel real-time numerical computation: beyond speedup. III","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":true,"ca_institutions":"Queen's University","funders":"","keywords":"Speedup; Computer science; Computation; Parallel computing; Parallel algorithm; Process (computing); Algorithm; Cryptography; Programming language","score_opus":0.026756783680449505,"score_gpt":0.2805241409058742,"score_spread":0.2537673572254247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097345549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010626453,0.12861207,0.651841,0.01933613,0.008125973,0.00021991615,0.000384929,0.002313059,0.17854041],"genre_scores_gemma":[0.35021338,0.09556587,0.3807146,0.0040893895,0.011668767,0.00076721364,0.0010635619,0.002289776,0.15362747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9990515,0.0002099081,0.000045008615,0.00015205468,0.0004434071,0.00009809002],"domain_scores_gemma":[0.99868387,0.0005377833,0.000072299605,0.00034757436,0.00028468575,0.000073901785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001432184,0.00093970075,0.00069323176,0.00066944485,0.0005377067,0.00241095,0.0008760013,0.000883574,0.013793184],"category_scores_gemma":[0.0049649887,0.00066550216,0.00055657566,0.0013113593,0.0017591579,0.0038224368,0.0014575036,0.0024783832,0.0056467876],"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.00019192591,0.000059431328,0.0010254974,0.0008838157,0.00009646214,0.00019198688,0.00023781693,0.033429097,0.00559178,0.58994997,0.1190761,0.24926616],"study_design_scores_gemma":[0.000032894834,0.00006788184,0.0005070555,0.00019827872,0.000030481064,0.00017688045,0.000055834033,0.09508413,0.0034390744,0.6889747,0.21140914,0.000023709015],"about_ca_topic_score_codex":0.00100196,"about_ca_topic_score_gemma":0.000733497,"teacher_disagreement_score":0.013793184,"about_ca_system_score_codex":0.0011772638,"about_ca_system_score_gemma":0.00088128785,"threshold_uncertainty_score":0.046142757},"labels":[],"label_agreement":null},{"id":"W2099124997","doi":"10.1109/tcad.2011.2153853","title":"An Optimal and Practical Approach to Single Constant Multiplication","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Constant (computer programming); Arithmetic; Mathematics; Computer science; Combinatorics; Programming language","score_opus":0.1102515315918191,"score_gpt":0.2907375211890358,"score_spread":0.18048598959721668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099124997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004736237,0.00049101905,0.98367494,0.00045698273,0.000072630886,0.000056457528,0.000034633093,0.00074097846,0.009736133],"genre_scores_gemma":[0.13789232,0.0005616655,0.85615,0.00026125004,0.00011727854,0.00012389693,0.000099557496,0.00015876853,0.004635233],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983846,0.00028881908,0.0000787977,0.00023545384,0.0008312792,0.00018105943],"domain_scores_gemma":[0.9984806,0.000490269,0.00010823249,0.0005023235,0.0003708623,0.000047768648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010223098,0.0009251239,0.000818697,0.0014362679,0.0010061901,0.0018784738,0.0018987436,0.0012823689,0.011609661],"category_scores_gemma":[0.006652712,0.0005406167,0.000659071,0.0018004477,0.0014480223,0.002580293,0.0017879001,0.0018950864,0.0029739197],"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.00021598546,0.00014866558,0.0005690358,0.00034713646,0.000047042624,0.0001603872,0.00014472872,0.17015125,0.010975494,0.26724052,0.01309654,0.53690314],"study_design_scores_gemma":[0.00006801583,0.00010626186,0.00011904408,0.000057081437,0.000023169683,0.00037988715,0.000060615628,0.79623675,0.007517058,0.17414266,0.021263205,0.000026255944],"about_ca_topic_score_codex":0.0016522116,"about_ca_topic_score_gemma":0.0026062415,"teacher_disagreement_score":0.011609661,"about_ca_system_score_codex":0.0010159672,"about_ca_system_score_gemma":0.00275197,"threshold_uncertainty_score":0.038838208},"labels":[],"label_agreement":null},{"id":"W2099817857","doi":"10.1109/n-ssc.2007.4785653","title":"Tales of the Continuum: A Subsampled History of Analog Circuits","year":2007,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Society Newsletter","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"George (robot); Tribute; Analogue electronics; Art history; Engineering; Art; Electrical engineering; Electronic circuit","score_opus":0.030117602702326562,"score_gpt":0.2739686817458178,"score_spread":0.24385107904349124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099817857","genre_codex":"review","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013595432,0.4705384,0.06880744,0.06518304,0.009043863,0.000044924047,0.00038055907,0.00046503177,0.37194136],"genre_scores_gemma":[0.41939682,0.38255173,0.032241784,0.027880799,0.018946532,0.00014935958,0.00039670363,0.0007927988,0.11764354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918455,0.00030100558,0.000032568398,0.00011336915,0.00029897233,0.00006960797],"domain_scores_gemma":[0.9978598,0.0015325464,0.000053823453,0.00019183979,0.00024497404,0.000117111056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013095918,0.00049691263,0.00044402215,0.00293588,0.00269877,0.0047774366,0.0008959135,0.001678988,0.010127055],"category_scores_gemma":[0.005758772,0.00037685048,0.00028147345,0.0023157508,0.008626604,0.0084975,0.0020548461,0.004056518,0.0023190803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009261161,0.00003644082,0.00053708605,0.00033427493,0.000020650908,0.00017166989,0.0020800862,0.0015863444,0.00060741644,0.7770433,0.06348598,0.15400422],"study_design_scores_gemma":[0.000006187593,0.000029472914,0.00039167577,0.00040975108,0.0000065569143,0.00025426014,0.00053538743,0.0009851344,0.00033679628,0.3052644,0.69175917,0.000021160648],"about_ca_topic_score_codex":0.0014395007,"about_ca_topic_score_gemma":0.0022406762,"teacher_disagreement_score":0.010127055,"about_ca_system_score_codex":0.0018396667,"about_ca_system_score_gemma":0.0009257266,"threshold_uncertainty_score":0.033878446},"labels":[],"label_agreement":null},{"id":"W2099838466","doi":"10.1109/ccece.1999.807240","title":"Design and synthesis of an IEEE-754 exponential function","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"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; VHDL; Rounding; Verilog; Exponential function; Lookup table; Floating point; Hardware description language; Table (database); Function (biology); Multiplication (music); Integer (computer science); Parallel computing; Algorithm; Computer hardware; Field-programmable gate array; Programming language; Mathematics; Operating system","score_opus":0.029777982015880656,"score_gpt":0.26213926544419147,"score_spread":0.2323612834283108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099838466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03741193,0.00028303184,0.94301015,0.00021099961,0.00015874316,0.00016461026,0.00022653173,0.0021716096,0.016362423],"genre_scores_gemma":[0.5843029,0.00045043792,0.39868212,0.00018341534,0.000057237216,0.00025184688,0.00039100274,0.00022965674,0.015451394],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997086,0.000036781883,0.000021424523,0.000049153692,0.00013989049,0.00004408815],"domain_scores_gemma":[0.99979466,0.000041051833,0.00001850667,0.000025598216,0.000108548506,0.00001163801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049086136,0.0003747465,0.0002890189,0.0003546645,0.00030919557,0.0009140731,0.0007856738,0.00041489673,0.0036337022],"category_scores_gemma":[0.0006785619,0.00019684182,0.00038228263,0.00029982292,0.00020904907,0.00056839053,0.00021575246,0.0003795396,0.0016900935],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056909205,0.00020672653,0.0013130037,0.000780304,0.0001444897,0.00046727151,0.00035584538,0.17662154,0.36816096,0.18848589,0.0076286644,0.2552662],"study_design_scores_gemma":[0.00019282811,0.0009135407,0.0007789687,0.00009198706,0.00014513929,0.0005716696,0.000055903325,0.50157183,0.37055555,0.009819556,0.11522811,0.00007497326],"about_ca_topic_score_codex":0.0013095763,"about_ca_topic_score_gemma":0.00090550527,"teacher_disagreement_score":0.0036337022,"about_ca_system_score_codex":0.00078457664,"about_ca_system_score_gemma":0.0008231335,"threshold_uncertainty_score":0.01215595},"labels":[],"label_agreement":null},{"id":"W2100494504","doi":"10.1142/s0218126615500206","title":"ICAT: Engine to Perform Range Analysis and Allocate Bit-Widths for Arithmetic Datapaths","year":2014,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"Affine arithmetic; Arithmetic; Saturation arithmetic; Computer science; Range (aeronautics); Register allocation; Interval arithmetic; Arbitrary-precision arithmetic; Integer (computer science); Fixed-point arithmetic; Algorithm; Floating point; Affine transformation; Mathematics; Compiler","score_opus":0.015153297430085507,"score_gpt":0.253707234686,"score_spread":0.23855393725591448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494504","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061675427,0.00043093253,0.9071012,0.000071123366,0.00012361942,0.000130824,0.00081051415,0.078998774,0.006165543],"genre_scores_gemma":[0.17538342,0.0005404847,0.7991249,0.000271255,0.00014701125,0.00084997097,0.0042022574,0.012114829,0.007365871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991509,0.000075986005,0.00006691164,0.00017230501,0.00041772265,0.00011622472],"domain_scores_gemma":[0.9986444,0.0004953185,0.00011373918,0.0003158509,0.00037107072,0.00005962335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091085985,0.0022997272,0.0010455034,0.0026069605,0.0006572993,0.0019903337,0.0032129714,0.0010637484,0.012474564],"category_scores_gemma":[0.0047693406,0.0008495593,0.0013514542,0.0014177528,0.00077530346,0.0022938137,0.0013421783,0.0015931407,0.00477887],"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.001353176,0.00023862194,0.005026762,0.001234911,0.0002619825,0.00033232264,0.0004496175,0.11657394,0.05131927,0.053457603,0.073325604,0.6964262],"study_design_scores_gemma":[0.00016889122,0.0001690024,0.00088235317,0.00010809079,0.000093061084,0.00033046017,0.000062241445,0.85913604,0.07428587,0.020232191,0.044415373,0.000116385614],"about_ca_topic_score_codex":0.002967062,"about_ca_topic_score_gemma":0.0030641695,"teacher_disagreement_score":0.012474564,"about_ca_system_score_codex":0.001150294,"about_ca_system_score_gemma":0.002365891,"threshold_uncertainty_score":0.041731596},"labels":[],"label_agreement":null},{"id":"W2100695032","doi":"10.2139/ssrn.2269814","title":"A Fast Fractional Difference Algorithm","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Social Sciences and Humanities Research Council of Canada; Canada Research Chairs; Danmarks Grundforskningsfond; National Research Foundation","keywords":"Algorithm; Mathematics; Computer science","score_opus":0.008465826394422352,"score_gpt":0.2501804840411531,"score_spread":0.24171465764673078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100695032","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00576007,0.0002318014,0.9848358,0.0002045763,0.00042947705,0.000052639698,0.00004946061,0.00032346716,0.008112696],"genre_scores_gemma":[0.12976654,0.0002604385,0.85560524,0.000194163,0.00020907431,0.00017488233,0.00011313672,0.00018219255,0.013494375],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966204,0.0000800717,0.000016084103,0.00004655026,0.0001606,0.000034556582],"domain_scores_gemma":[0.9993734,0.00027730069,0.000025225423,0.00011059563,0.00017096274,0.000042519277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073169265,0.0005532024,0.00083956076,0.0007584351,0.0008392384,0.0010648891,0.0010673333,0.001503595,0.009269853],"category_scores_gemma":[0.002584915,0.0002831681,0.000651528,0.00081673305,0.0005419168,0.0011345682,0.001293899,0.0013617689,0.00173749],"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.00042653873,0.00015841049,0.000541127,0.00021369242,0.0000669773,0.0001636174,0.00014361496,0.20481704,0.018120743,0.27819702,0.008422315,0.48872888],"study_design_scores_gemma":[0.000060970822,0.00004567466,0.000087926426,0.000017776174,0.000014916483,0.00007466961,0.0000131805455,0.9492068,0.0035193323,0.03434834,0.012593986,0.000016409433],"about_ca_topic_score_codex":0.0017537677,"about_ca_topic_score_gemma":0.0016022696,"teacher_disagreement_score":0.009269853,"about_ca_system_score_codex":0.00058855914,"about_ca_system_score_gemma":0.0011228321,"threshold_uncertainty_score":0.031010807},"labels":[],"label_agreement":null},{"id":"W2100853394","doi":"10.1109/ccece.2006.277355","title":"An FPGA-Based Singular Value Decomposition Processor","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"CMC Microsystems","keywords":"Singular value decomposition; Computer science; Field-programmable gate array; CORDIC; Systolic array; Parallel computing; Virtex; Algorithm; Matrix (chemical analysis); Matrix multiplication; MATLAB; Vector processor; Computational science; Computer hardware; Embedded system; Very-large-scale integration","score_opus":0.009827068608507123,"score_gpt":0.3031902495135223,"score_spread":0.2933631809050152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100853394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033026837,0.0005033127,0.9200631,0.00018644934,0.00035721797,0.00039774642,0.00060790696,0.019232212,0.02562512],"genre_scores_gemma":[0.31741533,0.00047794965,0.66034037,0.00026667808,0.00014546125,0.0003752123,0.0015717638,0.00029868577,0.019108592],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997422,0.000024421492,0.000018216659,0.000053456835,0.0001245998,0.00003718396],"domain_scores_gemma":[0.99975306,0.000040456,0.000012710819,0.00003959901,0.00013613478,0.000018071041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016941834,0.00057957415,0.0005581862,0.000779049,0.00034300637,0.00071994454,0.000740033,0.00032582233,0.012407707],"category_scores_gemma":[0.0005099628,0.00022002344,0.00022542001,0.0007592367,0.00016177131,0.00048228947,0.00026177443,0.0004237248,0.00484207],"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.0008415255,0.00015648463,0.0013159212,0.00033974048,0.000072235205,0.0004710183,0.000107672444,0.02729304,0.11157137,0.012985676,0.033378933,0.8114664],"study_design_scores_gemma":[0.00044587807,0.0014205601,0.0032968626,0.00009256875,0.00012819972,0.0019167808,0.00010379138,0.6536236,0.18794695,0.005737459,0.14517224,0.00011517763],"about_ca_topic_score_codex":0.0011374457,"about_ca_topic_score_gemma":0.0013425229,"teacher_disagreement_score":0.012407707,"about_ca_system_score_codex":0.00032498813,"about_ca_system_score_gemma":0.0005986916,"threshold_uncertainty_score":0.04150796},"labels":[],"label_agreement":null},{"id":"W2101173251","doi":"10.1109/arith.2001.930126","title":"The use of the multi-dimensional logarithmic number system in DSP applications","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"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 Windsor","funders":"","keywords":"Logarithm; Digital signal processing; Computer science; Cryptography; Discrete logarithm; Base (topology); Extension (predicate logic); Arithmetic; Signal processing; Theoretical computer science; Algorithm; Representation (politics); Mathematics; Computer hardware; Public-key cryptography; Encryption","score_opus":0.07222602232512369,"score_gpt":0.2809821754083183,"score_spread":0.20875615308319462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101173251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028867057,0.0033322347,0.9419151,0.0007238533,0.0007744476,0.000057781737,0.000083601175,0.0008698774,0.023376035],"genre_scores_gemma":[0.47230598,0.004084627,0.51410526,0.0005492005,0.000746689,0.000116557334,0.00014618672,0.00017120455,0.0077742846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943084,0.00017091582,0.000053327167,0.000104738625,0.00020521892,0.000034887966],"domain_scores_gemma":[0.99891126,0.00041641167,0.00012609127,0.00037612286,0.00012425319,0.000045955232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062003394,0.00040305193,0.00042904072,0.00078257284,0.00059672596,0.0014047372,0.0008623924,0.00043330897,0.003793277],"category_scores_gemma":[0.0038780442,0.00015661516,0.00025972817,0.0012889298,0.0013782725,0.0028048402,0.0013683223,0.0012558342,0.0016626669],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004350408,0.00006090047,0.0005312176,0.00035252908,0.000011515593,0.00030907142,0.00025438,0.01429961,0.043299858,0.5605014,0.0038125373,0.37613192],"study_design_scores_gemma":[0.00012494004,0.0008646152,0.00096799026,0.00025026416,0.000044426597,0.0031289004,0.00015387862,0.18554164,0.08688908,0.49618447,0.22569446,0.0001552693],"about_ca_topic_score_codex":0.00011646912,"about_ca_topic_score_gemma":0.00015820812,"teacher_disagreement_score":0.003793277,"about_ca_system_score_codex":0.00040438125,"about_ca_system_score_gemma":0.00036305064,"threshold_uncertainty_score":0.012689769},"labels":[],"label_agreement":null},{"id":"W2101221074","doi":"10.1109/arith.1991.145548","title":"Specifications for a variable-precision arithmetic coprocessor","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Coprocessor; Computer science; Programmer; Arithmetic; Variable (mathematics); Decimal; Programming language; Arbitrary-precision arithmetic; Set (abstract data type); Software; Embedded system; Mathematics","score_opus":0.1095624609350344,"score_gpt":0.2956864882773909,"score_spread":0.1861240273423565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101221074","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00810884,0.0011501642,0.95147276,0.00053061463,0.00041073892,0.000822735,0.0017833384,0.0071517006,0.028569037],"genre_scores_gemma":[0.11388365,0.002220649,0.8381395,0.001038033,0.0002814527,0.0025064636,0.007892965,0.0039980756,0.030039186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99448085,0.0008919999,0.0015591583,0.0003804206,0.0022921653,0.0003953902],"domain_scores_gemma":[0.98986477,0.0019227045,0.0009646378,0.0011791076,0.00582285,0.0002458629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033649616,0.001310436,0.000849344,0.0020205134,0.0009691475,0.0032361124,0.002742046,0.0020530615,0.009969761],"category_scores_gemma":[0.008612583,0.0010689461,0.0009739005,0.0014356237,0.00070369034,0.0018104748,0.0010709342,0.0019763787,0.010403395],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011786752,0.00019679277,0.0032975904,0.003939749,0.00009791108,0.0024075548,0.0017105031,0.046790585,0.10332585,0.38492128,0.119428396,0.3327051],"study_design_scores_gemma":[0.00013266024,0.0006178271,0.0008773447,0.0006162968,0.000120602046,0.0024778666,0.00024530425,0.05713613,0.08042573,0.031799413,0.8253797,0.00017112558],"about_ca_topic_score_codex":0.0013273616,"about_ca_topic_score_gemma":0.0012752666,"teacher_disagreement_score":0.009969761,"about_ca_system_score_codex":0.00068573246,"about_ca_system_score_gemma":0.0023517993,"threshold_uncertainty_score":0.033352196},"labels":[],"label_agreement":null},{"id":"W2102282062","doi":"10.1109/tc.2010.45","title":"A Karatsuba-Based Algorithm for Polynomial Multiplication in Chebyshev Form","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Multiplication (music); Computer science; Algorithm; Polynomial; Arithmetic; Mathematics; Parallel computing; Combinatorics","score_opus":0.017022166178700227,"score_gpt":0.28066250431296863,"score_spread":0.2636403381342684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102282062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009980387,0.000079376056,0.9977852,0.000027995064,0.00003911804,0.000020292702,0.000009189734,0.0002915186,0.00074930716],"genre_scores_gemma":[0.033663187,0.00022068455,0.9624396,0.00006559175,0.00007315404,0.000091839844,0.00007493863,0.00013390262,0.0032370696],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936193,0.00012742718,0.000039612598,0.00013664944,0.00028819675,0.00004609169],"domain_scores_gemma":[0.99946254,0.0001754315,0.000041018946,0.00010251349,0.0001908549,0.00002767095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005641287,0.0007831249,0.0006144058,0.000796766,0.00074055325,0.00088147173,0.0011543159,0.000724008,0.008547195],"category_scores_gemma":[0.0020166286,0.00036753176,0.0005708636,0.0011298351,0.0007651417,0.0016274662,0.0010543765,0.0016315216,0.0036807167],"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.00026134218,0.00014877132,0.0004334617,0.00039601375,0.0001181865,0.00018624953,0.0002456469,0.042777773,0.082594514,0.105064765,0.006141785,0.7616315],"study_design_scores_gemma":[0.00020923634,0.00043997302,0.0006273888,0.000077884426,0.000105192485,0.0011139978,0.00009996316,0.75285167,0.0712663,0.08574261,0.08731576,0.00015007779],"about_ca_topic_score_codex":0.00093418884,"about_ca_topic_score_gemma":0.0014904886,"teacher_disagreement_score":0.008547195,"about_ca_system_score_codex":0.00047999356,"about_ca_system_score_gemma":0.0008846877,"threshold_uncertainty_score":0.028593183},"labels":[],"label_agreement":null},{"id":"W2105153879","doi":"10.1109/arith.1995.465368","title":"The K5 transcendental functions","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Transcendental number; Transcendental function; Computer science; Microprocessor; x86; Algorithm; Schedule; Table (database); Polynomial; Arithmetic; Mathematics; Programming language; Embedded system; Operating system; Data mining; Software","score_opus":0.02679106760959364,"score_gpt":0.2421225720561345,"score_spread":0.21533150444654087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105153879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06343631,0.0043109367,0.6452133,0.0007644583,0.0011522777,0.00016993981,0.0007076674,0.004858129,0.279387],"genre_scores_gemma":[0.5845447,0.0036125816,0.32709756,0.0007029264,0.00028429873,0.00013785835,0.0014261525,0.0014150366,0.08077878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946326,0.00006158095,0.00004179232,0.00008501518,0.0002699544,0.00007840964],"domain_scores_gemma":[0.99958974,0.00007379246,0.000034336976,0.00009406291,0.00018409056,0.000023950508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036325783,0.00063582964,0.0003038409,0.000818564,0.000723358,0.0015074715,0.0009705256,0.000412534,0.011739239],"category_scores_gemma":[0.0018846169,0.00022230337,0.00048030406,0.00070552225,0.0007125196,0.0017892503,0.0009356166,0.001078151,0.0068078414],"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.0002775191,0.0000406285,0.000687021,0.0003409758,0.00001952212,0.0003433759,0.00048959657,0.012493549,0.01782082,0.5226504,0.021193974,0.42364255],"study_design_scores_gemma":[0.00006345031,0.00033632806,0.0011664495,0.00027363584,0.000050571514,0.0012854914,0.00015934603,0.06681115,0.07448466,0.17100792,0.6841961,0.00016490357],"about_ca_topic_score_codex":0.0014726312,"about_ca_topic_score_gemma":0.0014723163,"teacher_disagreement_score":0.011739239,"about_ca_system_score_codex":0.00082110486,"about_ca_system_score_gemma":0.0011440538,"threshold_uncertainty_score":0.039271593},"labels":[],"label_agreement":null},{"id":"W2105605001","doi":"10.1109/mwscas.1993.343072","title":"A VLSI architecture for DFT","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Ottawa","funders":"","keywords":"Very-large-scale integration; Computer science; Architecture; Simple (philosophy); Discrete Fourier transform (general); Modular design; Parallel computing; Point (geometry); Computational science; Fast Fourier transform; Computation; Theoretical computer science; Algorithm; Fourier transform; Computer architecture; Arithmetic; Embedded system; Mathematics; Fourier analysis; Fractional Fourier transform","score_opus":0.03497187509894589,"score_gpt":0.2768092329434893,"score_spread":0.2418373578445434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105605001","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015239621,0.0013995107,0.9632086,0.0004266197,0.00029136875,0.000060456405,0.0002054051,0.0022619767,0.016906407],"genre_scores_gemma":[0.36470196,0.0016480999,0.612964,0.0004998165,0.00019099821,0.000115561146,0.0006655966,0.00014119892,0.019072762],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99991107,0.000010994442,0.000005285232,0.000020952437,0.000039097813,0.0000126129335],"domain_scores_gemma":[0.99992514,0.00001556555,0.000004379592,0.000016083486,0.000032959153,0.0000058215605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008338146,0.00025537793,0.00017287592,0.00030137107,0.0003040362,0.00051609345,0.00054464245,0.0004955648,0.008008068],"category_scores_gemma":[0.000308197,0.00016466017,0.00022108265,0.0004079002,0.00019154834,0.00070400466,0.0002543222,0.00033870566,0.0024289812],"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.0001819332,0.00006852831,0.0006378702,0.00039111194,0.00005179541,0.0003492688,0.000103535756,0.0445676,0.20813833,0.12544595,0.018670637,0.60139346],"study_design_scores_gemma":[0.00014212725,0.0008230932,0.0016190542,0.00013521558,0.00011276307,0.0017257466,0.0000767332,0.5531189,0.10214664,0.07868227,0.26133943,0.00007794172],"about_ca_topic_score_codex":0.0010617656,"about_ca_topic_score_gemma":0.0020530547,"teacher_disagreement_score":0.008008068,"about_ca_system_score_codex":0.0004202502,"about_ca_system_score_gemma":0.00046893762,"threshold_uncertainty_score":0.026789665},"labels":[],"label_agreement":null},{"id":"W2105999745","doi":"10.1109/sips.2007.4387509","title":"Embedded Reconfigurable Solution for OFDM Detection Over Fast Fading Radio Channels","year":2007,"lang":"en","type":"article","venue":"SiPS ... design and implementation - IEEE Workshop on Signal Processing Systems","topic":"Numerical Methods and Algorithms","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":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Fading; Demodulation; Orthogonal frequency-division multiplexing; Software-defined radio; QR decomposition; Block (permutation group theory); Overhead (engineering); Pipeline (software); Channel (broadcasting); Computer hardware; Embedded system; Algorithm; Field-programmable gate array; Decoding methods; Computer network; Mathematics; Telecommunications; Eigenvalues and eigenvectors","score_opus":0.06289223757742589,"score_gpt":0.3544005188633682,"score_spread":0.2915082812859423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105999745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15582238,0.00041162144,0.8356388,0.0001808974,0.000103199214,0.000048618833,0.000037357673,0.0018010272,0.0059560747],"genre_scores_gemma":[0.74948597,0.00014688082,0.24625993,0.00006357171,0.000027840895,0.000038650414,0.00004086769,0.000047550842,0.0038887803],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998909,0.000024807965,0.000005997073,0.000021821788,0.000040179264,0.00001630839],"domain_scores_gemma":[0.9998462,0.000044304812,0.0000321747,0.0000382279,0.000029486528,0.000009582355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012581625,0.00021769154,0.00016380407,0.00017525593,0.00017740819,0.0003117307,0.00041251746,0.0001983689,0.002127535],"category_scores_gemma":[0.0005892621,0.00010482309,0.00011857001,0.00017082196,0.00016820019,0.00030241068,0.00020206391,0.00020992752,0.00036077522],"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.0006706636,0.0001188477,0.0014514773,0.00017424604,0.000060506056,0.00044649126,0.00014152844,0.17512599,0.41829032,0.02787715,0.0024716435,0.37317112],"study_design_scores_gemma":[0.000095301744,0.0004481772,0.00095965795,0.000021941549,0.000032913675,0.00033668775,0.00004594493,0.8482687,0.13735056,0.0037469773,0.008667328,0.000025777486],"about_ca_topic_score_codex":0.00041971772,"about_ca_topic_score_gemma":0.0007090532,"teacher_disagreement_score":0.002127535,"about_ca_system_score_codex":0.00024245719,"about_ca_system_score_gemma":0.00027917072,"threshold_uncertainty_score":0.0071172714},"labels":[],"label_agreement":null},{"id":"W2107131148","doi":"10.1145/980175.980177","title":"A comparison of methods for accurate summation","year":2004,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Rounding; Computer science; Double-precision floating-point format; Compensation (psychology); Algorithm; Cascade; Accuracy and precision; Arithmetic; Mathematics; Floating point; Statistics; Engineering","score_opus":0.09880814579206969,"score_gpt":0.45556522887872203,"score_spread":0.3567570830866523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107131148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00683134,0.009653333,0.96171343,0.0004308544,0.000864919,0.00017462789,0.0002665824,0.003787719,0.016277194],"genre_scores_gemma":[0.07544942,0.008865007,0.90048397,0.00027765753,0.00038071076,0.00050094095,0.0006329547,0.0027575952,0.010651775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895913,0.0018096841,0.0005473645,0.0004441916,0.0073676775,0.00023976294],"domain_scores_gemma":[0.97636765,0.013459346,0.0008646153,0.0038362606,0.0051642032,0.0003079688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056027574,0.0011622538,0.001538451,0.0033989244,0.0008855053,0.0023438213,0.0028351168,0.0014413326,0.012759746],"category_scores_gemma":[0.034400288,0.0008014938,0.0013384012,0.0035663145,0.0008599123,0.0034889707,0.0024798717,0.0018339735,0.004087029],"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.00062663836,0.00017026771,0.0015672146,0.0020245523,0.00030894694,0.00015426434,0.00056223804,0.08264915,0.006438476,0.13613227,0.02182185,0.7475441],"study_design_scores_gemma":[0.00035889237,0.00047363606,0.0031261158,0.00092759833,0.00022769788,0.0012142144,0.0003490264,0.70796794,0.03299653,0.11801651,0.13406456,0.00027736847],"about_ca_topic_score_codex":0.0018236942,"about_ca_topic_score_gemma":0.0017936962,"teacher_disagreement_score":0.012759746,"about_ca_system_score_codex":0.0011365624,"about_ca_system_score_gemma":0.0018796123,"threshold_uncertainty_score":0.042685628},"labels":[],"label_agreement":null},{"id":"W2108119746","doi":"10.1109/tc.2010.78","title":"High-Radix Multiplier-Dividers: Theory, Design, and Hardware","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Cairo University; University of Utah","keywords":"Rounding; Arithmetic; Multiplier (economics); Division (mathematics); Radix (gastropod); Multiplication (music); Shift register; Computer science; Quotient; Numerical digit; Mathematics; Division algorithm; Computer hardware; Telecommunications","score_opus":0.019991996110876847,"score_gpt":0.25543929078501293,"score_spread":0.23544729467413608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108119746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014531969,0.0106836725,0.9474296,0.00036353158,0.00022450059,0.00015909837,0.0000987092,0.0014806883,0.025028167],"genre_scores_gemma":[0.32870036,0.010961211,0.63719517,0.0003466471,0.00045540126,0.0002518638,0.00026014532,0.0001933813,0.021635782],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953485,0.00006720267,0.000030338608,0.00007366803,0.0002589161,0.000035032797],"domain_scores_gemma":[0.999778,0.0000695599,0.000035325687,0.000038869337,0.000067966896,0.00001036706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045713113,0.00056086155,0.0005191057,0.0007225289,0.00043890098,0.0014054185,0.0010760357,0.00063951564,0.0037271157],"category_scores_gemma":[0.0007217818,0.00045205443,0.00039540476,0.0009764745,0.0006598365,0.0016191178,0.0004244045,0.0007917763,0.0022314016],"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.00026739476,0.00008367156,0.00094861275,0.0009736902,0.00008811666,0.00024062443,0.0002376592,0.03771394,0.119296856,0.34514663,0.00541388,0.48958895],"study_design_scores_gemma":[0.00014657987,0.0015308359,0.0015390891,0.00030189718,0.00019845349,0.003321322,0.0001493975,0.28639522,0.27061716,0.10771938,0.32790565,0.00017493094],"about_ca_topic_score_codex":0.00035540675,"about_ca_topic_score_gemma":0.00057461584,"teacher_disagreement_score":0.0037271157,"about_ca_system_score_codex":0.0007766237,"about_ca_system_score_gemma":0.000643089,"threshold_uncertainty_score":0.012468398},"labels":[],"label_agreement":null},{"id":"W2110534080","doi":"10.1109/iscas.2011.5937750","title":"Nonspeculative decimal signed digit adder","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Decimal; Arithmetic; Computer science; Multiplication (music); Carry-save adder; Numerical digit; Division (mathematics); Subtraction; Binary number; VHDL; Carry (investment); Multiplication algorithm; Parallel computing; Computer hardware; Mathematics; Field-programmable gate array; Telecommunications","score_opus":0.06457336308468495,"score_gpt":0.2531912788677962,"score_spread":0.18861791578311124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110534080","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11413332,0.003971069,0.8314187,0.00048925704,0.0013289326,0.00020349358,0.0010757473,0.00474785,0.042631693],"genre_scores_gemma":[0.46413773,0.0023298138,0.49525476,0.00042474625,0.0002121289,0.000118375196,0.0010761914,0.00008628766,0.03635996],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998447,0.00001317832,0.000023335117,0.000028944967,0.00007572513,0.000014097801],"domain_scores_gemma":[0.9997793,0.000038375314,0.00002988536,0.000048132693,0.00009312755,0.000011263454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016197351,0.00037174957,0.0002229699,0.000448503,0.00037862093,0.0006236245,0.0008157822,0.00023892867,0.005927747],"category_scores_gemma":[0.0004976561,0.00015575705,0.00028420537,0.00050906744,0.00014213473,0.00079184235,0.00024338572,0.0002477735,0.0014388991],"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.0004988851,0.000089981906,0.00086977857,0.0006804978,0.00007541012,0.0006640247,0.000098249846,0.0148069095,0.23122612,0.061558556,0.009560424,0.6798712],"study_design_scores_gemma":[0.00017070977,0.0011521156,0.002542969,0.00013963494,0.00028516704,0.0048439316,0.000070019734,0.19017734,0.53330183,0.02416028,0.2430423,0.00011365944],"about_ca_topic_score_codex":0.00024295032,"about_ca_topic_score_gemma":0.0010209549,"teacher_disagreement_score":0.005927747,"about_ca_system_score_codex":0.00025790656,"about_ca_system_score_gemma":0.00058644,"threshold_uncertainty_score":0.019830287},"labels":[],"label_agreement":null},{"id":"W2111546354","doi":"10.1109/acc.2002.1024794","title":"Rigorous simulation of hybrid dynamic systems with symbolic and interval methods","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Computer science; Interval arithmetic; Symbolic data analysis; Theoretical computer science; Mathematics","score_opus":0.01652825348506537,"score_gpt":0.33327256542471095,"score_spread":0.3167443119396456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111546354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017954007,0.00013789299,0.9778061,0.00009602798,0.00003443398,0.000028762304,0.000035717552,0.000342734,0.0035643661],"genre_scores_gemma":[0.7239988,0.00038144356,0.27258462,0.000057866495,0.000043352487,0.0002534599,0.0001355044,0.00016189518,0.0023831152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986915,0.0004891899,0.000078095385,0.000056720044,0.00060813146,0.00007640644],"domain_scores_gemma":[0.9972627,0.0018228871,0.00023566547,0.00032145,0.0002752304,0.000082091115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013842408,0.0005607629,0.0007856794,0.0005873596,0.00037809362,0.0011910638,0.0010812929,0.00092772563,0.002219073],"category_scores_gemma":[0.0052639823,0.00036925825,0.00065402215,0.0005439016,0.0016546629,0.0013020192,0.0018786946,0.0012371518,0.00025235125],"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.000038970225,0.000022733862,0.0002760757,0.00004299581,0.00001643996,0.000053309945,0.00008344046,0.90931743,0.0026065735,0.077993214,0.00024513056,0.009303708],"study_design_scores_gemma":[0.0000092088085,0.000009773136,0.00002618147,0.000004792965,0.0000018338923,0.0000064120995,0.0000056362423,0.9863274,0.00064150547,0.012480086,0.00048268773,0.0000045042657],"about_ca_topic_score_codex":0.0020753408,"about_ca_topic_score_gemma":0.001228745,"teacher_disagreement_score":0.002219073,"about_ca_system_score_codex":0.00076650316,"about_ca_system_score_gemma":0.0009204697,"threshold_uncertainty_score":0.0074235797},"labels":[],"label_agreement":null},{"id":"W2111675255","doi":"10.1109/iccit.2009.5407171","title":"On the fast computation of decimal logarithm","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Logarithm; Computer science; Computation; Arithmetic; Double-precision floating-point format; Floating point; Field-programmable gate array; Binary number; Algorithm; Mathematics; Computer hardware","score_opus":0.02206580754195244,"score_gpt":0.2926224837445959,"score_spread":0.27055667620264345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111675255","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077310363,0.0020984565,0.9784031,0.00019065363,0.00036048138,0.000050469545,0.000061107945,0.0015896026,0.009515056],"genre_scores_gemma":[0.1420312,0.0035525071,0.84007263,0.00029861848,0.0004197005,0.00016858355,0.0004044636,0.00055984245,0.012492549],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988438,0.0001957643,0.00007970412,0.0001485839,0.00063943217,0.00009279363],"domain_scores_gemma":[0.99904615,0.00043008733,0.00006762391,0.0001494658,0.00027507517,0.000031491527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008631924,0.0010187154,0.0008332561,0.0018283267,0.0006532706,0.001893506,0.0010133152,0.00045825285,0.005422138],"category_scores_gemma":[0.0044650724,0.00034405178,0.000511112,0.0017236286,0.0011413264,0.0025962307,0.0015156426,0.0012309116,0.0040093507],"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.00044907196,0.000058366695,0.0007850477,0.00047288567,0.00006361382,0.0004692596,0.00035258112,0.050603572,0.029782996,0.19166937,0.013700808,0.7115924],"study_design_scores_gemma":[0.00017236787,0.0003529723,0.0008899644,0.00033293257,0.00005988561,0.0015403928,0.0001454845,0.56610715,0.0766013,0.20030199,0.15334438,0.00015121358],"about_ca_topic_score_codex":0.0007597687,"about_ca_topic_score_gemma":0.00071162323,"teacher_disagreement_score":0.005422138,"about_ca_system_score_codex":0.000568742,"about_ca_system_score_gemma":0.00087970216,"threshold_uncertainty_score":0.018138885},"labels":[],"label_agreement":null},{"id":"W2111833899","doi":"10.1109/ccece.1996.548095","title":"Rounding techniques for signed binary arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Calgary","funders":"","keywords":"Rounding; Arithmetic; Binary number; Truncation (statistics); Arbitrary-precision arithmetic; Kernel (algebra); Complement (music); Arithmetic logic unit; Computer science; Mathematics; Saturation arithmetic; Algorithm; Discrete mathematics; Statistics","score_opus":0.048949543692598615,"score_gpt":0.30091939788317934,"score_spread":0.2519698541905807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111833899","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039085792,0.0012627015,0.9828948,0.0001325526,0.00036397166,0.000054097032,0.000041208343,0.00033918433,0.011002887],"genre_scores_gemma":[0.15552905,0.004533815,0.82939345,0.00030239648,0.00040123882,0.0001777492,0.00021712341,0.00022219689,0.009223025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872416,0.00022315903,0.00013464985,0.00010043966,0.00075403997,0.00006354872],"domain_scores_gemma":[0.9990569,0.00035139135,0.00009753125,0.0002425714,0.00022993352,0.000021591532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007584998,0.000563657,0.0005470969,0.0009695238,0.0006840602,0.0018204006,0.0006879744,0.0006032599,0.004675015],"category_scores_gemma":[0.0042227698,0.00028299564,0.0005334152,0.0012277283,0.00095183344,0.001662022,0.0010430918,0.0020131415,0.00289408],"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.00015148666,0.000027956654,0.00014313882,0.00046911841,0.00001920971,0.00026510272,0.00029680162,0.026772954,0.03375856,0.6018602,0.0036565464,0.33257884],"study_design_scores_gemma":[0.00007083502,0.00028820743,0.0002516954,0.0005108758,0.000045304416,0.001441299,0.00016492962,0.2051575,0.07071016,0.59242827,0.12883614,0.00009475862],"about_ca_topic_score_codex":0.0002432484,"about_ca_topic_score_gemma":0.00033315044,"teacher_disagreement_score":0.004675015,"about_ca_system_score_codex":0.00041372073,"about_ca_system_score_gemma":0.0005993796,"threshold_uncertainty_score":0.015639424},"labels":[],"label_agreement":null},{"id":"W2113155657","doi":"10.1145/1391469.1391574","title":"Optimizing imprecise fixed-point arithmetic circuits specified by Taylor Series through arithmetic transform","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Saturation arithmetic; Arbitrary-precision arithmetic; Fixed-point arithmetic; Affine arithmetic; Arithmetic; Taylor series; Quantization (signal processing); Arithmetic circuit complexity; Series (stratigraphy); Floating point; Algorithm; Mathematics; Computer science","score_opus":0.032327384215790365,"score_gpt":0.2613277696845557,"score_spread":0.2290003854687653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113155657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041299693,0.00012662604,0.95488346,0.000075580145,0.000012586483,0.000018624478,0.000022995486,0.00015814253,0.003402315],"genre_scores_gemma":[0.6894019,0.00029739682,0.30826858,0.00003830284,0.00001767635,0.00008353703,0.000050494407,0.00010061644,0.0017414973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941874,0.00013424043,0.000031262167,0.00006453297,0.0003045249,0.000046831974],"domain_scores_gemma":[0.9993292,0.00040124156,0.000107982254,0.00007187916,0.00008047896,0.000009268317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092347845,0.0006068115,0.00055257394,0.0003791895,0.00022543804,0.0009471749,0.0006823166,0.00045105343,0.0011638829],"category_scores_gemma":[0.0032393946,0.00026964853,0.00037093394,0.00069175044,0.00072670594,0.0009291884,0.0003681347,0.00069422805,0.00024528292],"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.00006590258,0.000013203676,0.0002004082,0.000088566914,0.000018667675,0.000049640807,0.000054686127,0.8796071,0.0149685405,0.07318432,0.00020023396,0.031548806],"study_design_scores_gemma":[0.000018400086,0.00008567691,0.00006307137,0.000015584856,0.000017285016,0.000032455555,0.000016923737,0.9595388,0.014984773,0.02395921,0.0012588395,0.000008956255],"about_ca_topic_score_codex":0.0005436248,"about_ca_topic_score_gemma":0.0008047432,"teacher_disagreement_score":0.0011638829,"about_ca_system_score_codex":0.0007274533,"about_ca_system_score_gemma":0.00062441285,"threshold_uncertainty_score":0.0052781105},"labels":[],"label_agreement":null},{"id":"W2113291399","doi":"10.1109/tcsii.2003.815020","title":"Novel approach to the design of direct digital frequency synthesizers based on linear interpolation","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems II Analog and Digital Signal Processing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"CMC Microsystems","keywords":"Spurious-free dynamic range; Interpolation (computer graphics); Linear phase; Spurious relationship; Linear interpolation; Algorithm; Computer science; Sine; Dynamic range; Sine wave; Direct digital synthesizer; Electronic engineering; Mathematics; Filter (signal processing); Engineering; Phase noise; Telecommunications; Frequency synthesizer; Electrical engineering; Phase-locked loop","score_opus":0.04092386196837652,"score_gpt":0.2486332864599392,"score_spread":0.20770942449156268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113291399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009167352,0.00023355953,0.98606795,0.0000479907,0.000036865567,0.00005585993,0.0000147659075,0.00035498047,0.004020688],"genre_scores_gemma":[0.15313162,0.00039103004,0.84236425,0.00006981592,0.00006352558,0.00013236029,0.000058522837,0.000033450604,0.0037553366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99977523,0.00003862096,0.000014863589,0.00004433328,0.00011013174,0.000016816877],"domain_scores_gemma":[0.99980503,0.00006506127,0.000027352517,0.000037346475,0.00005516062,0.000010067257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027746454,0.00033767457,0.00026826764,0.00035969616,0.0002328373,0.0004258667,0.00062534335,0.00031049474,0.0020141427],"category_scores_gemma":[0.000633756,0.00022895506,0.00028137123,0.00022359453,0.00030479167,0.00036821404,0.00034494593,0.0005119562,0.0005977195],"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.00020101751,0.000112153044,0.0007186267,0.00042678879,0.0000653307,0.0002396807,0.00027274163,0.07077939,0.3781514,0.057183877,0.0015094037,0.49033958],"study_design_scores_gemma":[0.0001706722,0.0010397657,0.00071961357,0.00007424746,0.0000903287,0.0012151791,0.00006369361,0.66386956,0.22623843,0.017004615,0.08945618,0.00005773224],"about_ca_topic_score_codex":0.00026366155,"about_ca_topic_score_gemma":0.0006294445,"teacher_disagreement_score":0.0020141427,"about_ca_system_score_codex":0.00030897695,"about_ca_system_score_gemma":0.0003964646,"threshold_uncertainty_score":0.0067379475},"labels":[],"label_agreement":null},{"id":"W2115204962","doi":"10.1016/j.jsc.2007.10.013","title":"Solving polynomial systems via symbolic-numeric reduction to geometric involutive form","year":2008,"lang":"en","type":"article","venue":"Journal of Symbolic Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Science Foundation","keywords":"Mathematics; Reduction (mathematics); Polynomial; Algebra over a field; Symbolic computation; Applied mathematics; Partial differential equation; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.025414302656878687,"score_gpt":0.27760462594355306,"score_spread":0.2521903232866744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115204962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04025646,0.00013617973,0.93057317,0.00042935222,0.00014491807,0.000116142604,0.000074366006,0.0006401315,0.027629323],"genre_scores_gemma":[0.6144892,0.00020649288,0.3728006,0.00019157265,0.00013569387,0.00017331394,0.00020923304,0.00042518266,0.011368814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939334,0.0001853706,0.000029501743,0.000077996665,0.00023382746,0.0000798581],"domain_scores_gemma":[0.99937785,0.00036178995,0.00003061975,0.000118478536,0.00009087183,0.0000203611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004964293,0.0006499586,0.0009896165,0.0006866424,0.0010026094,0.0015008828,0.0011061961,0.0006375141,0.0091535505],"category_scores_gemma":[0.0032564094,0.000380457,0.0008838982,0.00072248065,0.0020086188,0.0014605318,0.0022678387,0.0019133104,0.0012423001],"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.000090305955,0.0001340208,0.00046865508,0.00021997117,0.00003630343,0.00014707728,0.00040719108,0.17820224,0.0029340652,0.6903454,0.00436516,0.12264964],"study_design_scores_gemma":[0.000052571708,0.000044903285,0.00008286038,0.000024086947,0.000019773854,0.000042116568,0.00013148187,0.4951004,0.0025805803,0.4963833,0.0055256276,0.000012275782],"about_ca_topic_score_codex":0.0017791291,"about_ca_topic_score_gemma":0.0039193016,"teacher_disagreement_score":0.0091535505,"about_ca_system_score_codex":0.00068978505,"about_ca_system_score_gemma":0.0010370081,"threshold_uncertainty_score":0.030621648},"labels":[],"label_agreement":null},{"id":"W2115626949","doi":"10.1109/freq.2002.1075963","title":"A new approach to the design of low power direct digital frequency synthesizers","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Direct digital synthesizer; Realization (probability); Computer science; Selection (genetic algorithm); Reduction (mathematics); Set (abstract data type); Frequency synthesizer; Power (physics); Function (biology); Electronic engineering; Algorithm; Phase-locked loop; Telecommunications; Mathematics; Engineering; Artificial intelligence","score_opus":0.026510744798304623,"score_gpt":0.24961593968343787,"score_spread":0.22310519488513325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115626949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042003323,0.00033806203,0.98737353,0.00009001821,0.000059371494,0.000032194625,0.000012437775,0.00017066464,0.0077233687],"genre_scores_gemma":[0.11428866,0.0010842214,0.8711982,0.00021449002,0.000108174565,0.00013722858,0.000061620434,0.00006153599,0.012845858],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996735,0.000039225648,0.000013983108,0.00005145004,0.00020448134,0.000017412485],"domain_scores_gemma":[0.9998592,0.000046805544,0.000015486628,0.000025187119,0.00004426227,0.000009035294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021675002,0.00037184954,0.00035610882,0.00038260088,0.00028161786,0.00081840646,0.00065794296,0.00046597442,0.0023026394],"category_scores_gemma":[0.000614008,0.0002546,0.00038678432,0.00025723493,0.0004797516,0.00057147635,0.0004627059,0.0007834559,0.0008749157],"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.00012114853,0.00011313886,0.0005318729,0.00045185557,0.000085861146,0.0002609337,0.0003095996,0.11389747,0.22619972,0.1648387,0.0026594563,0.49053025],"study_design_scores_gemma":[0.00020837205,0.0006501875,0.0006120681,0.00011785759,0.00013048408,0.0013303241,0.000091070855,0.5882945,0.10432657,0.074357845,0.2298135,0.0000671531],"about_ca_topic_score_codex":0.0003925708,"about_ca_topic_score_gemma":0.00072942866,"teacher_disagreement_score":0.0023026394,"about_ca_system_score_codex":0.00032295275,"about_ca_system_score_gemma":0.0004787484,"threshold_uncertainty_score":0.0077031255},"labels":[],"label_agreement":null},{"id":"W2116444959","doi":"10.1109/asap.2002.1030711","title":"Efficient conversion from binary to multi-digit multi-dimensional logarithmic number systems using arrays of range addressable look-up tables","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Windsor","funders":"","keywords":"Binary number; Logarithm; Computer science; Floating point; Representation (politics); Range (aeronautics); Domain (mathematical analysis); Point (geometry); Parallel computing; Algorithm; Arithmetic; Theoretical computer science; Computer hardware; Mathematics","score_opus":0.05533831300258389,"score_gpt":0.30217389553960045,"score_spread":0.24683558253701654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116444959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020607933,0.00072251563,0.9546704,0.0001825994,0.00025508445,0.0000818956,0.00021572792,0.006414156,0.01684959],"genre_scores_gemma":[0.20422289,0.0008020351,0.7828291,0.00020161169,0.00012223062,0.00021675556,0.0006834591,0.00046148497,0.010460415],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995401,0.00007417332,0.00005773341,0.00006145947,0.00023164324,0.000034919503],"domain_scores_gemma":[0.999014,0.0003978032,0.00008040479,0.000285421,0.0001971533,0.000025278112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031710856,0.00040200783,0.00037206724,0.0008457079,0.0003435883,0.0014124889,0.0007082401,0.00027719614,0.008319028],"category_scores_gemma":[0.003172885,0.00027376655,0.00027962998,0.0010347265,0.00029784229,0.0017840338,0.0010097591,0.00062137534,0.004519374],"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.00029634594,0.00007374566,0.0006999476,0.0002862551,0.000020795325,0.00030410817,0.00027720517,0.013786218,0.05272073,0.06420024,0.011017442,0.8563169],"study_design_scores_gemma":[0.00019695665,0.0005984853,0.001879844,0.00029098897,0.00007184577,0.002525538,0.00042083903,0.3307348,0.29771084,0.13621163,0.2291869,0.00017126388],"about_ca_topic_score_codex":0.00021052125,"about_ca_topic_score_gemma":0.00037043812,"teacher_disagreement_score":0.008319028,"about_ca_system_score_codex":0.0002172708,"about_ca_system_score_gemma":0.00030546074,"threshold_uncertainty_score":0.027829885},"labels":[],"label_agreement":null},{"id":"W2117005707","doi":"10.1109/newcas.2005.1496664","title":"Optimized Distributed Processing of Scaling Factor-in CORDIC","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"CORDIC; Computer science; Scaling; Factor (programming language); Scale factor (cosmology); Parallel computing; Path (computing); Very-large-scale integration; Algorithm; Iterative method; Mathematics; Field-programmable gate array; Computer hardware; Embedded system","score_opus":0.024718627889776943,"score_gpt":0.3039779492210318,"score_spread":0.2792593213312548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117005707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08405521,0.0005141265,0.89508015,0.0003163117,0.00022742948,0.00009707813,0.00012856888,0.0045105186,0.0150706265],"genre_scores_gemma":[0.57856846,0.00019809022,0.4078548,0.0001726451,0.00014932727,0.00012295398,0.0003806311,0.00063190504,0.0119212065],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951255,0.00006812261,0.000028823204,0.00012695484,0.00017498713,0.00008851946],"domain_scores_gemma":[0.99900275,0.0002264111,0.00006947542,0.0002859425,0.0003598943,0.000055593056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048089985,0.0008753751,0.0009242623,0.00050073094,0.0006880452,0.0012562805,0.0009706648,0.00050768035,0.009161304],"category_scores_gemma":[0.002609507,0.000235383,0.00039562513,0.00088461774,0.0006236082,0.001159232,0.0009773639,0.0007211074,0.0017492389],"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.0019089835,0.00020915037,0.0021969667,0.0003713877,0.00008346311,0.0006904711,0.00046107106,0.24075891,0.11085574,0.06475733,0.01711629,0.56059027],"study_design_scores_gemma":[0.00015688589,0.00025646886,0.0005346871,0.000027448688,0.00003735828,0.00024596462,0.000095505944,0.89379144,0.06991285,0.02297376,0.011940026,0.00002758852],"about_ca_topic_score_codex":0.0021947632,"about_ca_topic_score_gemma":0.004232719,"teacher_disagreement_score":0.009161304,"about_ca_system_score_codex":0.000974689,"about_ca_system_score_gemma":0.0012137312,"threshold_uncertainty_score":0.030647576},"labels":[],"label_agreement":null},{"id":"W2118489076","doi":"10.1109/iscas.2015.7169114","title":"Efficient radix conversions for classes of radices","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Radix (gastropod); Division (mathematics); Arithmetic; Computer science; Parallel computing; Integer (computer science); Algorithm; Fraction (chemistry); Mathematics","score_opus":0.06361355208152067,"score_gpt":0.3275038079313259,"score_spread":0.2638902558498052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118489076","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030279582,0.00093694875,0.9357626,0.00019206549,0.00026655252,0.00012906392,0.00012059417,0.0015437717,0.030768823],"genre_scores_gemma":[0.2523417,0.0014185735,0.72593755,0.00031284994,0.0003100387,0.00031987613,0.0005816187,0.0009789834,0.017798861],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.00018087443,0.00013883128,0.00024926703,0.00075094943,0.00017172372],"domain_scores_gemma":[0.99833614,0.00055641093,0.00015883365,0.000632498,0.00026447608,0.000051656145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087266526,0.0008013395,0.0007613414,0.0018526157,0.00086520775,0.0028540373,0.0011984034,0.0006206672,0.013212275],"category_scores_gemma":[0.0059111784,0.00033061227,0.0008870609,0.0017745398,0.0011820366,0.0032586358,0.0018436672,0.0018178601,0.0046916986],"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.00021867824,0.00006772973,0.00054536643,0.00018536323,0.00002253232,0.00013803614,0.00022212106,0.013453797,0.015371171,0.57503307,0.007666463,0.38707566],"study_design_scores_gemma":[0.00010723785,0.00024825128,0.0008005908,0.00020449798,0.00004015567,0.0011070591,0.00021913271,0.15411048,0.05490903,0.6389137,0.14923903,0.00010094923],"about_ca_topic_score_codex":0.00025933076,"about_ca_topic_score_gemma":0.0004931547,"teacher_disagreement_score":0.013212275,"about_ca_system_score_codex":0.00080606516,"about_ca_system_score_gemma":0.00050386746,"threshold_uncertainty_score":0.044199407},"labels":[],"label_agreement":null},{"id":"W2119178646","doi":"10.1109/ccece.2007.279","title":"Design and Implementation of Decimal Reciprocal Unit","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Lunds Universitet","keywords":"Decimal; Reciprocal; Arithmetic; Computer science; Field-programmable gate array; Lookup table; Table (database); Multiplication (music); Floating point; Double-precision floating-point format; Algorithm; Computer hardware; Mathematics; Programming language","score_opus":0.048125248478341195,"score_gpt":0.37327293362729086,"score_spread":0.32514768514894965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119178646","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04678799,0.0018192393,0.9075226,0.00030166883,0.00045650356,0.0003852689,0.00029333145,0.007364334,0.035069175],"genre_scores_gemma":[0.46221036,0.0008448309,0.5157736,0.00032015593,0.00014684096,0.00030822438,0.00053212105,0.0002753708,0.019588536],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939144,0.000090178015,0.00006195179,0.000113610186,0.00027283857,0.00006999107],"domain_scores_gemma":[0.9995646,0.000059316964,0.000055677232,0.000089263136,0.00020660498,0.000024511712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031680157,0.0005849428,0.0004927231,0.0008531014,0.00046067877,0.0011791358,0.0017864974,0.00047647776,0.0078116897],"category_scores_gemma":[0.0009334619,0.0002777088,0.00027435028,0.00066743756,0.0002926278,0.0008654296,0.00044237662,0.0003815166,0.0027094574],"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.0010934878,0.00014942251,0.0014120472,0.0012973929,0.000108587315,0.0008430252,0.0005660573,0.023565615,0.2285335,0.051327948,0.013878698,0.6772242],"study_design_scores_gemma":[0.0001821184,0.0018909022,0.0017178565,0.00016582798,0.00018301961,0.0030778784,0.00017743623,0.18857151,0.62019557,0.0052116835,0.17849442,0.0001317885],"about_ca_topic_score_codex":0.0006596545,"about_ca_topic_score_gemma":0.00069613644,"teacher_disagreement_score":0.0078116897,"about_ca_system_score_codex":0.00057435327,"about_ca_system_score_gemma":0.00065953104,"threshold_uncertainty_score":0.026132703},"labels":[],"label_agreement":null},{"id":"W2119490711","doi":"10.1142/s0218195900000085","title":"EXACT AND OPTIMAL CONVEX HULLS IN 2D","year":2000,"lang":"en","type":"article","venue":"International Journal of Computational Geometry & Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Convex hull; Rounding; Mathematics; Hull; Floating point; Computation; Convex combination; Interval arithmetic; Algorithm; Convex set; Regular polygon; Combinatorics; Arithmetic; Convex optimization; Computer science; Geometry; Mathematical analysis","score_opus":0.011457383642419352,"score_gpt":0.31300177017626346,"score_spread":0.30154438653384413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119490711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137371505,0.00014817592,0.9809106,0.000094363815,0.00003736868,0.00003565163,0.00018196442,0.00045358046,0.0044012074],"genre_scores_gemma":[0.24055828,0.0003361553,0.7527441,0.000065008644,0.00004947795,0.00013761096,0.000747829,0.00043645923,0.0049250848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910295,0.00011957922,0.000045246867,0.000115676,0.0005154708,0.00010110342],"domain_scores_gemma":[0.99918014,0.0003793264,0.00006162036,0.00014180734,0.00019018984,0.000046931575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060620747,0.0007362552,0.001043902,0.0012450046,0.00052122277,0.0019826847,0.001003807,0.00084183697,0.005036933],"category_scores_gemma":[0.0035310995,0.00063995976,0.00085829565,0.0012001552,0.0012778857,0.0019873686,0.0023783478,0.0012245943,0.0013905532],"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.00018564184,0.00004714199,0.0007494571,0.00016092247,0.000024218416,0.00016936348,0.00025675283,0.6060998,0.0049011,0.20561928,0.0057140966,0.17607221],"study_design_scores_gemma":[0.00001967833,0.00002064426,0.00014412505,0.000012952884,0.0000025903298,0.000039342045,0.00003895288,0.91780424,0.0017322103,0.07670632,0.003463771,0.000015118088],"about_ca_topic_score_codex":0.0037330769,"about_ca_topic_score_gemma":0.0047602938,"teacher_disagreement_score":0.005036933,"about_ca_system_score_codex":0.0009689642,"about_ca_system_score_gemma":0.00090694334,"threshold_uncertainty_score":0.016850173},"labels":[],"label_agreement":null},{"id":"W2121253617","doi":"10.1109/20.877764","title":"Dimensional analysis and constraint propagation systems applied to the design of electromagnetic devices","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"Computer science; Constraint (computer-aided design); Structuring; Set (abstract data type); Local consistency; Interval arithmetic; Interval (graph theory); Computational electromagnetics; Space (punctuation); Mathematical optimization; Applied mathematics; Algorithm; Theoretical computer science; Constraint satisfaction problem; Electromagnetic field; Mathematics; Mathematical analysis; Physics; Programming language","score_opus":0.014415060345806028,"score_gpt":0.23816061982779055,"score_spread":0.22374555948198452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121253617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030373433,0.00020056132,0.99268216,0.00014835263,0.000030691554,0.00002324251,0.000020326432,0.00006964502,0.0037876884],"genre_scores_gemma":[0.30254614,0.0011593413,0.6920833,0.00020537511,0.00009653979,0.00051942904,0.00011866152,0.00016890118,0.0031022783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978661,0.0011674732,0.00011121365,0.0001336398,0.0006614189,0.000060170663],"domain_scores_gemma":[0.9961398,0.0025742478,0.0003762198,0.00034750788,0.0005073376,0.00005492084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023248496,0.00086064154,0.00071726274,0.00093313376,0.0007812719,0.0019107334,0.0011142561,0.0009026621,0.0028766461],"category_scores_gemma":[0.010824073,0.00054022163,0.0006331801,0.00121768,0.0019535432,0.0015588751,0.001604769,0.0016913555,0.00044513334],"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.00004873402,0.00002431936,0.0003881615,0.0001676525,0.00003575908,0.00008448509,0.00020349598,0.49124455,0.0023385817,0.45499444,0.0011666972,0.049303114],"study_design_scores_gemma":[0.000014625554,0.000033779175,0.00009642562,0.000036647307,0.000011167463,0.000042446794,0.00003443385,0.85132176,0.0016360065,0.14202233,0.0047288854,0.000021471844],"about_ca_topic_score_codex":0.0014862189,"about_ca_topic_score_gemma":0.0011868994,"teacher_disagreement_score":0.0028766461,"about_ca_system_score_codex":0.00093822146,"about_ca_system_score_gemma":0.000895893,"threshold_uncertainty_score":0.012295127},"labels":[],"label_agreement":null},{"id":"W2123886643","doi":"10.1109/ccece.2008.4564605","title":"Software efficient implementation of GMSK modem for an automatic identification system transceiver","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Demodulation; Minimum-shift keying; Computer science; Digital signal processing; Software; Transceiver; Embedded system; Software-defined radio; Computer hardware; Bit error rate; Phase-shift keying; Computer network; Telecommunications; Operating system; Wireless; Channel (broadcasting)","score_opus":0.02680996116435334,"score_gpt":0.2504761636768973,"score_spread":0.22366620251254396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123886643","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105041064,0.00031819774,0.884519,0.00013798969,0.00011989266,0.0002078773,0.000102408114,0.0034456667,0.006107995],"genre_scores_gemma":[0.6343817,0.0001980892,0.3571038,0.000090315436,0.000047713685,0.00019595491,0.0002063866,0.00015542714,0.0076206056],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998361,0.000027272854,0.000010814635,0.000018075696,0.00009023845,0.00001752274],"domain_scores_gemma":[0.9997764,0.000060232982,0.000029107689,0.000033718014,0.000090728354,0.000009808919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018738478,0.0003373136,0.00016067324,0.0002891209,0.00014704258,0.0003388263,0.0005374608,0.0002707555,0.002458655],"category_scores_gemma":[0.00047102256,0.00014019161,0.00016211366,0.00013972571,0.000111193345,0.00019232467,0.00015909749,0.00037092617,0.00079147005],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042443842,0.00015417382,0.0019032989,0.0003233049,0.000077432946,0.00033793465,0.00016548105,0.018673755,0.6782495,0.011578768,0.0021341047,0.28597784],"study_design_scores_gemma":[0.00025551298,0.0020636448,0.0042418097,0.00007270919,0.00011467301,0.0016377943,0.00005337639,0.38235947,0.57098526,0.0021427835,0.03601867,0.000054318592],"about_ca_topic_score_codex":0.00035696622,"about_ca_topic_score_gemma":0.0005609745,"teacher_disagreement_score":0.002458655,"about_ca_system_score_codex":0.00017400809,"about_ca_system_score_gemma":0.0003804731,"threshold_uncertainty_score":0.008225024},"labels":[],"label_agreement":null},{"id":"W2125097461","doi":"10.1145/1101884.1101886","title":"Space-efficient evaluation of hypergeometric series","year":2005,"lang":"en","type":"article","venue":"ACM SIGSAM Bulletin","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Lethbridge","funders":"","keywords":"Series (stratigraphy); Binary number; Mathematics; Hypergeometric function; Hypergeometric distribution; Basic hypergeometric series; Computation; Algorithm; Double-precision floating-point format; Constant (computer programming); Applied mathematics; Computer science; Pure mathematics; Arithmetic","score_opus":0.03926145888206123,"score_gpt":0.3030860639389255,"score_spread":0.2638246050568643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125097461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07769643,0.0003112263,0.9105704,0.00020256343,0.00006921204,0.00005369419,0.00006802071,0.0017530797,0.009275317],"genre_scores_gemma":[0.48510852,0.0004089408,0.5072513,0.00010238394,0.000076238466,0.00012105797,0.00023867539,0.00042059203,0.006272376],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993592,0.00016059958,0.000039996416,0.00005750242,0.0003145458,0.00006821493],"domain_scores_gemma":[0.9989343,0.00040542847,0.00009365592,0.00027454935,0.00024349673,0.000048529982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007267673,0.0007852565,0.0008720185,0.0012265005,0.00059839926,0.0015787234,0.0012423215,0.00049128215,0.005152312],"category_scores_gemma":[0.004683836,0.0002669786,0.00052416424,0.0012342358,0.00070608826,0.0019310528,0.001312402,0.0009323019,0.0022209564],"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.00051017065,0.00010156454,0.0020824978,0.00045909907,0.000083180756,0.00053642987,0.00055990746,0.18107167,0.044169355,0.22036883,0.004985482,0.54507184],"study_design_scores_gemma":[0.00005145611,0.0000535285,0.0003180357,0.000029308268,0.000018072562,0.00015865915,0.000106765445,0.8785588,0.025940234,0.08935833,0.0053874883,0.00001930228],"about_ca_topic_score_codex":0.0010310811,"about_ca_topic_score_gemma":0.001762869,"teacher_disagreement_score":0.005152312,"about_ca_system_score_codex":0.0008148724,"about_ca_system_score_gemma":0.0008706308,"threshold_uncertainty_score":0.017236233},"labels":[],"label_agreement":null},{"id":"W2126235977","doi":"10.1109/iccd.2007.4601917","title":"Floating-point division algorithms for an x86 microprocessor with a rectangular multiplier","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Division (mathematics); x86; Multiplier (economics); Microprocessor; Computer science; Division algorithm; Floating point; Algorithm; Point (geometry); Parallel computing; Arithmetic; Computer hardware; Mathematics; Software; Operating system; Geometry","score_opus":0.03208559869844244,"score_gpt":0.32738260642221867,"score_spread":0.2952970077237762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126235977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013346054,0.0009592301,0.9775894,0.00010826913,0.000111722155,0.00007150545,0.00004876118,0.0010700143,0.006695117],"genre_scores_gemma":[0.112266526,0.00089863705,0.87820333,0.000083127736,0.00006825053,0.0001285477,0.000158716,0.0001623279,0.008030563],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994795,0.000063007035,0.000064960484,0.00009073186,0.00024919055,0.0000527351],"domain_scores_gemma":[0.99943835,0.00014236424,0.000069507565,0.00008881154,0.0002423971,0.000018528732],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046894632,0.0005847594,0.00038297492,0.0006590852,0.0005815183,0.00072027225,0.0008838026,0.00035960463,0.0055123107],"category_scores_gemma":[0.0021692365,0.00022223893,0.00034063583,0.0009716595,0.00035953333,0.0011715416,0.0005378128,0.00051542855,0.0021706293],"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.00045992198,0.00004984534,0.00070790725,0.00029374097,0.000044747943,0.00014016933,0.00021535046,0.053730946,0.041106112,0.09926317,0.0099417595,0.7940464],"study_design_scores_gemma":[0.00025037976,0.0006983064,0.0012619025,0.00025844917,0.00009791464,0.001145063,0.00019521144,0.6036813,0.18217239,0.05812252,0.15198031,0.00013626317],"about_ca_topic_score_codex":0.00095981546,"about_ca_topic_score_gemma":0.0014606926,"teacher_disagreement_score":0.0055123107,"about_ca_system_score_codex":0.00061007024,"about_ca_system_score_gemma":0.0010185859,"threshold_uncertainty_score":0.018440485},"labels":[],"label_agreement":null},{"id":"W2127458442","doi":"10.1109/asap.2007.4430003","title":"A Simple Central Processing Unit with Multi-Dimensional Logarithmic Number System Extensions","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Windsor","funders":"","keywords":"Logarithm; Multiplication (music); Computer science; Massively parallel; Simple (philosophy); Binary number; Division (mathematics); Parallel computing; Reduction (mathematics); Arithmetic; Base (topology); Algorithm; Mathematics; Combinatorics","score_opus":0.02922258930425549,"score_gpt":0.30841790871485714,"score_spread":0.27919531941060166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127458442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032101605,0.0024215674,0.91376024,0.00075127376,0.0013372756,0.0003700229,0.0003940181,0.016349673,0.032514293],"genre_scores_gemma":[0.31640306,0.00081370864,0.64961106,0.0010845793,0.0009073733,0.00057643495,0.0008410948,0.0005768763,0.029185848],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913496,0.0001275305,0.000088308145,0.00024226506,0.00032633767,0.00008068969],"domain_scores_gemma":[0.9988697,0.00015807523,0.0000841837,0.00044122865,0.00035248505,0.00009428883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006606514,0.00075199007,0.0009217914,0.0008057741,0.0007694502,0.0021979515,0.0027870252,0.0010123088,0.01632418],"category_scores_gemma":[0.0021825046,0.0004001109,0.0005647646,0.0013383935,0.000602064,0.0027898813,0.0017517462,0.0012187527,0.012349947],"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.0027199027,0.00034422142,0.0015710304,0.0011986692,0.000102783415,0.0010563133,0.00035407426,0.011739131,0.23502587,0.09870727,0.031815104,0.61536556],"study_design_scores_gemma":[0.0006064104,0.0021761442,0.001801707,0.00026377034,0.000273123,0.005060113,0.0001284282,0.23415577,0.2809845,0.036738627,0.43754548,0.00026598354],"about_ca_topic_score_codex":0.00035795278,"about_ca_topic_score_gemma":0.00038576467,"teacher_disagreement_score":0.01632418,"about_ca_system_score_codex":0.00062007946,"about_ca_system_score_gemma":0.0010151656,"threshold_uncertainty_score":0.054609835},"labels":[],"label_agreement":null},{"id":"W2128760591","doi":"10.1109/cacsd.1994.288930","title":"A knowledge-based system for control system design using MEDAL","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"University of Waterloo","funders":"","keywords":"Computer science; Expert system; Medal; USable; Software engineering; Knowledge-based systems; Controller (irrigation); Artificial intelligence; Human–computer interaction; Multimedia","score_opus":0.09622411135862424,"score_gpt":0.3046279500539558,"score_spread":0.20840383869533158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128760591","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00096812827,0.00008815357,0.962863,0.0002789611,0.00011931285,0.00020854104,0.00043407764,0.02500868,0.010031056],"genre_scores_gemma":[0.07639022,0.00029818324,0.88998973,0.0007701274,0.00013865394,0.00124647,0.0019577055,0.0016661703,0.027542822],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835473,0.00047088397,0.00015739264,0.00036111483,0.00055550557,0.00010040098],"domain_scores_gemma":[0.9982553,0.00071659393,0.00013193768,0.00037534698,0.00043344073,0.00008740114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021492632,0.000967027,0.0009822156,0.0013118141,0.0007844465,0.003187772,0.0020354793,0.0014870947,0.044799775],"category_scores_gemma":[0.0058326675,0.0004882877,0.0007934285,0.00058398413,0.0011246412,0.0022353746,0.0022975958,0.0017091956,0.013893426],"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.0015049295,0.0002486673,0.0010280957,0.0010529245,0.0001654814,0.001068315,0.0011603769,0.081563406,0.022537775,0.19816487,0.11128015,0.58022505],"study_design_scores_gemma":[0.00028485223,0.0002225331,0.0002900732,0.00023355566,0.00009531178,0.0004992142,0.00007258763,0.53824985,0.022799442,0.0480626,0.38909024,0.00009963007],"about_ca_topic_score_codex":0.0018255216,"about_ca_topic_score_gemma":0.0016351669,"teacher_disagreement_score":0.044799775,"about_ca_system_score_codex":0.0010241673,"about_ca_system_score_gemma":0.0013813647,"threshold_uncertainty_score":0.14987016},"labels":[],"label_agreement":null},{"id":"W2129905147","doi":"10.1007/978-3-540-30142-4_1","title":"Error Analysis of Digital Filters Using Theorem Proving","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Fixed-point arithmetic; Automated theorem proving; Computer science; Digital filter; Algorithm; Fixed point; Mathematical proof; Parametric statistics; Floating point; Arithmetic; Filter (signal processing); Mathematics; Discrete mathematics; Programming language","score_opus":0.030259835712247527,"score_gpt":0.29045335749546014,"score_spread":0.2601935217832126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129905147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003501291,0.00044118337,0.9933494,0.00014224295,0.00006666843,0.000013098054,0.00002359411,0.00012567233,0.0023368343],"genre_scores_gemma":[0.47155765,0.0034075354,0.5057395,0.00041331231,0.000657715,0.00020855306,0.00029322633,0.00057025027,0.017152231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958443,0.0012786362,0.00023573573,0.00044999557,0.0019362164,0.00025506254],"domain_scores_gemma":[0.9748062,0.019893179,0.0008755234,0.0017749583,0.0024629429,0.00018720014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050098156,0.001581799,0.0015619552,0.0022762248,0.0007221134,0.002784107,0.0022502323,0.0015633374,0.00443334],"category_scores_gemma":[0.026086187,0.00071266165,0.0014304543,0.001648115,0.002661867,0.004758545,0.002722712,0.0031074584,0.00071612356],"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.0002876081,0.00008571444,0.0008867664,0.0005436614,0.00014790142,0.00015819774,0.0002525573,0.21728571,0.006772544,0.64024013,0.0036703502,0.12966883],"study_design_scores_gemma":[0.000021295196,0.000044352786,0.0001940264,0.000057129564,0.000040484898,0.00009141292,0.000025308937,0.67097753,0.0048653767,0.32138082,0.002280043,0.00002219621],"about_ca_topic_score_codex":0.0013979418,"about_ca_topic_score_gemma":0.001037344,"teacher_disagreement_score":0.0050098156,"about_ca_system_score_codex":0.0016842418,"about_ca_system_score_gemma":0.00094925606,"threshold_uncertainty_score":0.026494741},"labels":[],"label_agreement":null},{"id":"W2130130502","doi":"10.1109/sfcs.1984.715894","title":"Log Depth Circuits For Division And Related Problems","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Division (mathematics); Divisibility rule; Integer (computer science); Electronic circuit; Boolean circuit; Space (punctuation); Boolean function; Mathematics; Circuit complexity; Algorithm; Computer science; Discrete mathematics; Arithmetic; Engineering","score_opus":0.02844324645905073,"score_gpt":0.2895281330211929,"score_spread":0.2610848865621422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130130502","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1396537,0.004139722,0.7667125,0.004644608,0.0002491738,0.0004113749,0.0014857041,0.0017985518,0.080904745],"genre_scores_gemma":[0.62587273,0.0025594211,0.3509907,0.0012238779,0.00025258702,0.00040138385,0.0013101187,0.00035897933,0.017030137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992041,0.00018511259,0.00003988912,0.0001404476,0.00027401032,0.00015655158],"domain_scores_gemma":[0.9968659,0.002392107,0.00024364993,0.00024201543,0.00017222832,0.00008407189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008226,0.00079146697,0.00048319044,0.000960686,0.0006868712,0.0022614347,0.0011018766,0.0011828402,0.015620404],"category_scores_gemma":[0.006743597,0.0004697364,0.0006653167,0.0012823445,0.0011455668,0.005925387,0.0014183141,0.0019357529,0.00086940965],"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.0004465295,0.0002699141,0.0016254479,0.0006307245,0.000030015035,0.00013984196,0.00015099972,0.08481585,0.008875127,0.66970915,0.015774881,0.21753155],"study_design_scores_gemma":[0.000115521776,0.00009315373,0.00048858474,0.00008513885,0.00003252028,0.00025822344,0.00010249061,0.16148625,0.0070308815,0.8155679,0.014712554,0.000026752288],"about_ca_topic_score_codex":0.0010306083,"about_ca_topic_score_gemma":0.002555448,"teacher_disagreement_score":0.015620404,"about_ca_system_score_codex":0.0020764947,"about_ca_system_score_gemma":0.00093043933,"threshold_uncertainty_score":0.05225545},"labels":[],"label_agreement":null},{"id":"W2130757597","doi":"10.1109/iscas.2008.4542127","title":"Efficient FPGA implementation of complex multipliers using the logarithmic number system","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Polytechnique Montréal","funders":"","keywords":"Field-programmable gate array; Multiplier (economics); Computer science; Logarithm; Pipeline (software); Computer hardware; Realization (probability); Clock rate; Arithmetic; Embedded system; Parallel computing; Mathematics","score_opus":0.067071208832831,"score_gpt":0.3489269499089081,"score_spread":0.2818557410760771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130757597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21507531,0.0006398438,0.7668917,0.00013869711,0.00009106749,0.00011218717,0.0000758158,0.002137496,0.014837881],"genre_scores_gemma":[0.70683444,0.00023965865,0.28865194,0.0000513514,0.000022297128,0.000055027103,0.000111546266,0.000048316182,0.0039853924],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998847,0.000030528656,0.000010384227,0.000019252418,0.000041042535,0.000014167184],"domain_scores_gemma":[0.99981385,0.00007117686,0.00003501899,0.000031960168,0.000040142048,0.0000077872655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018968956,0.00032862468,0.0001842434,0.00033202197,0.00016585887,0.0004264196,0.0003689621,0.00015179547,0.003198919],"category_scores_gemma":[0.00061284367,0.00013073426,0.00012581049,0.00032159348,0.0001854355,0.00045574055,0.00015933189,0.00019913053,0.0006571474],"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.0010574053,0.00014089287,0.002779753,0.00044764942,0.00005639685,0.0006157852,0.00022407982,0.06448146,0.39552316,0.035506528,0.0034323551,0.49573466],"study_design_scores_gemma":[0.00038708257,0.0017705045,0.0036503065,0.00011219928,0.00006421439,0.0021294383,0.000091757,0.5598995,0.3702752,0.011550962,0.049987815,0.000081027494],"about_ca_topic_score_codex":0.00040640432,"about_ca_topic_score_gemma":0.0007679614,"teacher_disagreement_score":0.003198919,"about_ca_system_score_codex":0.0002589498,"about_ca_system_score_gemma":0.00038931353,"threshold_uncertainty_score":0.0107014775},"labels":[],"label_agreement":null},{"id":"W2131222327","doi":"10.1023/a:1022268319273","title":"Adaptive Monotone Rational Approximation on Finite Sets","year":2003,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Monotonic function; Monotone polygon; Mathematics; Theory of computation; Interval (graph theory); Code (set theory); Set (abstract data type); Applied mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer science; Mathematical analysis","score_opus":0.03546421941878482,"score_gpt":0.2899272823238965,"score_spread":0.25446306290511167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131222327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012423633,0.0004146034,0.98242354,0.00027904284,0.000110258756,0.000025127056,0.000018140123,0.00012254472,0.004183131],"genre_scores_gemma":[0.5252448,0.0013966096,0.46090323,0.00023657153,0.000242993,0.00024055975,0.00012523163,0.00021991417,0.011390109],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982728,0.00083592144,0.000073402465,0.00014963567,0.00056699343,0.00010124112],"domain_scores_gemma":[0.99343663,0.0048554204,0.00029978962,0.00056915794,0.00068314,0.00015594912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034621547,0.0011407916,0.0015707264,0.0013446913,0.000527747,0.0016640344,0.0017805388,0.001603967,0.0029721486],"category_scores_gemma":[0.017486956,0.00065178366,0.00090424204,0.0010034962,0.0028136815,0.00239416,0.003230357,0.002792712,0.0005572381],"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.00019261878,0.00004822174,0.00046206906,0.00019357009,0.000040297997,0.0000745742,0.00015649792,0.3463719,0.0026702778,0.59345907,0.0016947318,0.054636132],"study_design_scores_gemma":[0.000018011291,0.000017532338,0.000041044972,0.000015240686,0.000007304588,0.000018624016,0.000011179562,0.9128242,0.00049207883,0.08562433,0.0009243718,0.0000060439343],"about_ca_topic_score_codex":0.0020969464,"about_ca_topic_score_gemma":0.0012013837,"teacher_disagreement_score":0.0034621547,"about_ca_system_score_codex":0.0014065264,"about_ca_system_score_gemma":0.000801826,"threshold_uncertainty_score":0.018309832},"labels":[],"label_agreement":null},{"id":"W2133323787","doi":"10.1504/ijhpsa.2011.040467","title":"A RISC architecture for 2DLNS-based signal processing","year":2011,"lang":"en","type":"article","venue":"International Journal of High Performance Systems Architecture","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Computer science; Digital signal processing; Architecture; Computer architecture; Parallel computing; Computation; Signal processing; Representation (politics); Multiplication (music); Coprocessor; Reduced instruction set computing; Embedded system; Instruction set; Computer hardware; Algorithm","score_opus":0.021467394392861494,"score_gpt":0.2709714346652626,"score_spread":0.24950404027240108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133323787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030264534,0.00083087356,0.92001396,0.00029854308,0.00050493935,0.00027311983,0.00046718682,0.009039727,0.038307052],"genre_scores_gemma":[0.26770237,0.0005458744,0.70488346,0.00038435843,0.00018613064,0.00045915187,0.0011286773,0.00030684815,0.024403203],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997162,0.00004668349,0.000020983862,0.00004097563,0.00015596896,0.000019066381],"domain_scores_gemma":[0.9997497,0.00005224919,0.000020350035,0.000056941633,0.00010654739,0.000014128116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022335227,0.00033114193,0.0002488443,0.0004908106,0.00038998437,0.0007480733,0.00074840407,0.00040830596,0.008811046],"category_scores_gemma":[0.0006524707,0.00018096424,0.00021545294,0.0006381195,0.00025039984,0.0005063002,0.00037749467,0.0005164391,0.003894843],"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.00058588805,0.00013891148,0.0019280532,0.00072946807,0.00006346919,0.0007126729,0.00034104905,0.04061447,0.28031206,0.09905407,0.03649183,0.53902817],"study_design_scores_gemma":[0.00016443488,0.0009988282,0.0036573964,0.00016919026,0.00007297074,0.002129855,0.00010276813,0.43248424,0.19114955,0.017351067,0.35159123,0.00012841154],"about_ca_topic_score_codex":0.0007825851,"about_ca_topic_score_gemma":0.001857226,"teacher_disagreement_score":0.008811046,"about_ca_system_score_codex":0.00061193464,"about_ca_system_score_gemma":0.00073528546,"threshold_uncertainty_score":0.029475927},"labels":[],"label_agreement":null},{"id":"W2134470982","doi":"10.1109/iscas.2011.5938158","title":"A study on resistive-type truncated CVNS Distributed Neural Networks","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Windsor","funders":"","keywords":"Noise (video); Resistive touchscreen; Computer science; Artificial neural network; Artificial intelligence","score_opus":0.08475696188919818,"score_gpt":0.30943120658778167,"score_spread":0.2246742446985835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134470982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1406706,0.0028722573,0.84138227,0.0005793609,0.00016586365,0.00006389133,0.0000732517,0.00033970783,0.013852764],"genre_scores_gemma":[0.8536388,0.0019914794,0.13810371,0.00020748851,0.00008895691,0.000044053668,0.00012350491,0.000048542013,0.0057533584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930394,0.00019988943,0.000049117163,0.00012615288,0.00028865697,0.00003232775],"domain_scores_gemma":[0.99759406,0.0012162805,0.00012419377,0.00027343186,0.0007376632,0.000054374395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009638949,0.0003518964,0.0004620721,0.000287189,0.00026416377,0.0008484469,0.0009593711,0.00063887413,0.0014714733],"category_scores_gemma":[0.0049759503,0.00018050378,0.00048107363,0.0002822404,0.00063791097,0.0014980822,0.00046893425,0.00070660684,0.00026017628],"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.00055080774,0.00007746702,0.0017762021,0.00044002992,0.00009354096,0.0007822161,0.0002974335,0.65932405,0.07476032,0.0876262,0.0014521474,0.17281967],"study_design_scores_gemma":[0.000009679822,0.00014623073,0.00031199757,0.000027674752,0.000018438877,0.00018069972,0.000025940195,0.97869945,0.010335454,0.007911567,0.002320643,0.00001224619],"about_ca_topic_score_codex":0.0019463948,"about_ca_topic_score_gemma":0.0010432041,"teacher_disagreement_score":0.0019463948,"about_ca_system_score_codex":0.0006134982,"about_ca_system_score_gemma":0.00040211703,"threshold_uncertainty_score":0.0050976276},"labels":[],"label_agreement":null},{"id":"W2134620537","doi":"10.1109/ccece.1999.807264","title":"Digit-serial digit-online addition","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Numerical digit; Computer science; Adder; Emulation; Arithmetic; Serial communication; Computer hardware; Mathematics; Telecommunications; Psychology","score_opus":0.023012422187147188,"score_gpt":0.27829423470103026,"score_spread":0.2552818125138831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134620537","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05412868,0.0010182944,0.8928696,0.00024903726,0.0006026567,0.0002428997,0.00027923853,0.004236606,0.04637306],"genre_scores_gemma":[0.44622925,0.0009779478,0.5292283,0.00036470423,0.00016269273,0.00012641435,0.00042783946,0.0001607711,0.022322092],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965584,0.000038428218,0.000042009735,0.000061480074,0.00017920967,0.000022942291],"domain_scores_gemma":[0.9993381,0.0001724856,0.000094205374,0.00017864257,0.00019282664,0.000023667684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800945,0.0005797924,0.00032793803,0.00048573216,0.00027409827,0.0007048482,0.00071836996,0.0002980852,0.011171213],"category_scores_gemma":[0.0014750137,0.00014576288,0.0002180216,0.00059450744,0.0002887845,0.001126538,0.00054139335,0.00037317805,0.003054915],"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.00056844647,0.0001652435,0.0010067757,0.00071035145,0.000043248325,0.000603704,0.00013295327,0.028416391,0.18300767,0.1007296,0.00825945,0.67635614],"study_design_scores_gemma":[0.00014496206,0.00085281976,0.0011371862,0.00010469493,0.00008903971,0.0041013598,0.00006476801,0.22365549,0.5873807,0.037821516,0.1445815,0.000065962166],"about_ca_topic_score_codex":0.00013765306,"about_ca_topic_score_gemma":0.00039517507,"teacher_disagreement_score":0.011171213,"about_ca_system_score_codex":0.00023450045,"about_ca_system_score_gemma":0.00038265102,"threshold_uncertainty_score":0.037371457},"labels":[],"label_agreement":null},{"id":"W2135526242","doi":"10.1109/iscas.2014.6865615","title":"High-speed FFT processors based on redundant number systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"University of Saskatchewan","funders":"","keywords":"Fast Fourier transform; Adder; Operand; Computer science; Parallel computing; Coprocessor; Multiplier (economics); Binary number; Arithmetic; Computer hardware; Latency (audio); Algorithm; Mathematics; Telecommunications","score_opus":0.014148220458314261,"score_gpt":0.2677238959681255,"score_spread":0.25357567550981125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135526242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1189521,0.0017334272,0.8553236,0.00024151763,0.0003164786,0.00012792367,0.00017294032,0.0033110955,0.019820882],"genre_scores_gemma":[0.53563243,0.0007261491,0.45536265,0.00013339499,0.00016453853,0.00011755407,0.000329755,0.00007746632,0.007455997],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998104,0.000030896324,0.000018045504,0.000032081232,0.00008685756,0.000021710539],"domain_scores_gemma":[0.99974567,0.0000749818,0.00003384042,0.000043262175,0.00009266234,0.000009527359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001644882,0.00041773907,0.00030891536,0.0006485917,0.00030988466,0.00042542283,0.00067788904,0.0002693818,0.0037232328],"category_scores_gemma":[0.0006356651,0.0001987887,0.00024519642,0.00077653234,0.00022679109,0.000859269,0.00025601304,0.0002832888,0.0010226585],"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.0007183605,0.00009816206,0.0011501667,0.00058171805,0.00006992116,0.0006496358,0.00024066422,0.029161248,0.31581658,0.051326133,0.0074788528,0.5927086],"study_design_scores_gemma":[0.00028710367,0.001238379,0.002494652,0.00014284,0.00017787154,0.0022127228,0.00009844936,0.5559961,0.3338279,0.017235879,0.086189836,0.00009820068],"about_ca_topic_score_codex":0.00046967037,"about_ca_topic_score_gemma":0.00079662673,"teacher_disagreement_score":0.0037232328,"about_ca_system_score_codex":0.00026083196,"about_ca_system_score_gemma":0.00035462968,"threshold_uncertainty_score":0.012455463},"labels":[],"label_agreement":null},{"id":"W2136511364","doi":"10.1109/ccece.2007.317","title":"FPGA Implementation and Performance Evaluation of a Digital Carrier Synchronizer Using Different Numerically Controlled Oscillators","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Synchronizer; Field-programmable gate array; Demodulation; Computer science; Lookup table; Synchronization (alternating current); Embedded system; Digital electronics; Phase-locked loop; Emulation; Electronic engineering; Computer hardware; Electronic circuit; Engineering; Electrical engineering; Telecommunications; Jitter","score_opus":0.03488506565078323,"score_gpt":0.3480327066057627,"score_spread":0.31314764095497943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136511364","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9692499,0.00033516937,0.024832051,0.00006149456,0.000043472966,0.00004223699,0.00008143955,0.00060281256,0.004751424],"genre_scores_gemma":[0.98705196,0.00009168792,0.01199292,0.0000090609055,0.0000046410596,0.000013007673,0.000050144,0.000013834928,0.0007728235],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997409,0.000073676056,0.000022415563,0.000031275824,0.00008453666,0.00004725306],"domain_scores_gemma":[0.9994192,0.00027759944,0.000088715366,0.00006749907,0.00011934087,0.000027569788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029596954,0.00029056668,0.0001842411,0.0003993235,0.00015533685,0.00033796317,0.00039294182,0.00023456909,0.001937671],"category_scores_gemma":[0.0010128224,0.00009513808,0.00010774152,0.0002814721,0.00014645027,0.0002519447,0.00010498835,0.00014577415,0.00016779588],"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.0049930527,0.00054691953,0.015486084,0.00090361777,0.000196292,0.0010976747,0.00053923274,0.2482523,0.48161963,0.007477468,0.0018769224,0.2370109],"study_design_scores_gemma":[0.00035495093,0.00610698,0.0131590525,0.00006049212,0.00014199791,0.0007284322,0.00017094353,0.36877295,0.6047956,0.00033797955,0.005312436,0.000058190795],"about_ca_topic_score_codex":0.0011423347,"about_ca_topic_score_gemma":0.00094018306,"teacher_disagreement_score":0.001937671,"about_ca_system_score_codex":0.0003013389,"about_ca_system_score_gemma":0.00020518112,"threshold_uncertainty_score":0.0064821243},"labels":[],"label_agreement":null},{"id":"W2136617430","doi":"10.1109/iscas.2012.6271460","title":"Design and implementation of a Radix-100 division unit","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Saskatchewan","funders":"","keywords":"Radix (gastropod); Divisor (algebraic geometry); Decimal; Division (mathematics); Initialization; Quotient; Computer science; Arithmetic; Greatest common divisor; Division algorithm; Parallel computing; Mathematics; Algorithm; Discrete mathematics","score_opus":0.059845922551351544,"score_gpt":0.370374186297669,"score_spread":0.3105282637463175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136617430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15391715,0.0018933148,0.7662462,0.0008373158,0.00064011966,0.0006670884,0.00048509918,0.01548108,0.059832603],"genre_scores_gemma":[0.6699063,0.0004964909,0.30081975,0.00048544112,0.00010941827,0.00034357744,0.0005337788,0.00026822733,0.027036913],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997255,0.000030174426,0.000019870642,0.00005486858,0.00013130919,0.00003822048],"domain_scores_gemma":[0.9998491,0.000017195616,0.000019349876,0.000030378926,0.00006920178,0.000014747433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016405307,0.00035381113,0.00036402966,0.000525403,0.00038743328,0.0008485318,0.0014206804,0.0004717229,0.006614102],"category_scores_gemma":[0.00036103427,0.00022798698,0.00018601157,0.00047490632,0.00018528017,0.00070634874,0.00030797522,0.00033030886,0.0031044492],"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.0006903718,0.00022938714,0.0022998843,0.0007016405,0.00011520172,0.00077932555,0.00039165467,0.021780206,0.398991,0.038569745,0.019667141,0.5157844],"study_design_scores_gemma":[0.00023769609,0.0015992097,0.002527468,0.000098321565,0.0001459391,0.001997878,0.00013912757,0.21723403,0.58054453,0.004316314,0.19104232,0.0001170792],"about_ca_topic_score_codex":0.00070603273,"about_ca_topic_score_gemma":0.00057880353,"teacher_disagreement_score":0.006614102,"about_ca_system_score_codex":0.0005275644,"about_ca_system_score_gemma":0.0006472058,"threshold_uncertainty_score":0.022126317},"labels":[],"label_agreement":null},{"id":"W2137831111","doi":"10.1109/ccece.2007.346","title":"A Technology-Independent Logarithmic Converter IP Block","year":2007,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Block (permutation group theory); Computer science; CMOS; USable; Logarithm; Computer hardware; Electronic engineering; Mathematics; Engineering","score_opus":0.012920728899103456,"score_gpt":0.27326013592376114,"score_spread":0.2603394070246577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137831111","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024217667,0.000532579,0.9244076,0.00022018638,0.00021408546,0.00038728493,0.0002936811,0.011247142,0.03847974],"genre_scores_gemma":[0.55051345,0.00044851037,0.42411178,0.00045699504,0.00021625159,0.00039941323,0.0006131767,0.00060308276,0.022637349],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963284,0.000042346408,0.000030099232,0.000077162134,0.00017688563,0.00004061082],"domain_scores_gemma":[0.99954385,0.00011020385,0.000036574183,0.00012721369,0.00015907492,0.000023061373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031566827,0.000408604,0.00033214988,0.0006102476,0.0003660856,0.0008821943,0.0013121552,0.00032090285,0.011336445],"category_scores_gemma":[0.0009935512,0.00020176801,0.00023392252,0.00040678593,0.0002457134,0.0010871876,0.00043348415,0.00064143504,0.0040051485],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069855136,0.00019253042,0.0014394809,0.00052074314,0.00004439934,0.00056438445,0.00015719362,0.014335807,0.25109828,0.038517825,0.015228472,0.67720234],"study_design_scores_gemma":[0.00021778196,0.001176524,0.0019727652,0.0001209692,0.00015350575,0.0029434077,0.00004787257,0.23275901,0.5563913,0.009711699,0.19440234,0.00010284613],"about_ca_topic_score_codex":0.0004819301,"about_ca_topic_score_gemma":0.00046361494,"teacher_disagreement_score":0.011336445,"about_ca_system_score_codex":0.0003868527,"about_ca_system_score_gemma":0.0006120699,"threshold_uncertainty_score":0.03792417},"labels":[],"label_agreement":null},{"id":"W2138131169","doi":"10.1007/s12532-013-0052-9","title":"Local cuts for mixed-integer programming","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cutting-plane method; Integer programming; Travelling salesman problem; Mathematics; Linear programming relaxation; Context (archaeology); Mathematical optimization; Relaxation (psychology); Theory of computation; Space (punctuation); Integer (computer science); Hyperplane; Point (geometry); Plane (geometry); Range (aeronautics); Linear programming; Algorithm; Computer science; Combinatorics; Geometry","score_opus":0.02548378838351857,"score_gpt":0.30913257376755415,"score_spread":0.2836487853840356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138131169","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029865166,0.00064972584,0.9919613,0.00024048366,0.00008160031,0.000035577992,0.000058821875,0.00014220763,0.003843761],"genre_scores_gemma":[0.14771287,0.00090015284,0.83992994,0.00031513066,0.00025744116,0.0006790247,0.000381142,0.00054761185,0.0092766285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979425,0.0011374406,0.000061562874,0.0002400187,0.000490567,0.00012790124],"domain_scores_gemma":[0.9923564,0.0059690163,0.00041191414,0.00043497054,0.0005844935,0.00024316846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044070533,0.0015426339,0.0018016385,0.0014616151,0.00094692636,0.0027994025,0.0024699934,0.0014167839,0.007773428],"category_scores_gemma":[0.016911115,0.0011706431,0.0011409557,0.0015561047,0.0022906011,0.003371033,0.0026475566,0.0056101,0.0011573005],"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.00027100794,0.000121053126,0.00040715677,0.0005138464,0.000092108174,0.00007757995,0.00017641636,0.24969915,0.001297006,0.64872247,0.008171437,0.09045078],"study_design_scores_gemma":[0.000039296185,0.000038288963,0.00007729185,0.00006282501,0.000022033051,0.000023917632,0.000028097726,0.5720349,0.00046944505,0.42298162,0.0042089354,0.000013404821],"about_ca_topic_score_codex":0.0019144864,"about_ca_topic_score_gemma":0.002390515,"teacher_disagreement_score":0.007773428,"about_ca_system_score_codex":0.00160505,"about_ca_system_score_gemma":0.0012342933,"threshold_uncertainty_score":0.026004732},"labels":[],"label_agreement":null},{"id":"W2140571294","doi":"10.1016/j.tcs.2004.01.013","title":"The abc conjecture and correctly rounded reciprocal square roots","year":2004,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Conjecture; Reciprocal; Square root; Square (algebra); Mathematics; Point (geometry); Code (set theory); Constant (computer programming); Computation; Collatz conjecture; Scheme (mathematics); Combinatorics; Discrete mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.008188843754170748,"score_gpt":0.26321091355238313,"score_spread":0.2550220697982124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140571294","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24173555,0.0036022575,0.28888965,0.023740144,0.005450548,0.000076296776,0.00060522644,0.0012813132,0.43461907],"genre_scores_gemma":[0.9214084,0.0010846953,0.041767817,0.002924946,0.0010073256,0.00008441652,0.00031973547,0.00048022842,0.030922381],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99729794,0.0007094242,0.00010857948,0.00048419976,0.0010572124,0.0003426294],"domain_scores_gemma":[0.9925925,0.0039828066,0.00043848198,0.001792427,0.00093391637,0.00025978463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017944119,0.00076969335,0.0011551485,0.0015414862,0.002083879,0.005914489,0.0012320435,0.0038262191,0.023099313],"category_scores_gemma":[0.029282704,0.00071679737,0.00065147685,0.0013771488,0.006810134,0.0075477376,0.003321285,0.005610872,0.005332901],"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.0001140783,0.000012335951,0.00023413954,0.000048879472,0.0000045120432,0.0001442734,0.0001193523,0.0020272222,0.000493903,0.98015827,0.005950507,0.010692511],"study_design_scores_gemma":[0.000019648316,0.0000072247035,0.000049313963,0.000021555554,0.000003055301,0.0001177882,0.000072684816,0.004077209,0.000383711,0.9907286,0.004509936,0.0000093330345],"about_ca_topic_score_codex":0.0010104708,"about_ca_topic_score_gemma":0.0006636765,"teacher_disagreement_score":0.023099313,"about_ca_system_score_codex":0.0010118387,"about_ca_system_score_gemma":0.0006678616,"threshold_uncertainty_score":0.07727486},"labels":[],"label_agreement":null},{"id":"W2140736088","doi":"10.1109/newcas.2006.250901","title":"On the Design of a Double Precision Logarithmic Number System Arithmetic Unit","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"CORDIC; Computer science; Arithmetic; Logarithm; Floating-point unit; Microprocessor; Latency (audio); Clock rate; Parallel computing; Computer hardware; Floating point; Interpolation (computer graphics); Series (stratigraphy); Saturation arithmetic; Arbitrary-precision arithmetic; Cache; Table (database); Double-precision floating-point format; Mathematics; Algorithm; Field-programmable gate array; Telecommunications","score_opus":0.0412253742137817,"score_gpt":0.281485395339671,"score_spread":0.2402600211258893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140736088","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030796815,0.0020481711,0.9281731,0.00036768746,0.0002630557,0.00020292717,0.000059926544,0.0013664328,0.036721803],"genre_scores_gemma":[0.3033141,0.0022902805,0.6721179,0.0003012283,0.00019399023,0.00017054251,0.00019239416,0.00014236144,0.021277228],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976844,0.00004265311,0.000017212195,0.000042103755,0.00010955641,0.00002007772],"domain_scores_gemma":[0.99970776,0.00007164327,0.0000358346,0.000037750506,0.0001348889,0.0000120441955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033627904,0.0003966372,0.00032096007,0.0003735176,0.00036277922,0.00083220954,0.00085534627,0.0003611961,0.0048137465],"category_scores_gemma":[0.0009580613,0.0002082908,0.00022363504,0.0004719187,0.00048573076,0.0011064353,0.0004037051,0.00043547363,0.002507693],"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.00064474106,0.000078825295,0.0014977191,0.0008828237,0.00003355264,0.0005109007,0.00030947174,0.035086818,0.1699807,0.24141368,0.0045141554,0.54504657],"study_design_scores_gemma":[0.0001715084,0.001543918,0.0012509541,0.00033622238,0.00013729926,0.00209832,0.00013346417,0.37865955,0.2789656,0.034664046,0.30194017,0.000098861645],"about_ca_topic_score_codex":0.00043857185,"about_ca_topic_score_gemma":0.0005378987,"teacher_disagreement_score":0.0048137465,"about_ca_system_score_codex":0.00050695887,"about_ca_system_score_gemma":0.0006565314,"threshold_uncertainty_score":0.016103625},"labels":[],"label_agreement":null},{"id":"W2141682399","doi":"10.1007/978-3-642-30885-7_8","title":"Preventing Arithmetic Overflows in Alloy","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Counterexample; Spurious relationship; Computer science; Bounded function; Semantics (computer science); Programming language; Arithmetic; Range (aeronautics); Key (lock); Theoretical computer science; Algorithm; Discrete mathematics; Mathematics; Operating system","score_opus":0.02226271050203656,"score_gpt":0.27457102186265875,"score_spread":0.2523083113606222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141682399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14983246,0.005425873,0.7501958,0.0010978286,0.0009356319,0.00017662895,0.00029813827,0.010081257,0.08195636],"genre_scores_gemma":[0.76913106,0.001884254,0.19862826,0.00043446987,0.00018785207,0.00009103384,0.00044725346,0.0014318896,0.027763875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99785197,0.00033456585,0.00018124125,0.0002180571,0.0010870318,0.00032716958],"domain_scores_gemma":[0.99672794,0.0013920292,0.00024112844,0.00096426904,0.00059053744,0.00008412345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015053342,0.000984617,0.0013761917,0.0013101583,0.0013436774,0.0022570805,0.002053727,0.000986122,0.006970569],"category_scores_gemma":[0.008071022,0.00079408084,0.0008209637,0.0016834586,0.0018764534,0.0040107504,0.003067039,0.0013483032,0.0017732101],"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.0009596821,0.00013629385,0.0016134355,0.0010177323,0.00009406558,0.00048182544,0.0007457301,0.051354516,0.018633775,0.47754896,0.020270428,0.42714363],"study_design_scores_gemma":[0.000109701556,0.00025721898,0.00046533544,0.00033928695,0.00024195657,0.0006661415,0.0003636052,0.12887569,0.06725468,0.7391205,0.06220248,0.00010351172],"about_ca_topic_score_codex":0.0011226401,"about_ca_topic_score_gemma":0.0016083185,"teacher_disagreement_score":0.006970569,"about_ca_system_score_codex":0.0007550112,"about_ca_system_score_gemma":0.0015005814,"threshold_uncertainty_score":0.023318827},"labels":[],"label_agreement":null},{"id":"W2141987758","doi":"10.1016/j.amc.2009.10.012","title":"Blending implicit interval curves and surfaces","year":2009,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Interval (graph theory); Mathematics; Interval arithmetic; Mathematical analysis; Geometry; Combinatorics","score_opus":0.022240295227680208,"score_gpt":0.2977170133105186,"score_spread":0.27547671808283836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141987758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09719579,0.000781058,0.8886803,0.00015898224,0.00022480723,0.000060456558,0.00006138273,0.0005263488,0.012310828],"genre_scores_gemma":[0.6424996,0.0010193205,0.33661014,0.0000804822,0.000085018706,0.00008277226,0.0001552624,0.0005724046,0.018894961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951756,0.00008026034,0.000027562246,0.000066026776,0.00026800612,0.00004063162],"domain_scores_gemma":[0.9990639,0.00042790227,0.000071603674,0.00021347859,0.00015435833,0.00006882402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009186928,0.00058739545,0.000805629,0.0015307611,0.00037270092,0.0021648656,0.0011263277,0.0012732701,0.006540833],"category_scores_gemma":[0.0051620468,0.00046802283,0.0005037522,0.0017418052,0.0012399801,0.002972496,0.0027727399,0.0016838458,0.0008984665],"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.00030947942,0.00014269342,0.0012729417,0.0003051608,0.000045650984,0.0002762795,0.0007984762,0.23692407,0.025726823,0.3662124,0.0019004863,0.36608544],"study_design_scores_gemma":[0.000040082145,0.00012393971,0.0003383317,0.000057697485,0.000023478668,0.00021989664,0.00016725504,0.8380298,0.011433575,0.13007282,0.019460868,0.000032235424],"about_ca_topic_score_codex":0.00050711306,"about_ca_topic_score_gemma":0.0005413254,"teacher_disagreement_score":0.006540833,"about_ca_system_score_codex":0.0004586551,"about_ca_system_score_gemma":0.0003329044,"threshold_uncertainty_score":0.021881282},"labels":[],"label_agreement":null},{"id":"W2143581900","doi":"10.1109/asap.2003.1212843","title":"A floating-point CORDIC based SVD processor","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Queen's University","funders":"","keywords":"CORDIC; Computer science; Computation; Parallel computing; Singular value decomposition; Floating point; Computer hardware; Computational science; Fixed-point arithmetic; Algorithm; Field-programmable gate array","score_opus":0.015086061521323144,"score_gpt":0.2698592292911693,"score_spread":0.25477316776984615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143581900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019741043,0.0006385298,0.9574045,0.00019719104,0.00033796864,0.00012195239,0.00020237635,0.0055546844,0.015801776],"genre_scores_gemma":[0.1976805,0.0006620209,0.7740238,0.00026533642,0.00026319173,0.00012947743,0.00063632877,0.00027566307,0.02606378],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998078,0.000015819223,0.00001261684,0.00004093899,0.00010223194,0.000020583906],"domain_scores_gemma":[0.9997806,0.000027063552,0.000013768899,0.000029763038,0.00013142379,0.000017320273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015164154,0.00044665733,0.0004284608,0.00043657445,0.0005101879,0.0008629396,0.0010213291,0.0004825244,0.009083437],"category_scores_gemma":[0.0005330439,0.00023281775,0.00025657506,0.0006422875,0.00029023667,0.00060212164,0.00038042106,0.00045415835,0.005473787],"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.00044268172,0.00008244639,0.00066982274,0.00039576046,0.000043239936,0.00050882454,0.0001115237,0.019740371,0.2907759,0.032766223,0.01567183,0.6387915],"study_design_scores_gemma":[0.00019049193,0.0009487202,0.0012506302,0.0001292907,0.00013867136,0.002768961,0.000079928235,0.54354966,0.30237147,0.015516923,0.1329456,0.00010966629],"about_ca_topic_score_codex":0.0011506337,"about_ca_topic_score_gemma":0.0017124816,"teacher_disagreement_score":0.009083437,"about_ca_system_score_codex":0.0004226154,"about_ca_system_score_gemma":0.0007202973,"threshold_uncertainty_score":0.030387163},"labels":[],"label_agreement":null},{"id":"W2143972262","doi":"10.1117/12.406502","title":"&lt;title&gt;Nonlinear signal processing using index calculus DBNS arithmetic&lt;/title&gt;","year":2000,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"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 Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Signal processing; Representation (politics); Digital signal processing; Dynamic range; Range (aeronautics); Arithmetic; Binary number; Algorithm; Speech processing; Speech recognition; Mathematics; Computer hardware; Computer vision","score_opus":0.015274226636533038,"score_gpt":0.2558410371923289,"score_spread":0.24056681055579587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143972262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010048009,0.0028988842,0.7891627,0.0011191969,0.0028287168,0.00012524104,0.00042494512,0.0019091663,0.19148318],"genre_scores_gemma":[0.13837308,0.0052667325,0.67754495,0.0006033336,0.00085892715,0.00026533986,0.0008974757,0.001084926,0.1751052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997893,0.000032675496,0.000011765265,0.000025017835,0.00012885038,0.000012415852],"domain_scores_gemma":[0.9998851,0.000025892816,0.000012223717,0.00002754245,0.000041585434,0.0000075587677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029684472,0.00034129684,0.0002843067,0.0005464658,0.00030033075,0.0011642022,0.00049773057,0.00027844,0.026281243],"category_scores_gemma":[0.00068270875,0.000140871,0.00023089627,0.0007068588,0.00063071575,0.00081073254,0.0006497796,0.00067353,0.00850012],"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.00008797074,0.000032570755,0.0003748934,0.00031596384,0.000011922315,0.00018110222,0.00013511487,0.013005865,0.053956583,0.55867404,0.04038901,0.33283502],"study_design_scores_gemma":[0.000023433804,0.00008312142,0.0006575731,0.0001276826,0.00000916613,0.00031483886,0.000050061913,0.2098238,0.036043882,0.10242535,0.650395,0.000046062054],"about_ca_topic_score_codex":0.0010830269,"about_ca_topic_score_gemma":0.0016412359,"teacher_disagreement_score":0.026281243,"about_ca_system_score_codex":0.0006275692,"about_ca_system_score_gemma":0.00040486554,"threshold_uncertainty_score":0.08791947},"labels":[],"label_agreement":null},{"id":"W2144397004","doi":"10.1109/tc.2010.266","title":"Computational Vector-Magnitude-Based Range Determination for Scientific Abstract Data Types","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","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":"McMaster University","funders":"","keywords":"Computer science; Computational complexity theory; Scalar (mathematics); Range (aeronautics); Key (lock); Modulo; Theoretical computer science; Satisfiability; Computational science; Block (permutation group theory); Algorithm; Computer engineering; Mathematics","score_opus":0.055371385950592815,"score_gpt":0.32539545675151266,"score_spread":0.27002407080091984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144397004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013554631,0.0002444711,0.9817151,0.00025603006,0.000038518712,0.00006538994,0.00014218956,0.00080608204,0.003177653],"genre_scores_gemma":[0.20517498,0.00021551015,0.7904125,0.0001288346,0.000058805042,0.00024242498,0.0004941715,0.00029204553,0.00298072],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863404,0.00043534068,0.00014190741,0.00015208915,0.0005374993,0.00009905213],"domain_scores_gemma":[0.99466527,0.0035321645,0.00046026634,0.0005417713,0.0007018485,0.000098709395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001851937,0.00067737984,0.0009286906,0.0023515297,0.00053273403,0.0020357633,0.0017060239,0.0007895868,0.008126738],"category_scores_gemma":[0.013560861,0.00053760654,0.0007686507,0.0021604975,0.0010608895,0.0040116115,0.0019302379,0.0011881872,0.001463981],"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.00044084512,0.000101565674,0.0016930503,0.000513741,0.000048126123,0.00012229143,0.00025131393,0.29216757,0.008928647,0.22377856,0.0060883407,0.46586585],"study_design_scores_gemma":[0.000038276117,0.00005491173,0.00018792559,0.000051116975,0.00000946259,0.00008483177,0.000062768544,0.88519883,0.0058396715,0.10462127,0.0038271667,0.00002377067],"about_ca_topic_score_codex":0.0014656235,"about_ca_topic_score_gemma":0.002686245,"teacher_disagreement_score":0.008126738,"about_ca_system_score_codex":0.0009848276,"about_ca_system_score_gemma":0.0015849228,"threshold_uncertainty_score":0.027186632},"labels":[],"label_agreement":null},{"id":"W2145660355","doi":"10.1109/mwscas.2005.1594354","title":"Error analysis of FIR filters implemented with 1-digit 2-dimensional logarithmic number systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Calgary","funders":"","keywords":"Finite impulse response; Logarithm; Digital filter; Algorithm; Variance (accounting); Filter (signal processing); Computer science; Reduction (mathematics); Impulse (physics); Linear filter; Arithmetic; Mathematics","score_opus":0.02064610220527882,"score_gpt":0.3031119482476305,"score_spread":0.2824658460423517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145660355","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6003884,0.00060855853,0.39449266,0.00019125771,0.000073992545,0.000025876787,0.00008250719,0.0007291863,0.0034076362],"genre_scores_gemma":[0.95304924,0.00014359162,0.04513101,0.000037277863,0.000015542244,0.000021699467,0.00008448162,0.000063964915,0.0014532575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885654,0.00024228929,0.00006480235,0.00012999654,0.00063334755,0.00007306201],"domain_scores_gemma":[0.9925383,0.0055530625,0.0005376861,0.00041895013,0.0009128407,0.000039274084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012881089,0.00043697061,0.00032702636,0.0007547681,0.00021068829,0.00041076064,0.00044430897,0.0005108146,0.00139886],"category_scores_gemma":[0.007798477,0.0001592974,0.0002276577,0.00056904374,0.00028989871,0.0007008657,0.00022049111,0.00030308406,0.00019320323],"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.0024010085,0.0001988268,0.008812307,0.00035011323,0.00012498193,0.0003823991,0.00035497342,0.579417,0.18903044,0.024081534,0.0008161411,0.19403026],"study_design_scores_gemma":[0.000020364794,0.00014161864,0.0025499146,0.00001666723,0.000011775992,0.00011796286,0.0000169795,0.94558775,0.049466286,0.0015384238,0.0005096227,0.000022517836],"about_ca_topic_score_codex":0.00092301617,"about_ca_topic_score_gemma":0.0010247852,"teacher_disagreement_score":0.00139886,"about_ca_system_score_codex":0.00070252613,"about_ca_system_score_gemma":0.00030864452,"threshold_uncertainty_score":0.0068122745},"labels":[],"label_agreement":null},{"id":"W2147123689","doi":"10.1109/cjece.2007.364327","title":"A new algorithm for finding the optimal solution of the least absolute value estimation problem","year":2007,"lang":"en","type":"article","venue":"Canadian Journal of Electrical and Computer Engineering","topic":"Numerical Methods 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":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Least absolute deviations; Algorithm; Value (mathematics); Mathematical optimization; Estimation; Computer science; Mathematics; Statistics; Engineering","score_opus":0.009453302953869485,"score_gpt":0.22120612998919234,"score_spread":0.21175282703532286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147123689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002900006,0.00002428451,0.9993037,0.000023237637,0.00002039955,0.000010027656,0.000003994394,0.00008433923,0.00023994873],"genre_scores_gemma":[0.014208278,0.00011337412,0.9838297,0.00004815019,0.000045174635,0.00013606776,0.000055433113,0.0001047316,0.0014591642],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922884,0.00018878341,0.000048052545,0.00020078686,0.0002791137,0.000054468223],"domain_scores_gemma":[0.99878126,0.00063946313,0.00008647151,0.00010237173,0.00034587187,0.000044544035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016374837,0.0010755889,0.0012957009,0.0009953912,0.0006964616,0.0012396472,0.001612609,0.0014501363,0.005903604],"category_scores_gemma":[0.0048238235,0.00079339335,0.000773424,0.0008641207,0.0008867461,0.0021160478,0.001792853,0.0022220649,0.002064902],"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.00015592904,0.00009127271,0.0005662114,0.00031326173,0.000062795036,0.00014855275,0.00020552133,0.21121351,0.019501334,0.08633926,0.00803987,0.67336243],"study_design_scores_gemma":[0.000051762916,0.00012767779,0.00015465509,0.00003727586,0.000024098888,0.00023709674,0.000042077856,0.9550988,0.005895997,0.024838567,0.013454787,0.000037242884],"about_ca_topic_score_codex":0.0012016498,"about_ca_topic_score_gemma":0.0010567467,"teacher_disagreement_score":0.005903604,"about_ca_system_score_codex":0.0004983371,"about_ca_system_score_gemma":0.0015329205,"threshold_uncertainty_score":0.019749522},"labels":[],"label_agreement":null},{"id":"W2147326654","doi":"10.1109/icis.2008.97","title":"Convergence Analysis of Jacobi Iterative Method Using Logarithmic Number System","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan; CMC Microsystems","keywords":"Jacobi method; Logarithm; Convergence (economics); Iterative method; Jacobi eigenvalue algorithm; Computer science; Constraint (computer-aided design); Applied mathematics; Mathematical optimization; Floating point; Mathematics; Algorithm; Mathematical analysis","score_opus":0.04638021523409191,"score_gpt":0.3447272514047174,"score_spread":0.29834703617062547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147326654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010604174,0.0006100459,0.9803593,0.0002598492,0.0000780855,0.00004085568,0.000024509256,0.00025152855,0.0077716373],"genre_scores_gemma":[0.5245507,0.0016713792,0.46147868,0.000256909,0.00014116788,0.0003030562,0.00018977781,0.00052435626,0.010883976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862945,0.00047393827,0.00005872229,0.00011780718,0.0006353449,0.0000848425],"domain_scores_gemma":[0.995965,0.002130529,0.00019124229,0.0002683139,0.0013697259,0.00007505959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024371895,0.0005827992,0.00054106466,0.00094347715,0.0006174242,0.000755162,0.00086695765,0.0005354523,0.00282197],"category_scores_gemma":[0.009244924,0.00021118872,0.0005041951,0.0006639146,0.0013205594,0.0014679345,0.00093689415,0.0010637317,0.00079900096],"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.00034995985,0.00006593775,0.004462052,0.00066674966,0.00006261738,0.0003445602,0.00073973753,0.59121335,0.020322759,0.24137263,0.0054442114,0.13495535],"study_design_scores_gemma":[0.0000055881155,0.000023665327,0.00016162064,0.000019778325,0.0000034410837,0.000058938538,0.000023191118,0.9805117,0.003568272,0.013705184,0.0019075484,0.000011060365],"about_ca_topic_score_codex":0.0020482468,"about_ca_topic_score_gemma":0.0012052716,"teacher_disagreement_score":0.00282197,"about_ca_system_score_codex":0.00090647844,"about_ca_system_score_gemma":0.0012027319,"threshold_uncertainty_score":0.012889266},"labels":[],"label_agreement":null},{"id":"W2148482408","doi":"10.1109/isit.1994.395018","title":"Search procedures for very low rate quasi-optimal convolutional codes","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convolutional code; Computer science; Serial concatenated convolutional codes; Algorithm; Turbo code; Concatenated error correction code; Block code; Decoding methods","score_opus":0.043674470397610014,"score_gpt":0.30736767732931547,"score_spread":0.26369320693170545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148482408","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035599656,0.00021342614,0.95760465,0.00016900378,0.00002879786,0.000054551732,0.000098477365,0.0003175643,0.0059138197],"genre_scores_gemma":[0.37316686,0.00025128157,0.6177658,0.00014530687,0.00004158826,0.00026792477,0.00037555277,0.00028074047,0.0077049425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996382,0.00012830344,0.000021108992,0.000042429503,0.000116658615,0.00005330716],"domain_scores_gemma":[0.9984126,0.001047858,0.00013593333,0.00008702082,0.00026333076,0.00005330114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081993797,0.00033202104,0.00045116135,0.0008225517,0.00037762677,0.00066853093,0.0006205261,0.00064887584,0.0054181637],"category_scores_gemma":[0.005345433,0.00042496948,0.00033433756,0.0006510278,0.0008584387,0.0007845568,0.00100916,0.0005390266,0.00089900603],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033901882,0.00005944711,0.0014036859,0.0002421618,0.00004381474,0.00015731416,0.00017939236,0.622555,0.013182468,0.18652023,0.004792877,0.17052463],"study_design_scores_gemma":[0.00004342841,0.00004835004,0.00017471249,0.000017071387,0.000008824692,0.0000470113,0.000020482888,0.96562284,0.0027879374,0.0295657,0.0016515573,0.000012000686],"about_ca_topic_score_codex":0.0019452336,"about_ca_topic_score_gemma":0.0028737916,"teacher_disagreement_score":0.0054181637,"about_ca_system_score_codex":0.00068159675,"about_ca_system_score_gemma":0.001136275,"threshold_uncertainty_score":0.018125534},"labels":[],"label_agreement":null},{"id":"W2151641706","doi":"10.1109/iscas.2008.4541511","title":"A novel decimal-to-decimal logarithmic converter","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; Computer science; Arithmetic; Logarithm; Mathematics","score_opus":0.04315103663352693,"score_gpt":0.27999601444877115,"score_spread":0.23684497781524422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151641706","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03083045,0.0013330155,0.92337286,0.0003537179,0.00039262074,0.00024452445,0.00027772985,0.0066467873,0.03654838],"genre_scores_gemma":[0.5144394,0.0012493094,0.45331344,0.0007624151,0.00027601168,0.00022746167,0.0006391396,0.00030631482,0.028786564],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99943334,0.00006688168,0.000047190522,0.0001051739,0.00030368456,0.00004372004],"domain_scores_gemma":[0.9995844,0.00007978809,0.000034462475,0.000078669094,0.00019390366,0.000028832752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031102033,0.00045657912,0.00042899558,0.0007418162,0.00041842196,0.0014938832,0.0013990867,0.00046270058,0.008525781],"category_scores_gemma":[0.0008643512,0.00022261431,0.00026429302,0.0007243952,0.0002773786,0.0013458822,0.0005683061,0.0007289391,0.0038940385],"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.00082469505,0.00025270839,0.0010831835,0.00057046826,0.00006185124,0.0007258611,0.00021796567,0.014832794,0.24953243,0.045512006,0.010954329,0.6754317],"study_design_scores_gemma":[0.0002073792,0.0010318694,0.0012689615,0.00018402254,0.00013135328,0.0046323817,0.00011399946,0.2930716,0.461806,0.015756534,0.22167034,0.00012552133],"about_ca_topic_score_codex":0.00024894753,"about_ca_topic_score_gemma":0.00034324845,"teacher_disagreement_score":0.008525781,"about_ca_system_score_codex":0.00041430054,"about_ca_system_score_gemma":0.00052165467,"threshold_uncertainty_score":0.028521597},"labels":[],"label_agreement":null},{"id":"W2152494213","doi":"10.1109/ismvl.2012.36","title":"Complexity Study of the Continuous Valued Number System Adders","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Windsor","funders":"","keywords":"Adder; Computer science; Operand; Arithmetic; Binary number; Redundancy (engineering); Mathematics; Algorithm; Latency (audio); Telecommunications","score_opus":0.054636617296167596,"score_gpt":0.3104786803961886,"score_spread":0.255842063100021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152494213","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49020788,0.002364597,0.46502694,0.001031616,0.00019323431,0.00011679583,0.00049946865,0.00033053703,0.040228907],"genre_scores_gemma":[0.9266996,0.0005148367,0.06539275,0.00008378852,0.00009511766,0.0000853678,0.0003115347,0.000035364046,0.0067816433],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993705,0.0001255786,0.000036462327,0.00008229868,0.00032760153,0.000057497477],"domain_scores_gemma":[0.99761534,0.0016693515,0.00015771089,0.00013757678,0.00037469412,0.00004532917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004564188,0.0002792586,0.0003521298,0.0007776775,0.00036833234,0.001252632,0.000553545,0.00025187843,0.0048432536],"category_scores_gemma":[0.004263327,0.00016313925,0.00035914007,0.00064075075,0.0004912899,0.0014763394,0.00041381875,0.00042400317,0.00028713865],"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.00068402884,0.000073403535,0.003251409,0.00047949867,0.00009189006,0.00048777953,0.0002410673,0.40471855,0.019993193,0.41269618,0.005187236,0.15209576],"study_design_scores_gemma":[0.000023192464,0.00008861588,0.00084081455,0.000016467939,0.00002310374,0.00025203612,0.00003525656,0.9225692,0.0049965493,0.06841199,0.0027249225,0.000017933082],"about_ca_topic_score_codex":0.0010458626,"about_ca_topic_score_gemma":0.001198283,"teacher_disagreement_score":0.0048432536,"about_ca_system_score_codex":0.001011672,"about_ca_system_score_gemma":0.001036181,"threshold_uncertainty_score":0.01620233},"labels":[],"label_agreement":null},{"id":"W2152694458","doi":"10.48550/arxiv.1505.05571","title":"Fast exact summation using small and large superaccumulators","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Computer science; Floating point; Exponent; Simple (philosophy); Algorithm; Set (abstract data type); Sign (mathematics); Point (geometry); Arithmetic; Mathematics","score_opus":0.1721135326766977,"score_gpt":0.24333264004153377,"score_spread":0.07121910736483605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152694458","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068421476,0.00054165575,0.9825867,0.00017110794,0.00028239354,0.000049860348,0.00005182007,0.002323749,0.0071506035],"genre_scores_gemma":[0.08466911,0.0004350335,0.9054051,0.00017789747,0.00017511573,0.00013982883,0.00014086947,0.0005323906,0.008324663],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998777,0.00013458147,0.0000877437,0.00013721465,0.0007630022,0.00010049873],"domain_scores_gemma":[0.998381,0.00048133245,0.00014670588,0.00049567566,0.0004117683,0.00008344234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006936636,0.0012208191,0.0009857485,0.0010201883,0.0007679361,0.0015507487,0.0017536242,0.00068528164,0.007442403],"category_scores_gemma":[0.0024217144,0.00073322584,0.0007482458,0.0012413958,0.0008344511,0.003472543,0.0018948673,0.0015211955,0.0027752405],"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.0005991676,0.00011883987,0.001010373,0.0004186871,0.00014120541,0.00046559164,0.0003401958,0.05651589,0.08231609,0.14015576,0.0151575385,0.7027607],"study_design_scores_gemma":[0.00013702655,0.0002633881,0.000539391,0.00011530883,0.000087984416,0.0006916855,0.00009409411,0.72350484,0.1306617,0.064440735,0.07932446,0.00013934339],"about_ca_topic_score_codex":0.0009218551,"about_ca_topic_score_gemma":0.0016316212,"teacher_disagreement_score":0.007442403,"about_ca_system_score_codex":0.0008424933,"about_ca_system_score_gemma":0.0011747607,"threshold_uncertainty_score":0.024897337},"labels":[],"label_agreement":null},{"id":"W2152795079","doi":"10.1093/comjnl/bxp023","title":"Verifying a Synthesized Implementation of IEEE-754 Floating-Point Exponential Function using HOL","year":2009,"lang":"en","type":"article","venue":"The Computer Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Library science; Computer science; Point (geometry); Art history; Management; History; Mathematics","score_opus":0.03781534554123004,"score_gpt":0.32767521011262674,"score_spread":0.2898598645713967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152795079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34053147,0.00013267217,0.6433953,0.00021834926,0.00013806082,0.00013914258,0.00048609503,0.0049635107,0.009995429],"genre_scores_gemma":[0.9023285,0.000052921903,0.0947872,0.000047808084,0.0000061228493,0.000045748624,0.00020500607,0.00010768048,0.0024189448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99976355,0.00004181157,0.000023390037,0.000036446207,0.00009210655,0.000042732994],"domain_scores_gemma":[0.99936515,0.00031806793,0.000056338307,0.00011252548,0.00013520813,0.000012680781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041651455,0.00023507664,0.0001838128,0.00024325117,0.00022820642,0.0004572152,0.00060852553,0.00031695652,0.0027904783],"category_scores_gemma":[0.0011846974,0.00010509092,0.00026847646,0.00014350706,0.00036349875,0.00044070103,0.00018278163,0.0003304191,0.00034535822],"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.0008890009,0.0003426255,0.0063732867,0.0010816633,0.00013215866,0.0017030315,0.0006506973,0.41760048,0.28573084,0.13103236,0.004006657,0.15045717],"study_design_scores_gemma":[0.0001855268,0.0007202758,0.0017150908,0.00005487243,0.000087219436,0.0003205521,0.00010794883,0.56070143,0.40871537,0.0116053475,0.015745701,0.000040613057],"about_ca_topic_score_codex":0.0016760885,"about_ca_topic_score_gemma":0.0017481185,"teacher_disagreement_score":0.0027904783,"about_ca_system_score_codex":0.0005454663,"about_ca_system_score_gemma":0.0009722076,"threshold_uncertainty_score":0.009335101},"labels":[],"label_agreement":null},{"id":"W2153846939","doi":"10.1109/tnn.2006.883002","title":"The Impact of Arithmetic Representation on Implementing MLP-BP on FPGAs: A Study","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":145,"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":"","keywords":"Computer science; Arithmetic; Field-programmable gate array; Representation (politics); Parallel computing; Theoretical computer science; Computer architecture; Mathematics; Computer hardware","score_opus":0.035797712668031376,"score_gpt":0.36823864259842787,"score_spread":0.3324409299303965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153846939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8887139,0.002403941,0.09577942,0.0004072961,0.00017112476,0.00014584948,0.0001313683,0.0009542675,0.0112928515],"genre_scores_gemma":[0.9555369,0.0007672006,0.04187674,0.00006603778,0.00003209416,0.000036948786,0.00009159017,0.00008812199,0.0015042828],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989611,0.0003537448,0.0000935738,0.000099346384,0.00036586323,0.00012632746],"domain_scores_gemma":[0.9939522,0.004163241,0.00054315804,0.00049421674,0.0007885625,0.000058587328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282962,0.0005764018,0.00028841555,0.00050853594,0.00028223742,0.0007696149,0.0010333182,0.0004555286,0.003657811],"category_scores_gemma":[0.007961618,0.00025962468,0.00024370363,0.0006704406,0.00023223311,0.0017801989,0.00024542937,0.00048230923,0.0004211192],"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.0026053118,0.0004700448,0.012826964,0.00218399,0.00025652564,0.001640727,0.0003560008,0.3368564,0.14051615,0.009365857,0.0026507115,0.4902714],"study_design_scores_gemma":[0.00021746219,0.0052245553,0.009726258,0.00029239917,0.00041185474,0.0018813029,0.00051889947,0.6188613,0.3465391,0.0021585592,0.014099355,0.00006893369],"about_ca_topic_score_codex":0.0016954853,"about_ca_topic_score_gemma":0.0018784532,"teacher_disagreement_score":0.003657811,"about_ca_system_score_codex":0.0005184228,"about_ca_system_score_gemma":0.0003386895,"threshold_uncertainty_score":0.012236595},"labels":[],"label_agreement":null},{"id":"W2154489416","doi":"10.1109/isspa.2001.949836","title":"An on-line CORDIC based 2-D IDCT implementation using distributed arithmetic","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Concordia University","funders":"","keywords":"CORDIC; Computer science; Very-large-scale integration; Parallel computing; Block (permutation group theory); Arithmetic; Adder; Computation; Computer hardware; CMOS; Algorithm; Embedded system; Field-programmable gate array; Mathematics; Electronic engineering","score_opus":0.1015332003149012,"score_gpt":0.38466634489817986,"score_spread":0.28313314458327865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154489416","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026407339,0.00033682972,0.9611319,0.00011638791,0.0001251094,0.00009835818,0.000085695574,0.0024407695,0.009257638],"genre_scores_gemma":[0.23113325,0.00023459148,0.762608,0.000170496,0.00006350098,0.00008107651,0.00028743228,0.0001176736,0.0053039724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984264,0.000023134713,0.000012125649,0.000024534202,0.00008103251,0.000016486054],"domain_scores_gemma":[0.99977416,0.000048248952,0.000021979342,0.000047187303,0.000093716066,0.000014797438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016802596,0.00043977943,0.00030540628,0.00051243516,0.00022405441,0.0006596448,0.0010052549,0.0003687585,0.0044085076],"category_scores_gemma":[0.00058482937,0.00016843228,0.00026077204,0.00052417524,0.00021881713,0.0005414565,0.00032076155,0.00031515976,0.0012660675],"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.00057151663,0.00012655494,0.0020408013,0.00032830393,0.000077901495,0.00057282514,0.00017447551,0.04450401,0.2294056,0.026416205,0.0076921335,0.6880897],"study_design_scores_gemma":[0.00021692821,0.0008952416,0.0016889013,0.00007209921,0.00011504217,0.0022983016,0.000064128995,0.6918371,0.24770302,0.004468181,0.05057849,0.000062642495],"about_ca_topic_score_codex":0.0013407328,"about_ca_topic_score_gemma":0.00243629,"teacher_disagreement_score":0.0044085076,"about_ca_system_score_codex":0.0005239405,"about_ca_system_score_gemma":0.00058221375,"threshold_uncertainty_score":0.014747918},"labels":[],"label_agreement":null},{"id":"W2154758172","doi":"10.1109/20.952668","title":"The use of interval mathematics in electromagnetic design","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Magnetics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Interval (graph theory); Process (computing); Computer science; Function (biology); Electromagnetism; Electromagnetics; Mathematical optimization; Applied mathematics; Mathematics; Physics; Engineering physics; Quantum mechanics","score_opus":0.07329594397173386,"score_gpt":0.2828399444887979,"score_spread":0.20954400051706404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154758172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008195057,0.0021737274,0.99086577,0.00020056372,0.0001518508,0.00001393955,0.000018058277,0.000077949466,0.0056786025],"genre_scores_gemma":[0.12825371,0.011199208,0.8549867,0.0003475774,0.0009112936,0.00028232468,0.00012664378,0.00013940225,0.0037530325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9960963,0.0018726545,0.00031896576,0.00037376143,0.0012364861,0.000101840196],"domain_scores_gemma":[0.9940924,0.004057353,0.000497695,0.00069842977,0.0005505515,0.000103548016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046162764,0.0011775907,0.0012282366,0.0017026748,0.0007087451,0.0026651893,0.0017055414,0.001114846,0.00267874],"category_scores_gemma":[0.012377476,0.00060917693,0.0013908797,0.0030620203,0.0039497097,0.0033341742,0.0019339435,0.0033587136,0.001147094],"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.000048151116,0.000025552798,0.0002441673,0.00031282593,0.00005134902,0.00009577225,0.00019675118,0.095664546,0.0015063018,0.803776,0.0023820738,0.09569637],"study_design_scores_gemma":[0.000028038352,0.00012858366,0.00012619153,0.00014872401,0.00002749895,0.00014738871,0.00003240122,0.1447842,0.0015418535,0.82177955,0.031210018,0.00004550657],"about_ca_topic_score_codex":0.00084092264,"about_ca_topic_score_gemma":0.0004792746,"teacher_disagreement_score":0.0046162764,"about_ca_system_score_codex":0.00091641844,"about_ca_system_score_gemma":0.0007191731,"threshold_uncertainty_score":0.024413466},"labels":[],"label_agreement":null},{"id":"W2157265006","doi":"10.1155/s0161171202012899","title":"On constrained uniform approximation","year":2002,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals; University of Alberta","keywords":"Mathematics; Generalization; Uniqueness; Hermite polynomials; Convergence (economics); Applied mathematics; Work (physics); Calculus (dental); Mathematical analysis","score_opus":0.04508577417861007,"score_gpt":0.3144215874656488,"score_spread":0.2693358132870387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157265006","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012960487,0.0020017591,0.9693322,0.00045696198,0.00020030643,0.0000385021,0.00009710697,0.0000864635,0.014826268],"genre_scores_gemma":[0.60671544,0.006929178,0.34578994,0.0010555385,0.0009823306,0.00041863875,0.00055996556,0.0004333913,0.037115622],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991054,0.00038429245,0.0000354555,0.00015418496,0.00023220456,0.00008838372],"domain_scores_gemma":[0.9984816,0.0009972543,0.00011630825,0.00015143293,0.00018172333,0.00007171135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017416808,0.0009241209,0.0012003536,0.0008356554,0.0006465298,0.0015680627,0.0011157953,0.0014408599,0.004678757],"category_scores_gemma":[0.008340486,0.00039193546,0.00059494615,0.00111995,0.0019740476,0.0019855506,0.0029814637,0.0014371654,0.000505065],"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.00013127913,0.000029281106,0.0003004906,0.00025504033,0.000038181202,0.00013031218,0.00010759027,0.20414023,0.0022288545,0.7506616,0.0037291227,0.038248066],"study_design_scores_gemma":[0.000014792812,0.000040656407,0.00017139135,0.000056382232,0.000014487448,0.000070066315,0.000037957063,0.7706187,0.0010373683,0.22137026,0.0065507162,0.000017286504],"about_ca_topic_score_codex":0.002616739,"about_ca_topic_score_gemma":0.0014187273,"teacher_disagreement_score":0.004678757,"about_ca_system_score_codex":0.0007971525,"about_ca_system_score_gemma":0.0006224349,"threshold_uncertainty_score":0.015652},"labels":[],"label_agreement":null},{"id":"W2159401583","doi":"10.5555/1874620.1874889","title":"Finite precision bit-width allocation using SAT-modulo theory","year":2009,"lang":"en","type":"article","venue":"Design, Automation, and Test in Europe","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Modulo; Bit (key); Context (archaeology); Computer science; Finite field; Algorithm; Division (mathematics); Arithmetic; Mathematics; Discrete mathematics","score_opus":0.032130310794171495,"score_gpt":0.2864878461000372,"score_spread":0.2543575353058657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159401583","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011731486,0.00051491515,0.98092586,0.00014985456,0.000070796144,0.0000450688,0.000044836786,0.00044899323,0.006068216],"genre_scores_gemma":[0.43896583,0.00081933575,0.5575481,0.00018939652,0.00009732382,0.00020918112,0.00017005592,0.0001898383,0.0018109222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814725,0.00071305584,0.0001214684,0.0002664908,0.00060522003,0.00014655519],"domain_scores_gemma":[0.9973015,0.0015811218,0.0002621612,0.00056928606,0.00023693664,0.000048961694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022509648,0.0008228974,0.0007771912,0.0017608226,0.00082002976,0.0024522336,0.001714809,0.0006494673,0.0034258578],"category_scores_gemma":[0.0086063035,0.00042325226,0.0006190127,0.0014985359,0.0015299224,0.0034248808,0.0015668268,0.0013881597,0.00087230647],"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.00026005929,0.00008764868,0.00065683876,0.00028486966,0.000052120744,0.0000910951,0.00019782624,0.15896268,0.021230284,0.64179975,0.0015396596,0.17483714],"study_design_scores_gemma":[0.00005451232,0.00018307264,0.0001772828,0.00015154867,0.00003639812,0.00011830625,0.00008121057,0.58122784,0.042930294,0.36558238,0.009405021,0.00005207757],"about_ca_topic_score_codex":0.00040873533,"about_ca_topic_score_gemma":0.0006185153,"teacher_disagreement_score":0.0034258578,"about_ca_system_score_codex":0.0012070024,"about_ca_system_score_gemma":0.0012128893,"threshold_uncertainty_score":0.0119044185},"labels":[],"label_agreement":null},{"id":"W2159907637","doi":"10.5555/1356802.1356904","title":"Faster projection based methods for circuit level verification","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 British Columbia","funders":"","keywords":"Computer science; Reachability; Very-large-scale integration; Flip-flop; Formal verification; Computation; Transistor; Digital electronics; Reduction (mathematics); Projection (relational algebra); Computer engineering; Electronic circuit; Functional verification; Embedded system; Computer hardware; Algorithm; Electrical engineering; Engineering","score_opus":0.23190064172941766,"score_gpt":0.39893578764126963,"score_spread":0.16703514591185198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159907637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026991481,0.000082133556,0.99406177,0.00005718408,0.000023712668,0.000045499255,0.00004962533,0.0013762269,0.0016046707],"genre_scores_gemma":[0.13996418,0.00020487577,0.8556131,0.000105172956,0.00003365026,0.00039332002,0.00030346654,0.0005586005,0.0028236413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783415,0.0007207456,0.00010479093,0.0002385755,0.0009595897,0.00014211758],"domain_scores_gemma":[0.99403375,0.0038183122,0.00021966112,0.001058972,0.00078091264,0.00008840366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017129007,0.0012463637,0.0010684518,0.00092433975,0.0007217928,0.0014891019,0.0016757717,0.0010283622,0.017427765],"category_scores_gemma":[0.0068659526,0.0008477721,0.0016239895,0.0010502727,0.0015326185,0.0024834813,0.0027948765,0.0031742211,0.0029881457],"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.000408034,0.00017767334,0.0009236011,0.00050829514,0.0001212835,0.00017630597,0.00021401687,0.5353876,0.018234367,0.19720267,0.0048461333,0.2418],"study_design_scores_gemma":[0.00005242525,0.00003348235,0.000079491496,0.000025744008,0.000012041559,0.000033347453,0.00001393843,0.92806655,0.0032819465,0.065482296,0.0029075018,0.000011269809],"about_ca_topic_score_codex":0.004106685,"about_ca_topic_score_gemma":0.0041838447,"teacher_disagreement_score":0.017427765,"about_ca_system_score_codex":0.0012620691,"about_ca_system_score_gemma":0.0017799693,"threshold_uncertainty_score":0.058301687},"labels":[],"label_agreement":null},{"id":"W2160829946","doi":"10.1109/ccece.1998.682562","title":"On the distribution of exponent differences during floating point addition","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Royal Military College of Canada; Concordia University","funders":"","keywords":"Exponent; Adder; Class (philosophy); A priori and a posteriori; Point (geometry); Distribution (mathematics); Mathematics; Probability density function; Statistical physics; Power consumption; Power (physics); Computer science; Mathematical analysis; Physics; Statistics; Artificial intelligence; Telecommunications; Quantum mechanics; Geometry","score_opus":0.032809701327877284,"score_gpt":0.23100535847261397,"score_spread":0.1981956571447367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160829946","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8005795,0.0011854515,0.19460553,0.000268287,0.000036608828,0.00003568481,0.00028920345,0.0004586863,0.0025409902],"genre_scores_gemma":[0.99311984,0.00031179984,0.005703638,0.000022514938,0.000028279326,0.000018340057,0.00015217648,0.000057239242,0.00058622763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993993,0.00009074042,0.000026251115,0.00013524268,0.0002554056,0.000093029055],"domain_scores_gemma":[0.98716635,0.008945677,0.0017082266,0.0010397999,0.00090436445,0.00023559111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014003956,0.0004791127,0.00041093436,0.0013824748,0.00041832245,0.0009229998,0.0006878682,0.0005264894,0.0018569654],"category_scores_gemma":[0.017010432,0.00036363065,0.0002211687,0.0011002693,0.0010412679,0.0020795106,0.0005199084,0.000964159,0.0003631851],"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.0027338283,0.00032350008,0.06445432,0.0004870379,0.00014069342,0.0036940924,0.0023219783,0.3854298,0.20220464,0.15763041,0.0024800752,0.17809965],"study_design_scores_gemma":[0.000044824817,0.0003691885,0.031429652,0.00006863016,0.000041951138,0.0027845732,0.00022788336,0.8593126,0.049606767,0.053138178,0.0028404542,0.00013519589],"about_ca_topic_score_codex":0.0003477502,"about_ca_topic_score_gemma":0.00020937322,"teacher_disagreement_score":0.0018569654,"about_ca_system_score_codex":0.00055711914,"about_ca_system_score_gemma":0.00026719965,"threshold_uncertainty_score":0.0074061155},"labels":[],"label_agreement":null},{"id":"W2160863424","doi":"10.1109/newcas.2008.4606371","title":"Verification of fixed-point circuits specified by Taylor Series using Arithmetic Transform","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"McGill University","funders":"","keywords":"Taylor series; Arithmetic; Saturation arithmetic; Fixed-point arithmetic; Quantization (signal processing); Algorithm; Computer science; Arbitrary-precision arithmetic; Series (stratigraphy); Electronic circuit; Implementation; Simple (philosophy); Floating point; Mathematics","score_opus":0.04589429743245357,"score_gpt":0.26922215878604594,"score_spread":0.22332786135359237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160863424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027537549,0.000083374245,0.96854657,0.000078266254,0.0000707559,0.000065639586,0.000089721405,0.0014140496,0.002114068],"genre_scores_gemma":[0.6969183,0.00033267928,0.29942554,0.00012887343,0.000082030616,0.0002953298,0.00040449342,0.0003488473,0.0020638942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946583,0.0011926811,0.0004897789,0.0006357563,0.0026547103,0.00036874073],"domain_scores_gemma":[0.99307454,0.0036781111,0.00058471126,0.0013257923,0.0012793484,0.000057511686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033805012,0.0008892243,0.0008981892,0.00091340014,0.00061039074,0.0018358906,0.0018619816,0.0010210692,0.0025941704],"category_scores_gemma":[0.015184912,0.00045544354,0.0018289683,0.00085261423,0.002119854,0.0028109644,0.0010040533,0.0015114235,0.00058844726],"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.0008942093,0.00012660162,0.0016890537,0.00071051077,0.00019206747,0.00065064203,0.00042891435,0.256923,0.09032152,0.5401268,0.0024611752,0.1054756],"study_design_scores_gemma":[0.00021962178,0.0004316665,0.0003404697,0.0000969666,0.000095063355,0.0003410179,0.000073143994,0.7139582,0.12824517,0.15083772,0.005272939,0.00008797743],"about_ca_topic_score_codex":0.0014874919,"about_ca_topic_score_gemma":0.0011532595,"teacher_disagreement_score":0.0033805012,"about_ca_system_score_codex":0.001112857,"about_ca_system_score_gemma":0.0018228958,"threshold_uncertainty_score":0.017878056},"labels":[],"label_agreement":null},{"id":"W2161442949","doi":"10.1109/mwscas.2008.4616807","title":"A mixed-signal adder based on the Continuous Valued Number System","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Windsor","funders":"","keywords":"Adder; Computer science; Binary number; Carry-save adder; Representation (politics); Signal processing; Serial binary adder; SIGNAL (programming language); Electronic engineering; Electronic circuit; Modular design; Mixed-signal integrated circuit; Digital signal processing; Arithmetic; Computer hardware; Mathematics; Integrated circuit; Electrical engineering; Engineering; Telecommunications","score_opus":0.03723561490849926,"score_gpt":0.2527806383633029,"score_spread":0.21554502345480364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161442949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03553851,0.0017735438,0.94545317,0.00038292527,0.0010362401,0.000120217075,0.0001757693,0.0010873607,0.014432202],"genre_scores_gemma":[0.264602,0.0008568578,0.7267764,0.000258288,0.00025111792,0.000121849975,0.00018121966,0.00003706202,0.006915221],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997923,0.000037440535,0.000021933172,0.00004601142,0.00008826904,0.0000140501525],"domain_scores_gemma":[0.9998079,0.000056211837,0.000024322266,0.000025665213,0.00007043514,0.000015466041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026146515,0.00036241813,0.00032898577,0.00073547015,0.00043732024,0.0008362469,0.00072021456,0.0003997234,0.0029402033],"category_scores_gemma":[0.00074358453,0.00021380231,0.00029797066,0.0006912371,0.0002867745,0.0013022504,0.00035974916,0.0004124437,0.0006303702],"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.0004734399,0.00006795172,0.00043455668,0.00059160014,0.00010371257,0.0004670443,0.00012582669,0.02362766,0.20463608,0.286704,0.0063297967,0.4764384],"study_design_scores_gemma":[0.00018311596,0.0010050787,0.0011381488,0.000118317315,0.00029537344,0.003243059,0.00006396378,0.52737254,0.23420969,0.07471194,0.15748976,0.00016904475],"about_ca_topic_score_codex":0.0002607688,"about_ca_topic_score_gemma":0.000600155,"teacher_disagreement_score":0.0029402033,"about_ca_system_score_codex":0.00031005545,"about_ca_system_score_gemma":0.00044770088,"threshold_uncertainty_score":0.0098359585},"labels":[],"label_agreement":null},{"id":"W2165108299","doi":"10.1109/aqtr.2010.5520840","title":"Challenges in verifying and optimizing fixed-point arithmetic-intensive designs","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"Datapath; Computer science; Arithmetic; Saturation arithmetic; Fixed-point arithmetic; Arbitrary-precision arithmetic; Arithmetic circuit complexity; Digital signal processing; Arithmetic logic unit; Polynomial; Implementation; Affine arithmetic; Algorithm; Floating point; Parallel computing; Computer hardware; Mathematics; Programming language","score_opus":0.1049849363005423,"score_gpt":0.31954189717801984,"score_spread":0.21455696087747755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165108299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015964078,0.002299724,0.9768232,0.0009897834,0.000076071934,0.000060308554,0.000052733652,0.0006428408,0.0030912026],"genre_scores_gemma":[0.24925914,0.0023459797,0.74643594,0.0001789804,0.00009577298,0.00017347175,0.00013362075,0.0003266863,0.0010503884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99347585,0.0025755323,0.0005398223,0.0004305201,0.0027395487,0.00023873005],"domain_scores_gemma":[0.9854284,0.0095032975,0.0008462885,0.0021052111,0.0020169187,0.000099966244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006754327,0.000855248,0.0013691474,0.0007942228,0.0006540542,0.002041758,0.0019964618,0.0010590133,0.002089147],"category_scores_gemma":[0.027789589,0.00072095863,0.00094400055,0.0012465067,0.0016862674,0.004173963,0.0008946259,0.0014013415,0.0006966607],"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.00016080585,0.00005833875,0.0011379796,0.00075705285,0.00007479493,0.00012437068,0.0001628063,0.59516513,0.014885456,0.13459444,0.0017282101,0.2511506],"study_design_scores_gemma":[0.000066156616,0.00015404086,0.00025953414,0.00014034304,0.000031455078,0.000120402576,0.00009323379,0.8381498,0.0133766355,0.13665068,0.010922529,0.00003515878],"about_ca_topic_score_codex":0.0014283798,"about_ca_topic_score_gemma":0.0016506534,"teacher_disagreement_score":0.006754327,"about_ca_system_score_codex":0.00132378,"about_ca_system_score_gemma":0.0024062248,"threshold_uncertainty_score":0.035720706},"labels":[],"label_agreement":null},{"id":"W2166069547","doi":"10.1109/acssc.2008.5074736","title":"Transcedental functions on a shift-enabled reconfigurable device: CORDIC as a case-study","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"CMC Microsystems","keywords":"CORDIC; Field-programmable gate array; Application-specific integrated circuit; Flexibility (engineering); Computer science; Embedded system; Computer hardware; Energy consumption; Reconfigurable computing; Computer architecture; Parallel computing; Electronic engineering; Electrical engineering; Engineering; Mathematics","score_opus":0.05108182027550622,"score_gpt":0.30801966143084497,"score_spread":0.25693784115533874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166069547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5928452,0.0016871127,0.34434894,0.0007285116,0.00024915548,0.00019002658,0.00013828736,0.0013429685,0.05846985],"genre_scores_gemma":[0.8339049,0.00053846405,0.15510029,0.00008089546,0.000033325552,0.000051165425,0.00005106043,0.000061466235,0.01017849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998331,0.000036568654,0.000011615625,0.000030965282,0.000060086135,0.000027662814],"domain_scores_gemma":[0.9997385,0.00009802838,0.000021614589,0.000058610047,0.000068806876,0.000014497571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001908765,0.00035283415,0.0002884736,0.00030272017,0.00031614682,0.00058260147,0.0006436132,0.00053129235,0.0026776905],"category_scores_gemma":[0.0005855137,0.000084408115,0.00021465942,0.00048597346,0.00044311836,0.00047861628,0.00030308348,0.0003832043,0.00038051428],"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.000882728,0.00023262452,0.0034715636,0.00072921807,0.00007395648,0.007020959,0.0005990701,0.37721586,0.13811736,0.16798012,0.0056776805,0.29799882],"study_design_scores_gemma":[0.000085008214,0.0008934212,0.0013115393,0.00007478782,0.000049839677,0.0031494088,0.00017987814,0.75275564,0.18746835,0.012811025,0.04116812,0.000052963976],"about_ca_topic_score_codex":0.0014444573,"about_ca_topic_score_gemma":0.0017486353,"teacher_disagreement_score":0.0026776905,"about_ca_system_score_codex":0.00047625907,"about_ca_system_score_gemma":0.00033451483,"threshold_uncertainty_score":0.008957744},"labels":[],"label_agreement":null},{"id":"W2166087899","doi":"10.1109/tc.2011.43","title":"Improved Decimal Floating-Point Logarithmic Converter Based on Selection by Rounding","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rounding; Retiming; Computer science; CORDIC; Logarithm; Parallel computing; Latency (audio); Floating point; Critical path method; Decimal; Adder; Standard cell; Field-programmable gate array; Arithmetic; Algorithm; Computer hardware; Mathematics; Integrated circuit","score_opus":0.024148604484967667,"score_gpt":0.24773158991262176,"score_spread":0.2235829854276541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166087899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08605757,0.001207613,0.8796141,0.00025816236,0.00026364485,0.00021640863,0.00023107098,0.006843822,0.025307538],"genre_scores_gemma":[0.55633855,0.00076692377,0.42962873,0.00022503168,0.00010371383,0.00009872001,0.0005054153,0.00015198044,0.0121809095],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967813,0.000033953085,0.00002921835,0.000062747895,0.00015850506,0.000037544916],"domain_scores_gemma":[0.9997869,0.000039279144,0.000017559601,0.000047796762,0.00009722719,0.000011255423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027350697,0.00038366174,0.0003927519,0.0007026547,0.00038150442,0.0010420518,0.0009160017,0.00026988977,0.004172166],"category_scores_gemma":[0.0006376137,0.00016836835,0.00027378483,0.00083379465,0.00026994434,0.0009973657,0.00036716825,0.0005236906,0.0014560255],"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.00091599557,0.00017232809,0.001865103,0.0003829071,0.000053526885,0.0006987193,0.00023220971,0.029910594,0.2187909,0.044124912,0.007123254,0.6957296],"study_design_scores_gemma":[0.00031970374,0.0012536487,0.0018734562,0.00012241252,0.00014291763,0.0038938364,0.00015072511,0.42793396,0.4765624,0.011912689,0.07569859,0.00013564841],"about_ca_topic_score_codex":0.0010109012,"about_ca_topic_score_gemma":0.0013656691,"teacher_disagreement_score":0.004172166,"about_ca_system_score_codex":0.0004161157,"about_ca_system_score_gemma":0.0007899013,"threshold_uncertainty_score":0.013957322},"labels":[],"label_agreement":null},{"id":"W2166141986","doi":"10.1109/arith.2011.17","title":"On the Fixed-Point Accuracy Analysis and Optimization of FFT Units with CORDIC Multipliers","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"McGill University","funders":"","keywords":"CORDIC; Fast Fourier transform; Twiddle factor; Split-radix FFT algorithm; Fixed-point arithmetic; Quantization (signal processing); Prime-factor FFT algorithm; Computer science; Algorithm; Floating point; LTI system theory; Arithmetic; Mathematics; Field-programmable gate array; Fourier transform; Linear system; Computer hardware; Fourier analysis; Fractional Fourier transform","score_opus":0.03535542563393678,"score_gpt":0.25269453159188754,"score_spread":0.21733910595795075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166141986","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008523698,0.0008602712,0.98566806,0.00012531989,0.000034586865,0.00001977642,0.00002118661,0.00018915448,0.0045579453],"genre_scores_gemma":[0.54977626,0.0020803902,0.44233292,0.00011905418,0.00014547135,0.00014799445,0.000116728756,0.000419313,0.004861816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.00014417038,0.00003793484,0.00007772063,0.00041786724,0.00004194001],"domain_scores_gemma":[0.99864095,0.00085431593,0.00011733626,0.0001223915,0.0002507649,0.000014205022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010457474,0.00094218133,0.00058689236,0.0005591124,0.0002806829,0.00062121276,0.0006792839,0.00044485295,0.0020443324],"category_scores_gemma":[0.0052983905,0.00028491562,0.00042529107,0.0007506011,0.0006898071,0.0011129535,0.00045989142,0.0009281539,0.0004578186],"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.000067108915,0.00001978936,0.00034402797,0.00017904262,0.000021945181,0.000056285306,0.00007414422,0.8292633,0.010399287,0.078754775,0.0009038844,0.079916336],"study_design_scores_gemma":[0.0000040020955,0.000030050976,0.00007419509,0.000017062544,0.0000059092677,0.000022348098,0.0000040834047,0.9857361,0.0038257109,0.009298697,0.0009766062,0.000005211395],"about_ca_topic_score_codex":0.0014170085,"about_ca_topic_score_gemma":0.001455424,"teacher_disagreement_score":0.0020443324,"about_ca_system_score_codex":0.00090127287,"about_ca_system_score_gemma":0.00076098024,"threshold_uncertainty_score":0.0068389177},"labels":[],"label_agreement":null},{"id":"W2167110608","doi":"10.1109/arith.2007.24","title":"Multiplication by a Constant is Sublinear","year":2007,"lang":"en","type":"article","venue":"Proceedings/Proceedings - Symposium on Computer Arithmetic","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Calgary Laboratory Services; University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sublinear function; Multiplication (music); Constant (computer programming); Integer (computer science); Conjecture; Mathematics; Scheme (mathematics); Computer science; Arithmetic; Discrete mathematics; Combinatorics; Mathematical analysis","score_opus":0.013488359848803496,"score_gpt":0.26533982185857047,"score_spread":0.251851462009767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167110608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.172139,0.0050491397,0.69768906,0.0036932584,0.0007010274,0.00010829291,0.0003332502,0.0033852432,0.116901666],"genre_scores_gemma":[0.77582395,0.00199253,0.19715661,0.0006490425,0.00036501506,0.000133302,0.00026516666,0.00055627536,0.023058087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974927,0.00039667162,0.00013760841,0.0006174626,0.0010246293,0.00033094484],"domain_scores_gemma":[0.9922925,0.004151387,0.0007891122,0.0019646585,0.0006654227,0.00013687013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012156873,0.0009019704,0.00057728647,0.0006396945,0.0008333057,0.00357994,0.0010082033,0.0005612727,0.009063195],"category_scores_gemma":[0.007998832,0.00036651705,0.0005279832,0.00092651375,0.0021002537,0.007505607,0.0015480164,0.002155653,0.0029530874],"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.0010167457,0.000094406816,0.0013707458,0.0007029103,0.000043896795,0.00027496426,0.00061258284,0.016790215,0.045626063,0.76990175,0.0061462275,0.15741941],"study_design_scores_gemma":[0.00011845492,0.00046252593,0.0008648708,0.00019929148,0.00014377704,0.0013987496,0.0002802856,0.14457922,0.1584013,0.5668255,0.12664737,0.000078761754],"about_ca_topic_score_codex":0.00058880204,"about_ca_topic_score_gemma":0.0008775916,"teacher_disagreement_score":0.009063195,"about_ca_system_score_codex":0.0015108681,"about_ca_system_score_gemma":0.0012321931,"threshold_uncertainty_score":0.030319393},"labels":[],"label_agreement":null},{"id":"W2167420410","doi":"10.1109/ccece.2013.6567806","title":"Decimal signed digit addition using stored transfer encoding","year":2013,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Decimal; Arithmetic; Computer science; Multiplication (music); Carry (investment); Division (mathematics); Carry-save adder; Encoding (memory); Transfer (computing); Numerical digit; Parallel computing; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.03344471264640212,"score_gpt":0.2664507804216076,"score_spread":0.23300606777520547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167420410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15100841,0.0013136822,0.8238714,0.00024381762,0.0005531861,0.00017300887,0.00044361118,0.0060174935,0.016375381],"genre_scores_gemma":[0.57354605,0.0007632558,0.4136998,0.00014677079,0.00012353151,0.000094541174,0.0007493598,0.00014284402,0.010733803],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971586,0.000037624726,0.00003742425,0.00003206783,0.00014870484,0.000028241118],"domain_scores_gemma":[0.9993913,0.00014056801,0.000071955095,0.00018452996,0.00019282772,0.000018726801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003098034,0.00052885705,0.0003572537,0.000875428,0.00035448078,0.0009630926,0.0008520802,0.00033178623,0.0031715143],"category_scores_gemma":[0.0011631221,0.00018714015,0.00029125978,0.0010817106,0.00032966334,0.0018450964,0.0005683697,0.0004079601,0.0012921749],"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.0007595502,0.000119761375,0.000690576,0.00041095645,0.00006819049,0.00047198756,0.00015304661,0.024919579,0.19070484,0.04012277,0.004920011,0.7366587],"study_design_scores_gemma":[0.00013262582,0.0012042765,0.00156232,0.0001603067,0.0002014493,0.002330572,0.00010609327,0.22082114,0.7026517,0.024312023,0.046403706,0.00011379889],"about_ca_topic_score_codex":0.00032174558,"about_ca_topic_score_gemma":0.000891534,"teacher_disagreement_score":0.0031715143,"about_ca_system_score_codex":0.0003217898,"about_ca_system_score_gemma":0.00053770136,"threshold_uncertainty_score":0.010609746},"labels":[],"label_agreement":null},{"id":"W2167518328","doi":"10.1109/ccece.2008.4564734","title":"A decimal-to-decimal antilogarithmic converter","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Decimal; VHDL; Computer science; Field-programmable gate array; Arithmetic; Algorithm; Mathematics; Computer hardware","score_opus":0.022116321013438633,"score_gpt":0.21675470269017671,"score_spread":0.19463838167673808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167518328","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021632258,0.0011405669,0.9445599,0.00021346274,0.00037273607,0.00022706571,0.00022502468,0.0066693695,0.024959732],"genre_scores_gemma":[0.46621078,0.0011349361,0.51171714,0.00057873543,0.00025205917,0.00023343354,0.0005432919,0.00031709453,0.019012526],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992198,0.00011377281,0.00008164902,0.00014578906,0.00038022356,0.000058780206],"domain_scores_gemma":[0.9993425,0.00014598633,0.00005806597,0.00011515244,0.0003124865,0.000025852865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046865767,0.0005943502,0.00046444606,0.0010136502,0.00045262143,0.0016767613,0.0018703636,0.0005844883,0.008305254],"category_scores_gemma":[0.0011799616,0.00029969003,0.00036415516,0.00065858883,0.00029357738,0.0011977485,0.00044678999,0.0008355643,0.004394397],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010925985,0.00033431518,0.0017094669,0.0010025406,0.00014851059,0.0009390052,0.00033625,0.035246346,0.18746848,0.057928886,0.011344538,0.702449],"study_design_scores_gemma":[0.00025106227,0.0015651258,0.001225432,0.00027722164,0.00027772613,0.004184856,0.00013911744,0.3557791,0.406151,0.015126734,0.21487552,0.0001470913],"about_ca_topic_score_codex":0.0005273507,"about_ca_topic_score_gemma":0.000616844,"teacher_disagreement_score":0.008305254,"about_ca_system_score_codex":0.0005198467,"about_ca_system_score_gemma":0.0008272002,"threshold_uncertainty_score":0.027783811},"labels":[],"label_agreement":null},{"id":"W2167718530","doi":"10.1109/ccece.2005.1557027","title":"Effective implementation of floating-point adder using pipelined LOP in FPGAs","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Field-programmable gate array; Computer science; Floating point; Parallel computing; Point (geometry); Computer architecture; Embedded system; Algorithm; Telecommunications; Mathematics; Latency (audio)","score_opus":0.012115070235764195,"score_gpt":0.3282469413671694,"score_spread":0.31613187113140523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167718530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08703478,0.0005646717,0.89927566,0.00016289693,0.00007553271,0.00010419181,0.00012570653,0.005311923,0.0073446794],"genre_scores_gemma":[0.53614813,0.0003480313,0.45921236,0.000088726854,0.000024906676,0.00009975724,0.00021547677,0.00010766001,0.0037549564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998423,0.000029313474,0.000015905998,0.000024172883,0.00005988338,0.00002851458],"domain_scores_gemma":[0.9997384,0.0000979906,0.000035879024,0.00005104868,0.00006619818,0.000010572675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027418762,0.00038549042,0.00019873201,0.00040575184,0.0002530456,0.0004373855,0.0005990866,0.00021526382,0.0031455576],"category_scores_gemma":[0.00064165273,0.00026368847,0.0002025398,0.00033762018,0.00017440111,0.00074207317,0.00021392325,0.00030470712,0.0006369062],"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.00055813894,0.000117510775,0.0018875817,0.0006196924,0.000058315698,0.0005600659,0.00022862414,0.06235424,0.34321615,0.024574542,0.0046333233,0.56119174],"study_design_scores_gemma":[0.00021881024,0.0012457472,0.0024066155,0.0001264371,0.000088770954,0.0009141088,0.000097469885,0.46049458,0.48179004,0.011068669,0.04148726,0.00006145496],"about_ca_topic_score_codex":0.000764849,"about_ca_topic_score_gemma":0.0017254625,"teacher_disagreement_score":0.0031455576,"about_ca_system_score_codex":0.0003272915,"about_ca_system_score_gemma":0.0006377195,"threshold_uncertainty_score":0.010522902},"labels":[],"label_agreement":null},{"id":"W2169100599","doi":"10.1109/cicc.2000.852612","title":"Direct digital frequency synthesis of low-jitter clocks","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Accumulator (cryptography); Jitter; Computer science; Direct digital synthesizer; Synchronization (alternating current); Clock recovery; NTSC; Digital television; Electronic engineering; Frequency divider; Clock synchronization; Clock domain crossing; Digital audio; Digital clock; Frequency synthesizer; Audio signal; Computer hardware; Phase-locked loop; Clock signal; High-definition television; Synchronous circuit; Digital signal processing; Telecommunications; Engineering; Algorithm","score_opus":0.016167481553252323,"score_gpt":0.23111847010635803,"score_spread":0.2149509885531057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169100599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04541686,0.003058071,0.92136925,0.00016139717,0.0004175951,0.00011929656,0.000075356096,0.0011190302,0.028263122],"genre_scores_gemma":[0.55884135,0.00254006,0.42340502,0.000114311486,0.00018335324,0.000118590455,0.00013979446,0.00012714796,0.014530374],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997062,0.000035998306,0.000019631947,0.000058482026,0.00015279879,0.000026822074],"domain_scores_gemma":[0.9997582,0.00007973837,0.00004507801,0.00002720309,0.0000812627,0.0000084964095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023554712,0.00044316208,0.0003200294,0.0005793424,0.00026351403,0.00063296675,0.00044828374,0.0003458381,0.0027650676],"category_scores_gemma":[0.0009775916,0.00020424521,0.00027775118,0.00041313944,0.0002458676,0.00043265868,0.0002979133,0.00032342877,0.0006684331],"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.00026136189,0.00007494187,0.00054240803,0.00086469733,0.000031857857,0.00026754919,0.00028131373,0.032633543,0.42248073,0.087152645,0.0024744102,0.4529345],"study_design_scores_gemma":[0.00018850803,0.00068642764,0.00067844737,0.00019224417,0.00008957372,0.00081154273,0.000074228,0.28546596,0.5877118,0.012656736,0.111385554,0.000059000515],"about_ca_topic_score_codex":0.0005080105,"about_ca_topic_score_gemma":0.0006562712,"teacher_disagreement_score":0.0027650676,"about_ca_system_score_codex":0.00056814385,"about_ca_system_score_gemma":0.0003761895,"threshold_uncertainty_score":0.009250045},"labels":[],"label_agreement":null},{"id":"W2170373566","doi":"10.1109/acssc.2009.5470207","title":"CORDIC instruction set extensions for matrix decompositions on Software Defined Radio processors","year":2009,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Victoria","funders":"","keywords":"CORDIC; Computer science; Software-defined radio; Singular value decomposition; Digital signal processing; Wireless; Overhead (engineering); Digital signal processor; QR decomposition; Software; Set (abstract data type); Instruction set; Matrix decomposition; Decomposition; Embedded system; Parallel computing; Computer engineering; Computer architecture; Computer hardware; Algorithm; Field-programmable gate array; Telecommunications; Operating system","score_opus":0.026346043517069335,"score_gpt":0.33021071000739033,"score_spread":0.303864666490321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170373566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03884084,0.0009867989,0.88974863,0.000254893,0.00039236358,0.00035244206,0.00059666275,0.051496044,0.017331311],"genre_scores_gemma":[0.23115692,0.00070933945,0.7510354,0.0003187466,0.00013270606,0.00086415024,0.001575394,0.0019145757,0.012292779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995109,0.000084170926,0.00008300581,0.000057033558,0.00020960225,0.000055254528],"domain_scores_gemma":[0.9986248,0.00037780165,0.00013220786,0.0003073438,0.00050602446,0.000051723644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004785919,0.001125535,0.00044403187,0.0006099621,0.00036035792,0.00077230897,0.001479013,0.0004938076,0.014165626],"category_scores_gemma":[0.003488992,0.00032056926,0.0003547619,0.00091419194,0.00036697017,0.0008010016,0.00065500464,0.0011872352,0.003394231],"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.0012994658,0.0002740909,0.002280566,0.00081321667,0.000064698004,0.00053468737,0.000351189,0.042432643,0.08824711,0.104769446,0.07711267,0.68182015],"study_design_scores_gemma":[0.00065023307,0.0009541578,0.0014198739,0.0003142571,0.000106614716,0.00070685596,0.00008018436,0.56368893,0.2101054,0.026893277,0.19496755,0.000112639165],"about_ca_topic_score_codex":0.0013513814,"about_ca_topic_score_gemma":0.002429076,"teacher_disagreement_score":0.014165626,"about_ca_system_score_codex":0.0007805203,"about_ca_system_score_gemma":0.0012321637,"threshold_uncertainty_score":0.047388792},"labels":[],"label_agreement":null},{"id":"W2171539959","doi":"10.2139/ssrn.2326121","title":"The Iterated Bootstrap","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Statistics; Econometrics","score_opus":0.03041850977332306,"score_gpt":0.2722613953100024,"score_spread":0.24184288553667932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171539959","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02489116,0.0018810427,0.91679746,0.001815824,0.00065660255,0.00007063924,0.00015675827,0.0004624652,0.053268075],"genre_scores_gemma":[0.6778209,0.0020224964,0.2640956,0.001310404,0.0022941048,0.00041411896,0.0005265673,0.000919068,0.050596725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996811,0.0019249576,0.000092915994,0.0004198027,0.00055594137,0.00019539252],"domain_scores_gemma":[0.99029386,0.0051669986,0.0005313644,0.0023715268,0.0012102113,0.00042614428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049735806,0.00083942234,0.0015913828,0.0020859246,0.0015281637,0.0026686722,0.002031828,0.0021130424,0.011048017],"category_scores_gemma":[0.03320588,0.0007059473,0.0015006526,0.0012430382,0.003400435,0.0041697947,0.0036848567,0.0032931468,0.0027960355],"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.00006096541,0.000020428648,0.0005834131,0.000067799745,0.00005093399,0.00012936741,0.0001204212,0.007849532,0.000620267,0.96381545,0.0031116048,0.023569908],"study_design_scores_gemma":[0.000023869743,0.000027071703,0.0004985266,0.00004920497,0.000027085624,0.00015869342,0.00004047305,0.12250175,0.00048164115,0.8685216,0.007644538,0.000025511383],"about_ca_topic_score_codex":0.0010281149,"about_ca_topic_score_gemma":0.0008129931,"teacher_disagreement_score":0.011048017,"about_ca_system_score_codex":0.0008329913,"about_ca_system_score_gemma":0.0009578454,"threshold_uncertainty_score":0.03695929},"labels":[],"label_agreement":null},{"id":"W2171832160","doi":"10.1109/sips.2000.886743","title":"A 2-digit DBNS filter architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"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 Windsor","funders":"","keywords":"Arithmetic; Finite impulse response; Numerical digit; Binary number; Computer science; Logarithm; Filter (signal processing); Algorithm; Multiplier (economics); Mathematics; Computer vision; Mathematical analysis","score_opus":0.030185239369253387,"score_gpt":0.24561561861796152,"score_spread":0.21543037924870814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171832160","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08047434,0.00060549885,0.8878014,0.0003683113,0.00055694603,0.00017389102,0.00034869782,0.0044296137,0.025241256],"genre_scores_gemma":[0.40557665,0.0005692967,0.5598974,0.00044876334,0.00021720334,0.00018227295,0.00052801706,0.000100126344,0.03248032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997609,0.00003209072,0.000022683294,0.00005451189,0.00010647454,0.000023455199],"domain_scores_gemma":[0.9998259,0.000033196782,0.000020063771,0.000036029334,0.00006905837,0.000015833033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023638924,0.00034812203,0.00030965137,0.0005603982,0.00042630822,0.0008423497,0.00060016505,0.000523915,0.009042907],"category_scores_gemma":[0.0006436914,0.00019622456,0.00026291527,0.0006144822,0.00024972967,0.00079455436,0.00030953242,0.00035201214,0.0030921001],"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.0008360926,0.00011941803,0.0008843704,0.00034577562,0.00007101221,0.0004473809,0.00024139418,0.025015289,0.3265593,0.08879869,0.009136389,0.54754496],"study_design_scores_gemma":[0.00025902965,0.0013368642,0.002176652,0.00017448039,0.00014369197,0.0025592765,0.000108642045,0.372138,0.40677026,0.030403612,0.18379638,0.00013317539],"about_ca_topic_score_codex":0.001219597,"about_ca_topic_score_gemma":0.002589836,"teacher_disagreement_score":0.009042907,"about_ca_system_score_codex":0.0006717027,"about_ca_system_score_gemma":0.0007129884,"threshold_uncertainty_score":0.030251563},"labels":[],"label_agreement":null},{"id":"W2171890123","doi":"10.1109/rfic.2003.1214013","title":"Piecewise continuous linear interpolation of the sine function for Direct Digital Frequency Synthesis","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Royal Military College of Canada","funders":"","keywords":"Piecewise linear function; Sine; Interpolation (computer graphics); Spurious-free dynamic range; Computer science; Algorithm; Spurious relationship; Range (aeronautics); Function (biology); Piecewise; Dynamic range; Mathematics; Telecommunications; Engineering; Mathematical analysis","score_opus":0.015009701529014565,"score_gpt":0.24662261296184798,"score_spread":0.2316129114328334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171890123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0079429075,0.0008466453,0.9871831,0.00005235998,0.000039037714,0.0000141793425,0.00002216127,0.00029511188,0.0036045515],"genre_scores_gemma":[0.30378643,0.0021686957,0.68879426,0.000051283772,0.000081943734,0.000067995185,0.00014324386,0.0000913385,0.004814741],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998281,0.00004470347,0.000008804198,0.000019963554,0.00008913115,0.000009200087],"domain_scores_gemma":[0.9997243,0.00016323169,0.0000237398,0.000039523246,0.000040783685,0.000008484172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025415735,0.00028189912,0.00023664045,0.00026419226,0.00019391136,0.00046229456,0.0003040481,0.00029565056,0.0028708528],"category_scores_gemma":[0.0015494425,0.00016683467,0.00020350672,0.0004516782,0.00026027553,0.0003324445,0.00028397675,0.0004427464,0.0008502974],"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.00023805961,0.000033877564,0.00056024763,0.0005463715,0.000027140022,0.00023297203,0.00019645436,0.1543927,0.120719336,0.11946865,0.0022012664,0.6013829],"study_design_scores_gemma":[0.000042678243,0.00033923305,0.00049017,0.00010900911,0.00004218425,0.00065888476,0.000055187524,0.84987134,0.053852413,0.034643542,0.059861172,0.000034224682],"about_ca_topic_score_codex":0.00033820118,"about_ca_topic_score_gemma":0.0006088704,"teacher_disagreement_score":0.0028708528,"about_ca_system_score_codex":0.00024903537,"about_ca_system_score_gemma":0.0002489898,"threshold_uncertainty_score":0.009603977},"labels":[],"label_agreement":null},{"id":"W2171948637","doi":"10.1109/ccece.2006.277498","title":"A Study on the Floating-Point Adder in FPGAS","year":2006,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":22,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Field-programmable gate array; Computer science; Latency (audio); Floating point; Critical path method; Parallel computing; Very-large-scale integration; Computer hardware; Embedded system; Algorithm; Engineering; Telecommunications","score_opus":0.03326623066855305,"score_gpt":0.2960138498039547,"score_spread":0.2627476191354016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171948637","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4623248,0.040616997,0.4102791,0.0012512726,0.0006058617,0.0002197165,0.00026141046,0.0009161895,0.083524585],"genre_scores_gemma":[0.7998252,0.018082522,0.15733097,0.00033733435,0.00015757864,0.00007311076,0.00026457646,0.00008940904,0.023839287],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996997,0.000052443163,0.000021416652,0.00004758003,0.00015095402,0.000027817658],"domain_scores_gemma":[0.9996037,0.00019083399,0.000028562745,0.000043051165,0.00012359192,0.000010231253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027422083,0.00031526043,0.00019073876,0.00040206435,0.00026983267,0.0006352179,0.00035369192,0.00024965324,0.0029960934],"category_scores_gemma":[0.0013913859,0.00015467175,0.00020668027,0.0007681802,0.00021675434,0.001322137,0.000097908465,0.0002518962,0.00041487455],"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.00065398536,0.00011217774,0.0038691983,0.0010621808,0.00007535165,0.0014358585,0.00035058672,0.06701889,0.13774136,0.118399754,0.004922562,0.6643581],"study_design_scores_gemma":[0.00016204768,0.0032259978,0.010619713,0.00067390886,0.00018164254,0.0064488337,0.00056658615,0.45253408,0.23370014,0.03945598,0.25232944,0.00010167838],"about_ca_topic_score_codex":0.0010146981,"about_ca_topic_score_gemma":0.0014404298,"teacher_disagreement_score":0.0029960934,"about_ca_system_score_codex":0.0003764672,"about_ca_system_score_gemma":0.00042274335,"threshold_uncertainty_score":0.010022938},"labels":[],"label_agreement":null},{"id":"W2188548788","doi":"10.1016/j.neunet.2015.10.001","title":"Constructing general partial differential equations using polynomial and neural networks","year":2015,"lang":"en","type":"article","venue":"Neural Networks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"European Regional Development Fund; National Oceanic and Atmospheric Administration","keywords":"Polynomial; Mathematics; Partial derivative; Artificial neural network; Applied mathematics; Partial differential equation; Differential equation; Variable (mathematics); Function (biology); Similarity (geometry); Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.05939473861804295,"score_gpt":0.302278272939761,"score_spread":0.24288353432171805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188548788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018736877,0.00025982023,0.9760867,0.00023524772,0.00009232469,0.000039161987,0.000054919212,0.000124675,0.0043702316],"genre_scores_gemma":[0.42574534,0.0010597586,0.5587,0.00021698422,0.0001771982,0.00022571668,0.00024215263,0.00023168701,0.01340118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968815,0.000107211694,0.000017569173,0.000053968117,0.00009869817,0.000034542063],"domain_scores_gemma":[0.99909794,0.0005630209,0.00009603236,0.00006864943,0.00012067198,0.000053718857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086087117,0.00069589994,0.0011994723,0.0010876143,0.00065733754,0.0009862201,0.0012511159,0.0014340742,0.0028742945],"category_scores_gemma":[0.004681898,0.0007015303,0.0010886021,0.0011471108,0.0016187639,0.0016353654,0.0019339095,0.0015956501,0.00047056013],"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.000039676263,0.00005269893,0.00047442023,0.00015248345,0.000037822905,0.000073968105,0.00008248993,0.78789437,0.0017281671,0.17639817,0.000975686,0.032090038],"study_design_scores_gemma":[0.000008078962,0.0000060437405,0.00004085344,0.0000053260596,0.0000040494806,0.000007785654,0.0000086149585,0.9549347,0.00020423174,0.044238318,0.0005364542,0.000005526439],"about_ca_topic_score_codex":0.0056375396,"about_ca_topic_score_gemma":0.0087651815,"teacher_disagreement_score":0.0056375396,"about_ca_system_score_codex":0.00096644025,"about_ca_system_score_gemma":0.001372385,"threshold_uncertainty_score":0.011209428},"labels":[],"label_agreement":null},{"id":"W2213705925","doi":"10.1049/iet-cta.2012.0648","title":"Improved bounds for the spectrum of interval matrices","year":2013,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Spectrum (functional analysis); Interval (graph theory); Control theory (sociology); Mathematics; Computer science; Combinatorics; Physics; Control (management); Artificial intelligence","score_opus":0.0074098188230117615,"score_gpt":0.2641158796103952,"score_spread":0.2567060607873834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213705925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017506072,0.0007433733,0.9711783,0.00012483203,0.00006779515,0.000033851036,0.00007446295,0.00022943247,0.010041906],"genre_scores_gemma":[0.7817513,0.0013312798,0.21147268,0.0001367697,0.0003056294,0.00019270575,0.00029505315,0.00019166544,0.0043230327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983766,0.0003481202,0.00009077465,0.00025189487,0.000802438,0.00013009168],"domain_scores_gemma":[0.99416995,0.0034217308,0.0005361141,0.00050362037,0.001177476,0.00019115812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001788306,0.0009875882,0.0007882508,0.0021106498,0.0005331699,0.0019154806,0.0011358628,0.00078855926,0.0056463373],"category_scores_gemma":[0.008107819,0.00034069736,0.0006781759,0.00063711684,0.0011115412,0.002554951,0.0015371346,0.002112253,0.0011103669],"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.00019959643,0.000075577576,0.0006757144,0.00030316212,0.000043274205,0.00027064828,0.00042144177,0.2130446,0.03829083,0.6621658,0.0020094188,0.08249994],"study_design_scores_gemma":[0.000014903144,0.00009531206,0.000363377,0.000095437215,0.000012891484,0.0000946761,0.0000620843,0.83808666,0.007513447,0.14931232,0.004309176,0.000039696],"about_ca_topic_score_codex":0.00070135883,"about_ca_topic_score_gemma":0.0006495404,"teacher_disagreement_score":0.0056463373,"about_ca_system_score_codex":0.00086250674,"about_ca_system_score_gemma":0.00062616647,"threshold_uncertainty_score":0.01888889},"labels":[],"label_agreement":null},{"id":"W2218028243","doi":"10.1155/2015/765898","title":"FFT Splitting for Improved FPGA-Based Acquisition of GNSS Signals","year":2015,"lang":"en","type":"article","venue":"International Journal of Navigation and Observation","topic":"Numerical Methods and Algorithms","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":"École de Technologie Supérieure","funders":"","keywords":"Fast Fourier transform; Field-programmable gate array; Computer science; GNSS applications; Reduction (mathematics); Global Positioning System; Code (set theory); Multiplier (economics); Algorithm; Computer hardware; Mathematics; Telecommunications","score_opus":0.06772072481751056,"score_gpt":0.349152864870594,"score_spread":0.2814321400530834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2218028243","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06784248,0.0003493799,0.9257674,0.00009982019,0.000090780064,0.0000925656,0.00012918566,0.0020710293,0.003557354],"genre_scores_gemma":[0.24502228,0.00017027913,0.75219125,0.000051291892,0.000036220616,0.00009114055,0.0004037241,0.00010361118,0.0019302819],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997656,0.000040885454,0.00002171907,0.00004005949,0.00010670822,0.000025152405],"domain_scores_gemma":[0.99967456,0.00012303138,0.00002711312,0.00005782957,0.00010162588,0.000015757192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002862929,0.00057090225,0.00034875917,0.0007447355,0.00024964515,0.00040458268,0.00045832206,0.00029585778,0.0035873996],"category_scores_gemma":[0.0011107574,0.00021115568,0.00024155501,0.00063816697,0.0001888945,0.0005622105,0.00040037266,0.00036982066,0.0011182192],"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.0009010248,0.000102795355,0.0016966647,0.00014922187,0.00003952267,0.00035625807,0.00019215199,0.038729914,0.18176427,0.0067097037,0.0030095188,0.766349],"study_design_scores_gemma":[0.00017793129,0.00038539708,0.003737419,0.00005067232,0.000036822064,0.00075376674,0.00009061619,0.8461871,0.1300077,0.004220761,0.014308524,0.000043291686],"about_ca_topic_score_codex":0.0019137585,"about_ca_topic_score_gemma":0.002493948,"teacher_disagreement_score":0.0035873996,"about_ca_system_score_codex":0.00024885213,"about_ca_system_score_gemma":0.00039786473,"threshold_uncertainty_score":0.012001038},"labels":[],"label_agreement":null},{"id":"W2235113569","doi":"10.1115/1.4031657","title":"Motion Analysis of Manipulators With Uncertainty in Kinematic Parameters","year":2015,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":16,"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":"Kinematics; Parametric statistics; Control theory (sociology); Interval (graph theory); Mathematics; Matrix (chemical analysis); Motion (physics); Computer science; Artificial intelligence; Classical mechanics; Physics; Statistics","score_opus":0.03715333811767787,"score_gpt":0.27444144863137027,"score_spread":0.2372881105136924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2235113569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025288658,0.0001768304,0.9736797,0.0000260341,0.0000071858913,0.000009344778,0.000012536827,0.000031924486,0.0007678153],"genre_scores_gemma":[0.85722417,0.00035151778,0.14092505,0.00002178131,0.000025454588,0.000071183444,0.00008298324,0.000023420766,0.0012744123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965096,0.00009309083,0.000020149917,0.00007274147,0.00014111027,0.000021973972],"domain_scores_gemma":[0.99959475,0.0002049449,0.00009426086,0.00004264859,0.000054590062,0.000008823894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059853384,0.0005446359,0.00056560553,0.00055522396,0.00023115202,0.00040624882,0.0005619389,0.00055480265,0.00070281205],"category_scores_gemma":[0.0018885165,0.000267337,0.0004133013,0.00041803188,0.00057598006,0.0008060191,0.00051570765,0.00042326978,0.00009253524],"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.000033439926,0.000010298057,0.00058677007,0.00008259808,0.000030421048,0.00011189299,0.000096808435,0.9321625,0.0074386643,0.021906532,0.00011252648,0.03742756],"study_design_scores_gemma":[0.0000028858108,0.000034824647,0.00023507322,0.0000070590563,0.0000046457976,0.00003683643,0.000019364028,0.9890788,0.000973561,0.009160787,0.00043853009,0.00000751083],"about_ca_topic_score_codex":0.0007288383,"about_ca_topic_score_gemma":0.0005157487,"teacher_disagreement_score":0.0007288383,"about_ca_system_score_codex":0.00024571197,"about_ca_system_score_gemma":0.0003495227,"threshold_uncertainty_score":0.0031653643},"labels":[],"label_agreement":null},{"id":"W2242362341","doi":"","title":"Numeracy CD – Whole Number Concepts and Operations Numeracy II CD – Understanding, Using, and Applying Fractions","year":2001,"lang":"en","type":"article","venue":"Society for Information Technology & Teacher Education International Conference","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Numeracy; Computer science; Mathematics; Psychology; Literacy; Pedagogy","score_opus":0.04887005566464688,"score_gpt":0.37428784084193883,"score_spread":0.325417785177292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2242362341","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012018303,0.010247502,0.45542538,0.007409459,0.00873452,0.0003022318,0.00090968184,0.0017314292,0.5032214],"genre_scores_gemma":[0.37162054,0.011097509,0.4423513,0.0041714017,0.0054264776,0.0013215838,0.002015413,0.0017594309,0.16023631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99736136,0.0006626447,0.00042733073,0.00053174683,0.00084729865,0.00016971187],"domain_scores_gemma":[0.99572104,0.0016133063,0.00034398297,0.00069366005,0.0013307892,0.00029729144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016197707,0.0014480898,0.0007529441,0.0031378726,0.0021252858,0.0077965995,0.0010702676,0.0013652685,0.026539264],"category_scores_gemma":[0.010603454,0.00034879457,0.0007699809,0.003443539,0.007384096,0.014623426,0.00380043,0.004551235,0.008150742],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004358407,0.000013809949,0.00021441685,0.00017362682,0.000004773242,0.00004420861,0.0006008256,0.00028525092,0.0008073662,0.89415854,0.016381942,0.08727154],"study_design_scores_gemma":[0.000009892027,0.00003926655,0.00043760848,0.00016688659,0.000007739848,0.00049974216,0.0003579805,0.000846066,0.0014370076,0.65062207,0.34554935,0.000026408265],"about_ca_topic_score_codex":0.0013335877,"about_ca_topic_score_gemma":0.00067740533,"teacher_disagreement_score":0.026539264,"about_ca_system_score_codex":0.002227406,"about_ca_system_score_gemma":0.0024358795,"threshold_uncertainty_score":0.08878267},"labels":[],"label_agreement":null},{"id":"W2246496525","doi":"10.1049/el.2015.0786","title":"Area and power efficient decimal carry‐free adder","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Carry (investment); Arithmetic; Decimal; Carry-save adder; Serial binary adder; Power (physics); Computer science; Mathematics; Telecommunications; Physics","score_opus":0.015553933112458208,"score_gpt":0.2419785368044795,"score_spread":0.2264246036920213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2246496525","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27229738,0.007488753,0.6494409,0.0009340712,0.00071675115,0.00018711646,0.0010902572,0.004627153,0.06321764],"genre_scores_gemma":[0.75467837,0.0013692233,0.21424457,0.00025626787,0.000094710405,0.00008300519,0.0007717347,0.000060234735,0.028441915],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99986696,0.000012472382,0.000011336259,0.000023659757,0.00006610607,0.000019378014],"domain_scores_gemma":[0.99984825,0.000028792107,0.000020916183,0.000024348265,0.00007013427,0.000007633108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000093051036,0.00033822164,0.00020744273,0.00049097626,0.00036579045,0.0005175753,0.00066088256,0.00022067009,0.0035349205],"category_scores_gemma":[0.00029573374,0.00016390688,0.00020925187,0.0005550676,0.00011261091,0.00058026094,0.00026125682,0.00022644667,0.0007910139],"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.0006238392,0.00014828486,0.0009691595,0.0006901811,0.000080460784,0.0008207704,0.00015646419,0.05103244,0.2588332,0.040328875,0.018885763,0.6274306],"study_design_scores_gemma":[0.00022508745,0.001045995,0.0039845253,0.00015596514,0.00024320009,0.0039265044,0.00011003206,0.46153057,0.36652583,0.018423872,0.14370342,0.00012494726],"about_ca_topic_score_codex":0.00072233373,"about_ca_topic_score_gemma":0.0023082164,"teacher_disagreement_score":0.0035349205,"about_ca_system_score_codex":0.00031242514,"about_ca_system_score_gemma":0.00065928214,"threshold_uncertainty_score":0.011825442},"labels":[],"label_agreement":null},{"id":"W2265220008","doi":"","title":"Efficient Evaluation of Large Polynomials","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Representation (politics); Polynomial; Field (mathematics); Base (topology); Mathematics; Degree (music); Algorithm; Computer science; Mathematical optimization; Discrete mathematics; Pure mathematics","score_opus":0.030217460948634423,"score_gpt":0.35544306765992617,"score_spread":0.32522560671129175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2265220008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046554036,0.0008773623,0.93357974,0.00055055856,0.00020071746,0.000058660302,0.00012654987,0.0019381483,0.01611425],"genre_scores_gemma":[0.58769417,0.00064486655,0.3952003,0.00016627013,0.00017219357,0.00012682973,0.00029535673,0.00080019434,0.0148997605],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987915,0.00031272075,0.000038092134,0.00011265851,0.0006046752,0.00014032549],"domain_scores_gemma":[0.99732494,0.0014971939,0.00013146043,0.00046928565,0.0004390188,0.00013794145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001082091,0.0009829426,0.0009610815,0.000784442,0.00072563026,0.001578259,0.0009895882,0.0007002799,0.0074286647],"category_scores_gemma":[0.0076807323,0.00036266976,0.00037196226,0.0011901673,0.0010375062,0.0023241995,0.0022012587,0.0015060833,0.0018494775],"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.000891386,0.00016680725,0.0013470147,0.00058375514,0.000082413506,0.00039848106,0.0004379339,0.16086301,0.0338792,0.3101925,0.022403555,0.46875396],"study_design_scores_gemma":[0.00009809284,0.00008306419,0.00043285626,0.000039337378,0.000023896442,0.00014953678,0.00008884518,0.8010696,0.018727219,0.16787948,0.011381748,0.00002635567],"about_ca_topic_score_codex":0.001125139,"about_ca_topic_score_gemma":0.0030467499,"teacher_disagreement_score":0.0074286647,"about_ca_system_score_codex":0.0009100626,"about_ca_system_score_gemma":0.0011759497,"threshold_uncertainty_score":0.024851382},"labels":[],"label_agreement":null},{"id":"W2269393291","doi":"10.1017/cbo9780511550881.035","title":"GETTING THE NUMBERS RIGHT, A CAUTIONARY TALE","year":2000,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Numerical Methods 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":"Carleton University","funders":"","keywords":"Point (geometry); Computer science; Mythology; Algorithm; History; Mathematics; Classics","score_opus":0.016546954477195796,"score_gpt":0.21075530621483157,"score_spread":0.1942083517376358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269393291","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000509531,0.047912095,0.012786395,0.7216282,0.068828195,0.000042949123,0.00014565531,0.00060818857,0.1475388],"genre_scores_gemma":[0.013132895,0.02777697,0.017783199,0.47961673,0.0399058,0.00015563933,0.0001913762,0.0017975216,0.41963992],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99431497,0.0022832977,0.00034830946,0.00063221814,0.0022218495,0.00019922847],"domain_scores_gemma":[0.9868874,0.0074396823,0.00032876545,0.0010306713,0.0035767786,0.00073666795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00538419,0.0016965573,0.0010566914,0.0014545532,0.0065427474,0.011158905,0.002899836,0.0068935673,0.018716449],"category_scores_gemma":[0.036423933,0.0007332786,0.0007954229,0.0012104661,0.012802933,0.017429136,0.004183209,0.028453598,0.025292842],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009947693,0.000006207595,0.0000376236,0.00006760452,0.000004153124,0.000059246984,0.0007467155,0.00005166298,0.00005574844,0.050446536,0.93672884,0.011785706],"study_design_scores_gemma":[0.000003258331,0.000005671115,0.00003860755,0.00012604047,0.0000018150691,0.00014844698,0.00046751378,0.00005914777,0.000052138766,0.024940472,0.9741475,0.000009421372],"about_ca_topic_score_codex":0.0045551537,"about_ca_topic_score_gemma":0.011368841,"teacher_disagreement_score":0.018716449,"about_ca_system_score_codex":0.0024271067,"about_ca_system_score_gemma":0.002399883,"threshold_uncertainty_score":0.06261277},"labels":[],"label_agreement":null},{"id":"W2272492589","doi":"","title":"Implementation and application of extended precision in Matlab","year":2009,"lang":"en","type":"article","venue":"International Conference on Mathematical Methods and Computational Techniques in Electrical Engineering","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"MATLAB; Computer science; Syntax; Arithmetic; Point (geometry); Floating point; Fixed-point arithmetic; Programming language; Algorithm; Computational science; Computer engineering; Artificial intelligence; Mathematics","score_opus":0.022702905862066067,"score_gpt":0.4067607116917569,"score_spread":0.38405780582969085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2272492589","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005511609,0.00033731846,0.9401677,0.00011995901,0.00019439023,0.000111537185,0.0011517488,0.0393083,0.0130974995],"genre_scores_gemma":[0.11234037,0.0008207025,0.85315526,0.00017433532,0.0001392491,0.0007084171,0.004654823,0.009981968,0.018024944],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9981516,0.0002861581,0.00025245754,0.00023098903,0.0008580069,0.0002206746],"domain_scores_gemma":[0.9970836,0.00053262827,0.00015560363,0.0006667772,0.0014200885,0.00014136358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013928402,0.00096941297,0.0011510196,0.001284598,0.00055352255,0.00204417,0.002825989,0.00065569667,0.033725645],"category_scores_gemma":[0.0076969946,0.0005150106,0.0008402614,0.001284502,0.0004525272,0.0012802265,0.0016543091,0.0015553938,0.01914607],"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.0011430668,0.0002168051,0.0021566143,0.0017109757,0.0002164126,0.0017384309,0.00094378047,0.12961368,0.048168667,0.07959656,0.08206794,0.652427],"study_design_scores_gemma":[0.00032817654,0.0003947549,0.0023716816,0.00054720277,0.0001222362,0.0021529417,0.0001745426,0.3829116,0.1263647,0.031154227,0.45322093,0.00025704052],"about_ca_topic_score_codex":0.0011459952,"about_ca_topic_score_gemma":0.00065910374,"teacher_disagreement_score":0.033725645,"about_ca_system_score_codex":0.00046308868,"about_ca_system_score_gemma":0.0011160222,"threshold_uncertainty_score":0.112823546},"labels":[],"label_agreement":null},{"id":"W2273070579","doi":"10.1049/iet-cdt.2015.0066","title":"Design of a novel energy efficient topology for maximum magnitude generator","year":2016,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","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":"University of Saskatchewan","funders":"","keywords":"Multiplexer; Computer science; Least significant bit; 4-bit; Comparator; Algorithm; Parallel computing; Verilog; Generator (circuit theory); Mathematics; Topology (electrical circuits); Computer hardware; Electronic engineering; CMOS; Multiplexing; Field-programmable gate array; Power (physics); Engineering; Electrical engineering; Voltage","score_opus":0.028594193466471494,"score_gpt":0.277706297829231,"score_spread":0.24911210436275952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273070579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13941374,0.0010417021,0.82555246,0.00061722635,0.00028207686,0.00019747032,0.00047510426,0.0020796494,0.03034045],"genre_scores_gemma":[0.7854127,0.00030206877,0.20317732,0.00018582198,0.000065696564,0.00012299254,0.00024435064,0.00007077351,0.010418252],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998658,0.00002358107,0.000009688603,0.0000328206,0.000052870317,0.000015277383],"domain_scores_gemma":[0.9998585,0.000029678507,0.000037128255,0.000019127268,0.000044690336,0.0000109392495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011269975,0.00024169301,0.00028829073,0.00037632853,0.00028092705,0.000582403,0.0009363055,0.00041685754,0.0036294211],"category_scores_gemma":[0.00019935127,0.0001767047,0.00019139024,0.00043643694,0.00017063784,0.0006733843,0.00024223007,0.00021551727,0.00082437607],"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.0005076373,0.0001467816,0.001584126,0.00077027787,0.000117196716,0.0009440936,0.00031809814,0.03786797,0.61764824,0.05085553,0.010052216,0.27918783],"study_design_scores_gemma":[0.00022891235,0.0023202933,0.0026870861,0.00013514064,0.00016370336,0.004797431,0.00015297603,0.4472658,0.41685274,0.013140124,0.11214833,0.00010745188],"about_ca_topic_score_codex":0.00020193256,"about_ca_topic_score_gemma":0.0005825326,"teacher_disagreement_score":0.0036294211,"about_ca_system_score_codex":0.00034537635,"about_ca_system_score_gemma":0.00028402277,"threshold_uncertainty_score":0.012141585},"labels":[],"label_agreement":null},{"id":"W227382844","doi":"10.1023/a:1009950630139","title":"Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations","year":2000,"lang":"en","type":"article","venue":"Reliable Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Hull; Correctness; Completeness (order theory); Computer science; Testbed; Java applet; Property (philosophy); Interval arithmetic; Java; Mathematics; Interval (graph theory); Algorithm; Calculus (dental); Discrete mathematics; Programming language; Combinatorics; Mathematical analysis","score_opus":0.034983481817895644,"score_gpt":0.3330606291159964,"score_spread":0.29807714729810075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W227382844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014602637,0.00018567736,0.96047467,0.0002683745,0.00006140644,0.000109949986,0.0006466364,0.016610792,0.0070398706],"genre_scores_gemma":[0.20195857,0.00041946603,0.78602695,0.00019267017,0.00006386551,0.00037414048,0.00092563924,0.0064723184,0.0035663452],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944395,0.00016406161,0.000036281155,0.00006766161,0.00022877473,0.00005925926],"domain_scores_gemma":[0.9938089,0.004878816,0.00016136953,0.0005796661,0.00033428575,0.0002369155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011353245,0.0013925638,0.0011371819,0.0015829313,0.0007706713,0.0024149467,0.0019469089,0.0012539637,0.035744857],"category_scores_gemma":[0.0097867865,0.0005713317,0.00067994307,0.0016078715,0.0008804284,0.002251226,0.0040313196,0.0017791485,0.0020999839],"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.0021180802,0.00023894722,0.0021979425,0.0019563916,0.00010905988,0.0016472035,0.0048204563,0.0775024,0.059855312,0.15081337,0.05873417,0.64000666],"study_design_scores_gemma":[0.0002918872,0.00015207846,0.0010499766,0.0003899611,0.000070801,0.00050925405,0.00055976026,0.7778536,0.0390454,0.100712754,0.07923105,0.0001334402],"about_ca_topic_score_codex":0.0026068066,"about_ca_topic_score_gemma":0.003843365,"teacher_disagreement_score":0.035744857,"about_ca_system_score_codex":0.0005227804,"about_ca_system_score_gemma":0.0007463856,"threshold_uncertainty_score":0.11957842},"labels":[],"label_agreement":null},{"id":"W2274911716","doi":"","title":"Searching for sinks of Henon map using a multiple-precision GPU arithmetic library","year":2013,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","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":"Prevention of Organ Failure","funders":"","keywords":"Computer science; Hénon map; Arithmetic; Computer graphics (images); Parallel computing; Mathematics; Artificial intelligence","score_opus":0.0320911317824659,"score_gpt":0.27697651504820126,"score_spread":0.24488538326573536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2274911716","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6479692,0.00042917702,0.32168877,0.0005333676,0.00026730765,0.0001163153,0.00073903415,0.0052776104,0.022979181],"genre_scores_gemma":[0.8164114,0.00011866677,0.17180602,0.00009900003,0.000030135714,0.000083473955,0.0013137845,0.001058884,0.009078644],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984336,0.00001866586,0.0000071898207,0.00004048332,0.000046716996,0.00004356958],"domain_scores_gemma":[0.9996246,0.00014900128,0.000033744807,0.00005855583,0.00008190059,0.000052180014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000322669,0.0007742086,0.0008510144,0.0014711428,0.0012010525,0.000854629,0.00087567006,0.00067994755,0.0076693036],"category_scores_gemma":[0.0018017782,0.00035774652,0.00050177414,0.0007178994,0.00054213044,0.0015151917,0.0014442194,0.0006441005,0.0010185709],"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.005035404,0.0007042445,0.025771435,0.00111234,0.00025831742,0.0021531298,0.0019369199,0.18120947,0.083474904,0.24556774,0.04644962,0.4063265],"study_design_scores_gemma":[0.00019149885,0.00021321375,0.0019289693,0.0000620182,0.000068068475,0.0001602921,0.00044496867,0.8566068,0.034097366,0.09620638,0.009974037,0.000046401587],"about_ca_topic_score_codex":0.0023483145,"about_ca_topic_score_gemma":0.003946942,"teacher_disagreement_score":0.0076693036,"about_ca_system_score_codex":0.00054515916,"about_ca_system_score_gemma":0.0008520952,"threshold_uncertainty_score":0.025656343},"labels":[],"label_agreement":null},{"id":"W2289344546","doi":"10.1109/tvlsi.2015.2437999","title":"Floating-Point Butterfly Architecture Based on Binary Signed-Digit Representation","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Very Large Scale Integration (VLSI) Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Arithmetic underflow; Adder; Computer science; Operand; Parallel computing; Floating point; Fast Fourier transform; Butterfly; Arithmetic; Multiplier (economics); Computer hardware; Algorithm; Mathematics; Latency (audio); Telecommunications","score_opus":0.030153833998448953,"score_gpt":0.2853131006588002,"score_spread":0.25515926666035127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289344546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11196218,0.0038964648,0.8416751,0.00039826124,0.00055834115,0.00019740796,0.00036412946,0.0045355754,0.036412604],"genre_scores_gemma":[0.5615161,0.0020103734,0.41969198,0.00034514233,0.00020712067,0.000111256326,0.000683728,0.000094295225,0.015339992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998739,0.000011106985,0.0000113521555,0.000027576174,0.00005716396,0.000018890789],"domain_scores_gemma":[0.99988675,0.000019955092,0.000013115658,0.000019266507,0.000053279444,0.0000076249185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011497239,0.00040844554,0.00027278013,0.000606649,0.00032674868,0.0005666551,0.0008130749,0.00038437961,0.0034313058],"category_scores_gemma":[0.00027692487,0.00015388693,0.0002819061,0.00071660074,0.0002397344,0.0007160068,0.00022833224,0.0003902912,0.0010995514],"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.00039859096,0.00008127204,0.0009309106,0.00050160557,0.00006824513,0.0007759963,0.00015502975,0.019694189,0.37460357,0.05631969,0.008915082,0.53755575],"study_design_scores_gemma":[0.0001551158,0.0017836038,0.0027915563,0.00017231696,0.00021424219,0.0036362861,0.00012176723,0.3527919,0.45028076,0.016192386,0.17171852,0.00014162193],"about_ca_topic_score_codex":0.0011457049,"about_ca_topic_score_gemma":0.0019099086,"teacher_disagreement_score":0.0034313058,"about_ca_system_score_codex":0.0004074492,"about_ca_system_score_gemma":0.00053362467,"threshold_uncertainty_score":0.011478901},"labels":[],"label_agreement":null},{"id":"W2292182108","doi":"10.48550/arxiv.1112.5052","title":"A method to rigorously enclose eigendecompositions of interval matrices","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","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":"Université Laval","funders":"","keywords":"Interval (graph theory); Mathematics; Nonlinear system; Argument (complex analysis); Interval arithmetic; Set (abstract data type); Contraction (grammar); Applied mathematics; Pure mathematics; Algebra over a field; Mathematical analysis; Computer science; Combinatorics; Physics; Philosophy; Quantum mechanics","score_opus":0.10441230298063876,"score_gpt":0.25264989495161183,"score_spread":0.14823759197097308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292182108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011739647,0.000017315535,0.9983152,0.000015856098,0.0000108894055,0.000010419231,0.0000072976977,0.000039321094,0.0004097692],"genre_scores_gemma":[0.06106626,0.00011045357,0.9366801,0.00007121367,0.000043747958,0.00016647084,0.000087527,0.00024447564,0.0015298143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991297,0.00029400125,0.000044842083,0.00009370176,0.00038984473,0.000047977177],"domain_scores_gemma":[0.99784124,0.0012784136,0.00017279797,0.00032787697,0.00031325227,0.0000663654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017171369,0.00067201717,0.00071626686,0.0006104259,0.0004564216,0.000903155,0.0011855961,0.000815725,0.0025979178],"category_scores_gemma":[0.005433781,0.00042914404,0.00068781344,0.0003656712,0.0013171114,0.0013284816,0.0019884678,0.0023256727,0.0012701554],"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.000100038196,0.00009057743,0.0006672922,0.00026176873,0.000051667077,0.00017558238,0.0003348801,0.3112037,0.041911975,0.5163369,0.0026810344,0.1261846],"study_design_scores_gemma":[0.000015653754,0.00006569155,0.00007894775,0.000024069528,0.000005018662,0.000082907296,0.000025940943,0.94440264,0.006547162,0.040967148,0.0077645537,0.000020452886],"about_ca_topic_score_codex":0.0005269839,"about_ca_topic_score_gemma":0.000531106,"teacher_disagreement_score":0.0025979178,"about_ca_system_score_codex":0.00028972048,"about_ca_system_score_gemma":0.0007879955,"threshold_uncertainty_score":0.009081185},"labels":[],"label_agreement":null},{"id":"W2296022720","doi":"10.48550/arxiv.cs/0703026","title":"Formal proof for delayed finite field arithmetic using floating point operators","year":2007,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Numerical Methods and Algorithms","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":"Prevention of Organ Failure","funders":"","keywords":"Mathematical proof; Rewriting; Computer science; Proof assistant; Field (mathematics); Arithmetic; Formal proof; Code (set theory); Point (geometry); Finite field; Floating point; Proof complexity; Theoretical computer science; Programming language; Mathematics; Discrete mathematics","score_opus":0.08182958631761202,"score_gpt":0.3469505712361439,"score_spread":0.2651209849185319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296022720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006204875,0.00013699762,0.98646355,0.00040772295,0.00022165684,0.00007303712,0.00021629226,0.0014015264,0.004874452],"genre_scores_gemma":[0.29796273,0.00050564436,0.6907805,0.0006498004,0.00022733521,0.0002893253,0.0006804117,0.0011871628,0.007717075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.996209,0.00091169437,0.00027670542,0.00047204844,0.0017414176,0.00038912424],"domain_scores_gemma":[0.98838556,0.0063182623,0.0006830299,0.002103495,0.0023216982,0.00018796565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005326523,0.0008850309,0.0006351873,0.0010286091,0.0010826936,0.0028322146,0.0020364502,0.0009513316,0.009308843],"category_scores_gemma":[0.01734712,0.0005673995,0.0017538128,0.0007601569,0.004281582,0.0039974656,0.0029827284,0.0034594447,0.0016443594],"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.000090719244,0.00006102381,0.00048758351,0.00040923237,0.00002848364,0.00032564474,0.00043209907,0.014445176,0.01236268,0.9252389,0.006337656,0.039780907],"study_design_scores_gemma":[0.0001434768,0.000106105785,0.00030845977,0.00022561742,0.000057871886,0.0005526565,0.00011204002,0.11202167,0.060574558,0.7456966,0.08011977,0.00008113254],"about_ca_topic_score_codex":0.0020015552,"about_ca_topic_score_gemma":0.0015644603,"teacher_disagreement_score":0.009308843,"about_ca_system_score_codex":0.002012835,"about_ca_system_score_gemma":0.0034688425,"threshold_uncertainty_score":0.031141162},"labels":[],"label_agreement":null},{"id":"W2296058057","doi":"10.1145/2812813","title":"An Enhanced Adaptive Recoding Rotation CORDIC","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"CORDIC; Computer science; Fast Fourier transform; Spurious-free dynamic range; Field-programmable gate array; Trigonometric functions; Twiddle factor; Power of two; Algorithm; Rotation (mathematics); Parallel computing; Computer hardware; Dynamic range; Fourier transform; Mathematics","score_opus":0.04924053905206561,"score_gpt":0.2963204737438354,"score_spread":0.2470799346917698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296058057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06681963,0.0022372208,0.8926191,0.00035166746,0.000615361,0.00030846495,0.00027608895,0.0069220723,0.029850444],"genre_scores_gemma":[0.40966755,0.00092170166,0.5636217,0.0003507545,0.0001740161,0.00015916253,0.00064195646,0.00026928092,0.02419392],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995982,0.000040980092,0.0000366212,0.00007855383,0.00020928957,0.00003650602],"domain_scores_gemma":[0.9994404,0.00005202879,0.0000695727,0.00009360218,0.00032203854,0.000022315673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024894302,0.0006663876,0.00032553545,0.00078425405,0.0003312458,0.0006817803,0.00079845753,0.00037136473,0.0049468284],"category_scores_gemma":[0.00082838617,0.00017073647,0.00024105208,0.00095803477,0.00025587148,0.0006855848,0.0004020494,0.00035305688,0.001689249],"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.00059364334,0.000058816164,0.0015879691,0.00039619178,0.000048727263,0.00053535117,0.00018404143,0.025623856,0.16820405,0.019120112,0.009800274,0.773847],"study_design_scores_gemma":[0.00020445658,0.0013170989,0.002212463,0.00017809855,0.00015751302,0.0035488086,0.00010784652,0.4511213,0.373766,0.0028772145,0.16439697,0.000112116235],"about_ca_topic_score_codex":0.002505573,"about_ca_topic_score_gemma":0.0030470092,"teacher_disagreement_score":0.0049468284,"about_ca_system_score_codex":0.0006380432,"about_ca_system_score_gemma":0.0010507596,"threshold_uncertainty_score":0.016548812},"labels":[],"label_agreement":null},{"id":"W2301399139","doi":"10.1145/2827700","title":"CORDIC-Based Enhanced Systolic Array Architecture for QR Decomposition","year":2015,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","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 Toronto","funders":"National University of Defense Technology","keywords":"CORDIC; QR decomposition; Systolic array; Computer science; Field-programmable gate array; Parallel computing; Speedup; Multiplexing; MIMO; Computational science; Computer hardware; Algorithm; Embedded system; Channel (broadcasting); Very-large-scale integration","score_opus":0.03008047115474734,"score_gpt":0.2969631896991813,"score_spread":0.26688271854443396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2301399139","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02267604,0.0004212985,0.9644986,0.00012389578,0.00015706349,0.00009406035,0.00010708797,0.0033310375,0.00859094],"genre_scores_gemma":[0.22278647,0.0003767834,0.7680843,0.00018013718,0.000087054344,0.0001261949,0.0003612002,0.00012442245,0.007873444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997224,0.000050876206,0.000030011723,0.00004992606,0.000116710726,0.000030034744],"domain_scores_gemma":[0.99961495,0.000049246395,0.000045709166,0.000063364256,0.00020752933,0.00001901147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026420105,0.0005163254,0.00028729803,0.00045353879,0.00025017603,0.0004980393,0.00070962275,0.00031065167,0.005883355],"category_scores_gemma":[0.0006904645,0.00018253832,0.00031517417,0.0006466959,0.00026193,0.0004983724,0.00035295324,0.00045626436,0.0021734112],"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.0006088145,0.00011396317,0.0012626242,0.00037369688,0.00006761799,0.00048170696,0.0001957,0.096513554,0.25102076,0.05357928,0.010473234,0.58530897],"study_design_scores_gemma":[0.00013467862,0.0011143661,0.0008278589,0.000065525164,0.000069346715,0.0008730834,0.00005095266,0.8059489,0.13058417,0.0068497276,0.05341696,0.00006432561],"about_ca_topic_score_codex":0.001656884,"about_ca_topic_score_gemma":0.0025292977,"teacher_disagreement_score":0.005883355,"about_ca_system_score_codex":0.0004786797,"about_ca_system_score_gemma":0.0009273465,"threshold_uncertainty_score":0.019681811},"labels":[],"label_agreement":null},{"id":"W2304461947","doi":"10.1109/icm.2015.7437978","title":"Reducing the number of embedded multipliers in squaring large size complex numbers","year":2015,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Royal Military College of Canada","funders":"","keywords":"Multiplier (economics); Partition (number theory); Arithmetic; Mathematics; Field-programmable gate array; Computer science; Discrete mathematics; Parallel computing; Algorithm; Combinatorics; Computer hardware","score_opus":0.05366920460987557,"score_gpt":0.3451073287977335,"score_spread":0.2914381241878579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304461947","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.096004345,0.00055790634,0.8939485,0.00021968792,0.00012456231,0.00007949811,0.00003237061,0.0005023467,0.0085307695],"genre_scores_gemma":[0.3444042,0.00052150246,0.6464793,0.00012624668,0.000073517156,0.00009940157,0.00007007981,0.0001687131,0.008057089],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961156,0.00009369663,0.000026756383,0.000057922847,0.00017965244,0.000030305859],"domain_scores_gemma":[0.9990497,0.0004928924,0.00010882083,0.00020059661,0.00012070794,0.000027197138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045307298,0.000807868,0.00037787954,0.00032423827,0.00034575947,0.00059079455,0.00056452514,0.0003099278,0.0061856164],"category_scores_gemma":[0.0025406724,0.00029208095,0.00034289915,0.00047339362,0.0007222346,0.0016408345,0.00086782343,0.000686349,0.0015576206],"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.0016172114,0.00023820395,0.001769893,0.0007501016,0.00010960407,0.0010747992,0.0005906866,0.13676953,0.24002124,0.091855,0.0046415217,0.52056205],"study_design_scores_gemma":[0.00023768125,0.0012970244,0.0020263698,0.00016136796,0.00010575344,0.0019850142,0.00032211683,0.695794,0.20763953,0.057858597,0.03248962,0.00008289623],"about_ca_topic_score_codex":0.00054555316,"about_ca_topic_score_gemma":0.0017280082,"teacher_disagreement_score":0.0061856164,"about_ca_system_score_codex":0.000291663,"about_ca_system_score_gemma":0.0004841065,"threshold_uncertainty_score":0.020692945},"labels":[],"label_agreement":null},{"id":"W2333744133","doi":"10.2514/6.2015-3062","title":"A Continuous Sensitivity Equation of Arbitrary High Order","year":2015,"lang":"en","type":"article","venue":"22nd AIAA Computational Fluid Dynamics Conference","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Sensitivity (control systems); Order (exchange); Computer science; Applied mathematics; Mathematics; Engineering; Electronic engineering; Business","score_opus":0.03592210093840128,"score_gpt":0.2693761547304198,"score_spread":0.23345405379201853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333744133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014601253,0.00012661934,0.9750015,0.00026420737,0.00008734897,0.000055965378,0.00011609209,0.0002444971,0.009502476],"genre_scores_gemma":[0.5724903,0.00043965166,0.40000626,0.0005026793,0.00021281264,0.00026645375,0.0002910041,0.0005660387,0.02522487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993795,0.00010049934,0.00002958208,0.00013278317,0.00029722924,0.0000603502],"domain_scores_gemma":[0.9984315,0.0008985132,0.00013067955,0.00013966995,0.00033766832,0.00006198254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012450092,0.0007315825,0.0005145045,0.0010249442,0.0005091832,0.0012598411,0.0007708259,0.001298301,0.0037944375],"category_scores_gemma":[0.005466355,0.0006008166,0.0013247398,0.00045559942,0.0014869274,0.0016114501,0.0016766861,0.0024723338,0.00054509187],"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.00004976053,0.00005945341,0.0018560976,0.00021547174,0.00004277093,0.0004598313,0.00040235536,0.6121877,0.036824115,0.30585083,0.002504861,0.039546706],"study_design_scores_gemma":[0.0000071820605,0.000017853037,0.00022923372,0.000016008793,0.000007695827,0.00007847077,0.000010838053,0.9694453,0.004276108,0.023019254,0.0028741823,0.000017891762],"about_ca_topic_score_codex":0.0043968656,"about_ca_topic_score_gemma":0.0029247287,"teacher_disagreement_score":0.0043968656,"about_ca_system_score_codex":0.0010731806,"about_ca_system_score_gemma":0.0018085876,"threshold_uncertainty_score":0.012693644},"labels":[],"label_agreement":null},{"id":"W2338924859","doi":"10.1017/mag.2016.23","title":"100.14 Optimum choice of interpolation points in Newton’s divided difference formula","year":2016,"lang":"en","type":"article","venue":"The Mathematical Gazette","topic":"Numerical Methods and 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":"York University","funders":"","keywords":"Content (measure theory); Interpolation (computer graphics); Mathematics; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Computer graphics (images)","score_opus":0.04053620404358291,"score_gpt":0.311944611900072,"score_spread":0.2714084078564891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338924859","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015087602,0.0009008565,0.9433054,0.0004401093,0.00037870838,0.00008035712,0.00017604213,0.00031320562,0.03931772],"genre_scores_gemma":[0.25169078,0.0005239173,0.73191625,0.0001455378,0.000081927414,0.0001544938,0.00026700957,0.0005756963,0.014644281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994867,0.00020654475,0.00002161038,0.000059893428,0.00019282351,0.000032515116],"domain_scores_gemma":[0.9993569,0.0003110644,0.000024838737,0.000075730786,0.00020692525,0.000024555162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011231268,0.00040603915,0.0005263198,0.0008479745,0.00042222947,0.0007109196,0.00090782606,0.0008096687,0.01211752],"category_scores_gemma":[0.0059759156,0.0002669455,0.00045167303,0.00075032894,0.00068836164,0.0009446951,0.0006705661,0.0011130765,0.003270193],"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.0004911541,0.00009569709,0.0013354385,0.00063059776,0.000042308686,0.00020517311,0.00023644419,0.08950615,0.023026804,0.49336156,0.02088931,0.37017936],"study_design_scores_gemma":[0.00007079447,0.00008789794,0.0008228523,0.00019287808,0.000029422301,0.00025389445,0.000056892663,0.8313769,0.016976435,0.117421865,0.032666363,0.00004380801],"about_ca_topic_score_codex":0.0014187024,"about_ca_topic_score_gemma":0.0016159357,"teacher_disagreement_score":0.01211752,"about_ca_system_score_codex":0.0006045402,"about_ca_system_score_gemma":0.00070394727,"threshold_uncertainty_score":0.04053718},"labels":[],"label_agreement":null},{"id":"W2341796638","doi":"10.1049/iet-cdt.2015.0058","title":"Decimal floating‐point fused multiply‐add with redundant internal encodings","year":2015,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":7,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Rounding; Adder; Arithmetic; Decimal; Critical path method; Computer science; Floating point; Square root; Binary number; Division (mathematics); Parallel computing; Multiplier (economics); Multiplication algorithm; Algorithm; Mathematics; Engineering; Latency (audio)","score_opus":0.022599201386390284,"score_gpt":0.2639737822558015,"score_spread":0.2413745808694112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2341796638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14769378,0.0022023371,0.8105761,0.00039586134,0.0005503546,0.00014133485,0.00037288305,0.005449246,0.032618184],"genre_scores_gemma":[0.57500833,0.0008261665,0.4087049,0.00021872857,0.00016064369,0.00011827152,0.00055928336,0.0001335828,0.014270032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996656,0.000036574802,0.000037515423,0.000057721998,0.00015309217,0.000049364615],"domain_scores_gemma":[0.9996327,0.000055331762,0.00006324204,0.000098796474,0.0001357452,0.000014123391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023684518,0.00065810035,0.000420926,0.00089968165,0.000433862,0.0008768343,0.00093428313,0.00035394658,0.0036720692],"category_scores_gemma":[0.00069372513,0.00028857673,0.00052039645,0.000820618,0.00029598645,0.0010119987,0.00044436977,0.00049796735,0.0016193327],"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.00074270234,0.00015676467,0.0011654012,0.00074985146,0.00011200219,0.00088516274,0.00029801807,0.030351749,0.24890445,0.0701834,0.008868823,0.6375817],"study_design_scores_gemma":[0.00014011764,0.0013635062,0.0020751648,0.0002411745,0.00029750488,0.0035246355,0.00012679126,0.28274116,0.56539655,0.019952226,0.1240022,0.00013889326],"about_ca_topic_score_codex":0.0005379376,"about_ca_topic_score_gemma":0.0011203373,"teacher_disagreement_score":0.0036720692,"about_ca_system_score_codex":0.00044911567,"about_ca_system_score_gemma":0.000626952,"threshold_uncertainty_score":0.012284279},"labels":[],"label_agreement":null},{"id":"W2353422490","doi":"","title":"A KIND OF TRIGONOMETRIC GRNERATOR ON COMPUTING DYNAMIC EQUATIONS FASTLY","year":2003,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"CAE (Canada)","funders":"","keywords":"Trigonometry; CORDIC; Computer science; Trigonometric functions; Computation; Computational science; Parallel computing; Algorithm; Throughput; Computer hardware; Field-programmable gate array; Mathematics; Operating system","score_opus":0.02732572413722066,"score_gpt":0.30398967904245555,"score_spread":0.2766639549052349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353422490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009080929,0.0013594283,0.9691328,0.00036730562,0.0006253533,0.00006846849,0.00006039495,0.0012204183,0.018084884],"genre_scores_gemma":[0.18327741,0.0033783782,0.7879793,0.00083511387,0.00071861054,0.00019777892,0.0002084297,0.0004952095,0.022909682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952495,0.000106778316,0.00003786391,0.0000909465,0.00020481298,0.00003457818],"domain_scores_gemma":[0.99941885,0.00016797589,0.000039182985,0.00017802075,0.00017420531,0.000021820559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005289982,0.00078503654,0.0005313156,0.00088644575,0.00050694484,0.0008222642,0.0007956908,0.0006571161,0.006697601],"category_scores_gemma":[0.0022429181,0.00026886375,0.0005127034,0.0015704071,0.0010858218,0.002045031,0.0007921272,0.0009501993,0.002224301],"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.00029171747,0.000052892225,0.00063099107,0.0006326746,0.0000736387,0.00033136693,0.00034744912,0.032195017,0.065404,0.56181145,0.013089135,0.32513964],"study_design_scores_gemma":[0.00020383192,0.00074110803,0.0008078205,0.00031443636,0.00017106748,0.002087432,0.0001160621,0.4201295,0.13303016,0.22542848,0.21682407,0.00014616696],"about_ca_topic_score_codex":0.00071779994,"about_ca_topic_score_gemma":0.0008933005,"teacher_disagreement_score":0.006697601,"about_ca_system_score_codex":0.00045751914,"about_ca_system_score_gemma":0.0006242638,"threshold_uncertainty_score":0.022405684},"labels":[],"label_agreement":null},{"id":"W2488658996","doi":"10.1007/978-3-319-30379-6_63","title":"Fixed Point Techniques in Analog Systems","year":2016,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Uniqueness; Fixed point; Fixed-point theorem; Mathematics; Ordinary differential equation; Partial differential equation; Applied mathematics; Mathematical analysis; Differential equation","score_opus":0.02360638829615991,"score_gpt":0.2682178212213849,"score_spread":0.24461143292522497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2488658996","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020678125,0.03974368,0.73760206,0.0010036672,0.0022030568,0.000043505774,0.0001541252,0.00056434056,0.21661775],"genre_scores_gemma":[0.15080063,0.09498132,0.387996,0.0012139208,0.0046591866,0.00033921836,0.00053555483,0.0010761555,0.35839805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997528,0.000062402454,0.000013167362,0.00003477293,0.00012489557,0.000012018543],"domain_scores_gemma":[0.9997758,0.00012943191,0.000008819653,0.000037850987,0.00004035462,0.0000076247557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040387176,0.0010312968,0.0008977323,0.0010899397,0.000443815,0.0014416855,0.0011039244,0.0011850038,0.020113911],"category_scores_gemma":[0.0010889403,0.0004244571,0.000703738,0.0016671576,0.001469466,0.0017511102,0.0009243134,0.0023364983,0.0056809327],"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.000012505494,0.000018701136,0.000041730676,0.0003940759,0.000021846583,0.00005252101,0.00011730051,0.016033646,0.001492003,0.7829102,0.022683647,0.17622179],"study_design_scores_gemma":[0.00001277351,0.00003081984,0.00013945927,0.00024744266,0.000018550852,0.0001706808,0.000036010744,0.040221978,0.0011395373,0.7543964,0.20355807,0.000028197686],"about_ca_topic_score_codex":0.0008433532,"about_ca_topic_score_gemma":0.0008890193,"teacher_disagreement_score":0.020113911,"about_ca_system_score_codex":0.00072880636,"about_ca_system_score_gemma":0.0004447974,"threshold_uncertainty_score":0.06728774},"labels":[],"label_agreement":null},{"id":"W2520705664","doi":"10.1145/2950067.2950076","title":"A fully parallel approximate CORDIC design","year":2016,"lang":"en","type":"article","venue":"International Symposium on Nanoscale Architectures","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"CORDIC; Computer science; Rotation (mathematics); Transformation (genetics); Scheme (mathematics); Algorithm; Trigonometric functions; Discrete cosine transform; Parallel computing; Arithmetic; Mathematics; Field-programmable gate array; Computer hardware; Artificial intelligence; Image (mathematics)","score_opus":0.01793891184503775,"score_gpt":0.2685308559063751,"score_spread":0.25059194406133734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520705664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022546165,0.00069224066,0.9504021,0.0001963306,0.00020669613,0.00016329551,0.00011044892,0.0012900275,0.02439276],"genre_scores_gemma":[0.4152274,0.0006632248,0.57179886,0.00022407224,0.000068612964,0.0001805392,0.00021054578,0.00011596114,0.011510748],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996511,0.000053192263,0.000024446153,0.000053814198,0.00019193414,0.000025482988],"domain_scores_gemma":[0.9996302,0.000042877713,0.000043242,0.00011268098,0.00015584356,0.000015130836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029485617,0.00043065683,0.00033887036,0.00042301646,0.00043074184,0.00080230413,0.0010162721,0.00050182774,0.0040609185],"category_scores_gemma":[0.00086289475,0.0001944963,0.00026022838,0.0005299344,0.00033210492,0.0009405939,0.00035561252,0.00049658096,0.001105949],"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.00046089722,0.00009741132,0.0014859793,0.000699993,0.00008231765,0.00037708922,0.00033670728,0.18783218,0.1563411,0.17579077,0.009275723,0.46721983],"study_design_scores_gemma":[0.00006682408,0.0009604446,0.0005809048,0.00012575017,0.00008290584,0.0010064692,0.00007200004,0.7768212,0.106960885,0.012124699,0.10114757,0.00005041617],"about_ca_topic_score_codex":0.0013497769,"about_ca_topic_score_gemma":0.0019538046,"teacher_disagreement_score":0.0040609185,"about_ca_system_score_codex":0.000912362,"about_ca_system_score_gemma":0.00080453354,"threshold_uncertainty_score":0.01358515},"labels":[],"label_agreement":null},{"id":"W2533798978","doi":"10.1109/iceec.2004.1374440","title":"ERL: an algorithm for fast evaluation of exponential, reciprocal, and logarithmic functions","year":2005,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Reciprocal; Exponential function; Logarithm; Algorithm; Computer science; Algorithm design; Mathematics; Mathematical analysis","score_opus":0.05882662110972689,"score_gpt":0.3478527906744261,"score_spread":0.2890261695646992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533798978","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012607645,0.00018345378,0.9861789,0.00013477125,0.0001074321,0.000053775173,0.00015279173,0.009279864,0.0026483145],"genre_scores_gemma":[0.029808385,0.00022510841,0.9569892,0.00025866835,0.00010813786,0.00033672558,0.0005603293,0.003996005,0.007717313],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99747294,0.0006127289,0.00016450408,0.00024359729,0.0012292337,0.00027703057],"domain_scores_gemma":[0.9958807,0.0016355461,0.00019271635,0.00091670867,0.0011844485,0.00018984222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037219897,0.0027439282,0.0016236277,0.003263487,0.001245288,0.0027797576,0.0042525493,0.0021651448,0.03068129],"category_scores_gemma":[0.013608862,0.0008799776,0.001261926,0.002390232,0.0014109295,0.005663113,0.004328295,0.0036967534,0.019002488],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008306036,0.00021290783,0.00067023793,0.00066245976,0.00007787655,0.00021946902,0.00028682812,0.03513808,0.009384501,0.09291443,0.062061742,0.79754084],"study_design_scores_gemma":[0.00052489096,0.0001644474,0.00038837985,0.0002014452,0.000066092325,0.00046826736,0.00012806432,0.7510715,0.03530566,0.12286752,0.08863284,0.00018087076],"about_ca_topic_score_codex":0.00205296,"about_ca_topic_score_gemma":0.0034300408,"teacher_disagreement_score":0.03068129,"about_ca_system_score_codex":0.001501055,"about_ca_system_score_gemma":0.002104966,"threshold_uncertainty_score":0.10263914},"labels":[],"label_agreement":null},{"id":"W2539913202","doi":"10.1109/acssc.2011.6190419","title":"Exploration of sign precomputation-based CORDIC in reconfigurable systems","year":2011,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Victoria","funders":"AUTO21 Network of Centres of Excellence","keywords":"CORDIC; Precomputation; Virtex; Field-programmable gate array; Computer science; Parallel computing; Sign (mathematics); Computer hardware; Algorithm; Mathematics; Computation","score_opus":0.09872016904157115,"score_gpt":0.2855447442718708,"score_spread":0.18682457523029966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539913202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2628788,0.005213923,0.66151386,0.00025655422,0.000115814735,0.00023432623,0.00012894746,0.0018303838,0.06782736],"genre_scores_gemma":[0.87788856,0.0019094835,0.1127579,0.00007861067,0.00004256578,0.000077086755,0.00012640844,0.0001538296,0.006965483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996742,0.00006524462,0.000024109104,0.000043843367,0.0001340773,0.0000585908],"domain_scores_gemma":[0.9993723,0.00021900919,0.000103705,0.00010839446,0.00017884474,0.000017827384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032252228,0.00059408625,0.00023938084,0.00063300744,0.00028186364,0.00077829475,0.00049711467,0.00027142826,0.0034036266],"category_scores_gemma":[0.0013513396,0.00018968829,0.0003661308,0.00079313706,0.00041905444,0.00069238927,0.00025119015,0.0003004937,0.0005626584],"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.0005773615,0.00013469736,0.003931226,0.000800234,0.000093823044,0.0007059579,0.0001794139,0.46113884,0.061475404,0.10769725,0.0019917453,0.361274],"study_design_scores_gemma":[0.000061454404,0.0011085649,0.0021631857,0.00012173067,0.00014307993,0.000906366,0.00009709882,0.87800664,0.073290266,0.017861309,0.026208863,0.000031431453],"about_ca_topic_score_codex":0.001802015,"about_ca_topic_score_gemma":0.002425257,"teacher_disagreement_score":0.0034036266,"about_ca_system_score_codex":0.0008409254,"about_ca_system_score_gemma":0.0008382989,"threshold_uncertainty_score":0.011386275},"labels":[],"label_agreement":null},{"id":"W2555658659","doi":"10.1115/1.4035221","title":"Wrench Accuracy for Parallel Manipulators and Interval Dependency","year":2016,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","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":"Wrench; Jacobian matrix and determinant; Interval (graph theory); Dependency (UML); Actuator; Set (abstract data type); Intersection (aeronautics); Torque; Control theory (sociology); Computer science; Parallel manipulator; Interval arithmetic; Mathematics; Robot; Engineering; Control (management); Artificial intelligence; Mechanical engineering; Applied mathematics","score_opus":0.029219883202387935,"score_gpt":0.28797043611305234,"score_spread":0.2587505529106644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2555658659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1311299,0.00047109867,0.86000055,0.000113767586,0.000053386822,0.000033755947,0.000069289854,0.00036696618,0.007761199],"genre_scores_gemma":[0.8265802,0.00036187228,0.17080584,0.000035112134,0.000031768213,0.000053879874,0.000083726205,0.00011753752,0.0019301088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999181,0.00010128831,0.000059413633,0.00015532096,0.0004462125,0.000056724683],"domain_scores_gemma":[0.99701476,0.001492344,0.0005501046,0.0005536688,0.00035159432,0.000037605536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012794464,0.0005151252,0.00044760888,0.000581232,0.00035284457,0.000663128,0.0007575809,0.00042227213,0.0024220056],"category_scores_gemma":[0.007841375,0.00034092806,0.0003328574,0.00067151646,0.0007833111,0.0012069811,0.00093635014,0.00084954675,0.00032107453],"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.00038950928,0.00005152009,0.0021220983,0.00030340537,0.00002946948,0.00030549587,0.0002946844,0.741598,0.0561686,0.04725171,0.00050232647,0.15098315],"study_design_scores_gemma":[0.000017485463,0.00035562395,0.0012865153,0.00004254119,0.000014855733,0.00026725675,0.000064488035,0.94465965,0.021515738,0.02821831,0.0035285144,0.000028980567],"about_ca_topic_score_codex":0.0006205746,"about_ca_topic_score_gemma":0.00041349186,"teacher_disagreement_score":0.0024220056,"about_ca_system_score_codex":0.00033364535,"about_ca_system_score_gemma":0.00041700262,"threshold_uncertainty_score":0.008102417},"labels":[],"label_agreement":null},{"id":"W2561509960","doi":"10.1016/j.amc.2016.12.024","title":"Improving CAS capabilities: New rules for computing improper integrals","year":2016,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Symbolic computation; Computation; Calculus (dental); Limit (mathematics); Laplace transform; Computer science; Mathematics; Algebra over a field; Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.026937031370197553,"score_gpt":0.28951362115763574,"score_spread":0.2625765897874382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561509960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0098307915,0.00024606692,0.9672775,0.00020654642,0.00047256946,0.0001374621,0.00019758593,0.0022938368,0.01933762],"genre_scores_gemma":[0.2175646,0.00049225026,0.7667534,0.0004919028,0.00050314143,0.00030351296,0.0006005309,0.002912894,0.0103777535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99563426,0.0007006413,0.00040095404,0.0005029539,0.002445595,0.00031559693],"domain_scores_gemma":[0.99247146,0.0020860657,0.0004382899,0.0027951363,0.0016942255,0.00051472185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036864078,0.001634811,0.001736602,0.0038851777,0.0021266877,0.006093139,0.0045220754,0.0015453427,0.009980582],"category_scores_gemma":[0.020841863,0.0008274801,0.001687843,0.0027462728,0.0033664014,0.006684557,0.00557453,0.0055752704,0.0038555872],"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.00024211113,0.00011294078,0.0016040737,0.00024433812,0.000060768736,0.00022483888,0.0002536449,0.028331324,0.0055263094,0.77712333,0.012600055,0.17367631],"study_design_scores_gemma":[0.000045952613,0.000058809997,0.00034602385,0.0000960007,0.000055061995,0.00015031602,0.000069835536,0.3407425,0.012773098,0.62421876,0.021375561,0.00006817832],"about_ca_topic_score_codex":0.0027179632,"about_ca_topic_score_gemma":0.0037681889,"teacher_disagreement_score":0.009980582,"about_ca_system_score_codex":0.00094724214,"about_ca_system_score_gemma":0.0020515244,"threshold_uncertainty_score":0.033388376},"labels":[],"label_agreement":null},{"id":"W2562314876","doi":"10.1016/j.jpdc.2016.12.013","title":"Low latency and division free Gauss–Jordan solver in floating point arithmetic","year":2016,"lang":"en","type":"article","venue":"Journal of Parallel and Distributed Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Gaussian elimination; Latency (audio); Parallel computing; Division (mathematics); Solver; Floating point; Gauss; Field-programmable gate array; Critical path method; Algorithm; Arithmetic; Gaussian; Computer hardware; Mathematics","score_opus":0.011599648206551433,"score_gpt":0.2535385210227733,"score_spread":0.24193887281622187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2562314876","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08160326,0.0009863133,0.8897858,0.0005958115,0.0003242259,0.0000722992,0.00017988689,0.0022171892,0.024235256],"genre_scores_gemma":[0.60182995,0.00044939615,0.36889243,0.00027333814,0.00017057009,0.00013561074,0.00036581373,0.00046657314,0.02741637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994203,0.00008086915,0.000027304912,0.00005419872,0.00033081052,0.00008657495],"domain_scores_gemma":[0.9993405,0.00020711492,0.00005044594,0.00013581969,0.00022019616,0.000046058536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029914195,0.00058035966,0.0006339868,0.00042159684,0.0008611645,0.0011676636,0.0012006515,0.0005631276,0.006150208],"category_scores_gemma":[0.0019328146,0.000293183,0.00029224835,0.00092057325,0.00048128623,0.0012602307,0.0011277931,0.00088961964,0.0020129594],"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.0021607194,0.0003856778,0.0031349657,0.00062553526,0.00018787447,0.0009419191,0.00064607663,0.24537653,0.09945594,0.1731052,0.025910167,0.44806942],"study_design_scores_gemma":[0.00013110589,0.00015089518,0.0003641641,0.00002585341,0.000031331172,0.000228379,0.000094216855,0.9267669,0.02395018,0.03959907,0.008624846,0.000033104407],"about_ca_topic_score_codex":0.002208704,"about_ca_topic_score_gemma":0.0036852048,"teacher_disagreement_score":0.006150208,"about_ca_system_score_codex":0.00045952687,"about_ca_system_score_gemma":0.0015658679,"threshold_uncertainty_score":0.02057451},"labels":[],"label_agreement":null},{"id":"W2567514703","doi":"10.1109/arith.1997.614878","title":"Theory and applications for a double-base number system","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Modular design; Computation; Logarithm; Arithmetic; Base (topology); Cryptography; Simple (philosophy); Modular arithmetic; Theoretical computer science; Digital signal processing; Representation (politics); Table (database); Algorithm; Mathematics; Computer hardware; Programming language; Data mining","score_opus":0.032881321108376056,"score_gpt":0.2949261330994269,"score_spread":0.26204481199105084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2567514703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0346923,0.006482824,0.80565727,0.0027888196,0.0023145836,0.00010253733,0.00020978184,0.00038691977,0.14736503],"genre_scores_gemma":[0.6808813,0.00975507,0.26580268,0.0018816907,0.004650328,0.00036711033,0.0003348105,0.00027087136,0.0360561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99942636,0.000104384766,0.00004111843,0.00010047329,0.0002567707,0.00007091874],"domain_scores_gemma":[0.99919003,0.0003324061,0.00009469878,0.0001296259,0.0001791342,0.000074145006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935986,0.0008299996,0.00079351204,0.0029382133,0.0014453558,0.0029256495,0.0007888524,0.001166068,0.0063285558],"category_scores_gemma":[0.002929075,0.00031203637,0.0006951509,0.0018220093,0.002853994,0.003783246,0.0016655663,0.0025040682,0.002567708],"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.000008034653,0.0000068029813,0.00005975224,0.00004081018,0.0000023819046,0.00007149055,0.000074449155,0.0013427131,0.0007542749,0.98898506,0.0013305899,0.007323554],"study_design_scores_gemma":[0.000004423371,0.000027349248,0.000070178656,0.000037693728,0.0000036907688,0.00027296421,0.00002798463,0.011441639,0.0006857674,0.96469915,0.022713607,0.000015466965],"about_ca_topic_score_codex":0.00032110914,"about_ca_topic_score_gemma":0.00023634708,"teacher_disagreement_score":0.0063285558,"about_ca_system_score_codex":0.0009966665,"about_ca_system_score_gemma":0.0005677279,"threshold_uncertainty_score":0.021171093},"labels":[],"label_agreement":null},{"id":"W2576532738","doi":"10.1515/udt-2016-0005","title":"On Strong Normality","year":2016,"lang":"en","type":"article","venue":"Uniform distribution theory","topic":"Numerical Methods and Algorithms","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":"Université Laval","funders":"","keywords":"Normality; Mathematics; Statistics","score_opus":0.012554835116144029,"score_gpt":0.26215723515878847,"score_spread":0.24960240004264445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2576532738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10038318,0.0010741479,0.83313775,0.002431942,0.000730175,0.00008079668,0.00033193076,0.00041750542,0.061412547],"genre_scores_gemma":[0.925043,0.00086133764,0.05439798,0.0012053234,0.0010548981,0.00020564976,0.00029617886,0.00022077964,0.016714992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9939715,0.002267983,0.00031253215,0.0009619272,0.001943692,0.00054226903],"domain_scores_gemma":[0.98119193,0.010068937,0.0011051805,0.0020163278,0.0044797417,0.0011378778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00582323,0.0006985455,0.0011318151,0.0023426565,0.0012209917,0.0031283395,0.0010194766,0.0010458286,0.004605205],"category_scores_gemma":[0.028655555,0.0003502317,0.00092279416,0.0013932833,0.007986695,0.0071765324,0.0048337914,0.0034413778,0.0010328242],"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.000041202093,0.0000123523205,0.00071289216,0.000026628342,0.000007980332,0.000058582667,0.00014429782,0.0035502564,0.0007175826,0.9852974,0.0013346074,0.008096162],"study_design_scores_gemma":[0.0000074093077,0.000025964717,0.00023227847,0.000015454993,0.0000037790708,0.00008356675,0.00006194515,0.021777423,0.0005561665,0.97369623,0.003527775,0.000012047317],"about_ca_topic_score_codex":0.00085984723,"about_ca_topic_score_gemma":0.00042714868,"teacher_disagreement_score":0.00582323,"about_ca_system_score_codex":0.0012358039,"about_ca_system_score_gemma":0.0011329672,"threshold_uncertainty_score":0.030796528},"labels":[],"label_agreement":null},{"id":"W2586442443","doi":"10.1142/s0218126617501298","title":"VLIW DSP-Based Low-Level Instruction Scheme of Givens QR Decomposition for Real-Time Processing","year":2017,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and Algorithms","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":"Royal Military College of Canada","funders":"","keywords":"Very long instruction word; Computer science; Parallel computing; Instruction-level parallelism; QR decomposition; Compiler; SIMD; Digital signal processing; Key (lock); Cache; Instruction set; Data parallelism; Parallelism (grammar); Computer hardware; Programming language","score_opus":0.035155931262750344,"score_gpt":0.31015807332598694,"score_spread":0.2750021420632366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2586442443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03195857,0.00064606033,0.94899863,0.00014649423,0.00016105086,0.00020242442,0.00025028043,0.0053859903,0.012250586],"genre_scores_gemma":[0.28069973,0.00043455485,0.70793164,0.00013323355,0.00006161817,0.00028490732,0.0010801607,0.00026509506,0.009109191],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997975,0.000029969186,0.000019063167,0.000032779448,0.000091864575,0.000028783068],"domain_scores_gemma":[0.99979633,0.00002492908,0.000021965707,0.00003843149,0.00010611539,0.000012332178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019106184,0.00045961904,0.00038005298,0.00042955,0.0002555828,0.0005270761,0.00077483593,0.00028729884,0.0067379014],"category_scores_gemma":[0.00042742645,0.00018885291,0.00029686,0.00052367285,0.00022674762,0.00043739987,0.0002849898,0.0005483253,0.001882942],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008152883,0.00020335359,0.0015814486,0.0010804863,0.00008635376,0.0003437535,0.00028262212,0.069921054,0.31472737,0.05662724,0.01686425,0.53746676],"study_design_scores_gemma":[0.00021107309,0.0009141208,0.0011580122,0.00008926485,0.00007265463,0.00047412567,0.000064335414,0.7281877,0.1676684,0.0064195194,0.094680175,0.000060678183],"about_ca_topic_score_codex":0.0012486118,"about_ca_topic_score_gemma":0.0019784367,"teacher_disagreement_score":0.0067379014,"about_ca_system_score_codex":0.00042429593,"about_ca_system_score_gemma":0.00081273867,"threshold_uncertainty_score":0.02254051},"labels":[],"label_agreement":null},{"id":"W2587600302","doi":"10.1145/3175502.3175509","title":"Blue sky ideas in artificial intelligence education from the EAAI 2017 new and future AI educator program","year":2018,"lang":"en","type":"article","venue":"AI Matters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Curriculum; Pedagogy; Psychology","score_opus":0.021680109443894677,"score_gpt":0.3422874222797634,"score_spread":0.3206073128358687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2587600302","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009448866,0.005538444,0.002346409,0.89730984,0.024080537,0.0000899914,0.00015274994,0.00013860424,0.060894515],"genre_scores_gemma":[0.19640537,0.014687696,0.014464943,0.40292412,0.016326368,0.00081467105,0.00070761546,0.0007929806,0.3528763],"study_design_codex":"not_applicable","study_design_gemma":"qualitative","domain_scores_codex":[0.9808498,0.007280347,0.0005287879,0.000811056,0.0073538013,0.0031762635],"domain_scores_gemma":[0.9701818,0.0073151975,0.0007848985,0.00068768923,0.006077982,0.01495232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03198244,0.00073630287,0.0006053887,0.0017100981,0.0068952516,0.013802789,0.0012420162,0.009806163,0.018314835],"category_scores_gemma":[0.02426438,0.0005195462,0.00064438256,0.0016183517,0.0060043694,0.01056012,0.012536924,0.022575688,0.004003216],"study_design_candidate":"qualitative","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.000077712466,0.00026364156,0.0009141928,0.00012711529,0.0000073400033,0.0001549934,0.0071269698,0.00015381273,0.00062847976,0.06255458,0.8945624,0.033428743],"study_design_scores_gemma":[0.000020053647,0.000059614744,0.0008865226,0.00021427327,0.000003964933,0.000048713893,0.0064122183,0.00017782456,0.00025155777,0.006961147,0.9849445,0.000019553903],"about_ca_topic_score_codex":0.0027202878,"about_ca_topic_score_gemma":0.007922939,"teacher_disagreement_score":0.03198244,"about_ca_system_score_codex":0.008089489,"about_ca_system_score_gemma":0.014507868,"threshold_uncertainty_score":0.1691413},"labels":[],"label_agreement":null},{"id":"W2588085343","doi":"10.18429/jacow-hiat2015-wem2i01","title":"The ISAC-II Linac Performance","year":2016,"lang":"en","type":"article","venue":"JACOW","topic":"Numerical Methods and 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":true,"ca_institutions":"TRIUMF","funders":"","keywords":"Linear particle accelerator; Computer science; Physics; Optics","score_opus":0.01158514282765951,"score_gpt":0.24476566502629413,"score_spread":0.2331805221986346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588085343","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34715754,0.0033296447,0.060412258,0.0028530934,0.0009897283,0.00036517344,0.030098995,0.032922197,0.5218714],"genre_scores_gemma":[0.8591754,0.0007466737,0.032383718,0.00053520204,0.00024723596,0.00018806799,0.035588704,0.00437578,0.066759154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981669,0.0001566267,0.000034681696,0.000261357,0.0011541024,0.00022633688],"domain_scores_gemma":[0.9981007,0.00023246268,0.00007522312,0.00020707253,0.0011473094,0.00023722355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002028474,0.00064641365,0.00064894446,0.0008108087,0.0011345954,0.0019077619,0.00084208767,0.00083024165,0.02368988],"category_scores_gemma":[0.0032201232,0.00024968825,0.00040270187,0.0011187594,0.00029904873,0.000946044,0.0008440241,0.0009727062,0.008445467],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004334202,0.00031374572,0.04146594,0.0012214975,0.0003036889,0.00033310344,0.00089755375,0.16555026,0.12679455,0.027228756,0.33463293,0.29692373],"study_design_scores_gemma":[0.00041569947,0.0025817007,0.11737992,0.00028480912,0.00025531414,0.00089465926,0.0005109534,0.23354982,0.12139139,0.0056348103,0.5166973,0.00040366777],"about_ca_topic_score_codex":0.008984231,"about_ca_topic_score_gemma":0.0061013084,"teacher_disagreement_score":0.02368988,"about_ca_system_score_codex":0.0023026592,"about_ca_system_score_gemma":0.0020132498,"threshold_uncertainty_score":0.079250515},"labels":[],"label_agreement":null},{"id":"W2590023945","doi":"10.1049/iet-cdt.2016.0100","title":"Area‐ and power‐efficient iterative single/double‐precision merged floating‐point multiplier on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Multiplier (economics); Field-programmable gate array; Digital signal processing; Computer science; Virtex; Application-specific integrated circuit; Clock rate; Computer hardware; Floating point; Double-precision floating-point format; Embedded system; Parallel computing; Algorithm; Chip; Telecommunications","score_opus":0.030274449641461147,"score_gpt":0.2961824391776271,"score_spread":0.26590798953616596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2590023945","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34699824,0.0021899028,0.61846775,0.00020354996,0.00015186345,0.00014919782,0.00019836804,0.0024295931,0.029211536],"genre_scores_gemma":[0.80481625,0.00062489137,0.1844367,0.00006716158,0.00003177927,0.000079660196,0.0001991373,0.000040180348,0.00970427],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9999021,0.000013011979,0.000006061551,0.00001915141,0.000041528085,0.00001814034],"domain_scores_gemma":[0.9999379,0.000010820378,0.000011011925,0.000009824219,0.00002702976,0.0000034277912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000083581755,0.00028933928,0.00017136423,0.0003027843,0.00023079349,0.00028770973,0.00055358955,0.00018660437,0.0023986367],"category_scores_gemma":[0.00016498221,0.000118623946,0.00016232354,0.00031599976,0.00008330334,0.00040918597,0.00013043854,0.00018768948,0.0004872706],"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.00048696197,0.0000868253,0.0015481642,0.00041243745,0.000096014315,0.0005750606,0.0001451033,0.038227364,0.5290868,0.014274304,0.0047178334,0.41034317],"study_design_scores_gemma":[0.00017858823,0.0021517521,0.0063549224,0.00011147547,0.00012496882,0.0022178798,0.00012700036,0.43396845,0.4909028,0.003663587,0.060119983,0.00007865811],"about_ca_topic_score_codex":0.0007364907,"about_ca_topic_score_gemma":0.0014142138,"teacher_disagreement_score":0.0023986367,"about_ca_system_score_codex":0.00023621216,"about_ca_system_score_gemma":0.00041367047,"threshold_uncertainty_score":0.008024275},"labels":[],"label_agreement":null},{"id":"W2597524413","doi":"10.1007/978-3-319-49742-6_7","title":"Robust Analog Arithmetic Based on the Continuous Valued Number System","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Arithmetic; Multiplication (music); Flexibility (engineering); Analogue electronics; Representation (politics); Electronic circuit; Computer science; Set (abstract data type); Analog computer; Analog signal; Mathematics; Computer hardware; Engineering; Statistics; Electrical engineering; Digital signal processing","score_opus":0.05182333295821514,"score_gpt":0.2632467167304395,"score_spread":0.21142338377222433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2597524413","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042664465,0.01007719,0.8455911,0.00083063514,0.0020160656,0.00004804753,0.000103818595,0.00052122405,0.1365455],"genre_scores_gemma":[0.31663045,0.017199429,0.5588463,0.0012267426,0.0037565345,0.00020305852,0.00034968517,0.000547532,0.101240285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992951,0.00012937684,0.000040133385,0.00012484433,0.00038413014,0.00002632308],"domain_scores_gemma":[0.99955314,0.00021813158,0.00003789153,0.00009256951,0.00008402026,0.00001427683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005936558,0.00072172785,0.00071243074,0.00094328844,0.00035379373,0.0025053893,0.0009910885,0.0007589257,0.010125765],"category_scores_gemma":[0.0023149787,0.00029315922,0.00061393046,0.0010392036,0.0020473737,0.00237519,0.0010255015,0.0026109198,0.0026280605],"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.000027870026,0.000008190421,0.000035420955,0.00016649597,0.000013030753,0.000028677268,0.000051544805,0.0084148515,0.0030203664,0.89305127,0.005719305,0.089463025],"study_design_scores_gemma":[0.000014519572,0.00007082867,0.00014528651,0.000116338,0.000017419681,0.00021495724,0.000025555215,0.05214956,0.0032822138,0.859422,0.08450803,0.00003335168],"about_ca_topic_score_codex":0.00026878735,"about_ca_topic_score_gemma":0.0002079168,"teacher_disagreement_score":0.010125765,"about_ca_system_score_codex":0.0008247426,"about_ca_system_score_gemma":0.0004398572,"threshold_uncertainty_score":0.033874035},"labels":[],"label_agreement":null},{"id":"W2607445385","doi":"10.1109/tmscs.2017.2696003","title":"Algorithm and Design of a Fully Parallel Approximate Coordinate Rotation Digital Computer (CORDIC)","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Multi-Scale Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"CORDIC; Rotation (mathematics); Computer science; Discrete cosine transform; Algorithm; Transformation (genetics); Trigonometric functions; Scheme (mathematics); Inverse; Arithmetic; Parallel computing; Mathematics; Computer hardware; Artificial intelligence; Field-programmable gate array; Image (mathematics)","score_opus":0.04612738478204215,"score_gpt":0.2917238515425709,"score_spread":0.24559646676052876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607445385","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046723606,0.00033760263,0.98707706,0.00011498769,0.00007027776,0.00012579764,0.000053588803,0.00079597137,0.006752478],"genre_scores_gemma":[0.14588495,0.0004986613,0.84717685,0.00011923043,0.00004445139,0.00022738619,0.00020993977,0.00009137775,0.005747053],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996836,0.00004019726,0.000022252047,0.000053886408,0.00017894241,0.000021088099],"domain_scores_gemma":[0.9996786,0.000037941776,0.00003230636,0.00007447792,0.00016251316,0.000014198779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033033692,0.0004427818,0.00034425093,0.0006051542,0.00045508746,0.0008344417,0.0010253242,0.00046644884,0.003991414],"category_scores_gemma":[0.0008396611,0.00021461069,0.0002306151,0.0005661635,0.0004058863,0.0007327425,0.000487534,0.000469061,0.0012018168],"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.0002594179,0.00004796781,0.0013938344,0.00053015025,0.00005176896,0.00029122888,0.00027515338,0.18783581,0.07828776,0.123531386,0.009143026,0.5983525],"study_design_scores_gemma":[0.000065053544,0.0004149452,0.00048689506,0.00008674596,0.00004855642,0.0008117495,0.00007177077,0.8544999,0.05500809,0.00945047,0.079015344,0.00004047565],"about_ca_topic_score_codex":0.0019442857,"about_ca_topic_score_gemma":0.0023792586,"teacher_disagreement_score":0.003991414,"about_ca_system_score_codex":0.00074696663,"about_ca_system_score_gemma":0.0011162694,"threshold_uncertainty_score":0.0133526325},"labels":[],"label_agreement":null},{"id":"W2608075123","doi":"10.1515/msr-2017-0008","title":"Field Programmable Gate Array (FPGA) Respiratory Monitoring System Using a Flow Microsensor and an Accelerometer","year":2017,"lang":"en","type":"article","venue":"Measurement Science Review","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Accelerometer; Field-programmable gate array; Respiratory monitoring; Inertial measurement unit; Tilt sensor; Wearable computer; Microelectromechanical systems; CORDIC; Tilt (camera); Computer science; Rotation (mathematics); Engineering; Sigmoid function; Computer hardware; Embedded system; Artificial neural network; Electronic engineering; Computer vision; Materials science; Artificial intelligence; Mechanical engineering; Respiratory system","score_opus":0.23949843646242508,"score_gpt":0.4042629836665343,"score_spread":0.1647645472041092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608075123","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13372186,0.0032291869,0.8299794,0.00043083506,0.00060485414,0.00028384922,0.00041790752,0.007167913,0.024164086],"genre_scores_gemma":[0.83635205,0.0007381508,0.15285707,0.0001668053,0.00007937837,0.00013311236,0.00017405124,0.000036911904,0.009462456],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998062,0.00003075626,0.000014796417,0.000046672736,0.0000850506,0.000016430156],"domain_scores_gemma":[0.99983776,0.000035617,0.000023447676,0.000021156278,0.000073446136,0.0000085699885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018466233,0.00029834363,0.0002589483,0.00038240617,0.00015231177,0.0002688376,0.0005095005,0.00028248268,0.002561263],"category_scores_gemma":[0.00028525293,0.00010849228,0.00012206932,0.00030595213,0.00009077348,0.0002318725,0.00013177407,0.0001555632,0.0006072445],"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.0007031591,0.0001669939,0.0054116733,0.0008287736,0.00011581634,0.00061955233,0.00012622646,0.043371264,0.23395891,0.0070601515,0.010831069,0.69680643],"study_design_scores_gemma":[0.00026041243,0.0017338814,0.014484539,0.00019972086,0.00022065957,0.0029709067,0.00006785676,0.5910383,0.3012284,0.0026868458,0.085003436,0.00010507985],"about_ca_topic_score_codex":0.00085265964,"about_ca_topic_score_gemma":0.0010227101,"teacher_disagreement_score":0.002561263,"about_ca_system_score_codex":0.00021694042,"about_ca_system_score_gemma":0.00024446577,"threshold_uncertainty_score":0.008568287},"labels":[],"label_agreement":null},{"id":"W2623814935","doi":"","title":"Accounting for tolerances in the design parameters of the 3-RRR","year":2016,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","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 New Brunswick","funders":"","keywords":"Accounting; Computer science; Business","score_opus":0.034104931882048724,"score_gpt":0.26791538012572585,"score_spread":0.23381044824367714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2623814935","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044286147,0.0004463642,0.93544036,0.0003074767,0.00022048321,0.000051570325,0.00011834638,0.0015647361,0.017564587],"genre_scores_gemma":[0.7505573,0.00031699392,0.23527825,0.00026070487,0.00006391114,0.00010607127,0.0001182593,0.0013485173,0.011950107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887747,0.00026939818,0.00007367366,0.0001873036,0.00048313168,0.00010896894],"domain_scores_gemma":[0.99786913,0.00057561835,0.00035723357,0.00081995653,0.00032237387,0.00005563604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001381762,0.001161728,0.00079248054,0.0006067233,0.00040102986,0.0016088455,0.001464905,0.0016556612,0.007815704],"category_scores_gemma":[0.0048634466,0.00046253213,0.0006745077,0.0006950138,0.00059247017,0.0012081267,0.0010354345,0.0011931685,0.0023618112],"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.00028450263,0.0001134612,0.0014716231,0.0004072897,0.00004800151,0.0002586159,0.0002540159,0.7509499,0.08221871,0.039660398,0.002216403,0.12211709],"study_design_scores_gemma":[0.000024672054,0.0001463554,0.00084379787,0.00005179473,0.00004364341,0.0001892902,0.000056062236,0.93369603,0.042929914,0.009236827,0.012728047,0.00005363503],"about_ca_topic_score_codex":0.0010885634,"about_ca_topic_score_gemma":0.001390938,"teacher_disagreement_score":0.007815704,"about_ca_system_score_codex":0.0006361109,"about_ca_system_score_gemma":0.0008495569,"threshold_uncertainty_score":0.026146054},"labels":[],"label_agreement":null},{"id":"W266245875","doi":"","title":"Optimization of algorithms with the opal framework","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Polytechnique Montréal","funders":"","keywords":"Generality; Computer science; Task (project management); Simple (philosophy); Session (web analytics); Domain (mathematical analysis); Base (topology); Algorithm; Theoretical computer science; Mathematics; Systems engineering; Engineering","score_opus":0.01826293320742537,"score_gpt":0.27850780085308025,"score_spread":0.26024486764565485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W266245875","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009519996,0.00032475262,0.9933115,0.00017718805,0.000036437414,0.00003548198,0.000045906578,0.00057842117,0.004538355],"genre_scores_gemma":[0.10679657,0.0008613836,0.8838564,0.00031350012,0.00025389076,0.0005021372,0.00031102216,0.00078404817,0.006320999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957308,0.001735551,0.0002155131,0.00048993586,0.0014945528,0.0003336217],"domain_scores_gemma":[0.9971054,0.0019474517,0.00019062463,0.0004171397,0.0002620239,0.00007732857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003539016,0.0016334972,0.0013827255,0.0012089389,0.00071083324,0.0030688038,0.002227989,0.0014753831,0.005355297],"category_scores_gemma":[0.009107029,0.000755753,0.0019481528,0.0012430548,0.00247375,0.0031317095,0.0041068,0.003238562,0.0017714292],"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.00009877516,0.00005088982,0.00029882492,0.0003262247,0.00006836829,0.000084622254,0.00010292681,0.45285296,0.00091754814,0.4550785,0.004896711,0.085223645],"study_design_scores_gemma":[0.000030348261,0.000035193454,0.000056272784,0.000034545814,0.000016112368,0.0000299699,0.000021781996,0.78000474,0.0006288132,0.20612116,0.013008399,0.000012654997],"about_ca_topic_score_codex":0.0026288219,"about_ca_topic_score_gemma":0.0029611995,"teacher_disagreement_score":0.005355297,"about_ca_system_score_codex":0.0017237024,"about_ca_system_score_gemma":0.0020843917,"threshold_uncertainty_score":0.018716276},"labels":[],"label_agreement":null},{"id":"W2713952360","doi":"10.1109/ccece.2017.7946811","title":"A software tool for generating optimized multipartite table parameters","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"CMC Microsystems","keywords":"Multipartite; Rounding; Table (database); Computer science; Software; Algorithm; Coding (social sciences); Generator (circuit theory); Theoretical computer science; Mathematics; Data mining; Power (physics); Programming language; Statistics","score_opus":0.05067381196039145,"score_gpt":0.3244771661584488,"score_spread":0.27380335419805735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2713952360","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004486115,0.00015290307,0.86616546,0.00010016141,0.00012031686,0.0002024841,0.002888873,0.11942932,0.006454328],"genre_scores_gemma":[0.09337008,0.00042987807,0.8388419,0.00026887207,0.00006415181,0.0016014538,0.010278194,0.041907575,0.013237875],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991499,0.00012585131,0.00008730777,0.000108441476,0.0004461297,0.000082318256],"domain_scores_gemma":[0.9973719,0.0014655235,0.00017327763,0.00038726404,0.00052923785,0.00007279398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015981353,0.001656309,0.001106644,0.0016018684,0.00080736354,0.0014838016,0.0029637276,0.0012538048,0.055574346],"category_scores_gemma":[0.0061308267,0.0012126201,0.00091214816,0.001775772,0.00047194437,0.0016641747,0.001336292,0.0019280564,0.014896152],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086461817,0.00037579317,0.0033516432,0.0017495056,0.00029332633,0.0007188398,0.00053910597,0.12308893,0.039172497,0.042632308,0.22012594,0.5670876],"study_design_scores_gemma":[0.0005258149,0.00025723095,0.0013637468,0.00023990298,0.00008505968,0.00066199293,0.00013824058,0.70221615,0.082034536,0.032245673,0.1799883,0.00024333708],"about_ca_topic_score_codex":0.0014533873,"about_ca_topic_score_gemma":0.0022575036,"teacher_disagreement_score":0.055574346,"about_ca_system_score_codex":0.00072280335,"about_ca_system_score_gemma":0.001766902,"threshold_uncertainty_score":0.1859147},"labels":[],"label_agreement":null},{"id":"W2727803506","doi":"","title":"A Load-balancing Tool for Structured Multi-block CFD Applications Applied to a Parallel Newton-Krylov Algorithm","year":2012,"lang":"en","type":"article","venue":"TSpace","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Toronto; Mitacs; Canada Research Chairs","keywords":"Computational fluid dynamics; Computer science; Block (permutation group theory); Parallel computing; Computational science; CFD-DEM; Load balancing (electrical power); Algorithm; Mathematics; Mechanics; Physics; Geometry","score_opus":0.027742068052757547,"score_gpt":0.3459688790231117,"score_spread":0.31822681097035416,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2727803506","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064106937,0.000077928664,0.9796975,0.0000630249,0.00004978401,0.000090436086,0.00014827593,0.01012855,0.0033337802],"genre_scores_gemma":[0.095347926,0.00015445302,0.89505476,0.000084243606,0.000030622192,0.00039022375,0.0007531615,0.0027169504,0.005467648],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994832,0.000096774966,0.000030654333,0.000051163526,0.00029648884,0.00004169967],"domain_scores_gemma":[0.9992673,0.00031574667,0.000044266704,0.00013289682,0.00019936942,0.00004033063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006966037,0.0007773704,0.00063124916,0.00074119325,0.0008305147,0.00076544215,0.0016760892,0.0008306741,0.011459141],"category_scores_gemma":[0.0024835025,0.00042872777,0.00048050354,0.00080032914,0.0003917257,0.0009002944,0.0010663052,0.001131211,0.0025089406],"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.0003518503,0.00025128876,0.0012862959,0.00043250434,0.00006135989,0.00055850326,0.00043586825,0.33542526,0.06624761,0.040246267,0.03310107,0.52160215],"study_design_scores_gemma":[0.00008381751,0.000041829197,0.0002569737,0.000029485549,0.000008344412,0.000088539484,0.000020587038,0.9464451,0.019244084,0.004692052,0.029059133,0.00003014117],"about_ca_topic_score_codex":0.0021684244,"about_ca_topic_score_gemma":0.00209218,"teacher_disagreement_score":0.011459141,"about_ca_system_score_codex":0.0004245166,"about_ca_system_score_gemma":0.0013195518,"threshold_uncertainty_score":0.038334668},"labels":[],"label_agreement":null},{"id":"W2737864593","doi":"10.1145/3061665","title":"Algorithm 978","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Mathematical Software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Arithmetic underflow; Computer science; Norm (philosophy); Scaling; Parallel computing; Algorithm; Range (aeronautics); Software; Test suite; Suite; Test case; Mathematics; Programming language","score_opus":0.03807129413798471,"score_gpt":0.3171835573263141,"score_spread":0.2791122631883294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737864593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004798553,0.0012061684,0.86924934,0.0016221997,0.0011897067,0.0012183549,0.010703614,0.020714564,0.08929761],"genre_scores_gemma":[0.07221108,0.0011815892,0.7598082,0.0017122399,0.00038860008,0.0020240708,0.035780866,0.009061577,0.11783187],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99833256,0.00024145743,0.00013753473,0.00054843124,0.0005172421,0.00022278492],"domain_scores_gemma":[0.99837446,0.00030260545,0.000061648054,0.0004909828,0.0006813215,0.0000888579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010280639,0.0017521441,0.0012691788,0.0015358976,0.0016352462,0.0038519166,0.003375175,0.0018043461,0.17205171],"category_scores_gemma":[0.0057061235,0.00060482725,0.0013091548,0.0015849513,0.0007618444,0.0025690333,0.0037864917,0.002268141,0.10230808],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005728486,0.00019541963,0.0018262477,0.0009443363,0.00012659564,0.00028568655,0.00021733336,0.030354818,0.0052865953,0.14662598,0.294489,0.5190751],"study_design_scores_gemma":[0.00034877696,0.0001456059,0.0005729266,0.00025425307,0.00006157092,0.00068826246,0.00023736087,0.17451191,0.007820411,0.2797863,0.53548115,0.00009155485],"about_ca_topic_score_codex":0.0021030637,"about_ca_topic_score_gemma":0.0028312707,"teacher_disagreement_score":0.17205171,"about_ca_system_score_codex":0.0012062553,"about_ca_system_score_gemma":0.0027218873,"threshold_uncertainty_score":0.57557034},"labels":[],"label_agreement":null},{"id":"W2741584520","doi":"10.1145/3129173.3129176","title":"2017 Kleene award","year":2017,"lang":"en","type":"article","venue":"ACM SIGLOG News","topic":"Numerical Methods and 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":"McGill University","funders":"","keywords":"Constructive; Presentation (obstetrics); Completeness (order theory); Computer science; Kleene's recursion theorem; Kleene algebra; Calculus (dental); Mathematics; Programming language; Discrete mathematics; Algorithm; Medicine","score_opus":0.06795900448942767,"score_gpt":0.35323624604111287,"score_spread":0.2852772415516852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741584520","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025600698,0.009020469,0.016242452,0.10691903,0.10033787,0.00025376,0.0041486262,0.0027051347,0.7578126],"genre_scores_gemma":[0.015981277,0.007889926,0.0051182266,0.009038172,0.0145057915,0.00017204079,0.004532357,0.0018723722,0.9408898],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99195534,0.0008115547,0.00041290472,0.0008241313,0.0046445695,0.0013515811],"domain_scores_gemma":[0.9821738,0.001170902,0.00039513406,0.0010672217,0.008799707,0.006393232],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007231589,0.001525063,0.0017552266,0.0034797965,0.0044342284,0.014635097,0.0023130851,0.0044440925,0.30428073],"category_scores_gemma":[0.017018367,0.0006567436,0.0018128287,0.0025874597,0.0021337445,0.009502394,0.008304544,0.007321693,0.27542797],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000067236935,0.000043455253,0.00010605511,0.00010806769,0.000009487766,0.00009618286,0.000044429074,0.00023136614,0.00022368708,0.047083054,0.9134175,0.038569514],"study_design_scores_gemma":[0.000009820046,0.000020317184,0.0001111416,0.00008366238,0.00000469411,0.0000720113,0.000049560327,0.00017168632,0.00025265847,0.0115159815,0.98769325,0.000015251213],"about_ca_topic_score_codex":0.0029597653,"about_ca_topic_score_gemma":0.0064157713,"teacher_disagreement_score":0.30428073,"about_ca_system_score_codex":0.008217745,"about_ca_system_score_gemma":0.009973371,"threshold_uncertainty_score":0.9923591},"labels":[],"label_agreement":null},{"id":"W2752065998","doi":"10.1049/iet-cdt.2016.0200","title":"High performance and energy efficient single‐precision and double‐precision merged floating‐point adder on FPGA","year":2017,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Adder; Field-programmable gate array; Double-precision floating-point format; Computer science; Single-precision floating-point format; Stratix; Computer hardware; Carry-save adder; Throughput; Efficient energy use; Parallel computing; Floating point; Embedded system; Algorithm; Engineering; Latency (audio); Electrical engineering","score_opus":0.01911748253702997,"score_gpt":0.26412505777196205,"score_spread":0.24500757523493208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752065998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30880782,0.006015766,0.62881756,0.00057408743,0.0007954567,0.00032699632,0.0011152191,0.008508508,0.045038603],"genre_scores_gemma":[0.7141592,0.001135838,0.26979735,0.00015428057,0.00008093995,0.00011059687,0.00087591313,0.000068385496,0.013617474],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998642,0.000011694473,0.000011708735,0.000020007905,0.00006898775,0.000023384273],"domain_scores_gemma":[0.9999167,0.000013230826,0.000012265395,0.000013158019,0.000037808048,0.0000068293375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000105158986,0.0004144532,0.00032280528,0.0005464449,0.00033214258,0.00053019385,0.00066664576,0.00027136694,0.0027567595],"category_scores_gemma":[0.00018078419,0.00019368369,0.00023780821,0.00044179038,0.00010898459,0.00070981175,0.00025044187,0.0002883045,0.00060677214],"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.0007765735,0.0001033072,0.0011230271,0.0007507248,0.00015319182,0.0010497153,0.000099257886,0.035185546,0.38920668,0.021671815,0.016962904,0.5329172],"study_design_scores_gemma":[0.0002624624,0.0014546646,0.0049594175,0.00016383051,0.00024024374,0.003856783,0.00011814739,0.35685882,0.5211678,0.006305279,0.10445235,0.00016011905],"about_ca_topic_score_codex":0.0008460327,"about_ca_topic_score_gemma":0.0021325946,"teacher_disagreement_score":0.0027567595,"about_ca_system_score_codex":0.0003321334,"about_ca_system_score_gemma":0.00059821934,"threshold_uncertainty_score":0.009222209},"labels":[],"label_agreement":null},{"id":"W2752693332","doi":"10.1115/detc2017-67091","title":"Solutions of Interval Systems for Under-Constrained and Redundant Parallel Manipulators","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Queen's University","funders":"","keywords":"Orthant; Jacobian matrix and determinant; Wrench; Solution set; Mathematics; Control theory (sociology); Actuator; Interval (graph theory); Parameterized complexity; Linear system; Context (archaeology); Mathematical optimization; Computer science; Set (abstract data type); Algorithm; Applied mathematics; Mathematical analysis; Engineering","score_opus":0.09412869442614291,"score_gpt":0.33452082577681524,"score_spread":0.24039213135067233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752693332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015013241,0.00031688935,0.9801631,0.00012700082,0.00002586214,0.000028820996,0.00004159273,0.000058194975,0.0042252764],"genre_scores_gemma":[0.5799624,0.0013073048,0.40853846,0.00009496502,0.00012388443,0.0003734495,0.00024920361,0.00009651138,0.00925387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995727,0.00013727734,0.000031192376,0.00009775038,0.00012806008,0.000033013494],"domain_scores_gemma":[0.99908674,0.0005332098,0.00018510973,0.000048315662,0.00012016808,0.000026536856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094390474,0.00064169854,0.0006622848,0.0005152338,0.00033507723,0.0009805392,0.0006160394,0.00097586034,0.0028839111],"category_scores_gemma":[0.00311967,0.0003180896,0.00054539903,0.00054886384,0.00071391783,0.0006993799,0.001275093,0.0011979379,0.00032952917],"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.00005214313,0.000028953464,0.0005595248,0.00022579785,0.000032962587,0.00016821593,0.0003215162,0.8456357,0.0044045327,0.101222984,0.0010789325,0.046268847],"study_design_scores_gemma":[0.0000069727503,0.00004143088,0.00015729222,0.000025084228,0.000006307939,0.000039535505,0.000069373615,0.96302515,0.0006115148,0.03429029,0.0017155764,0.000011450997],"about_ca_topic_score_codex":0.0013257306,"about_ca_topic_score_gemma":0.0010456169,"teacher_disagreement_score":0.0028839111,"about_ca_system_score_codex":0.0004307562,"about_ca_system_score_gemma":0.00060049834,"threshold_uncertainty_score":0.009647667},"labels":[],"label_agreement":null},{"id":"W2753204513","doi":"","title":"Software-Based Geometry Operations for 3D Computer Graphics","year":2008,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Victoria","funders":"","keywords":"CORDIC; Computer science; Floating point; Vector graphics; Fixed-point arithmetic; Software; Computation; Coprocessor; Fixed point; Parallel computing; Graphics; Vertex (graph theory); Rotation (mathematics); Computational science; Graphics hardware; Computer hardware; Computer graphics (images); Algorithm; Theoretical computer science; Field-programmable gate array; Graph; Artificial intelligence; Programming language; Mathematics","score_opus":0.039412128931581754,"score_gpt":0.28894626032397863,"score_spread":0.24953413139239689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753204513","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03227715,0.0005508666,0.94491917,0.00015172701,0.000075208445,0.00010206064,0.0001406567,0.005623197,0.016159862],"genre_scores_gemma":[0.35979125,0.0008687834,0.62586576,0.00014433984,0.0000693656,0.0001979218,0.0008937082,0.0008949082,0.011273938],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957496,0.00004853879,0.000021163005,0.000036864785,0.0002880655,0.000030426287],"domain_scores_gemma":[0.9996306,0.00007825205,0.000032250973,0.00013782039,0.00010985631,0.0000111932095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021170582,0.00048761122,0.0002554605,0.0004866521,0.00035245475,0.00077152695,0.0010099814,0.00030587308,0.0073760445],"category_scores_gemma":[0.0011364114,0.0002500742,0.00040179194,0.00087925885,0.00059367367,0.0008542186,0.0007743089,0.00059594837,0.0020266273],"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.00019907908,0.00008977169,0.001708159,0.00030249066,0.000039173337,0.00019355913,0.00038221976,0.110006906,0.09473732,0.17994158,0.014757847,0.5976419],"study_design_scores_gemma":[0.000060582788,0.00037307586,0.0020203,0.00007667846,0.000033012977,0.0004171626,0.000099067416,0.7267586,0.09427748,0.045221414,0.13061,0.00005270239],"about_ca_topic_score_codex":0.0021811218,"about_ca_topic_score_gemma":0.0036054628,"teacher_disagreement_score":0.0073760445,"about_ca_system_score_codex":0.0007273722,"about_ca_system_score_gemma":0.0010192848,"threshold_uncertainty_score":0.02467531},"labels":[],"label_agreement":null},{"id":"W2761962793","doi":"10.1109/tac.2017.2760106","title":"Invariance Control Synthesis for Switched Nonlinear Systems: An Interval Analysis Approach","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canada Research Chairs","keywords":"Nonlinear system; Mathematics; Partition (number theory); Control theory (sociology); Interval (graph theory); Invariant (physics); Computation; Interval arithmetic; Upper and lower bounds; Applied mathematics; Algorithm; Computer science; Control (management); Mathematical analysis; Artificial intelligence; Combinatorics","score_opus":0.03102403031255806,"score_gpt":0.29807022549944273,"score_spread":0.26704619518688466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2761962793","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018604838,0.000073277915,0.99691534,0.000015251111,0.000010004748,0.000008001447,0.000006699469,0.000057157955,0.0010538232],"genre_scores_gemma":[0.606232,0.00073103455,0.38985053,0.00007429196,0.000097969285,0.00022392739,0.00012426157,0.00012850511,0.0025375122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997067,0.00007954484,0.000017126466,0.00005995879,0.00011358828,0.000023069948],"domain_scores_gemma":[0.9997311,0.0001652956,0.000029985606,0.000024912246,0.000041079184,0.000007490549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958422,0.0005589342,0.0005150538,0.00047106927,0.00023634845,0.0006482231,0.0006919796,0.0003573704,0.0022267173],"category_scores_gemma":[0.00087604264,0.00023640004,0.0006622141,0.0003787861,0.0006297634,0.0006371381,0.0005289082,0.0008661288,0.0003302371],"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.00011058004,0.000047006775,0.0002844027,0.00021195912,0.0000600592,0.000076513184,0.00023769263,0.6118867,0.032094628,0.19828653,0.0010761247,0.15562774],"study_design_scores_gemma":[0.000011306959,0.00006530558,0.000083849634,0.000012610986,0.000013347296,0.00001467241,0.000012406664,0.9686527,0.003213781,0.02584814,0.0020609351,0.000010813919],"about_ca_topic_score_codex":0.0010540145,"about_ca_topic_score_gemma":0.0006525786,"teacher_disagreement_score":0.0022267173,"about_ca_system_score_codex":0.0005117118,"about_ca_system_score_gemma":0.0003674972,"threshold_uncertainty_score":0.0074490905},"labels":[],"label_agreement":null},{"id":"W2786598203","doi":"10.1007/978-3-030-26831-2_16","title":"Root-Finding with Implicit Deflation","year":2019,"lang":"en","type":"preprint","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Deflation; Root (linguistics); Computation; Polynomial; Subdivision; Mathematics; Applied mathematics; Computer science; Mathematical optimization; Algorithm; Mathematical analysis","score_opus":0.022283940828799538,"score_gpt":0.3024834169206719,"score_spread":0.28019947609187235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2786598203","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01066466,0.00017854435,0.9784759,0.00032002555,0.00018864716,0.0000429919,0.000081858314,0.001680496,0.008366833],"genre_scores_gemma":[0.250165,0.00016586413,0.73386884,0.00025459242,0.0002142625,0.00010395551,0.00027891554,0.0015826339,0.013365986],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972451,0.00074986485,0.00016669663,0.00051088864,0.0009789418,0.0003485048],"domain_scores_gemma":[0.9926347,0.0035960374,0.0003061451,0.0023841287,0.00092037,0.00015859501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023971128,0.001015928,0.0016428182,0.0015952293,0.0010711683,0.0017951329,0.0023054378,0.0022082627,0.017678497],"category_scores_gemma":[0.020360867,0.00074985827,0.00088027073,0.0014080926,0.0024769444,0.004324988,0.0066265515,0.0039042393,0.005331254],"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.00073013274,0.00019439045,0.0013518689,0.000579244,0.00007061955,0.00042214265,0.00072706846,0.034569114,0.013515998,0.40092567,0.01557501,0.53133875],"study_design_scores_gemma":[0.00016385682,0.00013014102,0.00024912017,0.00010049089,0.00005552768,0.00036043706,0.00014445097,0.38845176,0.015933841,0.5775872,0.01677391,0.000049260805],"about_ca_topic_score_codex":0.00070703565,"about_ca_topic_score_gemma":0.0013726347,"teacher_disagreement_score":0.017678497,"about_ca_system_score_codex":0.00054618844,"about_ca_system_score_gemma":0.001230322,"threshold_uncertainty_score":0.059140444},"labels":[],"label_agreement":null},{"id":"W2787037985","doi":"10.1109/reconfig.2017.8279781","title":"Build fast, trade fast: FPGA-based high-frequency trading using high-level synthesis","year":2017,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Field-programmable gate array; Computer science; Latency (audio); High-frequency trading; Implementation; Low latency (capital markets); Embedded system; Software; ARM architecture; Time to market; High-level synthesis; Protocol stack; Scheduling (production processes); Computer architecture; Algorithmic trading; Operating system; Stack (abstract data type); Software engineering; Computer network; Telecommunications","score_opus":0.07441522438581342,"score_gpt":0.3109154474418738,"score_spread":0.2365002230560604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2787037985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066847526,0.00033841527,0.88729316,0.0001558582,0.00011946734,0.00017878332,0.0002761471,0.02978806,0.0150025785],"genre_scores_gemma":[0.54912937,0.00014477565,0.44494963,0.00013213465,0.00002218615,0.00012308436,0.00036602173,0.0010611174,0.0040717265],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99947613,0.000104059174,0.000033709497,0.00007992948,0.00023771635,0.00006848516],"domain_scores_gemma":[0.9993261,0.00025850086,0.00007520975,0.00018210769,0.00012616026,0.000031971063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006059411,0.0006939195,0.00035719053,0.000545403,0.0002934559,0.0010339903,0.0010699822,0.0004971464,0.0073845503],"category_scores_gemma":[0.0014066008,0.00038256714,0.0003388226,0.00031505912,0.00040721602,0.00096751685,0.0005497372,0.00052501675,0.0015464511],"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.0008010929,0.0003076051,0.0055156318,0.000532847,0.00017729319,0.0006825045,0.0003071865,0.39623198,0.120339274,0.024564622,0.014198074,0.43634182],"study_design_scores_gemma":[0.0001721231,0.00024122257,0.0008071141,0.000041255447,0.000040221516,0.00021068478,0.000038387472,0.90500677,0.074188195,0.006411096,0.012808235,0.000034748387],"about_ca_topic_score_codex":0.0026542472,"about_ca_topic_score_gemma":0.0031927077,"teacher_disagreement_score":0.0073845503,"about_ca_system_score_codex":0.00059998606,"about_ca_system_score_gemma":0.00094607193,"threshold_uncertainty_score":0.024703741},"labels":[],"label_agreement":null},{"id":"W2889700844","doi":"10.5539/jmr.v10n5p76","title":"Solutions to Four-Letter Words in Mathematics","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Logarithm; Homogeneous; Notation; Zero (linguistics); Homogeneous differential equation; Mathematical analysis; Algebra over a field; Calculus (dental); Pure mathematics; Differential equation; Combinatorics; Arithmetic","score_opus":0.25593417755247966,"score_gpt":0.4572076234385613,"score_spread":0.20127344588608165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889700844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041343957,0.0016868779,0.76593727,0.0072108526,0.0035771532,0.00023372787,0.00089614396,0.0017378832,0.17737603],"genre_scores_gemma":[0.3994007,0.0013600287,0.499932,0.0017920238,0.0009036118,0.0005265677,0.00097467535,0.0016288322,0.09348146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977513,0.0007965158,0.00027944273,0.00032581828,0.00060890726,0.00023813563],"domain_scores_gemma":[0.9963744,0.0015723377,0.00030956927,0.00072332635,0.0008714873,0.00014885145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022090508,0.00082609075,0.00076372194,0.0018307545,0.0024224021,0.0057580676,0.0014794588,0.0021667732,0.04125321],"category_scores_gemma":[0.01894569,0.0005125424,0.0010667808,0.0021090424,0.004294624,0.0073418086,0.0037101512,0.0030437894,0.01283816],"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.0000329543,0.000012124352,0.00018874109,0.00011458025,0.000007210704,0.00009621582,0.0006681747,0.002357288,0.00059430307,0.9694874,0.008718332,0.017722605],"study_design_scores_gemma":[0.000015855307,0.000018299908,0.00006902105,0.00006441886,0.0000051117636,0.0000874558,0.00031438755,0.011218154,0.0011543193,0.93521684,0.051815968,0.000020273563],"about_ca_topic_score_codex":0.00090334006,"about_ca_topic_score_gemma":0.0011320781,"teacher_disagreement_score":0.04125321,"about_ca_system_score_codex":0.002388053,"about_ca_system_score_gemma":0.0018123705,"threshold_uncertainty_score":0.13800573},"labels":[],"label_agreement":null},{"id":"W2891906689","doi":"10.1109/arith.2018.8464818","title":"A Correctly Rounded Mixed-Radix Fused-Multiply-Add","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","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":"Safran Electronics (Canada)","funders":"","keywords":"Rounding; Computer science; Arithmetic; Floating point; Radix (gastropod); Double-precision floating-point format; Parallel computing; Point (geometry); Algorithm; Mathematics; Operating system","score_opus":0.034019104119754964,"score_gpt":0.3016679507167429,"score_spread":0.26764884659698795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891906689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013103965,0.00027790596,0.96089756,0.00017840139,0.00027616858,0.00012776525,0.00039636035,0.014029138,0.010712707],"genre_scores_gemma":[0.08837931,0.00013653698,0.9018007,0.00017860827,0.00007887653,0.00011238416,0.00071079895,0.0008018619,0.007800888],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986669,0.000105195926,0.00010113949,0.00023609861,0.0007342924,0.0001562913],"domain_scores_gemma":[0.9991215,0.00015463009,0.00006305419,0.0002927694,0.0003247168,0.000043396845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064782694,0.0013373934,0.00081501174,0.0014557434,0.0010652229,0.00208915,0.0019752325,0.0010688056,0.017537838],"category_scores_gemma":[0.0035143143,0.00068761257,0.0009125294,0.001278948,0.00077943,0.0019471667,0.0020725883,0.0013281356,0.010339354],"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.0012398442,0.0001839377,0.0019316319,0.0006167258,0.0001235612,0.00053707254,0.0003928546,0.029707033,0.050588638,0.09765709,0.04222807,0.7747935],"study_design_scores_gemma":[0.00036098843,0.00060581934,0.0013728068,0.0002730522,0.0001595264,0.0022787112,0.00021783316,0.4536498,0.2642611,0.087801285,0.18876056,0.00025854394],"about_ca_topic_score_codex":0.0010672152,"about_ca_topic_score_gemma":0.0019474474,"teacher_disagreement_score":0.017537838,"about_ca_system_score_codex":0.0007336742,"about_ca_system_score_gemma":0.0014627312,"threshold_uncertainty_score":0.058669865},"labels":[],"label_agreement":null},{"id":"W2912431218","doi":"10.1002/spe.2689","title":"Faster remainder by direct computation: Applications to compilers and software libraries","year":2019,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Divisibility rule; Divisor (algebraic geometry); Multiplication (music); Mathematics; Integer (computer science); Arithmetic; Inverse; Greatest common divisor; Quotient; Multiple; Division (mathematics); Compiler; Subtraction; Discrete mathematics; Computer science; Combinatorics","score_opus":0.016278115832119504,"score_gpt":0.3049469259117814,"score_spread":0.2886688100796619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912431218","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010862378,0.00075113657,0.9496766,0.00039388734,0.0001667936,0.00007388459,0.00016635738,0.030384501,0.007524493],"genre_scores_gemma":[0.1255172,0.000521151,0.85869426,0.00025871134,0.00016821026,0.00017222897,0.0006410603,0.0079579605,0.0060691503],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99770254,0.0006573417,0.00019942109,0.0003477589,0.0008804444,0.00021246696],"domain_scores_gemma":[0.98909676,0.004959156,0.0008785901,0.0025968438,0.0022699083,0.00019875963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023632061,0.001976297,0.0010648784,0.002508245,0.0007586389,0.0027160365,0.0022431263,0.0008280914,0.016259864],"category_scores_gemma":[0.013175676,0.0010630647,0.0011814417,0.002340423,0.0013158965,0.0043374305,0.001984568,0.0015857823,0.0069223377],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053267647,0.00017358699,0.002678915,0.0005027879,0.00007240372,0.0001875749,0.0002971586,0.09059318,0.015309199,0.11215748,0.037388127,0.74010694],"study_design_scores_gemma":[0.00022098681,0.00019319366,0.0006416261,0.0002776261,0.000052556537,0.00023157605,0.00007221895,0.7725239,0.04719203,0.12454826,0.053929865,0.00011612415],"about_ca_topic_score_codex":0.003073458,"about_ca_topic_score_gemma":0.0034299593,"teacher_disagreement_score":0.016259864,"about_ca_system_score_codex":0.0014698879,"about_ca_system_score_gemma":0.002156764,"threshold_uncertainty_score":0.054394722},"labels":[],"label_agreement":null},{"id":"W2913269411","doi":"10.1109/mwscas.2018.8623885","title":"Review of Arithmetic Operations Using the Continuous Valued Number System","year":2018,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Institute for International Education; Natural Sciences and Engineering Research Council of Canada; CMC Microsystems","keywords":"Multiplication (music); Arithmetic; Computer science; Relation (database); Series (stratigraphy); Power (physics); Algorithm; Mathematics; Data mining","score_opus":0.04087906962084958,"score_gpt":0.346876304207155,"score_spread":0.3059972345863054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913269411","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013732126,0.8969121,0.06441516,0.0007828211,0.0023642553,0.00005990411,0.0001501094,0.00024363415,0.03369884],"genre_scores_gemma":[0.013943985,0.91454965,0.05767291,0.0009905725,0.0029025972,0.00013520986,0.00039275488,0.00012183142,0.009290569],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991009,0.00015316192,0.00015351654,0.00016783872,0.00038536088,0.00003915842],"domain_scores_gemma":[0.9990356,0.0004936459,0.00008873462,0.000071503186,0.00028596446,0.000024658084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006998365,0.0010611361,0.0009867948,0.003248831,0.0005031444,0.0013378533,0.0011782174,0.00078614894,0.0065131593],"category_scores_gemma":[0.0024458522,0.0005410276,0.0005706449,0.0043071946,0.0012165374,0.002850133,0.0007650287,0.0012790803,0.0043511093],"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.000079173,0.00005824538,0.00022219298,0.014971011,0.00007746119,0.00021471412,0.00019059061,0.0031582897,0.004423678,0.11247666,0.036625657,0.8275024],"study_design_scores_gemma":[0.000008041033,0.00009469915,0.0003279127,0.0013764986,0.00003606801,0.0009482146,0.00005905737,0.0014720232,0.0022597224,0.022311583,0.971058,0.000048125665],"about_ca_topic_score_codex":0.0008098435,"about_ca_topic_score_gemma":0.00070192653,"teacher_disagreement_score":0.0065131593,"about_ca_system_score_codex":0.00066262984,"about_ca_system_score_gemma":0.0011756048,"threshold_uncertainty_score":0.021788657},"labels":[],"label_agreement":null},{"id":"W2914973130","doi":"10.1109/tc.2019.2895031","title":"Efficient Multiple-Precision Floating-Point Fused Multiply-Add with Mixed-Precision Support","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":74,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Double-precision floating-point format; Single-precision floating-point format; Accuracy and precision; Computer science; Multiplication (music); Floating point; Floating-point unit; Dot product; Algorithm; Mathematics; Statistics","score_opus":0.01378502794709515,"score_gpt":0.24885029591215002,"score_spread":0.23506526796505486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914973130","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087273404,0.0023796037,0.8897644,0.00034651536,0.0004789977,0.00019259071,0.00032003087,0.006042463,0.013201973],"genre_scores_gemma":[0.50186175,0.0005552689,0.48858714,0.0002647853,0.00018976338,0.00016639713,0.0006145546,0.00012422024,0.007636085],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99939406,0.000051817075,0.00005129174,0.000093668656,0.00033724683,0.00007177182],"domain_scores_gemma":[0.9994869,0.00007566419,0.000050057595,0.0001040455,0.00025693225,0.000026432816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428161,0.00084106886,0.0007773097,0.001036528,0.0006551772,0.0011532338,0.0018386075,0.0005193828,0.0046357117],"category_scores_gemma":[0.00097179366,0.0004236036,0.00054175773,0.0009243649,0.00030369812,0.0020818184,0.0009874188,0.0006924658,0.0019044174],"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.0013996626,0.00021200134,0.0015493415,0.0007105466,0.0001833169,0.00080949033,0.0001953113,0.021480141,0.21744372,0.033816192,0.012827177,0.7093731],"study_design_scores_gemma":[0.0001912857,0.0012828292,0.0012753244,0.00013141721,0.00025939295,0.0021950314,0.00009941124,0.49905005,0.3971296,0.011970839,0.08624139,0.00017345964],"about_ca_topic_score_codex":0.00081798347,"about_ca_topic_score_gemma":0.0020336804,"teacher_disagreement_score":0.0046357117,"about_ca_system_score_codex":0.0005019782,"about_ca_system_score_gemma":0.00080381247,"threshold_uncertainty_score":0.015508056},"labels":[],"label_agreement":null},{"id":"W2915767988","doi":"10.2172/983320","title":"Solution to Monthly Problem 11277","year":2007,"lang":"en","type":"report","venue":"","topic":"Numerical Methods and 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":"Dalhousie University","funders":"","keywords":"Mathematics; Environmental science","score_opus":0.0620953541275931,"score_gpt":0.3581646799043258,"score_spread":0.29606932577673273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2915767988","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13191049,0.0020748528,0.28113163,0.008830032,0.0018244998,0.00034255453,0.005935306,0.00074649305,0.5672041],"genre_scores_gemma":[0.56497943,0.0014194337,0.08599079,0.00076456025,0.0008521834,0.0003776717,0.0059635593,0.0010863608,0.338566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997627,0.00006163765,0.000007594655,0.000051423132,0.000056398683,0.00006025652],"domain_scores_gemma":[0.9996099,0.000189885,0.000034988352,0.00003893095,0.000066424655,0.000059919435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038589726,0.0004800283,0.0008686069,0.00083257,0.0005274822,0.00088762864,0.000651974,0.0016350253,0.074274994],"category_scores_gemma":[0.0024227651,0.00015499302,0.0004054101,0.0006877866,0.0005833035,0.00091244717,0.0010147106,0.0014529473,0.008772377],"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.0004547539,0.00022896903,0.0014291452,0.0009083628,0.00008491021,0.00047805542,0.00023517001,0.083065346,0.0044120126,0.523508,0.26068154,0.1245137],"study_design_scores_gemma":[0.00026127594,0.00019443034,0.0031236033,0.00020823652,0.00004613723,0.0006352285,0.0004982536,0.43011776,0.0058962856,0.39296976,0.16599299,0.000056082994],"about_ca_topic_score_codex":0.0025320023,"about_ca_topic_score_gemma":0.00256171,"teacher_disagreement_score":0.074274994,"about_ca_system_score_codex":0.00057836313,"about_ca_system_score_gemma":0.0007743119,"threshold_uncertainty_score":0.2484746},"labels":[],"label_agreement":null},{"id":"W2916027198","doi":"10.1109/isspit.2018.8642667","title":"Behavioral Implementation of SVD on FPGA","year":2018,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"University of Victoria","funders":"","keywords":"Field-programmable gate array; Computer science; Singular value decomposition; Coding (social sciences); Reconfigurable computing; Wireless; Software; Embedded system; Computer architecture; Hardware architecture; Gate array; Computer hardware; Computer engineering; Artificial intelligence","score_opus":0.05047965757708408,"score_gpt":0.41674507260046584,"score_spread":0.3662654150233818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916027198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08336264,0.00022787436,0.8679478,0.00020082838,0.00023506707,0.00017293693,0.00037338777,0.010979648,0.036499705],"genre_scores_gemma":[0.72560316,0.00020742623,0.26211926,0.00019303888,0.00004017718,0.00017651662,0.00050031836,0.00025863724,0.010901634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984527,0.00001946769,0.000012246555,0.00002503943,0.000065639324,0.00003224741],"domain_scores_gemma":[0.999808,0.00003968735,0.000015200019,0.000047776488,0.00007715004,0.00001221654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011040833,0.0003557878,0.00016333585,0.00036641557,0.00019860112,0.0004993929,0.0005207909,0.00022269222,0.0070768944],"category_scores_gemma":[0.00038623862,0.000119534845,0.00016678982,0.00020113126,0.0001485151,0.00032893813,0.00019404101,0.00029663058,0.0016175683],"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.0005241639,0.00022749008,0.0019889106,0.0005651624,0.00006439433,0.0005332656,0.00020475873,0.07812972,0.4246974,0.04224334,0.011922129,0.43889928],"study_design_scores_gemma":[0.00014014392,0.00090252666,0.002208773,0.00008881395,0.00005591114,0.00083909684,0.00012003102,0.47892857,0.44855878,0.009579333,0.05851666,0.0000613183],"about_ca_topic_score_codex":0.001026995,"about_ca_topic_score_gemma":0.001381041,"teacher_disagreement_score":0.0070768944,"about_ca_system_score_codex":0.0002877517,"about_ca_system_score_gemma":0.000409233,"threshold_uncertainty_score":0.023674548},"labels":[],"label_agreement":null},{"id":"W2920380655","doi":"","title":"Hardware/software codesign for mathematical function acceleration.","year":2018,"lang":"en","type":"article","venue":"Conference of the Centre for Advanced Studies on Collaborative Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Acceleration; Hardware acceleration; Function (biology); Software; Embedded system; Computational science; Computer hardware; Computer architecture; Programming language; Physics","score_opus":0.22619401309447307,"score_gpt":0.4544651877290336,"score_spread":0.22827117463456054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2920380655","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058010924,0.00064235815,0.9416036,0.00031149626,0.0007353654,0.00017310762,0.00050576485,0.03420928,0.016017918],"genre_scores_gemma":[0.13771293,0.0006481554,0.81735873,0.0003514155,0.00022569972,0.00062236685,0.0028871787,0.006976792,0.033216823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985253,0.00017126411,0.00009451322,0.00012933489,0.00092002004,0.00015957085],"domain_scores_gemma":[0.9983358,0.0003013781,0.00008507117,0.00052023033,0.0006570679,0.00010046469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010830066,0.0013087547,0.0005480533,0.0013441913,0.00067255594,0.001326887,0.0022029686,0.0011155275,0.051132735],"category_scores_gemma":[0.004548041,0.00062017515,0.00070442003,0.0012824239,0.0005961461,0.0012804333,0.0017178113,0.0026472115,0.02280154],"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.0007097873,0.00029649845,0.0012770641,0.0007673306,0.00013545054,0.000273273,0.00032063542,0.022141075,0.07040359,0.07340668,0.12066293,0.7096057],"study_design_scores_gemma":[0.0002935762,0.00036893145,0.0013764843,0.00022808582,0.00006347127,0.00073261384,0.00010029887,0.41052032,0.20157869,0.032236136,0.35237774,0.00012379365],"about_ca_topic_score_codex":0.0015518802,"about_ca_topic_score_gemma":0.0019270179,"teacher_disagreement_score":0.051132735,"about_ca_system_score_codex":0.0006191526,"about_ca_system_score_gemma":0.0016909973,"threshold_uncertainty_score":0.17105603},"labels":[],"label_agreement":null},{"id":"W2943147624","doi":"10.1109/iscas.2019.8702349","title":"Efficient Posit Multiply-Accumulate Unit Generator for Deep Learning Applications","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":57,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; University of Saskatchewan","keywords":"Datapath; Computer science; Adder; Pipeline (software); Generator (circuit theory); IEEE floating point; Exponent; Multiplier (economics); Floating point; Code (set theory); Binary number; Parallel computing; Parameterized complexity; Arithmetic; Algorithm; Power (physics); Mathematics; Programming language","score_opus":0.021829614808894622,"score_gpt":0.3019435780608762,"score_spread":0.28011396325198157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943147624","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06728645,0.00058265915,0.9144423,0.00026465734,0.00018397941,0.00021287304,0.00043311366,0.0068368283,0.009757218],"genre_scores_gemma":[0.6561708,0.0003515179,0.3302125,0.00029658037,0.00006668974,0.00024068715,0.0009356778,0.00028799378,0.011437509],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999803,0.00003241325,0.000022118444,0.000046346933,0.00007141494,0.000024708275],"domain_scores_gemma":[0.99969673,0.000074394084,0.000043726268,0.000056934376,0.00011576428,0.000012515855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030485707,0.00053571543,0.00023746745,0.00055200624,0.00025638138,0.00051573594,0.0010224944,0.0002714764,0.0069758156],"category_scores_gemma":[0.0008578733,0.00019900488,0.00026650785,0.0003567599,0.00023293588,0.00080068497,0.00037526165,0.00052126625,0.0011579754],"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.00103211,0.00019223751,0.0026350573,0.0006812939,0.00008383519,0.0006527034,0.00024806688,0.079507664,0.21226804,0.073678814,0.020209113,0.60881114],"study_design_scores_gemma":[0.00015668152,0.0010013,0.0010550612,0.000089071444,0.0001111671,0.0009920977,0.000059567054,0.6216352,0.3067935,0.018890683,0.04915874,0.000056845463],"about_ca_topic_score_codex":0.0006971628,"about_ca_topic_score_gemma":0.0015668568,"teacher_disagreement_score":0.0069758156,"about_ca_system_score_codex":0.000540473,"about_ca_system_score_gemma":0.0007981939,"threshold_uncertainty_score":0.02333647},"labels":[],"label_agreement":null},{"id":"W2949609940","doi":"","title":"Alternative Implementations of Secure Real Numbers.","year":2016,"lang":"en","type":"preprint","venue":"IACR Cryptology ePrint Archive","topic":"Numerical Methods and 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 Calgary","funders":"","keywords":"Implementation; Computer science; Computation; Floating point; Point (geometry); Arithmetic; Elementary function; Scheme (mathematics); Theoretical computer science; Algorithm; Mathematics; Programming language","score_opus":0.027726830641980345,"score_gpt":0.34933784493661135,"score_spread":0.321611014294631,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949609940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01908807,0.0016341752,0.9423979,0.0014593003,0.00066229526,0.00013534364,0.00013038331,0.0005918444,0.033900663],"genre_scores_gemma":[0.62852824,0.0022608398,0.3492925,0.0006294849,0.00048323788,0.00047290768,0.00029859808,0.00042325206,0.017611003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99059147,0.0030621837,0.0006911377,0.0011180484,0.0038617079,0.0006754344],"domain_scores_gemma":[0.99290895,0.0017882588,0.0005186845,0.0037192593,0.00085183786,0.0002130529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054861177,0.0011558495,0.00087089086,0.0012425411,0.001195232,0.0047585815,0.0025692692,0.0018916155,0.012432634],"category_scores_gemma":[0.01766009,0.0006201217,0.0010808851,0.0014164298,0.0035391608,0.009764202,0.004723276,0.004196563,0.0050319172],"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.0001702162,0.000026346372,0.00015271358,0.000107881955,0.00001529241,0.000051801588,0.00013368108,0.002942116,0.0021804895,0.9676558,0.0010608919,0.025502907],"study_design_scores_gemma":[0.00013268967,0.00030081786,0.0001371271,0.0002137303,0.000048544218,0.0005723189,0.0001523962,0.04942261,0.012955222,0.8744655,0.06152581,0.000073184405],"about_ca_topic_score_codex":0.00015512385,"about_ca_topic_score_gemma":0.00019390728,"teacher_disagreement_score":0.012432634,"about_ca_system_score_codex":0.001271149,"about_ca_system_score_gemma":0.0010537299,"threshold_uncertainty_score":0.041591287},"labels":[],"label_agreement":null},{"id":"W2952102246","doi":"10.1109/fccm.2019.00046","title":"Rethinking Integer Divider Design for FPGA-Based Soft-Processors","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":34,"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; Field-programmable gate array; Latency (audio); Pipeline (software); Parallel computing; Integer (computer science); Division (mathematics); Bottleneck; Algorithm; Computer hardware; Embedded system; Arithmetic; Mathematics; Operating system; Telecommunications","score_opus":0.062301625625910594,"score_gpt":0.30375060704955054,"score_spread":0.24144898142363994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952102246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3664805,0.0038545043,0.6078248,0.00045867756,0.00021867409,0.0002253258,0.00016155692,0.0049679563,0.015808],"genre_scores_gemma":[0.7173549,0.0008387075,0.27455807,0.00027457325,0.00004426133,0.00006822979,0.00019777392,0.00033645958,0.0063269213],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99966633,0.000050142367,0.000033574925,0.000050260333,0.00014132456,0.00005836163],"domain_scores_gemma":[0.9996599,0.00011301063,0.00006287194,0.00006276698,0.00008385384,0.00001748947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035455328,0.00050752336,0.00021222829,0.00054968137,0.00018919283,0.0007715755,0.0009018471,0.00023280177,0.0021036533],"category_scores_gemma":[0.0008535469,0.0002539389,0.00022805005,0.00036896247,0.00025334203,0.0009567687,0.00034853033,0.0005576477,0.0005093242],"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.00082603825,0.00015210558,0.0048940987,0.00066697615,0.00009239071,0.0005410367,0.00033862155,0.07991241,0.3754931,0.022284469,0.003973226,0.5108255],"study_design_scores_gemma":[0.0002872355,0.002558195,0.0043683345,0.00021457972,0.00019637213,0.0011598212,0.0002443823,0.41916752,0.48249123,0.009922135,0.07928271,0.00010749207],"about_ca_topic_score_codex":0.000867998,"about_ca_topic_score_gemma":0.002082384,"teacher_disagreement_score":0.0021036533,"about_ca_system_score_codex":0.00051524036,"about_ca_system_score_gemma":0.00062329415,"threshold_uncertainty_score":0.007037461},"labels":[],"label_agreement":null},{"id":"W2953353697","doi":"10.48550/arxiv.1210.4960","title":"A new Truncated Fourier Transform algorithm","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and 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 Waterloo","funders":"","keywords":"Fast Fourier transform; Algorithm; Fourier transform; Transformation (genetics); Computer science; Ring (chemistry); Arithmetic; Mathematics; Mathematical analysis","score_opus":0.07502044757962618,"score_gpt":0.2097360619565806,"score_spread":0.1347156143769544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953353697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001753275,0.00008634985,0.99392164,0.000113155314,0.00015943203,0.000048041635,0.000108208995,0.00084478804,0.0029651741],"genre_scores_gemma":[0.036521927,0.0002209596,0.94996685,0.00020006271,0.00019861035,0.00017654075,0.0006696776,0.0006178993,0.011427432],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998719,0.00017427783,0.000102172824,0.00024499142,0.00064841984,0.00011121704],"domain_scores_gemma":[0.99830496,0.00036920147,0.00008260655,0.00052903773,0.00061177206,0.000102430895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009800877,0.0009941019,0.0013152162,0.0013065683,0.0008420644,0.0021747653,0.0025284234,0.0016295423,0.019571083],"category_scores_gemma":[0.0062283655,0.0004748194,0.0009949555,0.001426802,0.0009596325,0.0036466974,0.0029794842,0.0022070862,0.009456609],"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.0003737059,0.00012974581,0.00059611624,0.00022139293,0.0000716996,0.0002439753,0.00017166068,0.070702426,0.021465119,0.15175305,0.025079625,0.7291914],"study_design_scores_gemma":[0.00011307277,0.00010707353,0.00017233401,0.000047296995,0.000032670872,0.0005146168,0.00006106,0.84106416,0.015177432,0.09456493,0.048099868,0.000045408706],"about_ca_topic_score_codex":0.0014628676,"about_ca_topic_score_gemma":0.0014100282,"teacher_disagreement_score":0.019571083,"about_ca_system_score_codex":0.0006357887,"about_ca_system_score_gemma":0.0016014408,"threshold_uncertainty_score":0.06547183},"labels":[],"label_agreement":null},{"id":"W2954615675","doi":"","title":"Variable Precision Floating-Point RISC-V Coprocessor Evaluation using Lightweight Software and Compiler Support","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and 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":"Google (Canada)","funders":"","keywords":"Computer science; Compiler; Floating point; Coprocessor; Speedup; Parallel computing; Reduced instruction set computing; Variable (mathematics); Double-precision floating-point format; Instruction set; Single-precision floating-point format; Computational science; Programming language; Mathematics","score_opus":0.02770308438994855,"score_gpt":0.28145826803365837,"score_spread":0.2537551836437098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954615675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42708904,0.0007838478,0.48060122,0.00028119338,0.00041687608,0.00017562088,0.0008620279,0.038041804,0.051748406],"genre_scores_gemma":[0.85402024,0.0001746128,0.12856655,0.000111674526,0.00006229236,0.0001012253,0.0011316803,0.0025894889,0.013242127],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931884,0.000104346465,0.00004475239,0.00009555428,0.00029683844,0.00013963952],"domain_scores_gemma":[0.99862385,0.00038008415,0.00010322845,0.0002943797,0.0005376069,0.000060907343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000544088,0.00095847575,0.0005420997,0.00083292986,0.00061401416,0.0012462,0.0012765664,0.00044861806,0.012014412],"category_scores_gemma":[0.0024881954,0.00032280193,0.0004501512,0.0010746082,0.00038968222,0.00083077385,0.0007319284,0.00055057544,0.0026427323],"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.0034365146,0.00046012056,0.008923958,0.0008551424,0.00024385321,0.001131577,0.0003805591,0.15515211,0.20549724,0.036633387,0.04866807,0.5386175],"study_design_scores_gemma":[0.00033712332,0.00065505004,0.0039419443,0.000086505745,0.00014649871,0.00032161587,0.00012507872,0.74223405,0.21977885,0.011245631,0.021044325,0.000083414685],"about_ca_topic_score_codex":0.0024271554,"about_ca_topic_score_gemma":0.0047651283,"teacher_disagreement_score":0.012014412,"about_ca_system_score_codex":0.0008040196,"about_ca_system_score_gemma":0.0015937877,"threshold_uncertainty_score":0.040192246},"labels":[],"label_agreement":null},{"id":"W2962778453","doi":"10.3934/dcds.2015.35.4765","title":"Rigorous numerics for nonlinear operators with tridiagonal dominant linear parts","year":2016,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Université Laval","funders":"Agence Nationale de la Recherche","keywords":"Tridiagonal matrix; Operator (biology); Mathematics; Nonlinear system; Linear operators; Diagonal; Computation; Inverse; Applied mathematics; Linear map; Contraction (grammar); Pure mathematics; Mathematical analysis; Algebra over a field; Physics; Algorithm; Eigenvalues and eigenvectors; Quantum mechanics; Geometry","score_opus":0.020160505517053808,"score_gpt":0.2844780856119548,"score_spread":0.26431758009490103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962778453","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015120108,0.00022199252,0.9789547,0.00025334334,0.000065707725,0.000033101038,0.000027401557,0.00016022478,0.005163379],"genre_scores_gemma":[0.3090149,0.00058541074,0.6815601,0.00021818095,0.00013453947,0.00031683984,0.000108766,0.00044140135,0.007619916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990507,0.00029008457,0.000046625544,0.00004084297,0.00051459926,0.000057199755],"domain_scores_gemma":[0.99834585,0.0007210863,0.00018068087,0.00025229726,0.00041609124,0.00008407538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001971598,0.00070061465,0.0005942862,0.0008684091,0.00066447956,0.0010733533,0.0012578269,0.0010472878,0.0021272374],"category_scores_gemma":[0.0057444125,0.00035089074,0.00075189193,0.00039258986,0.002106892,0.0023847441,0.0018263105,0.0017765395,0.0005943966],"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.00003542176,0.00008329303,0.00033173812,0.00018622012,0.00003514061,0.00011823231,0.00022043228,0.15868972,0.013774345,0.8095143,0.0014217914,0.015589418],"study_design_scores_gemma":[0.000012797876,0.000023192973,0.0000883152,0.000014822312,0.000003836603,0.000030561547,0.000018357374,0.8766238,0.0016844269,0.11975126,0.0017363738,0.000012275936],"about_ca_topic_score_codex":0.0007972859,"about_ca_topic_score_gemma":0.0012137069,"teacher_disagreement_score":0.0021272374,"about_ca_system_score_codex":0.0007315487,"about_ca_system_score_gemma":0.0012856292,"threshold_uncertainty_score":0.0104269385},"labels":[],"label_agreement":null},{"id":"W2963455733","doi":"10.5539/jmr.v11n3p60","title":"An Asymptotic Expansion for the Error Term in the Brent-McMillan Algorithm for Euler’s Constant","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Bessel function; Term (time); Asymptotic expansion; Constant (computer programming); Euler's formula; Computation; Integer (computer science); Applied mathematics; Algorithm; Mathematical analysis; Combinatorics","score_opus":0.1310918809042816,"score_gpt":0.4442376703974151,"score_spread":0.3131457894931335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963455733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026095985,0.00038208484,0.9924446,0.00029583852,0.0001451192,0.000033664193,0.00004030349,0.00022357402,0.0038252217],"genre_scores_gemma":[0.11849303,0.0012289967,0.8624889,0.00062762864,0.00029211765,0.00045356675,0.00030838244,0.0012735883,0.0148338415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980307,0.00060151704,0.00007927287,0.00021849608,0.00093956565,0.00013043414],"domain_scores_gemma":[0.9954465,0.0027925891,0.00021207306,0.00055028236,0.00084995554,0.00014857335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053167404,0.001301525,0.0009522766,0.0015339004,0.0007467068,0.0013516105,0.0026364392,0.00110413,0.0073905154],"category_scores_gemma":[0.023707327,0.0004826077,0.0008515765,0.0013836675,0.0027002052,0.0029397781,0.002597704,0.0047578407,0.0031726572],"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.00014977573,0.000047387177,0.0006353875,0.0002581543,0.00003815264,0.00013037834,0.00023855726,0.14132622,0.0051209014,0.75329655,0.00614728,0.092611216],"study_design_scores_gemma":[0.000015542852,0.000025114994,0.00019871148,0.00009671337,0.00001381266,0.000069122216,0.000021455602,0.8201011,0.0030899178,0.16957887,0.0067547597,0.000035006426],"about_ca_topic_score_codex":0.0046843053,"about_ca_topic_score_gemma":0.0063145584,"teacher_disagreement_score":0.0073905154,"about_ca_system_score_codex":0.002121074,"about_ca_system_score_gemma":0.0027746283,"threshold_uncertainty_score":0.028117895},"labels":[],"label_agreement":null},{"id":"W2963813846","doi":"10.1093/imanum/dry024","title":"Optimal sampling rates for approximating analytic functions from pointwise samples","year":2018,"lang":"en","type":"article","venue":"IMA Journal of Numerical Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Air Force Office of Scientific Research; Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Rate of convergence; Polynomial; Applied mathematics; Bounded function; Combinatorics; Exponential polynomial; Minimax approximation algorithm; Equidistributed sequence; Discrete mathematics; Exponential function; Mathematical analysis","score_opus":0.055206926224184875,"score_gpt":0.3594723217996215,"score_spread":0.30426539557543664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963813846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10171168,0.0001855751,0.89682496,0.000121706835,0.000015555315,0.0000362388,0.0000259959,0.00016808651,0.0009102976],"genre_scores_gemma":[0.82616115,0.00016201213,0.1727206,0.000050445353,0.0000205862,0.00009336398,0.00008346911,0.0000741028,0.0006342971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99826604,0.00068511046,0.0000904423,0.00019933516,0.00062786706,0.00013129693],"domain_scores_gemma":[0.9896163,0.007919466,0.0005207195,0.00090316904,0.00081176957,0.00022865547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004646208,0.00045631264,0.0007492247,0.00067132903,0.00034915004,0.00091764657,0.0015311794,0.00081819046,0.0010036061],"category_scores_gemma":[0.028615566,0.0004308665,0.00042143508,0.00049455353,0.0013981762,0.0018938376,0.0016605953,0.0011857303,0.00028724817],"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.0011903213,0.00013725407,0.0052296002,0.00021124055,0.00006813647,0.00015519484,0.0003508223,0.79246205,0.027833784,0.094917804,0.00067327113,0.07677059],"study_design_scores_gemma":[0.000010507978,0.000035630095,0.00014739505,0.000006649634,0.0000028812321,0.000016069303,0.000016007692,0.98923165,0.005423147,0.0049500414,0.00015498958,0.0000051186453],"about_ca_topic_score_codex":0.0014956318,"about_ca_topic_score_gemma":0.001055458,"teacher_disagreement_score":0.004646208,"about_ca_system_score_codex":0.0009205228,"about_ca_system_score_gemma":0.00073068304,"threshold_uncertainty_score":0.024571836},"labels":[],"label_agreement":null},{"id":"W2974844866","doi":"10.2200/s00946ed1v01y201908mas029","title":"Fast Start Integral Calculus","year":2019,"lang":"en","type":"article","venue":"Synthesis lectures on mathematics and statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Division of Graduate Education; California Institute of Technology","keywords":"Fundamental theorem of calculus; Mathematics; Calculus (dental); Trigonometric integral; Differential calculus; Trigonometric substitution; Integration by parts; Trigonometric functions; Trigonometry; Algebra over a field; Pure mathematics; Mathematical analysis; Fundamental theorem","score_opus":0.012847277263968573,"score_gpt":0.2591135490813591,"score_spread":0.24626627181739053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974844866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936739,0.0045106933,0.7252702,0.0025861547,0.0027200272,0.000059296854,0.00037832724,0.0015110694,0.25202745],"genre_scores_gemma":[0.3118369,0.0064325137,0.23932706,0.0018441802,0.0039150575,0.00020688771,0.0007630368,0.0031880639,0.4324863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909854,0.00014762956,0.000025618087,0.00014939414,0.0004895006,0.00008938538],"domain_scores_gemma":[0.9992416,0.00020881405,0.00003638565,0.0001807659,0.00023901662,0.00009347278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012430962,0.0014052673,0.0014927712,0.0020688737,0.001468668,0.0033272775,0.001204069,0.0014328115,0.021183744],"category_scores_gemma":[0.0028326185,0.0006608596,0.001212034,0.001467089,0.0019887213,0.0051706242,0.0029823724,0.0048825787,0.008280341],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017339195,0.000011056498,0.000030634477,0.000028975694,0.0000075732,0.0000148248755,0.00005190111,0.00079098245,0.00067751907,0.9758449,0.0058035706,0.016720764],"study_design_scores_gemma":[0.0000069039943,0.000009296004,0.000066815155,0.000020395903,0.000009142915,0.000048573704,0.00001542185,0.008390475,0.0010129327,0.96459144,0.0258163,0.000012406822],"about_ca_topic_score_codex":0.0008207361,"about_ca_topic_score_gemma":0.00067206647,"teacher_disagreement_score":0.021183744,"about_ca_system_score_codex":0.0018549549,"about_ca_system_score_gemma":0.00088919554,"threshold_uncertainty_score":0.070866704},"labels":[],"label_agreement":null},{"id":"W2979049289","doi":"10.1007/978-3-030-41258-6_6","title":"Approximate GCD in Bernstein basis","year":2019,"lang":"en","type":"preprint","venue":"Communications in computer and information science","topic":"Numerical Methods and 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":"Western University","funders":"","keywords":"Bipartite graph; Bernstein polynomial; Mathematics; Root (linguistics); Matching (statistics); Degree (music); Basis (linear algebra); Combinatorics; Discrete mathematics; Applied mathematics; Statistics; Graph; Physics; Geometry","score_opus":0.04903440410928161,"score_gpt":0.3396691884607903,"score_spread":0.2906347843515087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979049289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043839708,0.0013443297,0.9328643,0.0005742588,0.00026861936,0.00005463838,0.0003878808,0.000546235,0.02011996],"genre_scores_gemma":[0.5945411,0.0020141557,0.38230556,0.00049573084,0.00034389726,0.00019070014,0.0011499155,0.00057386246,0.0183851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979336,0.0006380031,0.00007558472,0.0003845375,0.00065293367,0.00031529638],"domain_scores_gemma":[0.9982324,0.00073858973,0.00011773115,0.00038077764,0.0003994239,0.00013111832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002159736,0.00081438525,0.0011405993,0.0015150518,0.0007522051,0.0018963189,0.0011850214,0.0010724533,0.008802102],"category_scores_gemma":[0.010315235,0.0003710657,0.00069522223,0.0014598812,0.001827856,0.003677006,0.0031508175,0.0020918506,0.0036469968],"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.00026733265,0.000053867065,0.0016840477,0.0002231242,0.00003618962,0.0001802141,0.00026312078,0.045429714,0.005409206,0.85620695,0.008646866,0.08159928],"study_design_scores_gemma":[0.00003542219,0.00006688437,0.00034718402,0.000064599066,0.000013642411,0.00022971262,0.000105381645,0.27743977,0.0030758004,0.7070053,0.011584466,0.000031694886],"about_ca_topic_score_codex":0.0022569238,"about_ca_topic_score_gemma":0.00239952,"teacher_disagreement_score":0.008802102,"about_ca_system_score_codex":0.001041377,"about_ca_system_score_gemma":0.000999955,"threshold_uncertainty_score":0.029446006},"labels":[],"label_agreement":null},{"id":"W2980033125","doi":"10.1109/ccece.2019.8861890","title":"Universal Functions Originator—Part II: Evaluation","year":2019,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.023250711673455333,"score_gpt":0.290864293816401,"score_spread":0.26761358214294567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980033125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688125,0.0043844813,0.80312943,0.000400009,0.0007741173,0.0013759433,0.0021565752,0.022191025,0.028707203],"genre_scores_gemma":[0.60977745,0.0014598706,0.36365363,0.0003046733,0.0001677159,0.0019130306,0.005820265,0.0045243986,0.012379073],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575126,0.0014359773,0.0003386243,0.00046338624,0.0016838223,0.00032694382],"domain_scores_gemma":[0.9914125,0.003603924,0.0003741979,0.0014026476,0.0028842473,0.00032248156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059280084,0.0017753579,0.0014438212,0.0022591162,0.00048310522,0.001745683,0.0017508718,0.0013500436,0.015526423],"category_scores_gemma":[0.02429222,0.00032649338,0.00066019857,0.0017437463,0.0007075813,0.0023119564,0.0017856992,0.0011059353,0.0045300913],"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.0028661964,0.0008874995,0.00690193,0.0026618484,0.00031687622,0.00029575854,0.00046957296,0.12091081,0.024322562,0.021432195,0.033230513,0.7857043],"study_design_scores_gemma":[0.00023576223,0.001666646,0.0056233783,0.00035111624,0.00009154881,0.00045227076,0.0002783776,0.8734551,0.073092915,0.005576847,0.039047215,0.00012876834],"about_ca_topic_score_codex":0.0025442021,"about_ca_topic_score_gemma":0.0010067708,"teacher_disagreement_score":0.015526423,"about_ca_system_score_codex":0.0010608743,"about_ca_system_score_gemma":0.00096130354,"threshold_uncertainty_score":0.051941037},"labels":[],"label_agreement":null},{"id":"W2986717322","doi":"10.1145/3371934.3371954","title":"Reflections on \"a control-theoretic approach to flow control\"","year":2019,"lang":"en","type":"article","venue":"ACM SIGCOMM Computer Communication Review","topic":"Numerical Methods and 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 Waterloo","funders":"","keywords":"Computer science; Control (management); Flow control (data); Control flow; Flow (mathematics); Test (biology); Operations research; Industrial engineering; Telecommunications; Artificial intelligence; Programming language; Mathematics","score_opus":0.046613424821494144,"score_gpt":0.3527846151115188,"score_spread":0.30617119029002465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986717322","genre_codex":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004831965,0.0162983,0.41415188,0.4333315,0.011415542,0.00007764216,0.000170376,0.00025454652,0.1194683],"genre_scores_gemma":[0.66815245,0.041592665,0.10910929,0.07668765,0.03597353,0.00072485587,0.00023588662,0.0007199431,0.06680375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9935376,0.0028210182,0.00020901972,0.0008109399,0.0021091488,0.0005122163],"domain_scores_gemma":[0.98690015,0.008762005,0.0005644433,0.0012884535,0.0018887318,0.0005962429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013107207,0.0010015492,0.0008513924,0.0012644436,0.0027712898,0.007799366,0.004064876,0.0060381508,0.012041497],"category_scores_gemma":[0.018373748,0.000618546,0.0011809529,0.0010471895,0.026875857,0.019119259,0.0038195127,0.011774113,0.0015381309],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067754277,0.000009371667,0.000019979738,0.000021863112,0.0000024850333,0.000008548736,0.00008017935,0.0017177132,0.000033604465,0.9899442,0.0056521143,0.0025032402],"study_design_scores_gemma":[0.000013702184,0.000016068774,0.00003248115,0.000087127075,0.000002470177,0.000013062738,0.000111285255,0.0034860305,0.00022382391,0.94898564,0.047012597,0.000015698351],"about_ca_topic_score_codex":0.0054024938,"about_ca_topic_score_gemma":0.0021253303,"teacher_disagreement_score":0.013107207,"about_ca_system_score_codex":0.005994275,"about_ca_system_score_gemma":0.0038586191,"threshold_uncertainty_score":0.069318354},"labels":[],"label_agreement":null},{"id":"W2996677505","doi":"","title":"Sparse polynomial interpolation. Exploring fast heuristic algorithms over finite fields","year":2019,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Heuristic; Interpolation (computer graphics); Algorithm; Polynomial interpolation; Polynomial; Computer science; Finite field; Mathematical optimization; Mathematics; Linear interpolation; Discrete mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.03631179572215997,"score_gpt":0.2608554636284519,"score_spread":0.22454366790629193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996677505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0344311,0.002672085,0.9458231,0.00074699504,0.00014614027,0.00008913598,0.00027577896,0.0012040356,0.014611646],"genre_scores_gemma":[0.33973682,0.001453924,0.65168005,0.00023653287,0.00016852186,0.00016922549,0.000489307,0.00044077527,0.0056249434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995295,0.00018733776,0.000015063689,0.00006777377,0.00014825787,0.000052180123],"domain_scores_gemma":[0.9978563,0.0016663792,0.00010483394,0.00018818784,0.00012395294,0.000060399292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719595,0.00076832,0.00074623415,0.00092970417,0.0005068199,0.0009859186,0.001129756,0.0010690973,0.008195696],"category_scores_gemma":[0.0073771337,0.00049496617,0.0006431123,0.0017737816,0.0010398335,0.001901585,0.0011736949,0.0012582606,0.001444517],"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.0004409297,0.00017513164,0.0008424264,0.0006862339,0.000048765218,0.0000803939,0.00014912455,0.5413765,0.0025737877,0.14972506,0.009539909,0.29436183],"study_design_scores_gemma":[0.00007637931,0.000045335146,0.0000876792,0.0000368596,0.000010831072,0.000037032853,0.00003967706,0.91446173,0.00096840353,0.07973453,0.0044949627,0.0000066196008],"about_ca_topic_score_codex":0.0031863993,"about_ca_topic_score_gemma":0.004016698,"teacher_disagreement_score":0.008195696,"about_ca_system_score_codex":0.0008437708,"about_ca_system_score_gemma":0.00097633555,"threshold_uncertainty_score":0.027417362},"labels":[],"label_agreement":null},{"id":"W2997405391","doi":"10.1016/j.cam.2019.112698","title":"Parameter range reduction from partial data in systems of differential algebraic equations","year":2019,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Reduction (mathematics); Range (aeronautics); Partial differential equation; Algebraic equation; Algebraic number; Applied mathematics; Parameter space; Interval (graph theory); Series (stratigraphy); Algorithm; Mathematical analysis; Nonlinear system; Statistics; Geometry","score_opus":0.04460851064823682,"score_gpt":0.29311661962750934,"score_spread":0.24850810897927253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997405391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087303035,0.0008283446,0.8915292,0.0008587925,0.00026657953,0.0000870235,0.00023331177,0.0008703931,0.018023295],"genre_scores_gemma":[0.8310081,0.00090072665,0.1571886,0.00026870737,0.00019820363,0.00015879777,0.00049766555,0.0006288707,0.009150298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990664,0.0003145304,0.00006723205,0.00009468878,0.00037566325,0.00008141382],"domain_scores_gemma":[0.99790823,0.0012294729,0.000105185405,0.00044917836,0.00023266979,0.000075342716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010939778,0.00046705597,0.0012340795,0.0010923055,0.00077314686,0.002077235,0.0010545739,0.0007415037,0.003844238],"category_scores_gemma":[0.006880574,0.0005485475,0.0009832793,0.0007781524,0.001997783,0.0024918232,0.0037534889,0.0026656964,0.0007646806],"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.00019117905,0.00010433085,0.0012077611,0.00037310683,0.00006316469,0.00034692613,0.0007752383,0.11048453,0.0054654325,0.7575169,0.0038664353,0.11960509],"study_design_scores_gemma":[0.000026128751,0.00004236814,0.0001886952,0.00003500123,0.000017831215,0.00008313717,0.00011704646,0.3524714,0.0034849287,0.63932705,0.004181592,0.000024786901],"about_ca_topic_score_codex":0.0008650775,"about_ca_topic_score_gemma":0.000793807,"teacher_disagreement_score":0.003844238,"about_ca_system_score_codex":0.00042632307,"about_ca_system_score_gemma":0.00055283844,"threshold_uncertainty_score":0.012860239},"labels":[],"label_agreement":null},{"id":"W3004075224","doi":"","title":"HOUR(s and Hours) OF (Math +) CODE","year":2018,"lang":"ru","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Code (set theory); Programming language; Mathematics; Computer science; Set (abstract data type)","score_opus":0.03182749736907063,"score_gpt":0.3158943191478868,"score_spread":0.28406682177881615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004075224","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02705582,0.0013426869,0.17142248,0.0034104774,0.004573515,0.0011252654,0.10675497,0.33483186,0.34948295],"genre_scores_gemma":[0.1798579,0.001486208,0.18771501,0.0028905543,0.001341364,0.0022598065,0.15499055,0.14290926,0.32654935],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973469,0.00043414044,0.00017603955,0.00050638383,0.0009599859,0.00057654077],"domain_scores_gemma":[0.9922064,0.0021431306,0.00027165754,0.0017703793,0.002482113,0.0011263458],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010875325,0.00230773,0.0016059376,0.002241078,0.0008822322,0.0017702677,0.0037585977,0.0010917776,0.46348697],"category_scores_gemma":[0.010616128,0.0008740128,0.0015244408,0.0028816196,0.0006131998,0.0017876235,0.0021465193,0.0015161559,0.34128702],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001558435,0.00025043942,0.00083173305,0.00065932743,0.00009070539,0.0001662267,0.00013251309,0.010713807,0.008266105,0.0049936976,0.7548915,0.21744543],"study_design_scores_gemma":[0.002328204,0.00044324572,0.005898909,0.00028251632,0.00017508777,0.00029443213,0.00037216285,0.06473737,0.026589964,0.011168885,0.8875219,0.00018720762],"about_ca_topic_score_codex":0.010020563,"about_ca_topic_score_gemma":0.009852986,"teacher_disagreement_score":0.46348697,"about_ca_system_score_codex":0.0013815035,"about_ca_system_score_gemma":0.0021565096,"threshold_uncertainty_score":0.7652707},"labels":[],"label_agreement":null},{"id":"W3011681010","doi":"10.1109/tcsii.2020.2980531","title":"Design of Power Efficient Posit Multiplier","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":53,"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 Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multiplier (economics); Arithmetic; Computer science; Speedup; Algorithm; Mathematics; Parallel computing","score_opus":0.037269546807745836,"score_gpt":0.2528530961319673,"score_spread":0.2155835493242215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011681010","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052014623,0.0023385098,0.88561517,0.0010269773,0.0008696365,0.00057068706,0.000508917,0.004347689,0.052707918],"genre_scores_gemma":[0.61630595,0.0014473164,0.3401628,0.000798135,0.00026065475,0.000516189,0.00073251425,0.00019344482,0.03958295],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980503,0.000025973888,0.000022889284,0.000051856725,0.000063748856,0.000030520892],"domain_scores_gemma":[0.99981004,0.000023009381,0.000029785893,0.000019582672,0.0001051292,0.000012511522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020232477,0.0005437054,0.00032121813,0.000674063,0.0004485308,0.00097371306,0.0009641783,0.00041251903,0.010476453],"category_scores_gemma":[0.00049999525,0.0002685197,0.0002355552,0.00050252036,0.0002461,0.0008617891,0.0004557736,0.00036977447,0.0031705163],"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.0008930903,0.00013828285,0.0021572385,0.0011822794,0.00011793863,0.0009785064,0.00038383924,0.031808462,0.29735583,0.08559039,0.040840726,0.5385534],"study_design_scores_gemma":[0.00032715098,0.0024245554,0.0019120885,0.00029255904,0.00020429774,0.003762545,0.00026559978,0.29913238,0.35182485,0.019410854,0.32028386,0.00015915855],"about_ca_topic_score_codex":0.0005232136,"about_ca_topic_score_gemma":0.0011519574,"teacher_disagreement_score":0.010476453,"about_ca_system_score_codex":0.0006206817,"about_ca_system_score_gemma":0.0009680787,"threshold_uncertainty_score":0.035047174},"labels":[],"label_agreement":null},{"id":"W3018597471","doi":"10.1002/cpe.6270","title":"High‐performance SIMD modular arithmetic for polynomial evaluation","year":2021,"lang":"en","type":"preprint","venue":"Concurrency and Computation Practice and Experience","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"SIMD; Computer science; Parallel computing; Polynomial; Modular design; Computation; Modular arithmetic; Matrix polynomial; Compiler; Arithmetic; Mathematics; Algorithm; Programming language","score_opus":0.05114997092760116,"score_gpt":0.37793689660265356,"score_spread":0.3267869256750524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018597471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12664719,0.000813626,0.8258011,0.0007015449,0.0002726569,0.000050665254,0.0002485272,0.0030379316,0.04242674],"genre_scores_gemma":[0.79911244,0.00030819912,0.19368836,0.00009203473,0.00010453666,0.00005679409,0.0002474995,0.00025802845,0.0061320513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996611,0.000085146676,0.000016668611,0.000041122203,0.00015675588,0.000039289258],"domain_scores_gemma":[0.9995746,0.00010998338,0.000033565757,0.00014929466,0.00010276089,0.000029741614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004582408,0.00040433247,0.00030502916,0.00039869358,0.00031540293,0.00076441653,0.00050106103,0.00019799061,0.0074610705],"category_scores_gemma":[0.0013713092,0.00016470745,0.00033446698,0.000655786,0.0005991057,0.0008211002,0.0010780052,0.0007237794,0.0016189866],"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.00062986836,0.000113917835,0.0022446413,0.0003403379,0.00006492718,0.00033314902,0.000265186,0.15026507,0.07761662,0.51403785,0.018358795,0.23572962],"study_design_scores_gemma":[0.00007845729,0.00011108138,0.00057127926,0.000037462534,0.000013462816,0.00016704036,0.00004014359,0.7854954,0.041741528,0.1466753,0.025048802,0.000020058083],"about_ca_topic_score_codex":0.00036863497,"about_ca_topic_score_gemma":0.00045742057,"teacher_disagreement_score":0.0074610705,"about_ca_system_score_codex":0.00046541577,"about_ca_system_score_gemma":0.00047111395,"threshold_uncertainty_score":0.024959743},"labels":[],"label_agreement":null},{"id":"W30280942","doi":"10.1007/978-1-4614-7085-4_10","title":"Optimization of Real-Time Coding and Control Policies: Structural and Existence Results","year":2013,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Coding (social sciences); Computer science; Control (management); Chemistry; Mathematics; Artificial intelligence; Statistics","score_opus":0.01554463908515861,"score_gpt":0.24820345421000486,"score_spread":0.23265881512484626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30280942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012316437,0.0027303018,0.9390518,0.001281784,0.00017882412,0.000045524215,0.00014954856,0.00013593404,0.044109806],"genre_scores_gemma":[0.66604567,0.013901202,0.24438018,0.0008417257,0.0008537611,0.0005032267,0.0006477004,0.0008038242,0.07202264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999226,0.00022892603,0.000032747343,0.0001607484,0.00025922322,0.00009234077],"domain_scores_gemma":[0.9934083,0.0049092923,0.0005592919,0.00029498426,0.0006712104,0.0001568451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018811749,0.0020731015,0.0014286871,0.001328653,0.000640999,0.002237458,0.0016669616,0.0023366793,0.009038195],"category_scores_gemma":[0.012323732,0.0010859439,0.0011706861,0.0018844554,0.0030296075,0.004800757,0.002128508,0.0034572622,0.0011716193],"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.000077246565,0.00006750666,0.00019143047,0.00028804148,0.000030141166,0.000046415727,0.00015829301,0.24452771,0.0018459944,0.70072037,0.0051067555,0.046940073],"study_design_scores_gemma":[0.000016567828,0.000036897258,0.00017595044,0.00008183095,0.000015094907,0.000050178587,0.000035813515,0.5248992,0.00082450337,0.47129685,0.0025429318,0.00002409405],"about_ca_topic_score_codex":0.0022306077,"about_ca_topic_score_gemma":0.0017651351,"teacher_disagreement_score":0.009038195,"about_ca_system_score_codex":0.0020497348,"about_ca_system_score_gemma":0.0019831113,"threshold_uncertainty_score":0.030235708},"labels":[],"label_agreement":null},{"id":"W30299302","doi":"10.1097/mat.0000000000000892","title":"Improved MDLNS Number System Addition and Subtraction by Use of the Novel Co- Transformation","year":2012,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Windsor","funders":"","keywords":"Transformation (genetics); Computer science; Subtraction; Mathematics; Arithmetic; Chemistry","score_opus":0.027980252807517068,"score_gpt":0.2722321824950851,"score_spread":0.244251929687568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30299302","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035933495,0.0005149712,0.9397264,0.0002915694,0.00039893846,0.00009766185,0.00026592193,0.0045325356,0.018238453],"genre_scores_gemma":[0.25161856,0.00032932774,0.7319038,0.00020956185,0.00014404267,0.00015809406,0.0007727882,0.00046031142,0.01440353],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990996,0.00012519091,0.00008168546,0.00016181821,0.00046322474,0.00006854952],"domain_scores_gemma":[0.9989391,0.00020008037,0.00007575163,0.00039822506,0.00035044877,0.000036376372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040882925,0.00057664333,0.000657544,0.0010967641,0.0007190168,0.001403582,0.0013287473,0.00033372518,0.008487807],"category_scores_gemma":[0.0021986722,0.00025989363,0.00059574336,0.0017668776,0.00063457707,0.0023721692,0.0014950173,0.0009274389,0.0037083537],"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.0005656478,0.00014283537,0.0014972797,0.0003047576,0.000036285674,0.00027678892,0.00024526945,0.024343943,0.063120574,0.13058658,0.014391167,0.7644889],"study_design_scores_gemma":[0.00017687886,0.0005541822,0.0012110018,0.000075032876,0.00007837138,0.0016244365,0.00018996977,0.50956064,0.23373005,0.08679491,0.16588874,0.000115819756],"about_ca_topic_score_codex":0.0009463419,"about_ca_topic_score_gemma":0.0014802761,"teacher_disagreement_score":0.008487807,"about_ca_system_score_codex":0.000783758,"about_ca_system_score_gemma":0.0012664426,"threshold_uncertainty_score":0.02839458},"labels":[],"label_agreement":null},{"id":"W3033979988","doi":"10.1016/j.parco.2020.102663","title":"AIR: Iterative refinement acceleration using arbitrary dynamic precision","year":2020,"lang":"en","type":"article","venue":"Parallel Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Iterative refinement; Computer science; Algorithm; Granularity; Iterative method; Acceleration; Double-precision floating-point format; Arbitrary-precision arithmetic; Floating point","score_opus":0.058257262045882184,"score_gpt":0.32999513388837365,"score_spread":0.2717378718424915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033979988","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048377146,0.00028563672,0.9662061,0.00017154221,0.0005223075,0.00007979257,0.00027983807,0.014667306,0.012949674],"genre_scores_gemma":[0.10673672,0.0003141173,0.86538607,0.00025536556,0.0001546646,0.0002342231,0.0009271202,0.0058707865,0.020120887],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991516,0.00014034743,0.00003835561,0.00008744766,0.0004986829,0.000083555344],"domain_scores_gemma":[0.9989661,0.00031736988,0.000046487385,0.00031091427,0.00028737407,0.00007185914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007630847,0.0012158002,0.0008617357,0.0009916433,0.0006740399,0.0011561755,0.0022953225,0.0009249877,0.023348158],"category_scores_gemma":[0.003369998,0.00062804046,0.000773043,0.0012568561,0.00073393225,0.0014620605,0.0026681316,0.0025394654,0.007468829],"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.0011731188,0.00019049598,0.0011268863,0.0006911052,0.00019320323,0.00026702936,0.0004250617,0.10815545,0.022919072,0.11354751,0.07685387,0.6744572],"study_design_scores_gemma":[0.00027754516,0.00014697234,0.00039523,0.00009372167,0.0000577971,0.00020082263,0.000055958797,0.86873037,0.025249904,0.031096874,0.07363851,0.000056306446],"about_ca_topic_score_codex":0.0027294608,"about_ca_topic_score_gemma":0.0043807602,"teacher_disagreement_score":0.023348158,"about_ca_system_score_codex":0.00046479105,"about_ca_system_score_gemma":0.0009986669,"threshold_uncertainty_score":0.07810736},"labels":[],"label_agreement":null},{"id":"W3088805374","doi":"10.1080/00029890.2020.1793635","title":"l’Hôpital’s Rule for Multivariable Functions","year":2020,"lang":"en","type":"article","venue":"American Mathematical Monthly","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Multivariable calculus; Zero (linguistics); Indeterminate; Mathematics; Variable (mathematics); Calculus (dental); Variety (cybernetics); Quotient; Pure mathematics; Philosophy; Mathematical analysis; Medicine; Engineering; Statistics","score_opus":0.027600597603742012,"score_gpt":0.28299147808842745,"score_spread":0.25539088048468545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088805374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013559939,0.0015270135,0.85090345,0.00340075,0.0021666633,0.00010358657,0.00022979209,0.0006568518,0.12745197],"genre_scores_gemma":[0.45251375,0.0023209099,0.48185727,0.004072248,0.0019306785,0.00038174045,0.0002191802,0.0010315657,0.055672508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974993,0.00071521377,0.00016850233,0.0004792493,0.0008613791,0.00027634128],"domain_scores_gemma":[0.9980724,0.0007640694,0.00007189378,0.0003444385,0.0006439729,0.00010330377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040745954,0.0005547207,0.0006499645,0.0016180173,0.001961065,0.0033115805,0.0013622988,0.0012214135,0.004562043],"category_scores_gemma":[0.008925228,0.0004146421,0.0012248369,0.0007780304,0.005798732,0.0060803834,0.0027081114,0.004634907,0.0025060473],"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.000013768472,0.000007618806,0.00011741243,0.000027649347,0.0000060859666,0.00012501111,0.00024979684,0.00029863004,0.00063572003,0.97823375,0.004344269,0.015940322],"study_design_scores_gemma":[0.000013211471,0.000022499762,0.0001277897,0.00003970158,0.00001102141,0.00020788655,0.000079271405,0.0028687539,0.0022899145,0.9312136,0.063096866,0.000029424193],"about_ca_topic_score_codex":0.0014817211,"about_ca_topic_score_gemma":0.0014762769,"teacher_disagreement_score":0.004562043,"about_ca_system_score_codex":0.0009050735,"about_ca_system_score_gemma":0.00079486676,"threshold_uncertainty_score":0.021548748},"labels":[],"label_agreement":null},{"id":"W3092128573","doi":"10.1007/s40435-020-00702-2","title":"A global optimization approach for sliding mode tuning and existence maps generation","year":2020,"lang":"en","type":"article","venue":"International Journal of Dynamics and Control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Agencia Nacional de Promoción de la Investigación, el Desarrollo Tecnológico y la Innovación; Universidad Nacional de La Plata; Direction Générale de l’Armement; Consejo Nacional de Investigaciones Científicas y Técnicas","keywords":"Control theory (sociology); A priori and a posteriori; Sizing; Context (archaeology); Mode (computer interface); Nonlinear system; Global optimization; Interval (graph theory); Series (stratigraphy); Computer science; Sliding mode control; Power (physics); Mathematical optimization; Control (management); Mathematics; Artificial intelligence","score_opus":0.0236990048038738,"score_gpt":0.2865947986139553,"score_spread":0.2628957938100815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092128573","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010139676,0.000042518794,0.99761945,0.000023628605,0.000014576595,0.000014015167,0.0000064191877,0.000079100595,0.0011862981],"genre_scores_gemma":[0.31280947,0.00032766926,0.6761745,0.00014057047,0.00009906066,0.00039240986,0.00013717673,0.0003740616,0.009545041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99969983,0.0000771726,0.000018869263,0.00007375302,0.00010181781,0.000028704057],"domain_scores_gemma":[0.9995022,0.00025652166,0.000034432407,0.000053621563,0.00013188936,0.00002129112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092086487,0.0010891074,0.001390456,0.0008658523,0.00061205274,0.0009855378,0.0010491152,0.0013140003,0.005159762],"category_scores_gemma":[0.0015625152,0.0006278833,0.0011175175,0.0005206771,0.0007647007,0.00093281065,0.0016785564,0.0012745908,0.0008508782],"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.00006897752,0.000058671645,0.00016828996,0.0001615411,0.00006687227,0.00006277529,0.00011525131,0.822835,0.008278306,0.03940998,0.0017713761,0.12700284],"study_design_scores_gemma":[0.0000033736803,0.000025788198,0.000030929405,0.000005767189,0.00000566538,0.000010675285,0.0000051331335,0.99537224,0.00043096507,0.0036491635,0.0004560282,0.0000043050477],"about_ca_topic_score_codex":0.0016196396,"about_ca_topic_score_gemma":0.0017539557,"teacher_disagreement_score":0.005159762,"about_ca_system_score_codex":0.00040787805,"about_ca_system_score_gemma":0.00077701826,"threshold_uncertainty_score":0.017261147},"labels":[],"label_agreement":null},{"id":"W3106655363","doi":"10.1016/j.jcin.2020.10.043","title":"When Something Can Be Worse Than Failing","year":2020,"lang":"en","type":"letter","venue":"JACC: Cardiovascular Interventions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"London Health Sciences Centre; Western University","funders":"","keywords":"Psychology","score_opus":0.07610198946987051,"score_gpt":0.30331776423431195,"score_spread":0.22721577476444144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106655363","genre_codex":"commentary","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023375792,0.0010782679,0.00043221822,0.98411417,0.009446449,0.0000040156233,0.000027039709,0.000027440416,0.0046366556],"genre_scores_gemma":[0.009913132,0.0016591763,0.0010627825,0.9318763,0.04921342,0.000034504057,0.000036548103,0.0000808503,0.0061232797],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9932382,0.0029064203,0.0006010818,0.00053009606,0.0019979153,0.0007261375],"domain_scores_gemma":[0.96694136,0.023129962,0.0014250228,0.0012764226,0.0031256091,0.0041016145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00856347,0.0005396149,0.0011687964,0.0008427178,0.0038406532,0.0061568976,0.0008892793,0.026784455,0.011346946],"category_scores_gemma":[0.08755134,0.00036299438,0.0008839159,0.00064541085,0.00578319,0.004871692,0.0024340614,0.033044253,0.00870702],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060752987,0.000025343204,0.0007255014,0.000057859284,0.000015877002,0.00044350282,0.00012411528,0.00009725259,0.00006233194,0.02173352,0.95374024,0.02291373],"study_design_scores_gemma":[0.00012390141,0.00006396549,0.0010322937,0.0007571662,0.00002940739,0.002398547,0.0007432584,0.0009600833,0.00016619035,0.28041375,0.71324384,0.00006746058],"about_ca_topic_score_codex":0.0025768713,"about_ca_topic_score_gemma":0.0050604357,"teacher_disagreement_score":0.026784455,"about_ca_system_score_codex":0.0031501662,"about_ca_system_score_gemma":0.0038324362,"threshold_uncertainty_score":0.045288503},"labels":[],"label_agreement":null},{"id":"W3114299204","doi":"10.1016/j.heliyon.2021.e07442","title":"Integer division by constants: optimal bounds","year":2021,"lang":"en","type":"preprint","venue":"Heliyon","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Remainder; Quotient; Divisor (algebraic geometry); Division (mathematics); Integer (computer science); Mathematics; Combinatorics; Constant (computer programming); Discrete mathematics; Computation; Arithmetic; Computer science; Algorithm","score_opus":0.019943574410049132,"score_gpt":0.2998659197484796,"score_spread":0.27992234533843047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114299204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02269009,0.018996073,0.79382163,0.005554829,0.0014008214,0.000280795,0.0010410944,0.0028271354,0.15338746],"genre_scores_gemma":[0.45851398,0.014453217,0.48775384,0.0035292793,0.0021822706,0.00071264704,0.0018628552,0.0036371334,0.02735483],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98543674,0.003203427,0.00069764885,0.0022137682,0.0056190374,0.0028294255],"domain_scores_gemma":[0.9745746,0.01612729,0.0011641114,0.005829354,0.0016336662,0.00067089207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009240116,0.0037216893,0.002491303,0.004310572,0.0024409925,0.009363654,0.004188375,0.0026296482,0.02311831],"category_scores_gemma":[0.0593006,0.0015204765,0.0019035401,0.008225685,0.005711429,0.022976503,0.007961035,0.010118589,0.0090281],"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.0011554393,0.00029836906,0.0013791249,0.00096208043,0.00013001445,0.00013157738,0.0004762652,0.040242497,0.0058158683,0.711717,0.031406704,0.20628498],"study_design_scores_gemma":[0.00009414335,0.0000869916,0.00041760385,0.0003205187,0.00013111284,0.00018480355,0.0001636098,0.082615,0.009948808,0.8777638,0.028223056,0.00005061372],"about_ca_topic_score_codex":0.0023586908,"about_ca_topic_score_gemma":0.0034371188,"teacher_disagreement_score":0.02311831,"about_ca_system_score_codex":0.005489332,"about_ca_system_score_gemma":0.003578321,"threshold_uncertainty_score":0.07733846},"labels":[],"label_agreement":null},{"id":"W3116903618","doi":"10.12697/acutm.2011.15.04","title":"Polynomial expansions via embedded Pascal’s triangles","year":2011,"lang":"en","type":"article","venue":"Acta et Commentationes Universitatis Tartuensis de Mathematica","topic":"Numerical Methods and Algorithms","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":"Western University","funders":"","keywords":"Monomial; Mathematics; Pascal (unit); Symbolic computation; Binomial coefficient; Combinatorics; Extension (predicate logic); Computation; Polynomial; Row; Algebra over a field; Pure mathematics; Algorithm; Mathematical analysis; Computer science","score_opus":0.0452933026454616,"score_gpt":0.28123519166350475,"score_spread":0.23594188901804314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116903618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034046695,0.00036641493,0.8976749,0.00035846824,0.0003121436,0.00010866051,0.00017353767,0.0006607796,0.066298366],"genre_scores_gemma":[0.37824777,0.00067635445,0.5880357,0.0002873518,0.00027049714,0.00022929716,0.0003743652,0.00081871095,0.031060016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868566,0.00041776354,0.00004272508,0.00015201073,0.0005509553,0.00015085065],"domain_scores_gemma":[0.9991628,0.0004105638,0.0000562731,0.00015051135,0.00017619482,0.00004381676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010066547,0.00059072056,0.0005660998,0.0013837406,0.00070392847,0.0013257413,0.0012147635,0.00065783237,0.014610301],"category_scores_gemma":[0.0057758004,0.0003951024,0.0006913557,0.001336861,0.001660679,0.0018395459,0.0018768144,0.0016992983,0.0043656947],"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.00005934709,0.000029009983,0.00020234405,0.00008142276,0.000008233091,0.00021701185,0.00034155085,0.017863074,0.0032393362,0.90993035,0.0041868244,0.06384147],"study_design_scores_gemma":[0.00003355878,0.00006734314,0.00015644988,0.00006029581,0.000010086748,0.0003628941,0.00014513682,0.21840453,0.0054227896,0.7188509,0.056449097,0.00003684586],"about_ca_topic_score_codex":0.0011007938,"about_ca_topic_score_gemma":0.0016062068,"teacher_disagreement_score":0.014610301,"about_ca_system_score_codex":0.00059920485,"about_ca_system_score_gemma":0.00045226625,"threshold_uncertainty_score":0.048876286},"labels":[],"label_agreement":null},{"id":"W3124418772","doi":"10.1109/itc44778.2020.9325274","title":"A Unified Method of Designing Signature Analyzers for Digital and Mixed-Signal Circuits Testing","year":2020,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ryerson University","keywords":"Computer science; Aliasing; Signature (topology); Digital signature; Cryptography; Simple (philosophy); Computer hardware; Computer engineering; Coding (social sciences); Electronic circuit; Algorithm; Theoretical computer science; Mathematics; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.06128384308820082,"score_gpt":0.3006648045891169,"score_spread":0.23938096150091606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124418772","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009416492,0.00005700742,0.99711764,0.000027766535,0.00003529851,0.00006600998,0.000017797158,0.0003943845,0.0013424793],"genre_scores_gemma":[0.045319483,0.00014776306,0.95193076,0.00008692641,0.00005312347,0.0002716641,0.0000833036,0.00012119596,0.0019857713],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849904,0.00028741016,0.00012606136,0.00025340478,0.00074105494,0.000092992246],"domain_scores_gemma":[0.99919516,0.0001492138,0.000077192366,0.0002185575,0.00032646037,0.000033450746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004193,0.0014248082,0.0009327618,0.0020721417,0.0006612092,0.0016896245,0.0016129368,0.000769135,0.00419789],"category_scores_gemma":[0.0020864964,0.0006200159,0.0007245989,0.0009961402,0.0012420074,0.0019782155,0.0011063041,0.00161491,0.0021676156],"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.00020364406,0.00017426575,0.0005785563,0.00047943217,0.000115279545,0.000251786,0.00026162784,0.015519403,0.21672136,0.34374404,0.004832484,0.41711816],"study_design_scores_gemma":[0.0002623241,0.0014103777,0.00077698263,0.00021135056,0.00024407238,0.0025545484,0.00014030767,0.32228443,0.40128586,0.14311536,0.12741534,0.00029900437],"about_ca_topic_score_codex":0.00030122572,"about_ca_topic_score_gemma":0.0005136832,"teacher_disagreement_score":0.00419789,"about_ca_system_score_codex":0.0006253729,"about_ca_system_score_gemma":0.0010197024,"threshold_uncertainty_score":0.014043331},"labels":[],"label_agreement":null},{"id":"W3125503078","doi":"10.1002/spe.2984","title":"Number parsing at a gigabyte per second","year":2021,"lang":"en","type":"preprint","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Decimal; Computer science; Parsing; Arithmetic; IEEE floating point; Bottleneck; Floating point; Binary number; Software; Algorithm; Mathematics; Operating system; Programming language; Embedded system","score_opus":0.027065916225519984,"score_gpt":0.33769450273096907,"score_spread":0.3106285865054491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125503078","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020426968,0.0010785701,0.6439728,0.0015034406,0.0019562594,0.00027035267,0.00977477,0.26651123,0.054505628],"genre_scores_gemma":[0.2151141,0.00091463694,0.65269774,0.0011994287,0.0005282,0.00047624766,0.031998783,0.026073134,0.0709977],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796295,0.00021489614,0.00020637624,0.00047393554,0.0009303216,0.00021150094],"domain_scores_gemma":[0.996653,0.00077112817,0.00017260094,0.0010924434,0.0011648657,0.00014599289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010689975,0.0016534509,0.0010947682,0.0027099447,0.0010695782,0.004232982,0.0018485519,0.0012743294,0.055063438],"category_scores_gemma":[0.009635409,0.00081368943,0.00070984056,0.002913242,0.00065834785,0.0040582833,0.0022098739,0.0016442005,0.042464126],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009165793,0.000114832364,0.0021595387,0.00042116124,0.00007647982,0.000627008,0.0004019707,0.007908079,0.025823232,0.0567649,0.37433085,0.53045547],"study_design_scores_gemma":[0.00017603216,0.00011586781,0.002420478,0.0002486511,0.00005229988,0.00073541165,0.00028790376,0.15226826,0.10755589,0.11814623,0.6178109,0.00018208896],"about_ca_topic_score_codex":0.002561329,"about_ca_topic_score_gemma":0.0018867942,"teacher_disagreement_score":0.055063438,"about_ca_system_score_codex":0.0010497615,"about_ca_system_score_gemma":0.001564969,"threshold_uncertainty_score":0.18420559},"labels":[],"label_agreement":null},{"id":"W3133741379","doi":"10.1109/synasc51798.2020.00018","title":"Approximate GCD in Lagrange bases","year":2020,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monomial; Basis (linear algebra); Eigenvalues and eigenvectors; Polynomial; Lagrange polynomial; Matrix (chemical analysis); Computation; Polynomial matrix; Gröbner basis; Applied mathematics; Difference polynomials; Combinatorics; Algebra over a field; Discrete mathematics; Orthogonal polynomials; Algorithm; Pure mathematics; Matrix polynomial; Mathematical analysis","score_opus":0.04444588995579091,"score_gpt":0.27106900194536193,"score_spread":0.22662311198957102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133741379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027736476,0.0002055628,0.96832746,0.00012501008,0.00006691868,0.000043101496,0.000054668348,0.00023422875,0.0032065555],"genre_scores_gemma":[0.25374618,0.00028763406,0.740615,0.000105159146,0.00006620847,0.00011716011,0.00023648945,0.00018057947,0.0046455595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988575,0.0003747153,0.000051799972,0.00020828776,0.00036147507,0.0001461928],"domain_scores_gemma":[0.99884003,0.0005536854,0.00013228339,0.00020783194,0.00019178007,0.00007436947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017201926,0.00084087334,0.0010302656,0.001419024,0.00070040167,0.0013558794,0.00086512533,0.0009561113,0.003780433],"category_scores_gemma":[0.007981966,0.0004955208,0.0008010654,0.0013416288,0.0015186166,0.002649461,0.0026640391,0.0016259955,0.0013579632],"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.0004435853,0.0000972607,0.0027321423,0.000268294,0.00006281036,0.0004892947,0.00059038505,0.16769898,0.01055464,0.570797,0.004540401,0.24172522],"study_design_scores_gemma":[0.00005192595,0.00013943829,0.00029017316,0.00005468836,0.000016895774,0.00031121031,0.0001758377,0.73910844,0.008445645,0.24255958,0.008808943,0.00003733201],"about_ca_topic_score_codex":0.0013325454,"about_ca_topic_score_gemma":0.0013277719,"teacher_disagreement_score":0.003780433,"about_ca_system_score_codex":0.0007430253,"about_ca_system_score_gemma":0.0010615162,"threshold_uncertainty_score":0.012646794},"labels":[],"label_agreement":null},{"id":"W3137311011","doi":"10.48550/arxiv.2103.13949","title":"Approximate GCD in Lagrange bases","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Basis (linear algebra); Eigenvalues and eigenvectors; Monomial; Polynomial; Lagrange polynomial; Matrix (chemical analysis); Computation; Polynomial matrix; Applied mathematics; Gröbner basis; Combinatorics; Algebra over a field; Discrete mathematics; Pure mathematics; Matrix polynomial; Algorithm; Mathematical analysis","score_opus":0.09662659302102211,"score_gpt":0.208398435864334,"score_spread":0.11177184284331187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137311011","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02871962,0.00019965695,0.96718115,0.00013377873,0.00006651186,0.00004531128,0.00005938059,0.00024367667,0.0033508916],"genre_scores_gemma":[0.25222877,0.00026875493,0.74175805,0.00011029123,0.00006626602,0.00013510535,0.00025305766,0.0001955189,0.0049841106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988207,0.0004087859,0.00005227307,0.00021525753,0.0003574704,0.00014549434],"domain_scores_gemma":[0.99871886,0.0006265132,0.00014072027,0.00023483357,0.00020119893,0.00007788777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017335371,0.0008424372,0.0010193149,0.0014161175,0.00072219264,0.0013995063,0.00091006904,0.0010072605,0.003986634],"category_scores_gemma":[0.008766288,0.0005096547,0.0008322468,0.0013389718,0.0015603862,0.00260234,0.002942021,0.0016636257,0.0013643937],"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.0004361654,0.00009936872,0.0030226014,0.00026066863,0.00006681641,0.0004512536,0.0006087171,0.1813698,0.008500147,0.5704999,0.00449492,0.23018968],"study_design_scores_gemma":[0.00005157617,0.00012101131,0.00026912146,0.000051775864,0.000016335467,0.0002531884,0.00016175369,0.7295875,0.0065217833,0.25494736,0.007986309,0.00003232301],"about_ca_topic_score_codex":0.0014041616,"about_ca_topic_score_gemma":0.0014007724,"teacher_disagreement_score":0.003986634,"about_ca_system_score_codex":0.00076970947,"about_ca_system_score_gemma":0.0010367241,"threshold_uncertainty_score":0.013336599},"labels":[],"label_agreement":null},{"id":"W3137786380","doi":"10.1049/cdt2.12019","title":"Fast and low‐power leading‐one detectors for energy‐efficient logarithmic computing","year":2021,"lang":"en","type":"article","venue":"IET Computers & Digital Techniques","topic":"Numerical Methods and Algorithms","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":"University of Alberta","funders":"","keywords":"Logarithm; Multiplexer; Computation; Multiplier (economics); Binary number; Detector; Algorithm; Multiplication (music); Computer science; Scaling; Arithmetic; Mathematics; Parallel computing; Multiplexing; Combinatorics; Mathematical analysis","score_opus":0.012124931183356386,"score_gpt":0.25848350127571584,"score_spread":0.24635857009235945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3137786380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042617846,0.0011339559,0.94011724,0.00041252165,0.0002027284,0.000074861084,0.00007117821,0.0017535992,0.013616072],"genre_scores_gemma":[0.63634974,0.0005136288,0.35214263,0.00035984232,0.00007470686,0.00009528464,0.00008673763,0.000103462466,0.010274027],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.999624,0.000089303525,0.000022043252,0.00005795678,0.00015567357,0.000051019575],"domain_scores_gemma":[0.9994981,0.00021151683,0.000061792765,0.000077411605,0.00012343799,0.000027680828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048751337,0.00051284,0.0003263583,0.00063091866,0.00043324064,0.001152076,0.00095981825,0.00036704136,0.0045404527],"category_scores_gemma":[0.001723731,0.00021624178,0.00022808656,0.00059484947,0.0005994173,0.0013541211,0.00071761763,0.00086047826,0.0010943776],"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.0010117291,0.00025011235,0.0022954775,0.00045609113,0.000054314878,0.0004262909,0.0002985932,0.07389732,0.19964607,0.20749843,0.0108095845,0.5033559],"study_design_scores_gemma":[0.0001063381,0.00041704523,0.0004641877,0.000088296474,0.000035177723,0.00037431158,0.00006280037,0.775093,0.14677303,0.041530866,0.03498873,0.00006616646],"about_ca_topic_score_codex":0.00067814137,"about_ca_topic_score_gemma":0.0015760042,"teacher_disagreement_score":0.0045404527,"about_ca_system_score_codex":0.00095226115,"about_ca_system_score_gemma":0.0009042705,"threshold_uncertainty_score":0.01518929},"labels":[],"label_agreement":null},{"id":"W3145632036","doi":"10.1109/iccad.2010.5654270","title":"Analysis of precision for scaling the intermediate variables in fixed-point arithmetic circuits","year":2010,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Robustness (evolution); Polynomial; Scaling; Fixed-point arithmetic; Algorithm; Computation; Mathematics; Fixed point; Set (abstract data type); Computer science; Electronic circuit; Floating point; Arithmetic","score_opus":0.018511695251513815,"score_gpt":0.30015418394928134,"score_spread":0.28164248869776753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3145632036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026461672,0.0008070531,0.96904176,0.00012889657,0.000042909323,0.00003736572,0.000019645862,0.00041899757,0.0030416094],"genre_scores_gemma":[0.696808,0.0011269808,0.2998451,0.000115149196,0.00009093142,0.00010746882,0.000068030284,0.00020422082,0.0016340868],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979849,0.00035280007,0.000091127535,0.00020425845,0.0012540814,0.000112908885],"domain_scores_gemma":[0.9969695,0.0017681826,0.0002986594,0.000579715,0.00035548527,0.000028434117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016444003,0.0010930847,0.0006531607,0.0009872885,0.000493501,0.000992354,0.00090915296,0.00054554775,0.0015989275],"category_scores_gemma":[0.008581614,0.00036686487,0.00067623943,0.00074570195,0.00097143353,0.001794295,0.0008716945,0.0013382343,0.0002925232],"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.0005512272,0.00005924979,0.0012578596,0.0005368091,0.00011841525,0.00035837648,0.00033056855,0.39310429,0.16192482,0.16801415,0.0011175985,0.27262673],"study_design_scores_gemma":[0.00004529868,0.00037642865,0.0006825281,0.00014746812,0.000097099815,0.00030971027,0.000041059637,0.816363,0.112162665,0.061895568,0.007822507,0.000056630583],"about_ca_topic_score_codex":0.0004220112,"about_ca_topic_score_gemma":0.00045967646,"teacher_disagreement_score":0.0016444003,"about_ca_system_score_codex":0.0009574741,"about_ca_system_score_gemma":0.00063839724,"threshold_uncertainty_score":0.008696556},"labels":[],"label_agreement":null},{"id":"W3151060349","doi":"10.5206/mt.v3i1.14661","title":"How to hunt wild constants","year":2023,"lang":"en","type":"preprint","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Limit (mathematics); Computer science; Float (project management); Calculator; Inverse trigonometric functions; Software; Symbolic computation; Conjecture; Constant (computer programming); Inverse; Computation; Series (stratigraphy); Point (geometry); Function (biology); Theoretical computer science; Discrete mathematics; Algorithm; Mathematics; Programming language; Mathematical analysis","score_opus":0.0668388024161281,"score_gpt":0.3085335090658384,"score_spread":0.24169470664971027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3151060349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0406306,0.0040996657,0.77636796,0.021897502,0.0035997313,0.00017892811,0.0004471307,0.009599498,0.14317898],"genre_scores_gemma":[0.36002004,0.0033969525,0.52003896,0.0066250945,0.00090910064,0.0003219292,0.0008365688,0.0067266626,0.10112473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99795014,0.00051107584,0.00011903597,0.00042025262,0.0007645103,0.00023500598],"domain_scores_gemma":[0.99354917,0.0032446976,0.0002341321,0.0017750775,0.0008870501,0.00030988432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002842311,0.000869637,0.0010154239,0.001786023,0.002655156,0.0053352867,0.0021220925,0.0019774758,0.03930457],"category_scores_gemma":[0.022409307,0.0008337303,0.0011090074,0.0012676977,0.0061069117,0.016018292,0.0049021062,0.004875827,0.014792008],"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.00013923069,0.00006374233,0.0008987571,0.00020203595,0.000032830267,0.0002056366,0.0011016949,0.0046223784,0.0028641978,0.7954286,0.053604946,0.14083597],"study_design_scores_gemma":[0.000038297738,0.000041913238,0.00013425546,0.00018734278,0.000023624858,0.00025455933,0.00047124366,0.018592734,0.0043394375,0.8015882,0.1742744,0.000054013566],"about_ca_topic_score_codex":0.0022764455,"about_ca_topic_score_gemma":0.0016839571,"teacher_disagreement_score":0.03930457,"about_ca_system_score_codex":0.0012301033,"about_ca_system_score_gemma":0.0013475809,"threshold_uncertainty_score":0.13148695},"labels":[],"label_agreement":null},{"id":"W3157983286","doi":"10.18280/mmep.080207","title":"An Efficient VLSI Architecture Design of Antilogarithm Converter with 10-Regions Error Correction Scheme","year":2021,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Very-large-scale integration; Converters; Computer science; Digital signal processing; Compiler; Signal processing; MATLAB; Error detection and correction; Computer hardware; Computer engineering; Arithmetic; Electronic engineering; Embedded system; Algorithm; Mathematics; Voltage; Engineering; Electrical engineering","score_opus":0.03079870109555168,"score_gpt":0.23797992601217438,"score_spread":0.2071812249166227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157983286","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14905033,0.0034516833,0.7831658,0.0007614701,0.00069502415,0.0004030559,0.000477854,0.0053975056,0.056597374],"genre_scores_gemma":[0.7958378,0.0009005092,0.18083517,0.00033765848,0.0000896939,0.00015835803,0.00043678336,0.00012266006,0.021281444],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99975353,0.00003605354,0.000021287804,0.000054131342,0.00010184231,0.000033048043],"domain_scores_gemma":[0.9998461,0.000021039976,0.000018559147,0.000023001432,0.00008382076,0.0000074203062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001830401,0.00032554351,0.00029708253,0.00040333558,0.00030397475,0.0008835988,0.0011748116,0.00038631522,0.0069681997],"category_scores_gemma":[0.00029016804,0.00017540122,0.00026138214,0.00032301247,0.00013360652,0.000651819,0.0001968133,0.0003658651,0.0018438507],"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.00096383324,0.00032720173,0.00256101,0.001177133,0.00022220508,0.0012719457,0.00048196875,0.049753997,0.45050725,0.043535516,0.020675436,0.42852247],"study_design_scores_gemma":[0.00023877126,0.00200487,0.0021499745,0.00016763006,0.00019204554,0.0036154664,0.00018140937,0.35455677,0.47044352,0.0084921215,0.15785776,0.0000996419],"about_ca_topic_score_codex":0.00093573076,"about_ca_topic_score_gemma":0.0015455502,"teacher_disagreement_score":0.0069681997,"about_ca_system_score_codex":0.0005187339,"about_ca_system_score_gemma":0.0006927543,"threshold_uncertainty_score":0.02331096},"labels":[],"label_agreement":null},{"id":"W3158271463","doi":"10.1109/iscas51556.2021.9401213","title":"Efficient Multiple-Precision Posit Multiplier","year":2021,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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 Saskatchewan","funders":"","keywords":"Multiplier (economics); Computer science; Computation; Architecture; Computer architecture; Parallel computing; Computer engineering; Algorithm","score_opus":0.017923194034822343,"score_gpt":0.27863330335093495,"score_spread":0.2607101093161126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3158271463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1369119,0.002641257,0.7965041,0.0007305622,0.00076504383,0.00025588687,0.0004763221,0.0047336277,0.056981284],"genre_scores_gemma":[0.6924235,0.00096846063,0.2800046,0.000391843,0.00017164777,0.00017270952,0.00066891493,0.0001269251,0.025071356],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997545,0.000028015695,0.000022948101,0.00005753526,0.000103239436,0.00003372615],"domain_scores_gemma":[0.99970055,0.00003647534,0.000037940943,0.00005394707,0.00015380788,0.000017363805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002695611,0.0005049774,0.00037738905,0.00080446876,0.0005265651,0.00092540786,0.0010299614,0.00036998128,0.009289782],"category_scores_gemma":[0.0008317956,0.00024638313,0.00027452924,0.0007890351,0.0003330612,0.0014035212,0.0007755902,0.00047381094,0.0023899875],"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.0012704827,0.00012159857,0.0027804964,0.0006990718,0.00006827133,0.0006343871,0.00025372894,0.031351488,0.20310186,0.1410611,0.024363084,0.59429437],"study_design_scores_gemma":[0.0003171697,0.0017782357,0.0024918916,0.00021473353,0.00015988215,0.0027540366,0.00022143628,0.38239792,0.3712535,0.042787664,0.19542828,0.0001952895],"about_ca_topic_score_codex":0.00043818908,"about_ca_topic_score_gemma":0.0013901567,"teacher_disagreement_score":0.009289782,"about_ca_system_score_codex":0.00054113584,"about_ca_system_score_gemma":0.0010482075,"threshold_uncertainty_score":0.031077385},"labels":[],"label_agreement":null},{"id":"W3173842498","doi":"","title":"Low-Precision Training in Logarithmic Number System using Multiplicative Weight Update","year":2021,"lang":"en","type":"preprint","venue":"CaltechAUTHORS (California Institute of Technology)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Semtech (Canada)","funders":"Nvidia; California Institute of Technology","keywords":"Computer science; Madam; Multiplicative function; Algorithm; Quantization (signal processing); Overhead (engineering); Convolutional neural network; Computer engineering; Artificial intelligence; Mathematics","score_opus":0.03206347963469536,"score_gpt":0.30419752982388604,"score_spread":0.2721340501891907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173842498","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030699447,0.0007486203,0.95460296,0.00041848686,0.0002456049,0.00009371466,0.00009692621,0.005825525,0.0072686654],"genre_scores_gemma":[0.52155846,0.0004496871,0.46603113,0.00069974764,0.00011970876,0.00029051263,0.00032598627,0.0005052632,0.010019477],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994622,0.00007018492,0.00004975727,0.00016327092,0.00020106678,0.000053474596],"domain_scores_gemma":[0.9994506,0.00016612557,0.00007510135,0.00011862951,0.00015764475,0.00003189805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005774843,0.0009546557,0.00053117133,0.00039915298,0.000350311,0.0010734192,0.0018408168,0.0006652618,0.0064571267],"category_scores_gemma":[0.0028309464,0.0003941568,0.00035756108,0.00043021044,0.0005991868,0.0017384547,0.0009636713,0.001428624,0.002317845],"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.0005877018,0.00022949769,0.0022171608,0.00043465762,0.000083004095,0.00032081341,0.00027393873,0.26249433,0.07365811,0.025459835,0.013644721,0.62059635],"study_design_scores_gemma":[0.000056717683,0.00016467289,0.000313259,0.000044165878,0.000026786633,0.00012880642,0.000027948949,0.95435536,0.029562974,0.005926133,0.009371123,0.00002199952],"about_ca_topic_score_codex":0.0018848411,"about_ca_topic_score_gemma":0.004579632,"teacher_disagreement_score":0.0064571267,"about_ca_system_score_codex":0.0007124606,"about_ca_system_score_gemma":0.00091562513,"threshold_uncertainty_score":0.0216012},"labels":[],"label_agreement":null},{"id":"W3199119351","doi":"10.5206/mt.v3i1.14591","title":"Arbitrary-precision computation of the gamma function","year":2023,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Precomputation; Digamma function; Algebraic number; Function (biology); Computation; Computer science; Algorithm; Cover (algebra); Mathematics; Arbitrary-precision arithmetic; Gamma function; Incomplete gamma function; Riemann zeta function; Pure mathematics; Mathematical analysis","score_opus":0.02362472644781519,"score_gpt":0.2722187500334173,"score_spread":0.2485940235856021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3199119351","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063415915,0.0013319822,0.97855544,0.0003593702,0.000158098,0.00002006543,0.000072308925,0.0009555722,0.012205479],"genre_scores_gemma":[0.2815554,0.0026991414,0.7038403,0.00039105734,0.0002706401,0.00016146763,0.00024085536,0.0009959133,0.009845208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986532,0.00030166947,0.00008589671,0.000175731,0.0006238071,0.00015958902],"domain_scores_gemma":[0.9967673,0.0014199725,0.00020736919,0.00095789845,0.0005780121,0.00006949059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018562416,0.0012400262,0.0008157266,0.0015562351,0.0007045161,0.0023965952,0.0015449285,0.0007230524,0.0072630183],"category_scores_gemma":[0.016177207,0.00034556485,0.0006107911,0.0016712897,0.0016672552,0.0036587685,0.0023748328,0.0021633736,0.0038105876],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016764096,0.00003473808,0.0007740529,0.00040160705,0.000045176614,0.00015707553,0.0002191866,0.07084551,0.0060667144,0.6758068,0.007545416,0.23793611],"study_design_scores_gemma":[0.000045657613,0.00005053673,0.0003284957,0.00029834235,0.000041244908,0.00025659517,0.00006783962,0.30783686,0.0226081,0.6332981,0.035107132,0.0000612026],"about_ca_topic_score_codex":0.000884941,"about_ca_topic_score_gemma":0.0013114167,"teacher_disagreement_score":0.0072630183,"about_ca_system_score_codex":0.0012003285,"about_ca_system_score_gemma":0.001333024,"threshold_uncertainty_score":0.024297178},"labels":[],"label_agreement":null},{"id":"W3201173787","doi":"10.1016/j.rinam.2021.100185","title":"Polynomial degree reduction in the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e65\" altimg=\"si4.svg\"> <mml:msup> <mml:mrow> <mml:mi mathvariant=\"script\">L</mml:mi> </mml:mrow> <mml:mrow> <mml:mn>2</mml:mn> </mml:mrow> </mml:msup> </mml:math> -norm on a symmetric interval for the canonical basis","year":2021,"lang":"lv","type":"article","venue":"Results in Applied Mathematics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Scalable Vector Graphics; Degree (music); Reduction (mathematics); Mathematics; Polynomial; Discrete mathematics; Combinatorics; Computer science; Physics; Geometry; World Wide Web; Mathematical analysis","score_opus":0.03605556553535473,"score_gpt":0.2749079152879501,"score_spread":0.2388523497525954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201173787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019264746,0.00019713871,0.9614586,0.0003616632,0.00013657236,0.000066056564,0.00021388086,0.00038806204,0.017913265],"genre_scores_gemma":[0.38322544,0.00055577466,0.5934503,0.00030680865,0.00020148836,0.00021305832,0.00075863965,0.0010126338,0.02027588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998396,0.00032400322,0.000064685926,0.00029165758,0.0007375317,0.00018620657],"domain_scores_gemma":[0.9986104,0.0005349324,0.000072172705,0.00029413746,0.00041629042,0.000072059425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016213438,0.00057949685,0.0005517619,0.0007565107,0.0005151849,0.00196568,0.0010273639,0.00040157288,0.00718415],"category_scores_gemma":[0.0056080683,0.00021609257,0.0006993362,0.0007835784,0.0012568639,0.0019331889,0.0016264453,0.0025436734,0.0034559695],"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.00015195683,0.00009485304,0.0010901397,0.00022842159,0.000022548056,0.00012855297,0.00032852785,0.048419937,0.010774659,0.7739865,0.015154005,0.14961992],"study_design_scores_gemma":[0.000039515016,0.00014788097,0.0007397116,0.00005930718,0.000026622243,0.00029270773,0.00018544229,0.42805028,0.026789932,0.50834,0.035271004,0.000057705165],"about_ca_topic_score_codex":0.0018651225,"about_ca_topic_score_gemma":0.0034781364,"teacher_disagreement_score":0.00718415,"about_ca_system_score_codex":0.0011640587,"about_ca_system_score_gemma":0.0011112584,"threshold_uncertainty_score":0.024033368},"labels":[],"label_agreement":null},{"id":"W3205213491","doi":"10.1007/978-3-031-30445-3_35","title":"A Cross-Platform Benchmark for Interval Computation Libraries","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Benchmark (surveying); Computation; Interval (graph theory); Interval arithmetic; Parallel computing; Theoretical computer science; Computational science; Algorithm; Mathematics; Cartography; Combinatorics","score_opus":0.04205215407942594,"score_gpt":0.31812423413195146,"score_spread":0.27607208005252554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205213491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10154039,0.0029564078,0.47706208,0.00076777226,0.0012886571,0.0009104974,0.013478917,0.29825327,0.10374208],"genre_scores_gemma":[0.30864546,0.0013779576,0.5129438,0.00092489115,0.00024217907,0.0012897083,0.059242927,0.05846737,0.056865685],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99753857,0.00047522748,0.00027833643,0.00033646892,0.001033519,0.00033785703],"domain_scores_gemma":[0.995635,0.0016491085,0.0001715666,0.0011491303,0.0011019302,0.00029321606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025395912,0.0024704528,0.00086986256,0.0017040338,0.00094955444,0.0023551467,0.0050044633,0.0013212677,0.031887423],"category_scores_gemma":[0.007353323,0.0009366696,0.0012502004,0.0039529903,0.00065773766,0.0033285317,0.002805276,0.0021503526,0.0112588415],"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.0031383005,0.0015157228,0.003961879,0.0017258151,0.0003110429,0.000532207,0.00044158683,0.053406075,0.024587933,0.036026597,0.34204394,0.53230894],"study_design_scores_gemma":[0.001716515,0.0012235092,0.0040890975,0.00036131733,0.00027446734,0.00057735015,0.0003610676,0.59600574,0.12526147,0.03705594,0.23280565,0.00026789872],"about_ca_topic_score_codex":0.0045860466,"about_ca_topic_score_gemma":0.005843298,"teacher_disagreement_score":0.031887423,"about_ca_system_score_codex":0.0009188333,"about_ca_system_score_gemma":0.0018012569,"threshold_uncertainty_score":0.106674016},"labels":[],"label_agreement":null},{"id":"W320568238","doi":"10.1007/s00224-005-1279-2","title":"Dichotomies in the Complexity of Solving Systems of Equations over Finite Semigroups","year":2005,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université Laval","funders":"","keywords":"Semigroup; Mathematics; Monoid; Commutative property; Constraint satisfaction problem; Dichotomy; Polynomial; Domain (mathematical analysis); Finite set; Special classes of semigroups; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.060242600002026164,"score_gpt":0.3048558017418451,"score_spread":0.24461320173981896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W320568238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56311893,0.0031308406,0.35135746,0.020930016,0.0003330667,0.00016628092,0.0010096926,0.00057909766,0.05937456],"genre_scores_gemma":[0.9615524,0.00094383804,0.029091021,0.0005700862,0.0005893275,0.00023780267,0.0006220201,0.00013400699,0.0062596467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935348,0.0022689344,0.00037398914,0.00079295115,0.0024868466,0.0005424823],"domain_scores_gemma":[0.91787624,0.074252486,0.002105483,0.0023782307,0.0017003646,0.0016872241],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004487166,0.0008229017,0.0018590904,0.002077388,0.001957615,0.006781885,0.0020711322,0.0025901305,0.00971865],"category_scores_gemma":[0.04003581,0.0009846268,0.0017505167,0.0015899091,0.0055510723,0.016545866,0.004211955,0.0064308015,0.0005443432],"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.00021682912,0.00011407169,0.0011227945,0.00017787975,0.00003554214,0.00010257601,0.0006080059,0.020549498,0.0006281121,0.9665403,0.002011696,0.007892749],"study_design_scores_gemma":[0.000032907366,0.000015186021,0.00029713867,0.000013188963,0.000007742308,0.000032078187,0.00006854914,0.06894277,0.00014750338,0.9300138,0.00041825554,0.000010992627],"about_ca_topic_score_codex":0.0015390248,"about_ca_topic_score_gemma":0.001214513,"teacher_disagreement_score":0.00971865,"about_ca_system_score_codex":0.0033957553,"about_ca_system_score_gemma":0.0020812072,"threshold_uncertainty_score":0.03251213},"labels":[],"label_agreement":null},{"id":"W3211272906","doi":"10.5281/zenodo.4458977","title":"JuliaData/Tables.jl: v1.3.1","year":2021,"lang":"en","type":"article","venue":"Edinburgh Research Explorer","topic":"Numerical Methods and 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":"Invenia (Canada)","funders":"","keywords":"Computer science","score_opus":0.1905788622703148,"score_gpt":0.4234606503070905,"score_spread":0.2328817880367757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211272906","genre_codex":"software","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":"software","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023721384,0.00018389289,0.017384816,0.000549688,0.0005665847,0.00017975639,0.30521554,0.6388536,0.03682885],"genre_scores_gemma":[0.0040137284,0.00028901335,0.012320964,0.0009973762,0.00019933944,0.0005744295,0.30456653,0.63556886,0.04146979],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727005,0.00032546336,0.00027084988,0.00057251134,0.0010988256,0.0004622451],"domain_scores_gemma":[0.98995703,0.002260116,0.00033230995,0.0036806115,0.0031592108,0.00061065424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002953989,0.004259448,0.0029618908,0.0045681926,0.0016791287,0.011414728,0.008553242,0.0037611858,0.78951186],"category_scores_gemma":[0.025548369,0.0052293576,0.004134956,0.0047548953,0.00096350606,0.008729876,0.0087214,0.004852372,0.813694],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000879623,0.00001698028,0.00022490187,0.00030952925,0.00002237156,0.000025983507,0.000053451648,0.00017526354,0.00023053255,0.001658949,0.9891585,0.008035587],"study_design_scores_gemma":[0.00012998024,0.000012881328,0.00043535102,0.00022075787,0.000014871889,0.000062766696,0.000049581,0.0007013787,0.0026278412,0.004418241,0.99124724,0.000079131365],"about_ca_topic_score_codex":0.005890982,"about_ca_topic_score_gemma":0.005138897,"teacher_disagreement_score":0.78951186,"about_ca_system_score_codex":0.0031701413,"about_ca_system_score_gemma":0.0033206283,"threshold_uncertainty_score":0.30023575},"labels":[],"label_agreement":null},{"id":"W3216435508","doi":"10.5206/mt.v1i1.14466","title":"An Interview with the Authors: Log-Lightning Computation, and Some Instructive Mathematical Errors","year":2021,"lang":"en","type":"article","venue":"Maple Transactions","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maple; Computation; Zoom; Lightning (connector); George (robot); Function (biology); Computer science; Algorithm; Artificial intelligence; Physics","score_opus":0.028433252055116553,"score_gpt":0.2951867353316376,"score_spread":0.26675348327652104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216435508","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028715648,0.009840369,0.0061005536,0.92972106,0.031713534,0.00006537574,0.0002636731,0.00014233189,0.019281551],"genre_scores_gemma":[0.09881006,0.019207781,0.012040725,0.6932,0.03729322,0.000643676,0.00033324337,0.0016136196,0.13685767],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99008965,0.005819473,0.00052973867,0.00061071565,0.0024145923,0.00053583103],"domain_scores_gemma":[0.95544016,0.03021772,0.0015314677,0.0008481743,0.009977608,0.0019847886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0126770595,0.0011826415,0.0013020259,0.0018468959,0.011179212,0.006189378,0.0017352353,0.009693139,0.008702198],"category_scores_gemma":[0.07999193,0.0012357379,0.00097456045,0.0031272052,0.0071487054,0.014693986,0.0035789215,0.02148629,0.003975928],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042002503,0.000030198496,0.00044743402,0.00010468794,0.0000048202673,0.0004579614,0.022829039,0.0003132387,0.00016267,0.024883145,0.9438424,0.0068823593],"study_design_scores_gemma":[0.0000110448445,0.000019906618,0.00033091745,0.00027114584,0.0000059621234,0.00049130723,0.023145085,0.0005288343,0.00022036204,0.013344517,0.961563,0.000067936744],"about_ca_topic_score_codex":0.012050729,"about_ca_topic_score_gemma":0.0132928435,"teacher_disagreement_score":0.0126770595,"about_ca_system_score_codex":0.00663815,"about_ca_system_score_gemma":0.0040524993,"threshold_uncertainty_score":0.06704348},"labels":[],"label_agreement":null},{"id":"W332188984","doi":"10.15215/aupress/9781927356388.01","title":"Open Data Structures: An Introduction","year":2013,"lang":"en","type":"book","venue":"Athabasca University Press eBooks","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Government of Alberta; Government of Canada; Athabasca University","keywords":"Computer science","score_opus":0.07474945680873323,"score_gpt":0.28570251096979693,"score_spread":0.2109530541610637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W332188984","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015175833,0.13147837,0.4368667,0.008891043,0.017786724,0.0007584541,0.005723335,0.011437308,0.38554046],"genre_scores_gemma":[0.009445484,0.14535014,0.31613725,0.011412772,0.012458928,0.0017648013,0.01142926,0.011787012,0.48021442],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977397,0.00027568915,0.00023048249,0.00032350785,0.0013081193,0.00012250306],"domain_scores_gemma":[0.9973232,0.0012738832,0.00009143462,0.0004260513,0.00073591137,0.00014947368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013122758,0.0020264573,0.0016057495,0.003768658,0.0016848673,0.0072575915,0.0028380328,0.00209488,0.055673767],"category_scores_gemma":[0.0058929315,0.0017867772,0.0016783903,0.008647006,0.0020885933,0.0121550225,0.0037270624,0.0055740857,0.049522057],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037243088,0.00008155052,0.00016461204,0.001038254,0.000020936635,0.00015580103,0.0004200939,0.0016747217,0.0011119973,0.17216094,0.46785447,0.3552794],"study_design_scores_gemma":[0.000003425078,0.0000105451145,0.00005038504,0.00022910131,0.000002175406,0.00019612322,0.000029711271,0.00042904852,0.00013048883,0.027521456,0.97138804,0.000009506404],"about_ca_topic_score_codex":0.001312144,"about_ca_topic_score_gemma":0.0012945993,"teacher_disagreement_score":0.055673767,"about_ca_system_score_codex":0.0018474577,"about_ca_system_score_gemma":0.002250713,"threshold_uncertainty_score":0.18624729},"labels":[],"label_agreement":null},{"id":"W337437596","doi":"10.1007/978-3-642-57172-5_6","title":"ODE Software that Computes Guaranteed Bounds on the Solution","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computational science and engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ode; Ordinary differential equation; Solver; Computer science; Initial value problem; Software; Applied mathematics; Algorithm; Mathematics; Differential equation; Programming language; Mathematical analysis","score_opus":0.020822315806311033,"score_gpt":0.23976566695893486,"score_spread":0.21894335115262384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W337437596","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052690003,0.00007082051,0.9634907,0.00006203392,0.00009554093,0.000034658242,0.00031922295,0.025555128,0.0051028617],"genre_scores_gemma":[0.20680873,0.00028965666,0.7676464,0.00029524567,0.00013290961,0.00041027687,0.0023133792,0.010222202,0.011881145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984744,0.00022104172,0.00013759483,0.0002626751,0.00075860263,0.00014567949],"domain_scores_gemma":[0.99528366,0.0024137786,0.00029694583,0.0011426668,0.0006712525,0.00019161917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023418954,0.0012923342,0.0016855554,0.0015161026,0.0006971516,0.0015749894,0.0026157124,0.0022130895,0.016746188],"category_scores_gemma":[0.014662436,0.0011491325,0.0014243062,0.00090817467,0.0012798705,0.0027660856,0.0035779746,0.002268659,0.004838985],"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.0010051049,0.00033395784,0.0033087109,0.00072265515,0.0002348251,0.00029119098,0.00028280588,0.43316993,0.027732747,0.20915498,0.034775984,0.28898716],"study_design_scores_gemma":[0.00006529659,0.000035135556,0.00015498056,0.000029492137,0.000018716086,0.000051383875,0.000008258376,0.9508531,0.010509973,0.03163998,0.0066106184,0.00002308489],"about_ca_topic_score_codex":0.001977249,"about_ca_topic_score_gemma":0.002776451,"teacher_disagreement_score":0.016746188,"about_ca_system_score_codex":0.0010338046,"about_ca_system_score_gemma":0.0022047563,"threshold_uncertainty_score":0.05602157},"labels":[],"label_agreement":null},{"id":"W38126735","doi":"10.7554/elife.86409","title":"Arithmetic with the two-dimensional logarithmic number system (2dlns)","year":2011,"lang":"en","type":"article","venue":"eLife","topic":"Numerical Methods 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":"University of Windsor","funders":"Eunice Kennedy Shriver National Institute of Child Health and Human Development; National Institute of General Medical Sciences; National Institutes of Health","keywords":"Multiplication (music); Computer science; Operand; Arithmetic; Multiplication algorithm; Logarithm; Realization (probability); Digital signal processing; Parallel computing; Mathematics; Binary number; Computer hardware","score_opus":0.024372311536349018,"score_gpt":0.25356009853251144,"score_spread":0.2291877869961624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W38126735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010664,0.00074243476,0.913813,0.00032536173,0.00096007955,0.0007865934,0.008837972,0.036773182,0.027097272],"genre_scores_gemma":[0.085934624,0.0009690502,0.8649808,0.00039501328,0.00033443552,0.004389589,0.012084427,0.0037941206,0.027117888],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99607533,0.0009592156,0.000855736,0.00070520747,0.0011788633,0.00022561417],"domain_scores_gemma":[0.9945568,0.001683236,0.0005709322,0.0017841421,0.0011995618,0.00020531833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033492278,0.0016758873,0.0015704654,0.0031714947,0.0014266743,0.0033736918,0.0020078954,0.00088825636,0.066072725],"category_scores_gemma":[0.017826384,0.000946833,0.0016954739,0.0029757002,0.0013575604,0.004385346,0.0035890585,0.002035245,0.040266313],"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.002246986,0.00017215518,0.005775053,0.0015969052,0.0001629502,0.00057280133,0.0010649269,0.025413435,0.021688193,0.19718993,0.090101905,0.65401477],"study_design_scores_gemma":[0.00046204557,0.0007608108,0.0022395256,0.00043491455,0.00012650165,0.0013467519,0.0002277805,0.25658762,0.03365615,0.15593813,0.547973,0.00024680296],"about_ca_topic_score_codex":0.0012767458,"about_ca_topic_score_gemma":0.0017508643,"teacher_disagreement_score":0.066072725,"about_ca_system_score_codex":0.0014305456,"about_ca_system_score_gemma":0.0021500466,"threshold_uncertainty_score":0.2210353},"labels":[],"label_agreement":null},{"id":"W4206215463","doi":"10.1145/3015306.3015312","title":"The basic polynomial algebra subprograms","year":2016,"lang":"en","type":"article","venue":"ACM communications in computer algebra","topic":"Numerical Methods and 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":"Western University; Microsoft (Canada)","funders":"","keywords":"Computer science; Multiplication (music); Prime (order theory); Univariate; Polynomial; Division (mathematics); Rational function; Variety (cybernetics); Isolation (microbiology); Algebra over a field; Arithmetic; Rational number; Code (set theory); Theoretical computer science; Mathematics; Programming language; Discrete mathematics; Multivariate statistics; Pure mathematics; Set (abstract data type); Combinatorics","score_opus":0.04041744860613087,"score_gpt":0.316534470289144,"score_spread":0.2761170216830131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206215463","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071721985,0.0010402171,0.845425,0.0010491248,0.00037957757,0.00063188584,0.007777453,0.02996347,0.10656106],"genre_scores_gemma":[0.13374875,0.0019174987,0.7465908,0.0019341112,0.00084770494,0.0017847791,0.020837786,0.013305173,0.07903349],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99820364,0.0002616951,0.00013277208,0.00038303915,0.00076707033,0.00025175564],"domain_scores_gemma":[0.9984669,0.00048001876,0.00011446189,0.00037877305,0.0004511359,0.00010867005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013431732,0.0010212896,0.0008893671,0.0014921962,0.0013217252,0.0029963467,0.0022617725,0.00086342316,0.056255117],"category_scores_gemma":[0.004801969,0.0008997777,0.001804146,0.001730008,0.0014688832,0.0038362392,0.0030286051,0.0037634182,0.046381835],"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.00030660932,0.0002041154,0.0012795472,0.0009321278,0.00004703419,0.00018316138,0.00053482974,0.005586778,0.006614887,0.5329114,0.1373276,0.31407198],"study_design_scores_gemma":[0.00008724853,0.000071682494,0.00070519606,0.00015992523,0.000038276776,0.0005692093,0.00009820344,0.021630544,0.013473674,0.4541414,0.50896,0.00006462025],"about_ca_topic_score_codex":0.0017393038,"about_ca_topic_score_gemma":0.0015599285,"teacher_disagreement_score":0.056255117,"about_ca_system_score_codex":0.0010173547,"about_ca_system_score_gemma":0.002660957,"threshold_uncertainty_score":0.18819213},"labels":[],"label_agreement":null},{"id":"W4210720283","doi":"10.1145/3502492","title":"Quick-Div: Rethinking Integer Divider Design for FPGA-based Soft-processors","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Computer science; Latency (audio); Field-programmable gate array; Division (mathematics); Integer (computer science); Radix (gastropod); Arithmetic; Parallel computing; Computer hardware; Mathematics; Operating system; Telecommunications","score_opus":0.05208566830806895,"score_gpt":0.28130916773205966,"score_spread":0.22922349942399073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210720283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23436339,0.0040572975,0.73750615,0.0005315677,0.0004744863,0.00024489305,0.00029968144,0.007509784,0.015012774],"genre_scores_gemma":[0.625205,0.00080901233,0.36409473,0.00045098108,0.00010937207,0.00011311123,0.00035380194,0.00062014634,0.00824391],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996092,0.000057393958,0.000037808895,0.00006389594,0.00017911264,0.000052707448],"domain_scores_gemma":[0.99950194,0.00015533796,0.000084711806,0.00010821154,0.00012064953,0.000029091321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041691138,0.0006698093,0.0002779737,0.0007023903,0.0002918146,0.0008040755,0.001121396,0.00035997026,0.0034787632],"category_scores_gemma":[0.0012277078,0.00032323922,0.00032488527,0.00040785765,0.0003879855,0.0012256381,0.0005590818,0.00067615946,0.0007464176],"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.0012766425,0.00015146603,0.0041898517,0.0007987151,0.00011060501,0.0006300702,0.00034000035,0.065165736,0.2876247,0.026223918,0.008816368,0.60467196],"study_design_scores_gemma":[0.00041010935,0.0024923533,0.0031604476,0.000249446,0.00017278949,0.0021680503,0.000212625,0.34087792,0.5064557,0.019982127,0.123626575,0.0001918753],"about_ca_topic_score_codex":0.00057089166,"about_ca_topic_score_gemma":0.001435887,"teacher_disagreement_score":0.0034787632,"about_ca_system_score_codex":0.00062832906,"about_ca_system_score_gemma":0.0006451719,"threshold_uncertainty_score":0.011637628},"labels":[],"label_agreement":null},{"id":"W42139197","doi":"10.1007/978-0-387-68477-2_14","title":"Distributions with Bounded Support","year":2007,"lang":"en","type":"book-chapter","venue":"Springer series in statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Interval (graph theory); Bounded function; Scale (ratio); Distribution (mathematics); Mathematics; Statistics; Mathematical analysis; Combinatorics; Physics","score_opus":0.0346898154038766,"score_gpt":0.3012447235696555,"score_spread":0.26655490816577887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W42139197","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016876439,0.013758666,0.65347093,0.005160376,0.0009723004,0.000060387425,0.0009434101,0.0008843825,0.30787304],"genre_scores_gemma":[0.5081656,0.025542445,0.12694892,0.0024733073,0.004193907,0.00049629656,0.00253554,0.0009894418,0.32865453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994479,0.000118786884,0.000024911718,0.00010781777,0.0002491475,0.000051491235],"domain_scores_gemma":[0.9976488,0.0014812758,0.00012920411,0.00034887638,0.00029414977,0.000097855205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008247607,0.00089649035,0.0011003284,0.0016249478,0.0005547902,0.0030612594,0.0008666241,0.0012458083,0.021543564],"category_scores_gemma":[0.0072184796,0.00043752222,0.00046271866,0.002209175,0.0017837995,0.0029611192,0.0015003441,0.0024279892,0.008185483],"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.000015575715,0.000011036359,0.00010443113,0.000067887326,0.00000766354,0.00006836179,0.0000583436,0.0017493595,0.00038203108,0.93905926,0.013245452,0.0452305],"study_design_scores_gemma":[0.000007601108,0.000010809001,0.00017506692,0.000032086326,0.000005383428,0.00030516958,0.000021022308,0.010780531,0.000315079,0.9586905,0.02964705,0.000009722624],"about_ca_topic_score_codex":0.0003133137,"about_ca_topic_score_gemma":0.00023020821,"teacher_disagreement_score":0.021543564,"about_ca_system_score_codex":0.00071572134,"about_ca_system_score_gemma":0.0005285295,"threshold_uncertainty_score":0.07207042},"labels":[],"label_agreement":null},{"id":"W4214868813","doi":"10.1007/s00366-022-01612-x","title":"FPGA-orthopoly: a hardware implementation of orthogonal polynomials","year":2022,"lang":"en","type":"article","venue":"Engineering With Computers","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Field-programmable gate array; Orthogonal polynomials; Chebyshev polynomials; Jacobi polynomials; Computer science; Legendre polynomials; Laguerre polynomials; Gegenbauer polynomials; Orthogonal functions; Mathematics; Algorithm; Classical orthogonal polynomials; Computer hardware; Pure mathematics","score_opus":0.0075699329214089775,"score_gpt":0.24044164590683137,"score_spread":0.2328717129854224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214868813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092754886,0.0025765062,0.7849614,0.00036321377,0.00073631434,0.00035566418,0.00220375,0.06065984,0.05538834],"genre_scores_gemma":[0.53609735,0.00087135885,0.43386266,0.00047171453,0.0001440739,0.00028767186,0.003028789,0.0016565276,0.023579806],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99967885,0.000059605703,0.000022903208,0.000053549473,0.000105592444,0.00007950099],"domain_scores_gemma":[0.99977607,0.00005714311,0.000022156102,0.000053172793,0.00006631941,0.000025222113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002512948,0.00068392826,0.00030121364,0.00081866106,0.00025306828,0.00074829604,0.0010774308,0.00034655328,0.02233138],"category_scores_gemma":[0.0007590229,0.00029814118,0.00025186065,0.000607883,0.00021581193,0.0005739442,0.00050307246,0.00053734245,0.0048600296],"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.002607319,0.0003059527,0.002843945,0.00096678815,0.00018458867,0.0005796288,0.0001998163,0.01610084,0.12188274,0.03691885,0.071017414,0.74639213],"study_design_scores_gemma":[0.0016197663,0.0022032412,0.0047504674,0.00027368055,0.0002227576,0.0020743876,0.00015203735,0.28256512,0.40289813,0.012573802,0.2904749,0.0001917209],"about_ca_topic_score_codex":0.00103281,"about_ca_topic_score_gemma":0.0018300383,"teacher_disagreement_score":0.02233138,"about_ca_system_score_codex":0.00030858716,"about_ca_system_score_gemma":0.0005671475,"threshold_uncertainty_score":0.07470596},"labels":[],"label_agreement":null},{"id":"W4220896534","doi":"10.28924/2291-8639-20-2022-19","title":"Approximating the Mode of the Non-Central Chi-Squared Distribution","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Centrality; Degrees of freedom (physics and chemistry); Probability density function; Mode (computer interface); Function (biology); Domain (mathematical analysis); Distribution (mathematics); Enhanced Data Rates for GSM Evolution; Applied mathematics; Mathematical analysis; Statistics; Computer science; Artificial intelligence; Physics","score_opus":0.007268214019607473,"score_gpt":0.28424877010868244,"score_spread":0.27698055608907496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220896534","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027306192,0.00012912821,0.97011876,0.00012219156,0.000053138847,0.000017886034,0.000038403872,0.0004201611,0.0017941205],"genre_scores_gemma":[0.6220974,0.00033536463,0.3707378,0.00023005431,0.00010716736,0.00012771548,0.00021353476,0.00052550115,0.0056254463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992656,0.0003471019,0.000019267269,0.00010900702,0.00017522156,0.00008375156],"domain_scores_gemma":[0.99442863,0.0038841623,0.0002788159,0.0005926024,0.0006497878,0.00016607135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032533295,0.00071327045,0.00053621863,0.0008938122,0.00039480644,0.0011275648,0.001733642,0.00087243866,0.0033232332],"category_scores_gemma":[0.015165402,0.0002861979,0.00045132032,0.00088370993,0.0011955252,0.0017862405,0.000994332,0.0012543137,0.0012357262],"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.00056492013,0.00015359028,0.00816383,0.0002776593,0.00008132131,0.0008588292,0.00043354594,0.6220832,0.012492084,0.28153625,0.005258945,0.06809583],"study_design_scores_gemma":[0.000009653949,0.00001637616,0.00035771247,0.000010822484,0.000003588487,0.00014194725,0.000028070157,0.97787243,0.0015116325,0.019461207,0.0005734725,0.000013127443],"about_ca_topic_score_codex":0.0033300724,"about_ca_topic_score_gemma":0.002731945,"teacher_disagreement_score":0.0033300724,"about_ca_system_score_codex":0.00073118974,"about_ca_system_score_gemma":0.0011084994,"threshold_uncertainty_score":0.017205417},"labels":[],"label_agreement":null},{"id":"W4221036944","doi":"10.1109/tcsii.2022.3161005","title":"Variable-Precision Approximate Floating-Point Multiplier for Efficient Deep Learning Computation","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":21,"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 Saskatchewan","funders":"Ocean University of China; University of Saskatchewan","keywords":"Multiplier (economics); Computation; Exponent; Floating point; Adder; Mathematics; Multiplication (music); Algorithm; Computer science","score_opus":0.02239759204039348,"score_gpt":0.2650750091429171,"score_spread":0.2426774171025236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221036944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025456395,0.0021878162,0.95445496,0.0004360032,0.00037803297,0.00012437496,0.00029772162,0.0026743764,0.013990376],"genre_scores_gemma":[0.48384532,0.0015466519,0.493808,0.00048046422,0.00014569362,0.00028238422,0.00066482427,0.00020657484,0.019019995],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997532,0.000031380176,0.000023277107,0.000047210036,0.00010836144,0.000036657835],"domain_scores_gemma":[0.9997894,0.00004404742,0.000022789302,0.000036918227,0.000096256685,0.000010616612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033225343,0.00073138037,0.0003592606,0.0006397613,0.0003944613,0.00081562623,0.001286621,0.00048671284,0.010805668],"category_scores_gemma":[0.0010200172,0.0002394774,0.0002997429,0.0007858995,0.00029859316,0.0013177345,0.00049531966,0.0008100669,0.0027199439],"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.0008219779,0.00013894218,0.0013455679,0.0008220912,0.00012351858,0.000590187,0.00018598406,0.054355126,0.13974904,0.085017614,0.026910974,0.6899391],"study_design_scores_gemma":[0.00019731946,0.0011014761,0.0010131203,0.00030629334,0.00012103205,0.0014011327,0.00009770024,0.6295509,0.19453776,0.031497493,0.14007173,0.00010406059],"about_ca_topic_score_codex":0.0011159074,"about_ca_topic_score_gemma":0.002415698,"teacher_disagreement_score":0.010805668,"about_ca_system_score_codex":0.0006599951,"about_ca_system_score_gemma":0.0007824047,"threshold_uncertainty_score":0.036148548},"labels":[],"label_agreement":null},{"id":"W4233832720","doi":"10.1109/asap.2000.862402","title":"A new algorithm for the elimination of common subexpressions in hardware implementation of digital filters by using genetic programming","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Constant (computer programming); Digital signal processing; Multiplication (music); Digital filter; Genetic programming; Algorithm; Genetic algorithm; Parallel computing; Computer hardware; Filter (signal processing); Mathematics; Programming language; Artificial intelligence; Machine learning","score_opus":0.04420860618494046,"score_gpt":0.3385677893883045,"score_spread":0.29435918320336407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233832720","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020279693,0.000086498956,0.99695206,0.000044265045,0.000022754508,0.000021992384,0.000007567925,0.00020853418,0.00062826765],"genre_scores_gemma":[0.032188203,0.00016682496,0.9656471,0.000059441078,0.000022383752,0.00017376755,0.00004349134,0.00006263147,0.0016361575],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996439,0.00007235255,0.000017893983,0.00007449039,0.00015691202,0.000034467845],"domain_scores_gemma":[0.9997185,0.00015040448,0.000028492728,0.000021588838,0.00006879558,0.000012283892],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068913854,0.00073507323,0.0007747539,0.00069733924,0.0005286081,0.0006676545,0.0010272107,0.0010822342,0.0017672512],"category_scores_gemma":[0.0011541542,0.00044074887,0.0006633606,0.0008026926,0.000777586,0.00072490174,0.0006146638,0.0012989442,0.00039823493],"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.0000666662,0.000089377936,0.00058007607,0.00018012428,0.00011003334,0.00018388705,0.00017596832,0.4467701,0.020383742,0.040765937,0.0029033115,0.4877907],"study_design_scores_gemma":[0.000058072907,0.00008752422,0.00021786512,0.00002721903,0.00004680815,0.00018468402,0.00001766557,0.9706139,0.0064560142,0.013288516,0.008978875,0.00002291578],"about_ca_topic_score_codex":0.001990078,"about_ca_topic_score_gemma":0.002068468,"teacher_disagreement_score":0.001990078,"about_ca_system_score_codex":0.0005018653,"about_ca_system_score_gemma":0.0009549969,"threshold_uncertainty_score":0.005912006},"labels":[],"label_agreement":null},{"id":"W4236443661","doi":"10.1007/978-0-387-39940-9_2153","title":"Calculus Expression","year":2009,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Database Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Calculus (dental); Expression (computer science); Computer science; Mathematics; Medicine; Programming language; Dentistry","score_opus":0.019122738037544423,"score_gpt":0.26189831884412806,"score_spread":0.24277558080658365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236443661","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015254781,0.0017806325,0.3483297,0.001921983,0.0016807511,0.00020040742,0.0030247043,0.0063063405,0.63523],"genre_scores_gemma":[0.05569887,0.0040735467,0.20782767,0.0015082204,0.000991416,0.0003344053,0.007092592,0.0058591617,0.7166142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988931,0.0001340964,0.00007755511,0.00030757388,0.00049154315,0.00009626122],"domain_scores_gemma":[0.99935645,0.00015382182,0.000024645851,0.00016937141,0.0002596871,0.000035966976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007781909,0.000967478,0.0008187118,0.0015512229,0.0015852577,0.0065165567,0.0020138256,0.0009288472,0.11175483],"category_scores_gemma":[0.0026350555,0.00060291326,0.0009719492,0.0019183406,0.0014937309,0.0053447667,0.0022711838,0.0026132578,0.072927944],"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.00002668909,0.000025407715,0.0000713947,0.00014207416,0.000007759342,0.00007913911,0.00024086039,0.00036700393,0.001451469,0.7866462,0.11078972,0.100152306],"study_design_scores_gemma":[0.00000797475,0.000007636195,0.000056127268,0.00005760523,0.000011576553,0.0001796674,0.000054888398,0.0016111734,0.0020174289,0.18909925,0.806882,0.000014582393],"about_ca_topic_score_codex":0.0021246385,"about_ca_topic_score_gemma":0.0020461914,"teacher_disagreement_score":0.11175483,"about_ca_system_score_codex":0.0014009412,"about_ca_system_score_gemma":0.0015683635,"threshold_uncertainty_score":0.37385714},"labels":[],"label_agreement":null},{"id":"W4236655281","doi":"10.11113/mjfas.v7n1.207","title":"A numerical algorithm for nth root","year":2014,"lang":"en","type":"article","venue":"Malaysian Journal of Fundamental and Applied Sciences","topic":"Numerical Methods and Algorithms","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":"Mount Sinai Hospital","funders":"","keywords":"Square root; Root (linguistics); Numerical digit; Convergence (economics); Mathematics; Algorithm; Arithmetic; Computer science; Geometry","score_opus":0.01721227881018055,"score_gpt":0.27211939264703766,"score_spread":0.2549071138368571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236655281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009030165,0.00014260311,0.9938267,0.00009888819,0.0000987441,0.00005446099,0.000025710564,0.00043966487,0.0044101733],"genre_scores_gemma":[0.021021828,0.00024780584,0.9715739,0.000084844214,0.000043898926,0.00019371534,0.000093679264,0.00019350226,0.0065468373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988109,0.00021417547,0.00009774576,0.00019927968,0.0005872084,0.00009062276],"domain_scores_gemma":[0.99833447,0.00059665274,0.00011647381,0.00025024553,0.0006496093,0.00005257271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001457213,0.0010329157,0.0009983254,0.0015624058,0.0015127122,0.0019630278,0.0018878721,0.0016217212,0.021212744],"category_scores_gemma":[0.0070913774,0.0005358313,0.0009449625,0.0014727069,0.0014206547,0.002204405,0.0024883754,0.0020500899,0.009616666],"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.00019561457,0.00007409985,0.0009361442,0.0005770286,0.00005549717,0.00036986434,0.0005347527,0.16872737,0.018602552,0.3554823,0.014108004,0.4403367],"study_design_scores_gemma":[0.000068623856,0.00011366342,0.00019741393,0.00019193649,0.000024875799,0.00050240604,0.00011832648,0.7768905,0.011838404,0.14182252,0.068171054,0.000060270922],"about_ca_topic_score_codex":0.001752974,"about_ca_topic_score_gemma":0.0022801275,"teacher_disagreement_score":0.021212744,"about_ca_system_score_codex":0.0010337938,"about_ca_system_score_gemma":0.0020207353,"threshold_uncertainty_score":0.07096374},"labels":[],"label_agreement":null},{"id":"W4238351182","doi":"10.1007/11816492_107","title":"Benchmarking a Recurrent Linear GP Model on Prediction and Control Problems","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Chaotic; Genetic programming; Benchmarking; Computer science; Linear programming; Series (stratigraphy); Lorenz system; Algorithm; Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.017295690028529945,"score_gpt":0.24987953059124796,"score_spread":0.23258384056271802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238351182","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6839196,0.0024244357,0.2879882,0.0023494046,0.00062321126,0.00019809164,0.0016062211,0.0034189438,0.017471893],"genre_scores_gemma":[0.9487504,0.00019640439,0.046631664,0.00017092885,0.000056351357,0.00008727261,0.0016145635,0.00022419586,0.002268263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972704,0.0015822361,0.00016454034,0.0003907387,0.00038907846,0.00020297644],"domain_scores_gemma":[0.9910096,0.0062327245,0.0002419586,0.0010779544,0.0012457152,0.00019199807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006397641,0.0011376131,0.0019337153,0.0009211001,0.00056079705,0.0015663219,0.0021040838,0.0042597535,0.00349215],"category_scores_gemma":[0.020215642,0.0006146638,0.0010568504,0.0011011359,0.0009101761,0.002303117,0.0015258052,0.0022047018,0.0006278136],"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.000239949,0.00016005008,0.0008918717,0.000093068906,0.00008033132,0.000049843,0.000020902704,0.97409534,0.0005336346,0.0036786674,0.0016006642,0.018555643],"study_design_scores_gemma":[0.000019372002,0.00005517007,0.00018251105,0.0000044293906,0.000010191499,0.000005493756,0.0000051886013,0.9979061,0.00030977945,0.0013907092,0.00010700282,0.000004051529],"about_ca_topic_score_codex":0.013321901,"about_ca_topic_score_gemma":0.0075402223,"teacher_disagreement_score":0.013321901,"about_ca_system_score_codex":0.0013583668,"about_ca_system_score_gemma":0.0012997511,"threshold_uncertainty_score":0.03383434},"labels":[],"label_agreement":null},{"id":"W4240515399","doi":"10.1109/iwsoc.2004.1319850","title":"A programmable base MDLNS MAC with self-generated lookup table","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Dram; Lookup table; Computer science; Adder; Accumulator (cryptography); Parallel computing; Logarithm; Reduction (mathematics); Binary number; Computer hardware; Table (database); Algorithm; Arithmetic; Mathematics","score_opus":0.011717074925306282,"score_gpt":0.2381415275958603,"score_spread":0.22642445267055403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240515399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18476145,0.004932523,0.7323233,0.00069981866,0.0012115347,0.0003696,0.00092536496,0.019270746,0.055505686],"genre_scores_gemma":[0.63746506,0.00079828734,0.33118457,0.00043287588,0.00029962225,0.0001712762,0.00086302037,0.00022374745,0.028561538],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99972874,0.000027867083,0.000025016798,0.00006157023,0.0001219394,0.00003489001],"domain_scores_gemma":[0.99972576,0.00003997684,0.00003151758,0.000086315806,0.00008885623,0.000027520602],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017385469,0.00034211582,0.00045328357,0.00061571423,0.00043977334,0.0012388593,0.002148939,0.00030382324,0.008120175],"category_scores_gemma":[0.00041800158,0.0002568308,0.00024841217,0.00060660683,0.00030361474,0.0013010671,0.0006629081,0.0004891822,0.0027311293],"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.0012917496,0.00018361992,0.002620957,0.00079382805,0.00012848992,0.0009675228,0.00033694378,0.012040551,0.37659717,0.08388831,0.021400662,0.49975026],"study_design_scores_gemma":[0.00025629296,0.0017143438,0.0018150995,0.00010843354,0.00020383163,0.0033047758,0.00011220779,0.16870676,0.5102221,0.009157159,0.30422676,0.00017223276],"about_ca_topic_score_codex":0.0008993003,"about_ca_topic_score_gemma":0.0013746585,"teacher_disagreement_score":0.008120175,"about_ca_system_score_codex":0.00070486194,"about_ca_system_score_gemma":0.00069582066,"threshold_uncertainty_score":0.027164698},"labels":[],"label_agreement":null},{"id":"W4244897181","doi":"10.1109/pact.2004.1342544","title":"A high-performance SIMD floating point unit for BlueGene/L: architecture, compilation, and algorithm design","year":2004,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"IBM (Canada)","funders":"","keywords":"Computer science; Parallel computing; PowerPC; Compiler; SIMD; Memory bandwidth; Floating point; Memory hierarchy; Computer architecture; Software; Algorithm; Operating system","score_opus":0.03092589562900043,"score_gpt":0.26976995702838674,"score_spread":0.2388440613993863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244897181","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16993932,0.00056393567,0.78884465,0.00028490456,0.00009393364,0.00039030958,0.00044058848,0.023160297,0.01628199],"genre_scores_gemma":[0.32964903,0.00016879874,0.66253704,0.00014462389,0.000027736318,0.0003926661,0.00091326213,0.001170482,0.004996379],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997613,0.00003511453,0.0000102211925,0.000038126716,0.000118694676,0.000036546116],"domain_scores_gemma":[0.9997373,0.00004672091,0.000030080339,0.000054382763,0.00010714255,0.000024331961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032676957,0.00052626635,0.0003166391,0.00039066176,0.00039067463,0.00054775644,0.0013158132,0.0003162997,0.002516804],"category_scores_gemma":[0.00071752566,0.00035845354,0.00022074586,0.0005430342,0.000385946,0.00049458793,0.0003896737,0.0006609481,0.0010389492],"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.0010407921,0.0003407447,0.010135292,0.000788832,0.00012108205,0.0009508314,0.00067510834,0.179258,0.28088504,0.0341288,0.027738899,0.46393663],"study_design_scores_gemma":[0.00015636138,0.00055562187,0.0021660496,0.000042418942,0.00003194538,0.00034924044,0.000072781746,0.68227863,0.27059606,0.0038062967,0.03988895,0.00005570273],"about_ca_topic_score_codex":0.0021019783,"about_ca_topic_score_gemma":0.0021660288,"teacher_disagreement_score":0.002516804,"about_ca_system_score_codex":0.0007358347,"about_ca_system_score_gemma":0.0011299589,"threshold_uncertainty_score":0.008419573},"labels":[],"label_agreement":null},{"id":"W4247218661","doi":"10.1002/9781118316948.ch27","title":"Efficient Approximations for the Arctangent Function","year":2012,"lang":"en","type":"other","venue":"","topic":"Numerical Methods and Algorithms","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":"Defence Research and Development Canada","funders":"","keywords":"Inverse trigonometric functions; Approximations of π; Quadrant (abdomen); Mathematics; Computer science; Applied mathematics; Calculus (dental); Mathematical analysis; Medicine","score_opus":0.03142524699923648,"score_gpt":0.2836481641776861,"score_spread":0.25222291717844963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247218661","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027991442,0.000746321,0.98567444,0.00017113109,0.00017221773,0.000024200639,0.000039292943,0.00019785366,0.010175392],"genre_scores_gemma":[0.17203942,0.0028686232,0.7901414,0.0003246403,0.00024843946,0.00021277288,0.00034176823,0.0011620938,0.032660905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991417,0.0003659273,0.000033059987,0.00007243782,0.00032313733,0.00006369685],"domain_scores_gemma":[0.9973437,0.001467391,0.000114610855,0.00041626146,0.00059401203,0.00006410437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021047336,0.0012468565,0.0008856829,0.00167951,0.00053132273,0.002221474,0.0017730573,0.0010966831,0.009144671],"category_scores_gemma":[0.012181302,0.00047092672,0.0009018225,0.0019024468,0.0010393898,0.003029256,0.0013016224,0.0028454643,0.0030175964],"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.00008339138,0.000050750088,0.0006637951,0.00021792368,0.000029254206,0.00009967838,0.0001874564,0.17515662,0.0023350753,0.7319383,0.007887428,0.08135039],"study_design_scores_gemma":[0.000006928675,0.000011485763,0.00009780643,0.000043296495,0.000008300355,0.00005696979,0.000035864152,0.91874343,0.0009865069,0.069591545,0.010407013,0.000010929043],"about_ca_topic_score_codex":0.0030710076,"about_ca_topic_score_gemma":0.0031378458,"teacher_disagreement_score":0.009144671,"about_ca_system_score_codex":0.0014713038,"about_ca_system_score_gemma":0.0011437883,"threshold_uncertainty_score":0.030591965},"labels":[],"label_agreement":null},{"id":"W4250035399","doi":"10.1115/1.4037803","title":"On the Solutions of Interval Systems for Under-Constrained and Redundant Parallel Manipulators","year":2017,"lang":"en","type":"article","venue":"Journal of Mechanisms and Robotics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Orthant; Jacobian matrix and determinant; Mathematics; Solution set; Wrench; Interval (graph theory); Parameterized complexity; Control theory (sociology); Actuator; Mathematical optimization; Set (abstract data type); Computer science; Applied mathematics; Algorithm; Engineering","score_opus":0.07155371988058924,"score_gpt":0.3019212601783187,"score_spread":0.2303675402977295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250035399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068983454,0.00049592735,0.9887524,0.00012944873,0.00003092203,0.000029040473,0.000026054313,0.000032526328,0.0036053273],"genre_scores_gemma":[0.4036676,0.0035905978,0.5834281,0.00014024247,0.00022258009,0.00048033305,0.00028027158,0.00014004628,0.008050335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937564,0.00024892407,0.0000402712,0.000114631635,0.00018395024,0.000036639867],"domain_scores_gemma":[0.99821186,0.0012601364,0.00020623214,0.000080943486,0.00020630512,0.000034459194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015423856,0.0009901688,0.00081195374,0.00092222146,0.00045402977,0.001124578,0.00076537544,0.001096434,0.0025120154],"category_scores_gemma":[0.006097091,0.0003839713,0.00084509526,0.00090857106,0.0012543919,0.0010036635,0.0014529534,0.001700741,0.00039656402],"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.00003969513,0.000033988028,0.00047522603,0.00026584632,0.000035197692,0.00012243727,0.00032119386,0.77187914,0.0029848146,0.17017262,0.0010784174,0.052591365],"study_design_scores_gemma":[0.0000039323677,0.00003831464,0.000103625585,0.000040687937,0.0000052488526,0.000031597447,0.00004054199,0.9509311,0.00039278495,0.046793893,0.0016069188,0.000011382123],"about_ca_topic_score_codex":0.00180512,"about_ca_topic_score_gemma":0.0010630667,"teacher_disagreement_score":0.0025120154,"about_ca_system_score_codex":0.0004915218,"about_ca_system_score_gemma":0.0007192869,"threshold_uncertainty_score":0.00840348},"labels":[],"label_agreement":null},{"id":"W4251445548","doi":"10.1007/978-1-84882-406-5_4","title":"Interval Arithmetic","year":2009,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Victoria","funders":"","keywords":"Arithmetic; Mathematics; Interval (graph theory); Interval arithmetic; Computer science; Combinatorics; Mathematical analysis","score_opus":0.02883518811282298,"score_gpt":0.27489151986644933,"score_spread":0.24605633175362635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251445548","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011343828,0.010000741,0.19418977,0.0008072748,0.0015536511,0.00006114269,0.0003408402,0.0009793098,0.79093295],"genre_scores_gemma":[0.039282274,0.015096677,0.12851438,0.00088409847,0.0022429798,0.00019378512,0.0011415558,0.0009670194,0.81167716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960905,0.00004407838,0.000019088642,0.000074062926,0.00023080646,0.00002295864],"domain_scores_gemma":[0.99972457,0.000090268404,0.000012562184,0.00006710814,0.000091734255,0.000013748826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035956435,0.0009298114,0.0006732739,0.0013246692,0.0005975298,0.0016832118,0.0009557438,0.00044403106,0.05584443],"category_scores_gemma":[0.0013174033,0.00038125613,0.00045023512,0.002076718,0.00094548526,0.0023630576,0.000845535,0.0022429298,0.025891468],"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.000026651414,0.000021502807,0.00004439973,0.00020293579,0.000007495392,0.00002822418,0.00014469237,0.0013477227,0.0010099142,0.5301198,0.128297,0.3387498],"study_design_scores_gemma":[0.000010008333,0.000025318754,0.00018052862,0.00014120709,0.00001244974,0.000141375,0.000037561487,0.0034386462,0.00079932535,0.24512073,0.75007915,0.000013588868],"about_ca_topic_score_codex":0.0006250586,"about_ca_topic_score_gemma":0.00077189395,"teacher_disagreement_score":0.05584443,"about_ca_system_score_codex":0.0007651399,"about_ca_system_score_gemma":0.0005332075,"threshold_uncertainty_score":0.18681824},"labels":[],"label_agreement":null},{"id":"W4253633424","doi":"10.31219/osf.io/35297","title":"Función de dos variables y sucesiones numéricas eventualmente periódicas.","year":2021,"lang":"es","type":"preprint","venue":"","topic":"Numerical Methods and 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":"Cegep de Sept Iles","funders":"","keywords":"Chemistry; Humanities; Philosophy","score_opus":0.03162879485124109,"score_gpt":0.31400904422611114,"score_spread":0.28238024937487005,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253633424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04166838,0.0025176913,0.9385684,0.00020188125,0.00043746823,0.00008024072,0.00025714916,0.0016006876,0.014668165],"genre_scores_gemma":[0.43159658,0.002874638,0.54199106,0.00022630107,0.000329599,0.0004494118,0.00053674326,0.0009843447,0.021011384],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949527,0.00013034182,0.000036684745,0.000117743475,0.00016912636,0.000050891038],"domain_scores_gemma":[0.9992501,0.00034277097,0.00008256325,0.00013435494,0.00015609528,0.000034195273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010840332,0.0012343745,0.0007972167,0.00089113606,0.0004213511,0.0016145555,0.00075298786,0.00074315205,0.0054686572],"category_scores_gemma":[0.004046413,0.0003198674,0.00083073304,0.0006797593,0.00091351505,0.0014236275,0.001010193,0.0010855327,0.0013869149],"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.00056813686,0.00013813641,0.005057291,0.0010812214,0.00015866231,0.0005323848,0.0007161118,0.15184283,0.05892203,0.25083584,0.007544899,0.5226025],"study_design_scores_gemma":[0.000095682655,0.00034318792,0.0033498295,0.00030764984,0.00013438029,0.00084767386,0.00023531992,0.69820786,0.048559904,0.1852819,0.06254065,0.000095954325],"about_ca_topic_score_codex":0.000618266,"about_ca_topic_score_gemma":0.00059731235,"teacher_disagreement_score":0.0054686572,"about_ca_system_score_codex":0.0004996679,"about_ca_system_score_gemma":0.00048000133,"threshold_uncertainty_score":0.018294513},"labels":[],"label_agreement":null},{"id":"W4254701380","doi":"10.1007/bf02985860","title":"The SIAM 100-Digit challenge: a study in high-accuracy numerical computing","year":2005,"lang":"en","type":"article","venue":"The Mathematical Intelligencer","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Numerical digit; Arithmetic; Computer science; Parallel computing; Mathematics","score_opus":0.05911578884719328,"score_gpt":0.36633160644383944,"score_spread":0.3072158175966462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254701380","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21978937,0.080724664,0.3107263,0.118054375,0.009522611,0.00028717154,0.0046412353,0.004437011,0.2518173],"genre_scores_gemma":[0.7874518,0.022280186,0.1251334,0.007306725,0.0055058557,0.00027706855,0.004943796,0.0023662646,0.044735003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9939879,0.0015046265,0.00018606191,0.00051469705,0.0035217719,0.00028501631],"domain_scores_gemma":[0.9537357,0.03210641,0.0012712175,0.0048464416,0.0065260427,0.001514191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062303613,0.0008660252,0.0011096917,0.0022243506,0.0024602907,0.0050956514,0.0025479682,0.0028069867,0.009688948],"category_scores_gemma":[0.09029746,0.00045624477,0.0005982601,0.0051890137,0.0037249457,0.008637357,0.003748653,0.0050388426,0.0029562847],"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.0005610114,0.00024795707,0.0074808574,0.001092271,0.00008023378,0.00029816863,0.0007344474,0.033647478,0.0012234814,0.4627696,0.2722165,0.21964793],"study_design_scores_gemma":[0.0001169073,0.00018461637,0.0041806526,0.0004644341,0.00004518837,0.00089132914,0.0009714011,0.27744046,0.0050505544,0.5360637,0.17450674,0.00008415691],"about_ca_topic_score_codex":0.0066293743,"about_ca_topic_score_gemma":0.006460165,"teacher_disagreement_score":0.009688948,"about_ca_system_score_codex":0.0017264951,"about_ca_system_score_gemma":0.0032555691,"threshold_uncertainty_score":0.032949686},"labels":[],"label_agreement":null},{"id":"W4254743552","doi":"10.1142/s0218126600000056","title":"AN ALTERNATIVE PROOF OF MODIFIED-BOOTH RECODING ALGORITHM BASED ON NUMBER-DOMAIN TRANSFORMATIONS","year":2000,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Numerical Methods and 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 Alberta; Nortel (Canada)","funders":"","keywords":"Complement (music); Algorithm; Arithmetic; Radix (gastropod); Representation (politics); Mathematics; Set (abstract data type); Numerical digit; Computer science; Domain (mathematical analysis)","score_opus":0.02235452750072046,"score_gpt":0.2774658672538252,"score_spread":0.25511133975310474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254743552","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010528734,0.00038703927,0.9671602,0.000714974,0.0005484856,0.00011554766,0.00015103606,0.0005600368,0.019833948],"genre_scores_gemma":[0.18096064,0.00082590076,0.79803926,0.0009676195,0.0004101934,0.00029107966,0.00031002943,0.00037490085,0.017820422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985386,0.00025079612,0.000109087916,0.0002608459,0.0006861411,0.00015460016],"domain_scores_gemma":[0.99791104,0.00074983377,0.00013155249,0.0004940067,0.00065962155,0.00005387259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011385499,0.00080623385,0.0007249256,0.0010857648,0.00097071467,0.0017007929,0.001352635,0.0014696668,0.010647231],"category_scores_gemma":[0.0054287016,0.0004244021,0.0009838308,0.0010989131,0.0017688822,0.0036757106,0.0021242162,0.0029009322,0.0028556243],"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.00016260608,0.00004918398,0.0002870476,0.00026407192,0.00003306827,0.00053401943,0.0003221262,0.0078006275,0.016803516,0.8393779,0.007612226,0.12675357],"study_design_scores_gemma":[0.00013337717,0.00020712835,0.0005026391,0.00017488595,0.00005672011,0.002092077,0.00017863161,0.113896586,0.06006353,0.73029345,0.09225697,0.0001439639],"about_ca_topic_score_codex":0.0006301843,"about_ca_topic_score_gemma":0.0006751917,"teacher_disagreement_score":0.010647231,"about_ca_system_score_codex":0.000697029,"about_ca_system_score_gemma":0.0014730807,"threshold_uncertainty_score":0.035618544},"labels":[],"label_agreement":null},{"id":"W4255714343","doi":"10.1109/mwscas.2000.951607","title":"Limitations of criteria for testing transistor circuits for multiple DC operating points","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"Simon Fraser University","funders":"","keywords":"Resistor; Transistor; Jacobian matrix and determinant; Electronic circuit; Equivalent circuit; Computer science; Control theory (sociology); Value (mathematics); Topology (electrical circuits); Mathematics; Electronic engineering; Electrical engineering; Engineering; Statistics; Voltage; Control (management); Applied mathematics","score_opus":0.31272017551827463,"score_gpt":0.3389295590777967,"score_spread":0.02620938355952207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255714343","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08963805,0.0008857856,0.89453346,0.00097584137,0.00011312921,0.00044640328,0.00027075753,0.0015387298,0.011597785],"genre_scores_gemma":[0.73309636,0.00029153866,0.26381585,0.00030398252,0.0000806612,0.000444395,0.00027978022,0.0002714441,0.0014160033],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9645537,0.0107737575,0.00363794,0.0033454492,0.016583303,0.0011058266],"domain_scores_gemma":[0.6869816,0.2353917,0.012716633,0.024521329,0.037677173,0.002711529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01833362,0.0013530814,0.0019539534,0.0035926602,0.0010397161,0.0028725227,0.003496339,0.002232336,0.0030576757],"category_scores_gemma":[0.17539127,0.0006986491,0.00092481414,0.0021622449,0.004033317,0.0035328802,0.0025738715,0.0020140498,0.0014936166],"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.001104753,0.0005622593,0.04230321,0.001331065,0.00024490402,0.0012506953,0.0012462377,0.1909191,0.051452883,0.2349148,0.0058102445,0.4688599],"study_design_scores_gemma":[0.00019750706,0.0011856109,0.006489169,0.0004253757,0.00007413008,0.002645434,0.00046511885,0.7367003,0.05451977,0.18643898,0.010579674,0.00027898734],"about_ca_topic_score_codex":0.0017784956,"about_ca_topic_score_gemma":0.0021606528,"teacher_disagreement_score":0.01833362,"about_ca_system_score_codex":0.0011100422,"about_ca_system_score_gemma":0.0016468388,"threshold_uncertainty_score":0.09695858},"labels":[],"label_agreement":null},{"id":"W4288869073","doi":"10.1007/978-3-031-02420-7","title":"Fast Start Differential Calculus","year":2019,"lang":"en","type":"book","venue":"Synthesis lectures on mathematics and statistics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Calculus (dental); Differential calculus; Logarithm; Limit (mathematics); Mathematics; Derivative (finance); Differential (mechanical device); Time-scale calculus; Algebraic number; Logarithmic derivative; Applied mathematics; Algebra over a field; Computer science; Multivariable calculus; Pure mathematics; Mathematical analysis; Medicine; Engineering","score_opus":0.016719283064697058,"score_gpt":0.2555289625368816,"score_spread":0.23880967947218457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288869073","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028005636,0.009304726,0.24616483,0.0020460323,0.0047983397,0.000054439184,0.00066091627,0.00223147,0.73193866],"genre_scores_gemma":[0.024721885,0.005461012,0.03656132,0.00054845976,0.0015615658,0.000055313867,0.00053260586,0.001047796,0.92951006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997081,0.000026289745,0.000007252738,0.0000476311,0.00018180381,0.0000287884],"domain_scores_gemma":[0.99977654,0.00005019095,0.000008481234,0.00004805505,0.00008529411,0.00003145264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003362194,0.0009372717,0.00071404845,0.0012938479,0.0007090992,0.0021248995,0.0006915231,0.0007466545,0.065285385],"category_scores_gemma":[0.00075994566,0.00038768727,0.00053074374,0.0010696893,0.00081830035,0.0021503954,0.0014908336,0.0018294435,0.03453776],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027502349,0.000020510177,0.000047573936,0.00012524528,0.0000104274,0.000036167017,0.00006922145,0.0018685489,0.0026559422,0.6751775,0.15437604,0.16558528],"study_design_scores_gemma":[0.000008313868,0.000018334284,0.00014074681,0.000059169684,0.000008862888,0.000098115524,0.000021037024,0.006361219,0.0017438586,0.34204566,0.6494778,0.000016948325],"about_ca_topic_score_codex":0.00061204046,"about_ca_topic_score_gemma":0.0010148789,"teacher_disagreement_score":0.065285385,"about_ca_system_score_codex":0.0011220686,"about_ca_system_score_gemma":0.0007754216,"threshold_uncertainty_score":0.21840137},"labels":[],"label_agreement":null},{"id":"W4289783938","doi":"","title":"Proofs of numerical programs when the compiler optimizes","year":2011,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Prevention of Organ Failure","funders":"","keywords":"Compiler; Mathematical proof; Computer science; Programming language; Parallel computing; Mathematics; Geometry","score_opus":0.031183257836975096,"score_gpt":0.2366826916201283,"score_spread":0.20549943378315322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289783938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06140918,0.00096982263,0.8819998,0.0040127477,0.0009598768,0.00019226247,0.0011081597,0.012036861,0.037311293],"genre_scores_gemma":[0.5831326,0.00096880045,0.37958977,0.0015647154,0.00095676736,0.00039657016,0.0026408392,0.01163127,0.019118639],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99328995,0.0026393584,0.00044438892,0.00066045654,0.0022240041,0.00074179727],"domain_scores_gemma":[0.95696414,0.0318526,0.0017906238,0.005363123,0.0034343565,0.0005952482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044070785,0.0015165516,0.000959879,0.0012606652,0.0015139385,0.0036194096,0.0020177844,0.0014057839,0.018000942],"category_scores_gemma":[0.047140248,0.0014388348,0.0019109114,0.0011606148,0.002960615,0.0067616254,0.003719176,0.0033623707,0.0038703727],"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.0012365364,0.00026967528,0.0037576405,0.0019236916,0.0002231703,0.0011918359,0.0012143492,0.024018735,0.022680027,0.73432666,0.05734528,0.1518123],"study_design_scores_gemma":[0.00024952853,0.00014244851,0.0016124706,0.00024087352,0.0001597799,0.00044827152,0.00019471442,0.060670085,0.050645884,0.85740775,0.028124226,0.00010400567],"about_ca_topic_score_codex":0.0006040516,"about_ca_topic_score_gemma":0.0011264392,"teacher_disagreement_score":0.018000942,"about_ca_system_score_codex":0.001291858,"about_ca_system_score_gemma":0.0019218946,"threshold_uncertainty_score":0.06021911},"labels":[],"label_agreement":null},{"id":"W4300819837","doi":"10.1007/0-306-48332-7_70","title":"Continuous Global Optimization: Applications","year":2001,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.010883409763587856,"score_gpt":0.25235946537320536,"score_spread":0.2414760556096175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300819837","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037576172,0.14065126,0.46309826,0.0020650227,0.0018202033,0.0000723526,0.0003104795,0.001244845,0.38698],"genre_scores_gemma":[0.14587079,0.16030009,0.35987765,0.001758448,0.0035505297,0.00040422226,0.0012072359,0.0015357654,0.32549527],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971324,0.000053565775,0.000011453741,0.00005139941,0.0001530891,0.000017181921],"domain_scores_gemma":[0.99982136,0.00007558585,0.000009729524,0.000027758311,0.000048813206,0.000016710537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035877217,0.0013495706,0.0013173091,0.000879065,0.00036727675,0.0013845005,0.00089852524,0.0011683807,0.014821863],"category_scores_gemma":[0.0008059746,0.00037512643,0.00052470487,0.0024891426,0.000867821,0.0009884693,0.0014265105,0.0017138206,0.0066073663],"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.000048007747,0.000116182135,0.00017629284,0.0011750407,0.000044899465,0.00011422643,0.000113338916,0.04898194,0.0025056326,0.1934281,0.13580073,0.6174956],"study_design_scores_gemma":[0.00003893907,0.00011616338,0.00084590283,0.00051293976,0.00003816466,0.00046505604,0.00007540952,0.12300918,0.0019332168,0.40737385,0.46554536,0.00004578567],"about_ca_topic_score_codex":0.00086862297,"about_ca_topic_score_gemma":0.0011729554,"teacher_disagreement_score":0.014821863,"about_ca_system_score_codex":0.00045261625,"about_ca_system_score_gemma":0.0005324061,"threshold_uncertainty_score":0.04958403},"labels":[],"label_agreement":null},{"id":"W4301385812","doi":"","title":"Hard faults and soft errors: possible numerical remedies in linear algebra solvers","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and 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":"Université de Sherbrooke","funders":"","keywords":"Linear algebra; Computer science; Algebra over a field; Numerical linear algebra; Algorithm; Applied mathematics; Linear system; Mathematics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.01603705846315263,"score_gpt":0.2482776919323049,"score_spread":0.23224063346915227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301385812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09640417,0.0024754398,0.87383115,0.006148501,0.0015773142,0.000092378956,0.000086996944,0.0027346858,0.016649418],"genre_scores_gemma":[0.85178626,0.0007625693,0.13879216,0.00063532696,0.000524843,0.000056833145,0.00008685662,0.0005820241,0.006773164],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963601,0.0014540034,0.00022729301,0.0003295552,0.0012876284,0.00034134882],"domain_scores_gemma":[0.9784979,0.010907227,0.0015714032,0.0054889875,0.0027719238,0.00076245284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004455464,0.0009776638,0.0012393278,0.0011147313,0.0010227282,0.0028460815,0.002243107,0.002079746,0.009198078],"category_scores_gemma":[0.056228485,0.0005363735,0.00064740505,0.0009857457,0.0026751794,0.003910687,0.0028488636,0.0030341202,0.0011057415],"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.0016254893,0.0003977598,0.0067330687,0.0012338217,0.00021695731,0.00086543243,0.0011110931,0.23957187,0.0098279435,0.33269477,0.011579515,0.39414224],"study_design_scores_gemma":[0.00009373284,0.00024210135,0.0007603657,0.00021406975,0.000054679407,0.0003289609,0.00025047586,0.6105389,0.009097648,0.3735117,0.0048546544,0.00005276627],"about_ca_topic_score_codex":0.0005965261,"about_ca_topic_score_gemma":0.00080857653,"teacher_disagreement_score":0.009198078,"about_ca_system_score_codex":0.0005083016,"about_ca_system_score_gemma":0.0010842104,"threshold_uncertainty_score":0.0307706},"labels":[],"label_agreement":null},{"id":"W4304782293","doi":"10.1007/s00365-022-09593-2","title":"Fast and Stable Approximation of Analytic Functions from Equispaced Samples via Polynomial Frames","year":2022,"lang":"lv","type":"article","venue":"Constructive Approximation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Polynomial; Computer science; Mathematics; Mathematical analysis","score_opus":0.022991958534008716,"score_gpt":0.2560468056044899,"score_spread":0.23305484707048119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304782293","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07193426,0.00017603605,0.92570245,0.00009548158,0.000031441174,0.000017973869,0.000042864966,0.00019913835,0.0018004081],"genre_scores_gemma":[0.75474393,0.00032064022,0.24061921,0.00005733613,0.000036750138,0.000044186676,0.00018455628,0.000121207304,0.0038723357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941695,0.00014340306,0.000024197514,0.00010215972,0.00024876985,0.00006450394],"domain_scores_gemma":[0.99900323,0.0005781381,0.000091184695,0.0001079391,0.00017229893,0.000047184025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013192458,0.0006434136,0.00071662804,0.00069087883,0.00029749665,0.0011546594,0.0010176387,0.00071969343,0.0018311919],"category_scores_gemma":[0.0049410434,0.00034062786,0.00052702933,0.0006418224,0.0010802206,0.0014721055,0.0011968275,0.0013547608,0.00032015052],"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.0006405646,0.00007992428,0.001651173,0.00012945049,0.000056190227,0.00021972589,0.0003821227,0.7482203,0.019412002,0.12068484,0.001389113,0.1071345],"study_design_scores_gemma":[0.000005048176,0.000018552182,0.00007348818,0.0000051743896,0.0000029838852,0.000012294913,0.000018152103,0.992465,0.0016546113,0.005331202,0.0004096181,0.0000038429375],"about_ca_topic_score_codex":0.0055628805,"about_ca_topic_score_gemma":0.0033982785,"teacher_disagreement_score":0.0055628805,"about_ca_system_score_codex":0.0011418598,"about_ca_system_score_gemma":0.00048476266,"threshold_uncertainty_score":0.011061013},"labels":[],"label_agreement":null},{"id":"W4308091049","doi":"10.1109/ccece49351.2022.9918302","title":"FPGA-Based Designs of the Factorial Function","year":2022,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"Royal Military College of Canada","funders":"","keywords":"Field-programmable gate array; Computer science; Factorial; Realization (probability); Function (biology); FLOPS; Logic synthesis; Embedded system; Parallel computing; Logic gate; Algorithm; Mathematics; Statistics","score_opus":0.04423702671045924,"score_gpt":0.26672045141523515,"score_spread":0.22248342470477592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308091049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.106777884,0.0014826733,0.86404485,0.00013294534,0.00017609692,0.0001968171,0.00038069306,0.003001692,0.02380638],"genre_scores_gemma":[0.6033358,0.00043862703,0.39026076,0.000083683415,0.00004278515,0.00014766303,0.0002993976,0.00008607139,0.0053052623],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99976724,0.00006140712,0.000018583414,0.00004351519,0.00007535663,0.000033904533],"domain_scores_gemma":[0.9996879,0.000096818694,0.00004678762,0.00005588051,0.00009935516,0.000013209356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031850868,0.00042863132,0.00026486666,0.00045047616,0.0002230541,0.00046717838,0.00046512324,0.00027843923,0.0051825643],"category_scores_gemma":[0.00071874587,0.00015724453,0.00022588753,0.0003779561,0.00015638446,0.00035304812,0.00014043899,0.00026365227,0.0009788255],"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.0012242434,0.00017766311,0.0022300563,0.0009554324,0.00013153473,0.00047857323,0.00014903006,0.15059973,0.2233383,0.054441966,0.008798427,0.5574751],"study_design_scores_gemma":[0.00046951204,0.0021766094,0.006375598,0.00017915684,0.00014686756,0.0025082624,0.00008031293,0.58809674,0.27489272,0.012090193,0.112846896,0.00013715502],"about_ca_topic_score_codex":0.0006857586,"about_ca_topic_score_gemma":0.0010479275,"teacher_disagreement_score":0.0051825643,"about_ca_system_score_codex":0.00045576078,"about_ca_system_score_gemma":0.00042463315,"threshold_uncertainty_score":0.017337382},"labels":[],"label_agreement":null},{"id":"W4308506738","doi":"10.32920/21518007","title":"On the Theory and Design of Polynomial Division Circuits","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Aliasing; Polynomial; Cryptography; Arithmetic function; Division (mathematics); Arithmetic; Mixed-signal integrated circuit; Theoretical computer science; Electronic circuit; Algorithm; Mathematics; Integrated circuit; Telecommunications; Engineering; Discrete mathematics; Electrical engineering","score_opus":0.04665917966233167,"score_gpt":0.29993043207952497,"score_spread":0.2532712524171933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308506738","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004456061,0.0033402967,0.95783204,0.00055064907,0.000171603,0.000056644436,0.000092899296,0.0003101461,0.033189613],"genre_scores_gemma":[0.36138594,0.01372836,0.5901044,0.0012191097,0.00068348885,0.0005303304,0.00050008,0.00027420488,0.031574104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990165,0.00023011705,0.00005617651,0.0001473155,0.00044184917,0.00010802384],"domain_scores_gemma":[0.9991123,0.00051043305,0.00006638393,0.00012803846,0.00015908526,0.00002377512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074360793,0.0009008517,0.00058487814,0.0011223791,0.00069149275,0.001660645,0.0010556409,0.0008929397,0.0065605934],"category_scores_gemma":[0.0027358776,0.0005261036,0.00066581747,0.0015490575,0.0019223097,0.0020428076,0.0010113978,0.0020933393,0.002074943],"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.000045375797,0.00003520469,0.00014811159,0.00029007555,0.000018295177,0.00008049555,0.0001409331,0.041174218,0.006616009,0.85494775,0.004125301,0.092378184],"study_design_scores_gemma":[0.000044205968,0.000117283445,0.00014687356,0.00015783055,0.000021885902,0.00029677933,0.000047647,0.16307811,0.009526861,0.7537978,0.07272955,0.000035197554],"about_ca_topic_score_codex":0.00076526677,"about_ca_topic_score_gemma":0.0007104916,"teacher_disagreement_score":0.0065605934,"about_ca_system_score_codex":0.0014229416,"about_ca_system_score_gemma":0.0008500479,"threshold_uncertainty_score":0.021947384},"labels":[],"label_agreement":null},{"id":"W4308507040","doi":"10.32920/21518007.v1","title":"On the Theory and Design of Polynomial Division Circuits","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and 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":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Aliasing; Polynomial; Arithmetic function; Cryptography; Division (mathematics); Arithmetic; Mixed-signal integrated circuit; Electronic circuit; Theoretical computer science; Algorithm; Mathematics; Integrated circuit; Telecommunications; Engineering; Discrete mathematics; Electrical engineering","score_opus":0.04665917966233167,"score_gpt":0.29993043207952497,"score_spread":0.2532712524171933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308507040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004456061,0.0033402967,0.95783204,0.00055064907,0.000171603,0.000056644436,0.000092899296,0.0003101461,0.033189613],"genre_scores_gemma":[0.36138594,0.01372836,0.5901044,0.0012191097,0.00068348885,0.0005303304,0.00050008,0.00027420488,0.031574104],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990165,0.00023011705,0.00005617651,0.0001473155,0.00044184917,0.00010802384],"domain_scores_gemma":[0.9991123,0.00051043305,0.00006638393,0.00012803846,0.00015908526,0.00002377512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074360793,0.0009008517,0.00058487814,0.0011223791,0.00069149275,0.001660645,0.0010556409,0.0008929397,0.0065605934],"category_scores_gemma":[0.0027358776,0.0005261036,0.00066581747,0.0015490575,0.0019223097,0.0020428076,0.0010113978,0.0020933393,0.002074943],"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.000045375797,0.00003520469,0.00014811159,0.00029007555,0.000018295177,0.00008049555,0.0001409331,0.041174218,0.006616009,0.85494775,0.004125301,0.092378184],"study_design_scores_gemma":[0.000044205968,0.000117283445,0.00014687356,0.00015783055,0.000021885902,0.00029677933,0.000047647,0.16307811,0.009526861,0.7537978,0.07272955,0.000035197554],"about_ca_topic_score_codex":0.00076526677,"about_ca_topic_score_gemma":0.0007104916,"teacher_disagreement_score":0.0065605934,"about_ca_system_score_codex":0.0014229416,"about_ca_system_score_gemma":0.0008500479,"threshold_uncertainty_score":0.021947384},"labels":[],"label_agreement":null},{"id":"W4309640194","doi":"10.1109/iemcon56893.2022.9946578","title":"Optimized FPGA-Based Datapath for the Iterative Design for the Factorial Function","year":2022,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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":"Royal Military College of Canada","funders":"","keywords":"Datapath; Field-programmable gate array; Computer science; Logic synthesis; Factorial; Realization (probability); Function (biology); Factorial experiment; Parallel computing; Computer architecture; Embedded system; Algorithm; Logic gate; Mathematics","score_opus":0.08987991328655642,"score_gpt":0.3183921529389845,"score_spread":0.22851223965242806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4309640194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02815371,0.00031120382,0.9595518,0.0001020894,0.00008162924,0.00017000943,0.00029097628,0.0034281837,0.007910454],"genre_scores_gemma":[0.44894806,0.00018588347,0.5437936,0.00018498952,0.00005086096,0.00026017302,0.0006421637,0.0002033582,0.005730938],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9997062,0.00005921345,0.000022475062,0.00006260273,0.00009836308,0.000051125375],"domain_scores_gemma":[0.999739,0.00007753045,0.00003648899,0.00005390903,0.00008186536,0.000011170876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028135246,0.0006437764,0.00026954466,0.00053666014,0.00028000373,0.00057260116,0.0008590905,0.0002921904,0.009462784],"category_scores_gemma":[0.0005529304,0.0001742166,0.0002705862,0.00047241902,0.00018247306,0.00046495392,0.00022921652,0.00040017592,0.00171023],"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.0015205975,0.00024342007,0.002457401,0.0007207445,0.00015086877,0.00043352006,0.000206084,0.07422404,0.21549785,0.031607155,0.01616541,0.6567729],"study_design_scores_gemma":[0.00051796855,0.002554002,0.0041084946,0.00012528272,0.00016469909,0.0014474023,0.00009307469,0.6043793,0.27837792,0.009458996,0.09866305,0.00010993119],"about_ca_topic_score_codex":0.0011707988,"about_ca_topic_score_gemma":0.0022633926,"teacher_disagreement_score":0.009462784,"about_ca_system_score_codex":0.00063548645,"about_ca_system_score_gemma":0.00089887157,"threshold_uncertainty_score":0.031656146},"labels":[],"label_agreement":null},{"id":"W4313569974","doi":"","title":"CAMPARY: Cuda Multiple Precision Arithmetic Library and Applications","year":2016,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods 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":"Prevention of Organ Failure","funders":"","keywords":"CUDA; Computer science; Arithmetic; Parallel computing; Saturation arithmetic; Arbitrary-precision arithmetic; Double-precision floating-point format; Computational science; Mathematics; Algorithm; Computation","score_opus":0.010196513595180012,"score_gpt":0.2226014731006912,"score_spread":0.2124049595055112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313569974","genre_codex":"software","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006257936,0.0017803567,0.38755137,0.00048415374,0.0008721303,0.00031552953,0.010147969,0.5493085,0.043282006],"genre_scores_gemma":[0.14194515,0.0020277519,0.557604,0.001882643,0.00090938405,0.0022962717,0.039236985,0.12921776,0.12488007],"study_design_codex":"not_applicable","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99790597,0.0003239001,0.00023106787,0.00042644382,0.0007860058,0.0003266594],"domain_scores_gemma":[0.99685174,0.0004208543,0.00023372957,0.0007996361,0.0014128771,0.0002810828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014715246,0.0033994012,0.0024751117,0.003811071,0.0019420942,0.0051163863,0.0069842697,0.0020051731,0.12489738],"category_scores_gemma":[0.006414011,0.002063143,0.0015314937,0.0054659327,0.0010376119,0.0037904868,0.0029468813,0.003978032,0.07591834],"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.001085504,0.00014584724,0.0008238075,0.00078684726,0.00014928285,0.0002045095,0.00027617314,0.005248794,0.0084777055,0.027400907,0.64947796,0.3059226],"study_design_scores_gemma":[0.0008513222,0.00025512718,0.0011203046,0.000450402,0.00019386131,0.00045906295,0.00012403788,0.14621145,0.07319496,0.040354688,0.7364044,0.00038032167],"about_ca_topic_score_codex":0.0057244627,"about_ca_topic_score_gemma":0.00643032,"teacher_disagreement_score":0.12489738,"about_ca_system_score_codex":0.0025044908,"about_ca_system_score_gemma":0.0029891434,"threshold_uncertainty_score":0.41782337},"labels":[],"label_agreement":null},{"id":"W4323074617","doi":"10.1002/spe.3198","title":"Fast number parsing without fallback","year":2023,"lang":"en","type":"article","venue":"Software Practice and Experience","topic":"Numerical Methods and Algorithms","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":"Université TÉLUQ; Université du Québec à Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Correctness; Computer science; String (physics); Parsing; Rust (programming language); Point (geometry); Algorithm; Function (biology); Binary number; Floating point; Arithmetic; Theoretical computer science; Programming language; Mathematics","score_opus":0.02836546243983597,"score_gpt":0.3547149455127382,"score_spread":0.32634948307290224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323074617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067942077,0.0007330135,0.88918364,0.001187906,0.0008524093,0.00011499539,0.0014912522,0.06951277,0.030129801],"genre_scores_gemma":[0.12286081,0.0005707139,0.81510717,0.0014014932,0.0004114616,0.00023776828,0.0065121036,0.016760454,0.036137935],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9972844,0.0005361463,0.00029035236,0.00065988133,0.0010342282,0.00019500028],"domain_scores_gemma":[0.9941017,0.0016561865,0.00020933953,0.0019182935,0.001981795,0.00013277149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014009519,0.0013679406,0.0008486005,0.0017874382,0.0010619011,0.0026439317,0.0021088568,0.0010326707,0.036948513],"category_scores_gemma":[0.011670323,0.00066383113,0.00080214324,0.0018255702,0.00085665536,0.0043616197,0.0022955483,0.0019078564,0.025925007],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058840436,0.0000922538,0.0014336527,0.00052021793,0.000046019188,0.00040006667,0.00040830913,0.009172691,0.016879736,0.121352375,0.17829612,0.67081016],"study_design_scores_gemma":[0.00017051469,0.00011842495,0.0014173388,0.0004504188,0.00006947199,0.0009068175,0.00013040566,0.13687095,0.08060749,0.1840709,0.5950036,0.00018375578],"about_ca_topic_score_codex":0.001693963,"about_ca_topic_score_gemma":0.0014735627,"teacher_disagreement_score":0.036948513,"about_ca_system_score_codex":0.001099642,"about_ca_system_score_gemma":0.0013857629,"threshold_uncertainty_score":0.12360507},"labels":[],"label_agreement":null},{"id":"W4324316870","doi":"10.48550/arxiv.2303.06527","title":"Optimal Control Duality and the Douglas-Rachford Algorithm","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; University of Waterloo; Australian Government","keywords":"Optimal control; Certificate; Duality (order theory); Mathematical optimization; Mathematics; Dual (grammatical number); Point (geometry); Control (management); Operator (biology); Fixed point; Quadratic equation; Computer science; Algorithm; Discrete mathematics; Artificial intelligence","score_opus":0.08058703082518184,"score_gpt":0.21891496504562977,"score_spread":0.13832793422044792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324316870","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01109693,0.00027097552,0.9811241,0.00030783282,0.000044621615,0.000023189517,0.00001709627,0.000038007398,0.007077302],"genre_scores_gemma":[0.5750294,0.0005819499,0.41334227,0.00030316928,0.00011592084,0.00019423716,0.00008671958,0.00012279394,0.010223629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987192,0.0006987183,0.000040775798,0.00014013,0.00027575306,0.00012547786],"domain_scores_gemma":[0.9985423,0.00081701786,0.00014736303,0.0001320626,0.00028304508,0.000078140925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034188821,0.0006823936,0.0010077908,0.0010148595,0.00065258885,0.0014349676,0.0012133977,0.0014074262,0.002909878],"category_scores_gemma":[0.006949835,0.00036745938,0.00063061836,0.00079262105,0.0020822403,0.0016561033,0.001758361,0.0013681855,0.00034238337],"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.000056142657,0.000039228482,0.00027724108,0.000057679517,0.000016952166,0.000048063335,0.00006759387,0.19897984,0.0009082569,0.7788976,0.0008716049,0.019779772],"study_design_scores_gemma":[0.000017626791,0.000049724033,0.00008580955,0.000025522784,0.0000048664792,0.00003125426,0.00002135219,0.770587,0.0007168959,0.2267054,0.0017427012,0.00001181615],"about_ca_topic_score_codex":0.0022518001,"about_ca_topic_score_gemma":0.0015223961,"teacher_disagreement_score":0.0034188821,"about_ca_system_score_codex":0.0013753545,"about_ca_system_score_gemma":0.0015625808,"threshold_uncertainty_score":0.01808095},"labels":[],"label_agreement":null},{"id":"W4362583342","doi":"10.3390/s23073683","title":"A New Recursive Trigonometric Technique for FPGA-Design Implementation","year":2023,"lang":"en","type":"article","venue":"Sensors","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CORDIC; Field-programmable gate array; Lookup table; Trigonometry; Computer science; Trigonometric functions; Algorithm; Waveform; Process (computing); Logic block; Transformation (genetics); Computer hardware; Mathematics","score_opus":0.062452244769170794,"score_gpt":0.3659777004172674,"score_spread":0.30352545564809663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362583342","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043731625,0.00046356852,0.98511755,0.00009286723,0.0001420681,0.00006585531,0.00005017634,0.0016542426,0.008040555],"genre_scores_gemma":[0.12730467,0.00068946794,0.86293596,0.00016212669,0.00008764397,0.00011794618,0.00019099038,0.00023773286,0.008273462],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966574,0.000055900753,0.00002870231,0.000046756566,0.0001757125,0.000027251619],"domain_scores_gemma":[0.9997545,0.000048348786,0.000028085942,0.000062074556,0.00009825861,0.000008778231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021331504,0.00065077463,0.00030012324,0.0007573171,0.00032355214,0.0005688729,0.00062171713,0.00035472942,0.006260833],"category_scores_gemma":[0.00077246566,0.00020834606,0.0003911973,0.00071687734,0.00024986587,0.00056683813,0.0002941806,0.0005248914,0.0030143876],"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.00014250839,0.00004585009,0.00051840756,0.00046257823,0.000046345802,0.00046928064,0.00017918914,0.03206566,0.13943519,0.041498046,0.009548464,0.77558845],"study_design_scores_gemma":[0.00013144354,0.0007169255,0.0014339015,0.00020077104,0.00010788118,0.0034940273,0.00012915529,0.53581274,0.2120023,0.0141607495,0.23168579,0.00012431206],"about_ca_topic_score_codex":0.0010351618,"about_ca_topic_score_gemma":0.0015925226,"teacher_disagreement_score":0.006260833,"about_ca_system_score_codex":0.0003819322,"about_ca_system_score_gemma":0.00048772368,"threshold_uncertainty_score":0.020944595},"labels":[],"label_agreement":null},{"id":"W4366087967","doi":"10.3390/appliedmath3020020","title":"A Generalized Series Expansion of the Arctangent Function Based on the Enhanced Midpoint Integration","year":2023,"lang":"en","type":"article","venue":"AppliedMath","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thoth Technology (Canada); York University","funders":"National Research Council Canada; York University","keywords":"Inverse trigonometric functions; Series (stratigraphy); Computation; Series expansion; Mathematics; Midpoint; Function (biology); Generalization; Applied mathematics; Trigonometric functions; Algorithm; Convergence (economics); Numerical integration; Integer (computer science); Taylor series; Mathematical optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.024677146434924226,"score_gpt":0.25492067740690616,"score_spread":0.23024353097198194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366087967","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01700304,0.00043670044,0.97351056,0.00010335003,0.00016291573,0.00002749565,0.000028945055,0.00015973343,0.008567332],"genre_scores_gemma":[0.35246646,0.001140427,0.63815355,0.0001888854,0.00019078907,0.00009982412,0.000093878625,0.00031391828,0.0073523093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977237,0.00005022857,0.000010967439,0.000026050686,0.00012129705,0.000019012903],"domain_scores_gemma":[0.9997482,0.00007848564,0.000020221183,0.000053599684,0.00008396207,0.000015490861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056485424,0.00043732463,0.00049516506,0.0006381746,0.0002497713,0.000550092,0.0010375541,0.00038234127,0.0024412863],"category_scores_gemma":[0.001506576,0.00016556135,0.00047606757,0.00060581666,0.0006264939,0.0011048912,0.00057392585,0.0010229825,0.0008132438],"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.000067230394,0.000054581196,0.00058470166,0.00032016617,0.000032653177,0.0003308156,0.00023578503,0.16013494,0.04206159,0.6734694,0.0023182577,0.12038975],"study_design_scores_gemma":[0.000013831299,0.00006699759,0.00019640804,0.0000355522,0.000014058533,0.00020240842,0.000029142682,0.9038266,0.010736025,0.074836545,0.010022362,0.000020166748],"about_ca_topic_score_codex":0.00045742557,"about_ca_topic_score_gemma":0.0007232571,"teacher_disagreement_score":0.0024412863,"about_ca_system_score_codex":0.00040438856,"about_ca_system_score_gemma":0.00047164553,"threshold_uncertainty_score":0.008166909},"labels":[],"label_agreement":null},{"id":"W4375868211","doi":"10.31219/osf.io/9r743","title":"An Alternative Method for the Gamma Function derived from Natural Logarithm and Pi Function","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Factorial; Logarithm; Gamma function; Function (biology); Factorial experiment; Mathematics; Euler's formula; Natural logarithm; Fractional factorial design; Applied mathematics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05778114293934835,"score_gpt":0.348013009391659,"score_spread":0.2902318664523107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4375868211","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019867183,0.00047330462,0.9910363,0.00026363914,0.000317294,0.000024813002,0.000048552087,0.00022331043,0.005626075],"genre_scores_gemma":[0.12746163,0.0019137682,0.84812444,0.0010281848,0.0010757496,0.00027148466,0.00023929392,0.00090939185,0.018976081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.00046662826,0.00008905459,0.00027011137,0.0004533365,0.00010029057],"domain_scores_gemma":[0.99775934,0.0010162119,0.00013291909,0.000357206,0.0006479717,0.00008624936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021604288,0.0009229432,0.00077196746,0.0035583475,0.00094803306,0.002110721,0.0015873672,0.0013601423,0.0071950313],"category_scores_gemma":[0.011125942,0.000315249,0.0013625569,0.0022243974,0.0019052377,0.0041087954,0.0020283717,0.0027550077,0.0033637134],"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.00003720483,0.000021436634,0.00048356116,0.00012655258,0.000021829308,0.00017646088,0.00020137672,0.0072909305,0.003070173,0.91154337,0.004268291,0.07275881],"study_design_scores_gemma":[0.00003388718,0.000059724964,0.00043205952,0.00009177294,0.00002913659,0.00091317,0.000080425314,0.1143187,0.004878903,0.82041144,0.058688622,0.0000620679],"about_ca_topic_score_codex":0.0011823907,"about_ca_topic_score_gemma":0.0011193409,"teacher_disagreement_score":0.0071950313,"about_ca_system_score_codex":0.0012523709,"about_ca_system_score_gemma":0.001442214,"threshold_uncertainty_score":0.024069786},"labels":[],"label_agreement":null},{"id":"W4376473171","doi":"10.1007/978-3-031-32180-1_10","title":"Evaluation of the Use of Low Precision Floating-Point Arithmetic for Applications in Radio Astronomy","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Herzberg Institute of Astrophysics","funders":"","keywords":"Digital signal processing; Computer science; Upgrade; Radio astronomy; Bandwidth (computing); Electromagnetic interference; Millimeter; Signal processing; Computer hardware; Telecommunications; Physics; Astronomy","score_opus":0.07419582912512034,"score_gpt":0.3185929965358885,"score_spread":0.24439716741076817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376473171","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4924853,0.0120620495,0.32174566,0.0007849765,0.0006702291,0.00023769548,0.0018752839,0.009000487,0.1611383],"genre_scores_gemma":[0.83583015,0.0019160981,0.14386365,0.00012233747,0.00006653631,0.0000903677,0.0012408904,0.0007982257,0.016071754],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979723,0.0003791491,0.00007524932,0.00010490384,0.0013051142,0.00016329906],"domain_scores_gemma":[0.9946004,0.0029799333,0.000205635,0.0004865486,0.0016341353,0.000093342045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011671915,0.00093107554,0.00057741493,0.0011563997,0.0004665073,0.0017692399,0.0013847742,0.0005954601,0.010330405],"category_scores_gemma":[0.010084734,0.00017913537,0.00036703542,0.001532377,0.00043245626,0.001271522,0.00055596436,0.00054420804,0.001822031],"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.0020035612,0.00031189324,0.004287966,0.001729714,0.0001225218,0.000380166,0.00025264474,0.1842957,0.05705787,0.050890915,0.020445405,0.67822164],"study_design_scores_gemma":[0.000120581055,0.0007644746,0.0045637614,0.00039632217,0.00019770401,0.0005081036,0.00026713937,0.78720546,0.13822688,0.021073503,0.046613116,0.00006298741],"about_ca_topic_score_codex":0.0019423678,"about_ca_topic_score_gemma":0.0020635328,"teacher_disagreement_score":0.010330405,"about_ca_system_score_codex":0.000915291,"about_ca_system_score_gemma":0.0009726533,"threshold_uncertainty_score":0.034558654},"labels":[],"label_agreement":null},{"id":"W4377018777","doi":"10.33774/coe-2023-wv4rc-v4","title":"An Alternative Method for the Gamma Function derived from Natural Logarithm and Pi Function","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Factorial; Logarithm; Gamma function; Function (biology); Factorial experiment; Mathematics; Euler's formula; Natural logarithm; Fractional factorial design; Applied mathematics; Pure mathematics; Statistics; Mathematical analysis","score_opus":0.05778114293934835,"score_gpt":0.348013009391659,"score_spread":0.2902318664523107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377018777","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019867183,0.00047330462,0.9910363,0.00026363914,0.000317294,0.000024813002,0.000048552087,0.00022331043,0.005626075],"genre_scores_gemma":[0.12746163,0.0019137682,0.84812444,0.0010281848,0.0010757496,0.00027148466,0.00023929392,0.00090939185,0.018976081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986206,0.00046662826,0.00008905459,0.00027011137,0.0004533365,0.00010029057],"domain_scores_gemma":[0.99775934,0.0010162119,0.00013291909,0.000357206,0.0006479717,0.00008624936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021604288,0.0009229432,0.00077196746,0.0035583475,0.00094803306,0.002110721,0.0015873672,0.0013601423,0.0071950313],"category_scores_gemma":[0.011125942,0.000315249,0.0013625569,0.0022243974,0.0019052377,0.0041087954,0.0020283717,0.0027550077,0.0033637134],"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.00003720483,0.000021436634,0.00048356116,0.00012655258,0.000021829308,0.00017646088,0.00020137672,0.0072909305,0.003070173,0.91154337,0.004268291,0.07275881],"study_design_scores_gemma":[0.00003388718,0.000059724964,0.00043205952,0.00009177294,0.00002913659,0.00091317,0.000080425314,0.1143187,0.004878903,0.82041144,0.058688622,0.0000620679],"about_ca_topic_score_codex":0.0011823907,"about_ca_topic_score_gemma":0.0011193409,"teacher_disagreement_score":0.0071950313,"about_ca_system_score_codex":0.0012523709,"about_ca_system_score_gemma":0.001442214,"threshold_uncertainty_score":0.024069786},"labels":[],"label_agreement":null},{"id":"W4380787291","doi":"10.1090/stml/104/04","title":"Introduction to congruence arithmetic","year":2023,"lang":"en","type":"book-chapter","venue":"Student mathematical library","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Congruence (geometry); Arithmetic; Mathematics; Computer science; Algebra over a field; Pure mathematics; Geometry","score_opus":0.02096316968295584,"score_gpt":0.2816607727206539,"score_spread":0.260697603037698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380787291","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006237676,0.0026916377,0.010461206,0.00087403937,0.0009703841,0.000027511931,0.00023554014,0.00036647994,0.9837494],"genre_scores_gemma":[0.0126571655,0.004430049,0.007366138,0.000538801,0.0010913,0.00005761844,0.000525538,0.00055396586,0.97277933],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997385,0.000033980017,0.000011963447,0.000043641234,0.00014030779,0.00003167198],"domain_scores_gemma":[0.999795,0.00006417852,0.000008216417,0.000035152174,0.000072922274,0.000024561828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024456883,0.00088547956,0.0006843148,0.0013698003,0.0011389897,0.0021616223,0.00070023077,0.00047753096,0.17494333],"category_scores_gemma":[0.00084148214,0.0004866136,0.00051503663,0.001948138,0.0011326957,0.0028132307,0.0014502606,0.0022795235,0.090774044],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018756287,0.00004497147,0.000058967376,0.00015708925,0.0000035127296,0.00005801288,0.00026069063,0.00025169578,0.0009689523,0.507483,0.34266326,0.14803109],"study_design_scores_gemma":[0.000004062314,0.000010474843,0.00010260635,0.000056052693,0.0000026267924,0.000084487045,0.000042724176,0.00014764693,0.00031693504,0.111686975,0.88754046,0.000004850214],"about_ca_topic_score_codex":0.0008277525,"about_ca_topic_score_gemma":0.0017386276,"teacher_disagreement_score":0.17494333,"about_ca_system_score_codex":0.0011201975,"about_ca_system_score_gemma":0.00087177847,"threshold_uncertainty_score":0.5852437},"labels":[],"label_agreement":null},{"id":"W4383749590","doi":"10.1109/fccm57271.2023.00030","title":"Designing a configurable IEEE-compliant FPU that supports variable precision for soft processors","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Xilinx; Intel Corporation","keywords":"Computer science; Field-programmable gate array; Throughput; Embedded system; Floating point; Latency (audio); Implementation; Pipeline transport; Computer hardware; Operating system; Wireless; Engineering","score_opus":0.06201858391409828,"score_gpt":0.3183571542873503,"score_spread":0.25633857037325203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383749590","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18511663,0.0017456606,0.77794117,0.0005828832,0.0005397139,0.0007979779,0.00043990675,0.011587348,0.021248683],"genre_scores_gemma":[0.76685786,0.00022222397,0.2279243,0.0002916895,0.00008652209,0.0003661187,0.0002242129,0.00034401333,0.0036831137],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993104,0.00007763511,0.000051928935,0.00016263805,0.00028459608,0.00011276638],"domain_scores_gemma":[0.99929583,0.00010412209,0.00016187438,0.00014953055,0.00021425249,0.00007431221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041029608,0.00074352464,0.0004690161,0.0008166443,0.0004955806,0.0010415408,0.0026221764,0.0007115107,0.003878927],"category_scores_gemma":[0.0013996037,0.0003418066,0.00019395538,0.00047156593,0.0003918828,0.0012022222,0.0007087867,0.00069091044,0.0017298063],"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.0014480117,0.0006084003,0.0074111265,0.0011383119,0.0001446621,0.0015079443,0.0005485374,0.11610126,0.36342388,0.027003417,0.025533475,0.45513102],"study_design_scores_gemma":[0.00034305177,0.0022054238,0.0031033552,0.00019163164,0.00013832477,0.001741742,0.00018277198,0.51104826,0.3935964,0.006499805,0.0807682,0.00018101426],"about_ca_topic_score_codex":0.0007922937,"about_ca_topic_score_gemma":0.0012856305,"teacher_disagreement_score":0.003878927,"about_ca_system_score_codex":0.0005971256,"about_ca_system_score_gemma":0.00083176,"threshold_uncertainty_score":0.012976289},"labels":[],"label_agreement":null},{"id":"W4384828140","doi":"10.21203/rs.3.rs-3135514/v1","title":"Predictive Biomarker Profiles in Cancer Using a Unique AI Model Based on Set Theory","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Numerical Methods and 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":"McGill University; McGill University Health Centre","funders":"","keywords":"Identification (biology); Biomarker; Outcome (game theory); Cancer; Set (abstract data type); Computer science; Artificial intelligence; Biomarker discovery; Machine learning; Computational biology; Medicine; Internal medicine; Mathematics; Biology; Proteomics","score_opus":0.2520936272897684,"score_gpt":0.503769002380663,"score_spread":0.2516753750908946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384828140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118234985,0.0005404727,0.87603784,0.0013717669,0.000068951944,0.00006009142,0.00025448445,0.00019951715,0.003231899],"genre_scores_gemma":[0.90315264,0.0003652577,0.09350027,0.0001604741,0.000077203884,0.00010589558,0.00021397964,0.000026759433,0.0023975258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989103,0.00044822769,0.00005043374,0.00024484517,0.00024905126,0.000097113974],"domain_scores_gemma":[0.9953223,0.0033345667,0.00061455724,0.00019632887,0.00035076693,0.00018144747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028084768,0.0007230948,0.0011804871,0.0019173649,0.0004933077,0.002652816,0.0013456668,0.0008550211,0.0020229435],"category_scores_gemma":[0.009496257,0.0003180141,0.001040048,0.0012722252,0.0014006991,0.001850004,0.0015241723,0.0015807202,0.0002574869],"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.00010858936,0.00007900443,0.009910028,0.0000817874,0.00015002248,0.00018264062,0.00020646334,0.84510475,0.0013928377,0.11973215,0.0008114338,0.022240363],"study_design_scores_gemma":[0.0000048809316,0.000018687948,0.00033088162,0.0000054679276,0.000009681809,0.000023732258,0.000014533244,0.9663598,0.00011498405,0.032958638,0.00015077827,0.000007879569],"about_ca_topic_score_codex":0.0033867466,"about_ca_topic_score_gemma":0.0017891242,"teacher_disagreement_score":0.0033867466,"about_ca_system_score_codex":0.0013686371,"about_ca_system_score_gemma":0.0011453792,"threshold_uncertainty_score":0.014852822},"labels":[],"label_agreement":null},{"id":"W4386068295","doi":"10.28924/2291-8639-21-2023-87","title":"A Symbolic Algorithm for Solving Doubly Bordered k-Tridiagonal Interval Linear Systems","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tridiagonal matrix; Interval (graph theory); Tridiagonal matrix algorithm; Algorithm; Interval arithmetic; Computation; Mathematics; Divide and conquer algorithms; Computer science; Algebra over a field; Pure mathematics","score_opus":0.023516237977498588,"score_gpt":0.3436594488449571,"score_spread":0.3201432108674585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386068295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031778363,0.000048820777,0.99481344,0.000043658405,0.000019673356,0.00001669863,0.000019217861,0.00029482116,0.0015658627],"genre_scores_gemma":[0.18166403,0.00015935182,0.8156955,0.000055281893,0.000032238262,0.00014301421,0.0001402498,0.00012866658,0.0019816523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997173,0.0000669875,0.000024757337,0.000037861984,0.00011966496,0.00003338601],"domain_scores_gemma":[0.99938166,0.00033211175,0.000056311306,0.00006858359,0.0001370101,0.000024272465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004366294,0.0005517787,0.0006197601,0.0005108195,0.0006321501,0.0007947849,0.00088041794,0.0007151408,0.004971587],"category_scores_gemma":[0.002124198,0.00022144616,0.0003862506,0.0007464824,0.0006870024,0.00082309387,0.0010960178,0.0010788799,0.0010346145],"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.00013978647,0.00006579498,0.00066094875,0.00022628623,0.00003403322,0.00022438353,0.00030208376,0.63605607,0.013378677,0.07409443,0.0032125632,0.27160498],"study_design_scores_gemma":[0.000014881224,0.000022007125,0.000026519116,0.000008775076,0.0000040296095,0.00003079723,0.00001824547,0.9890037,0.0014693512,0.007873024,0.00152301,0.0000056552885],"about_ca_topic_score_codex":0.0021027566,"about_ca_topic_score_gemma":0.00254948,"teacher_disagreement_score":0.004971587,"about_ca_system_score_codex":0.00038180442,"about_ca_system_score_gemma":0.0011497288,"threshold_uncertainty_score":0.016631663},"labels":[],"label_agreement":null},{"id":"W4386248611","doi":"10.1017/9781009303897.003","title":"Numbers","year":2023,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Numerical Methods and 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":"","keywords":"Multipole expansion; Legendre polynomials; Recursion (computer science); Rounding; Set (abstract data type); Variety (cybernetics); Representation (politics); Series (stratigraphy); Electromagnetism; Computer science; Applied mathematics; Algebra over a field; Calculus (dental); Mathematics; Theoretical physics; Algorithm; Pure mathematics; Physics; Mathematical analysis; Artificial intelligence; Quantum mechanics; Programming language","score_opus":0.0364773823564095,"score_gpt":0.2296667590256715,"score_spread":0.193189376669262,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386248611","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052947813,0.007499144,0.014345514,0.0027795527,0.005680495,0.000075133285,0.00091436546,0.0005543176,0.9676221],"genre_scores_gemma":[0.0046962616,0.004190961,0.0069324453,0.0009162857,0.0010284486,0.0000773643,0.0009623201,0.0003939494,0.98080206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994874,0.00007261494,0.000030157858,0.000102640864,0.00027477235,0.000032444295],"domain_scores_gemma":[0.999542,0.00012399773,0.000025982166,0.0000703173,0.000197603,0.000040230992],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035522555,0.0010171444,0.0005429162,0.0013424475,0.0014792623,0.004023038,0.0009997202,0.000757712,0.21250212],"category_scores_gemma":[0.0018116229,0.00029906727,0.00033089353,0.0015648372,0.0011050076,0.0037415703,0.0013500083,0.0019522039,0.12341343],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021922606,0.000014998158,0.000059827962,0.00019423012,0.000002753832,0.00004573013,0.00027273447,0.00024214516,0.00043865037,0.43256557,0.4718861,0.09425535],"study_design_scores_gemma":[7.116787e-7,0.000002569395,0.000025818525,0.0000340591,4.3708692e-7,0.000040948646,0.000021641068,0.00004839556,0.00007131354,0.017383609,0.9823689,0.0000016139793],"about_ca_topic_score_codex":0.0008910941,"about_ca_topic_score_gemma":0.0018782761,"teacher_disagreement_score":0.7874979,"about_ca_system_score_codex":0.0015639442,"about_ca_system_score_gemma":0.00074855244,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4386297689","doi":"10.1007/978-3-031-42753-4_8","title":"Teaching Linear Algebra in a Mechanized Mathematical Environment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Western University","funders":"","keywords":"Python (programming language); Linear algebra; Computer science; Algebra over a field; Maple; MATLAB; Symbolic computation; Mathematics education; Programming language; Software engineering; Mathematics; Pure mathematics; Geometry","score_opus":0.02543426211771828,"score_gpt":0.27545338647031814,"score_spread":0.2500191243525999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386297689","genre_codex":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072836163,0.0016013011,0.48402667,0.0051799025,0.001335438,0.0000619381,0.00016136878,0.0022151114,0.49813455],"genre_scores_gemma":[0.10993736,0.005000242,0.39193514,0.0020299756,0.0018809224,0.00019518632,0.00042617286,0.0013578386,0.48723722],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994974,0.00010099152,0.000015948654,0.000071332135,0.00027552297,0.00003881184],"domain_scores_gemma":[0.99938977,0.0002870431,0.000034664426,0.000095593154,0.00010702372,0.00008597088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004948079,0.0006813396,0.0003821385,0.00069884746,0.00080016785,0.002492526,0.0010595124,0.00072083634,0.062871926],"category_scores_gemma":[0.0013495621,0.0004764112,0.0004465741,0.00082617067,0.0012812659,0.004113817,0.002080252,0.0027207835,0.018126048],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018811841,0.00012739931,0.00013539863,0.00021748104,0.0000067926376,0.00006230722,0.00036100415,0.0032503887,0.0063112513,0.73760724,0.08647553,0.16542633],"study_design_scores_gemma":[0.000012509701,0.000038459242,0.0002411185,0.000156319,0.000006308126,0.0002207864,0.00023465513,0.008840347,0.004219718,0.5490738,0.43693915,0.000016835744],"about_ca_topic_score_codex":0.00031514443,"about_ca_topic_score_gemma":0.001183056,"teacher_disagreement_score":0.062871926,"about_ca_system_score_codex":0.0008366322,"about_ca_system_score_gemma":0.0012794008,"threshold_uncertainty_score":0.21032757},"labels":[],"label_agreement":null},{"id":"W4386986665","doi":"10.3850/978-981-18-8071-1_p672-cd","title":"On the Construction of Numerical Models through a Prime Convolutional Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Canadian Institute of Steel Construction","keywords":"Modulo; Computer science; Congruence (geometry); Prime factor; Convolutional neural network; Representation (politics); Prime (order theory); Set (abstract data type); Integer (computer science); Theoretical computer science; Algorithm; Artificial intelligence; Mathematics; Discrete mathematics; Programming language; Combinatorics","score_opus":0.06688757919077966,"score_gpt":0.2875273924641743,"score_spread":0.22063981327339466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386986665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025816793,0.00014632482,0.96928954,0.00028833232,0.000030004341,0.000016908583,0.000054560445,0.0005175164,0.0038399657],"genre_scores_gemma":[0.5832041,0.00048403817,0.41088057,0.0001953743,0.000063356325,0.00009372302,0.00031213384,0.00014661843,0.004620073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997826,0.0000686024,0.000011532512,0.000053350617,0.000059168524,0.000024777568],"domain_scores_gemma":[0.99951935,0.00022233874,0.000042927782,0.0001297155,0.000057304464,0.000028367984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006305069,0.00041675006,0.00037393463,0.0005417575,0.0003478273,0.0007801913,0.00076561107,0.0005146357,0.0023554303],"category_scores_gemma":[0.0026047926,0.00028234723,0.0005729568,0.00042345928,0.0014223773,0.0021827621,0.0011860789,0.000977079,0.00048182879],"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.00008150012,0.000036767433,0.00089301344,0.000105017534,0.000030335463,0.000065338834,0.00012373051,0.30242643,0.005145435,0.627043,0.0010714235,0.06297795],"study_design_scores_gemma":[0.0000049966734,0.000014924909,0.00007565636,0.00001233019,0.0000057952698,0.000017760418,0.0000068443064,0.8359245,0.0016336031,0.16066119,0.001637434,0.0000050230133],"about_ca_topic_score_codex":0.0016311177,"about_ca_topic_score_gemma":0.0019333491,"teacher_disagreement_score":0.0023554303,"about_ca_system_score_codex":0.00071497826,"about_ca_system_score_gemma":0.00055326015,"threshold_uncertainty_score":0.007879674},"labels":[],"label_agreement":null},{"id":"W4387260750","doi":"10.23952/jnva.7.2023.5.09","title":"Fréchet subdifferential calculus for interval-valued functions and its applications in nonsmooth interval optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Subderivative; Interval (graph theory); Mathematics; Calculus (dental); Applied mathematics; Mathematical optimization; Pure mathematics; Regular polygon; Combinatorics; Medicine; Convex optimization; Geometry","score_opus":0.026272807803175938,"score_gpt":0.31612973782345194,"score_spread":0.289856930020276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260750","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005636859,0.0010872514,0.98913234,0.00025255437,0.00008307813,0.000026309539,0.000025214607,0.000026998363,0.0037293325],"genre_scores_gemma":[0.3980193,0.004512458,0.58764553,0.00042057666,0.0005549113,0.0002536316,0.000149572,0.00012817179,0.008315812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992887,0.00030073337,0.000046548495,0.0001229133,0.00018348833,0.000057672667],"domain_scores_gemma":[0.9985367,0.00087574264,0.00012865876,0.00010858006,0.00025189633,0.00009844591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003268686,0.0011317467,0.00084768975,0.001525556,0.000564037,0.0012142041,0.00094541814,0.0010286346,0.0019236159],"category_scores_gemma":[0.0055849757,0.00033886812,0.0015270377,0.0011834562,0.0021126994,0.0021029366,0.0018152238,0.002966103,0.0002514801],"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.000022582848,0.000037011207,0.0004965489,0.00014818438,0.000032097894,0.0002038165,0.0002145572,0.07126192,0.004768759,0.89343244,0.0012871375,0.028094841],"study_design_scores_gemma":[0.000008423157,0.00007581044,0.0003907532,0.000044116478,0.000018268349,0.00014221048,0.000055136126,0.6465461,0.0012015277,0.34546098,0.006032509,0.000024151273],"about_ca_topic_score_codex":0.0017450184,"about_ca_topic_score_gemma":0.0014143054,"teacher_disagreement_score":0.003268686,"about_ca_system_score_codex":0.001057689,"about_ca_system_score_gemma":0.00095510104,"threshold_uncertainty_score":0.017286658},"labels":[],"label_agreement":null},{"id":"W4389387126","doi":"10.1109/iccs59700.2023.10335508","title":"High Performance and Energy Efficient Floating-Point Multiplier on FPGA","year":2023,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Qingdao","keywords":"Multiplier (economics); Double-precision floating-point format; Field-programmable gate array; Computer science; Single-precision floating-point format; Computer hardware; Floating point; Embedded system; Digital signal processing; Energy consumption; Virtex; Algorithm; Engineering; Electrical engineering","score_opus":0.015254500720810788,"score_gpt":0.24867582358008872,"score_spread":0.23342132285927794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389387126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18326885,0.003301161,0.77546054,0.00030719567,0.000395807,0.00018446476,0.00029136825,0.004460205,0.0323304],"genre_scores_gemma":[0.70600396,0.0010328272,0.27410173,0.00013551672,0.000073689014,0.00010705442,0.0004005911,0.0000960701,0.01804848],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9998543,0.000013157852,0.000009438163,0.000027662767,0.00006918856,0.000026320788],"domain_scores_gemma":[0.9999225,0.000010450419,0.000011084234,0.000012236094,0.000037260746,0.0000064319574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010472997,0.00048155262,0.00027588106,0.0004063137,0.00024886805,0.00037663948,0.00063928857,0.00023702094,0.0033279655],"category_scores_gemma":[0.00025008968,0.00016230483,0.00017400744,0.00035609558,0.00009709717,0.0005322897,0.00022442601,0.00030383308,0.00096613367],"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.0006613952,0.00008496991,0.0013290287,0.0005716365,0.00007781588,0.00080435467,0.00011152629,0.023439797,0.5031878,0.01751897,0.009334142,0.4428787],"study_design_scores_gemma":[0.00023801089,0.0016098581,0.0047996216,0.00017483687,0.00010079439,0.00260898,0.000103358085,0.3124331,0.5612997,0.005834577,0.11068142,0.00011577511],"about_ca_topic_score_codex":0.00051211705,"about_ca_topic_score_gemma":0.0009762546,"teacher_disagreement_score":0.0033279655,"about_ca_system_score_codex":0.00024467657,"about_ca_system_score_gemma":0.0003443658,"threshold_uncertainty_score":0.011133134},"labels":[],"label_agreement":null},{"id":"W4390055465","doi":"10.18280/mmep.100636","title":"Implementing Interval Linear Equations Systems for Enhanced Circuit Analysis","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Network analysis; Computer science; Linear circuit; Interval (graph theory); Mathematics; Equivalent circuit; Electrical engineering; Engineering; Voltage; Combinatorics","score_opus":0.07300491375540492,"score_gpt":0.2948277919037262,"score_spread":0.2218228781483213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390055465","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001331928,0.000042371514,0.99777323,0.000021445294,0.00001271816,0.000012318449,0.000007214442,0.00012981732,0.00066883356],"genre_scores_gemma":[0.13781044,0.00021851796,0.8599289,0.00006161901,0.000049063892,0.00015628814,0.000084221436,0.000112428716,0.0015784889],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990721,0.0003848415,0.00006603128,0.00012687445,0.00029503586,0.000055211043],"domain_scores_gemma":[0.99829966,0.0011484446,0.00013653623,0.00016189727,0.00022194166,0.000031560503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001737643,0.0008581517,0.0007808867,0.00069980987,0.00040653377,0.0014454225,0.0011573231,0.0008386936,0.00478336],"category_scores_gemma":[0.004806866,0.0003912268,0.000900647,0.0007352028,0.00086723367,0.0016047362,0.0017231265,0.0019772067,0.0010731372],"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.00009789604,0.00006477967,0.0005144823,0.00024775343,0.0000488853,0.0001353724,0.0003334761,0.59431237,0.00844989,0.24298705,0.0012884064,0.15151969],"study_design_scores_gemma":[0.000010183247,0.000027897238,0.000032047607,0.000017300426,0.000006703221,0.000020626316,0.000016619484,0.9664786,0.001615991,0.029180953,0.0025864784,0.000006579251],"about_ca_topic_score_codex":0.0014217496,"about_ca_topic_score_gemma":0.0009540001,"teacher_disagreement_score":0.00478336,"about_ca_system_score_codex":0.00058132544,"about_ca_system_score_gemma":0.0006435801,"threshold_uncertainty_score":0.01600194},"labels":[],"label_agreement":null},{"id":"W4390846317","doi":"10.1007/978-3-031-42478-6_24","title":"A Review of Posit Arithmetic for Energy-Efficient Computation: Methodologies, Applications, and Challenges","year":2023,"lang":"en","type":"review","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Rounding; Computer science; Floating point; Computation; Range (aeronautics); Computer engineering; Point (geometry); Representation (politics); Computer architecture; Computer hardware; Theoretical computer science; Arithmetic; Algorithm; Engineering","score_opus":0.35806147755987094,"score_gpt":0.4591130289443622,"score_spread":0.10105155138449123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390846317","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010971808,0.99536383,0.0020807474,0.00049007207,0.00039642345,0.000009626959,0.00003888636,0.000024971696,0.0014856902],"genre_scores_gemma":[0.00084321224,0.99513066,0.0024367822,0.00038392894,0.00053771085,0.000020988213,0.00006180956,0.000014075052,0.0005707878],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99933016,0.0001253462,0.00009032069,0.00011390503,0.00029541558,0.000044914388],"domain_scores_gemma":[0.9980446,0.0011634837,0.00013993496,0.00009363571,0.00047672287,0.00008161758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016801787,0.00143066,0.0022365374,0.003571169,0.00052806974,0.0019126586,0.0021829843,0.0015336184,0.0063614813],"category_scores_gemma":[0.0036962563,0.0007925667,0.00086734566,0.005601002,0.0011611013,0.003264756,0.0014759143,0.0028300215,0.004178661],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082857,0.000089942914,0.00017334816,0.02470083,0.00010595338,0.000059873197,0.000050030318,0.0017922672,0.0016393198,0.03529857,0.050496824,0.88551027],"study_design_scores_gemma":[0.000024289797,0.00012321868,0.00030544883,0.004672217,0.00010692628,0.00035167072,0.00003467057,0.0009767448,0.0010316481,0.014450746,0.9778732,0.00004920751],"about_ca_topic_score_codex":0.0011635798,"about_ca_topic_score_gemma":0.0017377009,"teacher_disagreement_score":0.0063614813,"about_ca_system_score_codex":0.0009257067,"about_ca_system_score_gemma":0.0022235774,"threshold_uncertainty_score":0.021281302},"labels":[],"label_agreement":null},{"id":"W4391935804","doi":"10.1109/tetc.2024.3365650","title":"A Design Framework for Hardware-Efficient Logarithmic Floating-Point Multipliers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Logarithm; Parallel computing; Floating point; Point (geometry); Field-programmable gate array; Computer hardware; Computational science; Embedded system; Algorithm; Mathematics","score_opus":0.04551023257329208,"score_gpt":0.3369960229184239,"score_spread":0.29148579034513183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391935804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018423544,0.00027752237,0.9937005,0.00007828946,0.00003407506,0.00005887294,0.000026632097,0.0004798235,0.0035018788],"genre_scores_gemma":[0.20446886,0.0007435392,0.78682774,0.00022169852,0.00009843857,0.0003832368,0.00013389226,0.0001864204,0.0069361874],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995216,0.000077585035,0.000038597063,0.00007297356,0.00024372633,0.00004540591],"domain_scores_gemma":[0.99965465,0.000082563056,0.000047133857,0.000057863945,0.00014330441,0.000014313742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058112905,0.00080560026,0.00034263023,0.000685444,0.00040353945,0.0012028997,0.0016849234,0.0005885914,0.004476516],"category_scores_gemma":[0.001477734,0.00034525368,0.0004212216,0.0004807083,0.00042007177,0.0010455815,0.0005666602,0.0009509814,0.0017712624],"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.00026801537,0.00009464722,0.00056726363,0.0006648004,0.00006429039,0.00046675047,0.00029564273,0.2030774,0.11061709,0.24760522,0.007972873,0.428306],"study_design_scores_gemma":[0.00008917673,0.0005388585,0.0002699157,0.00017936266,0.00005605906,0.0008928817,0.00006449061,0.7759671,0.0647535,0.048178773,0.10895724,0.000052662315],"about_ca_topic_score_codex":0.0006614544,"about_ca_topic_score_gemma":0.0008527873,"teacher_disagreement_score":0.004476516,"about_ca_system_score_codex":0.00070493517,"about_ca_system_score_gemma":0.0006974114,"threshold_uncertainty_score":0.014975429},"labels":[],"label_agreement":null},{"id":"W4392759659","doi":"10.5194/egusphere-egu24-13330","title":"An improved Copula-Based Framework for Efficient Global Sensitivity Analysis","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Numerical Methods 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":"University of Saskatchewan; University of Calgary; University of Alberta","funders":"","keywords":"Copula (linguistics); Sensitivity (control systems); Econometrics; Computer science; Economics; Engineering","score_opus":0.023194804921752625,"score_gpt":0.3603589878813745,"score_spread":0.33716418295962186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392759659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009392475,0.000121036326,0.99747014,0.000039828028,0.000014211634,0.000024987932,0.00006878064,0.00020035224,0.001121501],"genre_scores_gemma":[0.25399452,0.0010879951,0.7370712,0.0002529492,0.0001798977,0.0005697135,0.0007820629,0.00084950635,0.005212219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982181,0.00082328246,0.0000931243,0.00028932968,0.00043663237,0.00013951976],"domain_scores_gemma":[0.9971916,0.0016289963,0.00022128806,0.00028944868,0.0005918594,0.00007672465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039781225,0.0022970517,0.0016585917,0.0029888502,0.0006506088,0.0018883545,0.0016039326,0.0009848609,0.0062227896],"category_scores_gemma":[0.008618415,0.0009906112,0.0029123789,0.0020850613,0.0009898923,0.001874139,0.0022322086,0.0026877054,0.0011949718],"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.000020914687,0.00003371253,0.000398513,0.00011847857,0.00009983274,0.000105345986,0.00006454538,0.88613504,0.0021999325,0.06929747,0.0019339069,0.039592244],"study_design_scores_gemma":[0.0000021891915,0.000009611712,0.00007383925,0.000008042221,0.000009371291,0.000013133569,0.0000058537094,0.98579514,0.0002451378,0.012737963,0.0010917288,0.000007981699],"about_ca_topic_score_codex":0.011073351,"about_ca_topic_score_gemma":0.0064343456,"teacher_disagreement_score":0.011073351,"about_ca_system_score_codex":0.0012172341,"about_ca_system_score_gemma":0.0022255639,"threshold_uncertainty_score":0.022017777},"labels":[],"label_agreement":null},{"id":"W4392849806","doi":"10.1145/3650036","title":"Designing an IEEE-Compliant FPU that Supports Configurable Precision for Soft Processors","year":2024,"lang":"en","type":"article","venue":"ACM Transactions on Reconfigurable Technology and Systems","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Field-programmable gate array; Single-precision floating-point format; Scalability; Lookup table; Latency (audio); Floating point; Parallel computing; Embedded system; Computer hardware; Algorithm; Operating system","score_opus":0.048089707626656666,"score_gpt":0.30750307460928855,"score_spread":0.2594133669826319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392849806","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2154647,0.00083932583,0.7354211,0.00032395762,0.00029922748,0.00039746132,0.00033380438,0.03102775,0.015892632],"genre_scores_gemma":[0.59799826,0.00019745169,0.39479753,0.00028191402,0.000067355584,0.0003499666,0.0005773893,0.0013225904,0.0044075204],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989072,0.00015651582,0.000117284195,0.00014897686,0.00049893075,0.00017106804],"domain_scores_gemma":[0.99851006,0.00035670496,0.00017606175,0.0004580595,0.00041765664,0.00008139922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007437124,0.000658107,0.00041975672,0.0007910195,0.00033612442,0.0012073134,0.0023426195,0.00058481295,0.0033606854],"category_scores_gemma":[0.004385454,0.00041223716,0.00032069458,0.0006275367,0.0005136844,0.0014421516,0.0008382673,0.00092423934,0.0016514608],"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.0016089061,0.0005080415,0.00789242,0.00095003075,0.00012280009,0.0008334391,0.0005001276,0.10841695,0.20763819,0.037570424,0.021964714,0.61199397],"study_design_scores_gemma":[0.00028368563,0.0012565786,0.00224409,0.00013177442,0.00009629447,0.00076330925,0.00012522521,0.54185545,0.38273087,0.008585711,0.06177958,0.00014738893],"about_ca_topic_score_codex":0.0012111737,"about_ca_topic_score_gemma":0.0011622426,"teacher_disagreement_score":0.0033606854,"about_ca_system_score_codex":0.00055459567,"about_ca_system_score_gemma":0.0011253711,"threshold_uncertainty_score":0.011242628},"labels":[],"label_agreement":null},{"id":"W4393159133","doi":"10.1609/aaai.v38i8.28650","title":"An Approximate Skolem Function Counter","year":2024,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Numerical Methods and Algorithms","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 Toronto","funders":"","keywords":"Function (biology); Physics; Mathematics; Biology","score_opus":0.06802914258940301,"score_gpt":0.3278646981445455,"score_spread":0.2598355555551425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393159133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031790383,0.00037604597,0.94684947,0.000689228,0.00012262468,0.00012882492,0.00055788324,0.012767042,0.006718401],"genre_scores_gemma":[0.32270685,0.0001640356,0.66975313,0.0005845677,0.0000832474,0.00031142117,0.0010575089,0.0010585755,0.0042807283],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761665,0.0005151425,0.00012655703,0.00068291713,0.0008016035,0.00025726054],"domain_scores_gemma":[0.9939545,0.0031095645,0.00040138248,0.0017705697,0.0006129929,0.00015104077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017887965,0.0011721557,0.0011607152,0.002057259,0.0010190023,0.002492972,0.0033204437,0.0022198162,0.008601532],"category_scores_gemma":[0.012056573,0.0005420426,0.0013310107,0.0015528499,0.0014033174,0.0059737517,0.001969953,0.0018047943,0.0027002],"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.0017154338,0.0003289908,0.005420581,0.00060276483,0.0001914946,0.00031493366,0.00040914465,0.13759232,0.04725058,0.30720332,0.023908583,0.4750618],"study_design_scores_gemma":[0.0000842779,0.00013116044,0.0003488268,0.00006774483,0.000053842672,0.0002715389,0.00004828769,0.8330693,0.031430703,0.12323456,0.011212337,0.000047463498],"about_ca_topic_score_codex":0.0015729945,"about_ca_topic_score_gemma":0.0026976177,"teacher_disagreement_score":0.008601532,"about_ca_system_score_codex":0.0028192634,"about_ca_system_score_gemma":0.003830023,"threshold_uncertainty_score":0.028775036},"labels":[],"label_agreement":null},{"id":"W4393443200","doi":"10.23952/jano.6.2024.2.02","title":"Generalized Hukuhara Dini Hadamard $\\epsilon$-subdifferential and $H_{\\epsilon}$-subgradient and their applications in interval optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Subgradient method; Subderivative; Hadamard transform; Mathematics; Interval (graph theory); Pure mathematics; Applied mathematics; Mathematical analysis; Mathematical optimization; Regular polygon; Convex optimization; Combinatorics; Geometry","score_opus":0.01156842082400594,"score_gpt":0.2540222144213252,"score_spread":0.24245379359731928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011042216,0.0020861933,0.98052144,0.00038463314,0.00012113214,0.0000345669,0.00007394758,0.000046348443,0.0056894366],"genre_scores_gemma":[0.38884816,0.0046127923,0.5946619,0.00038954394,0.00031281187,0.00024037497,0.00027631287,0.00015919075,0.010498927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993106,0.00031773592,0.000050018512,0.00011012204,0.00015615954,0.00005530439],"domain_scores_gemma":[0.9986853,0.00073042273,0.0000966024,0.00011499619,0.00028771747,0.000085004845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024494904,0.0010401619,0.0009316875,0.0009963884,0.00040303986,0.0011830453,0.0009027795,0.0009339787,0.0020913074],"category_scores_gemma":[0.0049904054,0.00038598062,0.0011389811,0.0008159727,0.0015475007,0.0019120624,0.0012719368,0.002436231,0.00036658204],"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.00014815421,0.000059160186,0.0014692874,0.0003929144,0.00007710058,0.0002594921,0.00025929356,0.16954279,0.005592972,0.74469215,0.0033204202,0.07418632],"study_design_scores_gemma":[0.000015560885,0.00008412977,0.00058733666,0.000054445172,0.000020704982,0.00016481662,0.000055561904,0.8321684,0.0021598227,0.15831561,0.006340379,0.00003319893],"about_ca_topic_score_codex":0.0020802577,"about_ca_topic_score_gemma":0.001534034,"teacher_disagreement_score":0.0024494904,"about_ca_system_score_codex":0.0010958768,"about_ca_system_score_gemma":0.00084338454,"threshold_uncertainty_score":0.012954354},"labels":[],"label_agreement":null},{"id":"W4396670834","doi":"10.28924/2291-8639-22-2024-72","title":"Typical Sequence of Real Numbers From the Unit Interval Has All Distribution Functions","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Unit interval; Interval (graph theory); Sequence (biology); Unit (ring theory); Distribution (mathematics); Real number; Combinatorics; Mathematical analysis; Mathematics education","score_opus":0.048301418521463996,"score_gpt":0.3541620675182604,"score_spread":0.30586064899679644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396670834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42714474,0.0028011622,0.54246676,0.0007816084,0.00015710645,0.00006311186,0.00090905745,0.0005114555,0.025165087],"genre_scores_gemma":[0.92159545,0.0015344687,0.06976877,0.00022600316,0.00022306723,0.00014550937,0.0013158954,0.00013928526,0.005051489],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857223,0.00033701822,0.00010384279,0.00037747723,0.00047369467,0.0001358383],"domain_scores_gemma":[0.99435645,0.0026239068,0.0007537259,0.0005010217,0.0013267432,0.00043803803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020029834,0.00057919475,0.0011840216,0.0020791602,0.0007333551,0.0016883847,0.0010172839,0.0004948324,0.0031263074],"category_scores_gemma":[0.008598971,0.00026745195,0.0006532453,0.0015074371,0.0018272018,0.003260453,0.0012703931,0.0012717588,0.0004596681],"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.00014456571,0.000037519938,0.0030916631,0.0002940367,0.000075788965,0.00023290761,0.00039955613,0.0064926464,0.00970014,0.95654416,0.0014657164,0.021521255],"study_design_scores_gemma":[0.00004029286,0.00045420948,0.00670889,0.00012196945,0.00005836847,0.0015648357,0.00061695714,0.097831875,0.011246849,0.8643456,0.016928881,0.000081270715],"about_ca_topic_score_codex":0.00070069276,"about_ca_topic_score_gemma":0.0004217218,"teacher_disagreement_score":0.0031263074,"about_ca_system_score_codex":0.00079034484,"about_ca_system_score_gemma":0.00056998554,"threshold_uncertainty_score":0.0105929375},"labels":[],"label_agreement":null},{"id":"W4396700653","doi":"10.4171/mems/13","title":"On Efficient Algorithms for Computing Near-Best Polynomial Approximations to High-Dimensional, Hilbert-Valued Functions from Limited Samples","year":2024,"lang":"en","type":"book","venue":"Memoirs of the European Mathematical Society","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Algorithm; Polynomial; Mathematics; Approximations of π; Computer science; Discrete mathematics; Applied mathematics; Mathematical analysis","score_opus":0.03900926662789469,"score_gpt":0.27792535818383807,"score_spread":0.23891609155594337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396700653","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002632326,0.0023608487,0.98960614,0.0004562416,0.00033157907,0.00005490648,0.00016774933,0.0009420377,0.0034483075],"genre_scores_gemma":[0.04685449,0.0031216773,0.92986566,0.00064939936,0.0006324701,0.00043542802,0.0012415462,0.0009978312,0.016201613],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973598,0.00080575387,0.00018171108,0.0003927234,0.001042437,0.00021758072],"domain_scores_gemma":[0.99145776,0.006559794,0.00022403202,0.0009747167,0.0006208991,0.00016279725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039435164,0.0031979291,0.002780982,0.00183796,0.001075134,0.0028383336,0.0028488787,0.0019436466,0.00899901],"category_scores_gemma":[0.023882836,0.0011539254,0.0017374866,0.004710587,0.002928774,0.006833754,0.004622126,0.0058594025,0.0057474966],"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.00084036606,0.00023710827,0.0006745901,0.0006853441,0.00025837458,0.00018540352,0.00043779213,0.21427076,0.0063979346,0.19019894,0.0659665,0.519847],"study_design_scores_gemma":[0.00012174791,0.000091246824,0.00038963306,0.00008991754,0.000050086088,0.00017916088,0.00008847759,0.7347051,0.0035120193,0.2442883,0.016437996,0.000046322588],"about_ca_topic_score_codex":0.0032992188,"about_ca_topic_score_gemma":0.0042695883,"teacher_disagreement_score":0.00899901,"about_ca_system_score_codex":0.0016589169,"about_ca_system_score_gemma":0.0021774822,"threshold_uncertainty_score":0.030104697},"labels":[],"label_agreement":null},{"id":"W4399487307","doi":"10.1145/3649476.3658706","title":"A Low-Power and High-Accuracy Approximate Adder for Logarithmic Number System","year":2024,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Universitas Brawijaya","keywords":"Adder; Logarithm; Computer science; Power (physics); Arithmetic; Parallel computing; Mathematics; Telecommunications; Physics","score_opus":0.013159398471653237,"score_gpt":0.28706051908047736,"score_spread":0.2739011206088241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399487307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11707864,0.004174118,0.8515819,0.0008889863,0.00065927533,0.00017889634,0.00050695316,0.005229571,0.019701697],"genre_scores_gemma":[0.72903174,0.0011132844,0.25793618,0.0005876642,0.0002068352,0.00011272837,0.0005188904,0.0000854103,0.010407253],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9996685,0.00003937883,0.000039764967,0.000068951165,0.00013828273,0.000045138357],"domain_scores_gemma":[0.999666,0.000061958286,0.000057593184,0.0000755326,0.00011611332,0.000022953818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024703753,0.00052611536,0.00039336985,0.0006400738,0.00063398015,0.0010671944,0.0013347949,0.0003899803,0.0054685306],"category_scores_gemma":[0.00080940564,0.0002460667,0.0003677671,0.00088111404,0.00032363238,0.001983356,0.00055074046,0.0004889959,0.0011041531],"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.0010565494,0.00013826792,0.0020691166,0.0007304418,0.00010963072,0.0008198137,0.0002240341,0.036345042,0.26268008,0.045594644,0.017132204,0.6331002],"study_design_scores_gemma":[0.00021207641,0.0018540949,0.002234864,0.00016817682,0.0003248257,0.0044244635,0.00015815799,0.48581672,0.3726522,0.017660342,0.114316806,0.0001772208],"about_ca_topic_score_codex":0.0009365621,"about_ca_topic_score_gemma":0.0018604588,"teacher_disagreement_score":0.0054685306,"about_ca_system_score_codex":0.00065337576,"about_ca_system_score_gemma":0.001099099,"threshold_uncertainty_score":0.018294036},"labels":[],"label_agreement":null},{"id":"W4399511785","doi":"10.48550/arxiv.2406.04530","title":"A general framework for floating point error analysis of simplex derivatives","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simplex; Point (geometry); Error analysis; Computer science; Mathematics; Applied mathematics; Geometry","score_opus":0.12429011373928457,"score_gpt":0.2785428727080716,"score_spread":0.15425275896878704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399511785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011841953,0.0004893926,0.9957267,0.00021346669,0.00006198045,0.000018660963,0.000044437293,0.00010474897,0.0021565128],"genre_scores_gemma":[0.16127084,0.0028533908,0.8248526,0.00065063447,0.0006106016,0.00032331827,0.00028287,0.0009956519,0.0081600575],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99667835,0.0010179814,0.00021986902,0.00046751718,0.0014379106,0.00017839376],"domain_scores_gemma":[0.9937092,0.0031455462,0.00040851318,0.0010108639,0.0015432356,0.0001825606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057166493,0.0016001672,0.0013832182,0.0025539657,0.001021637,0.0030534386,0.003077815,0.002062295,0.0038684167],"category_scores_gemma":[0.02281808,0.00066258345,0.0018471692,0.002015579,0.003322788,0.005218863,0.00366252,0.004998664,0.0013727027],"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.00002502261,0.000012932799,0.0002954623,0.0001388859,0.000029772384,0.00009430852,0.00014424931,0.11528572,0.002257217,0.85638773,0.0020948139,0.023233872],"study_design_scores_gemma":[0.0000077642835,0.000028513547,0.000168334,0.00007184251,0.000016034724,0.000093361436,0.000029313083,0.5998696,0.0014524279,0.38711715,0.011117293,0.000028377313],"about_ca_topic_score_codex":0.0038452954,"about_ca_topic_score_gemma":0.0022984005,"teacher_disagreement_score":0.0057166493,"about_ca_system_score_codex":0.0021111388,"about_ca_system_score_gemma":0.0015325352,"threshold_uncertainty_score":0.030232906},"labels":[],"label_agreement":null},{"id":"W4399545623","doi":"10.20944/preprints202406.0554.v1","title":"A Rational Approximation of the Two-Term Machin-Like Formula for π","year":2024,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Numerical Methods and 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":"Thoth Technology (Canada); York University","funders":"","keywords":"Term (time); Trigonometry; Representation (politics); Mathematics; Convergence (economics); Binary number; Rational function; Applied mathematics; Trigonometric functions; Algebra over a field; Pure mathematics; Mathematical analysis; Arithmetic","score_opus":0.11403171367061332,"score_gpt":0.383765199226723,"score_spread":0.26973348555610965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399545623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057005793,0.00032447954,0.9260792,0.0002694464,0.00017508015,0.00003233824,0.000046568755,0.0003386465,0.01572841],"genre_scores_gemma":[0.52946025,0.00044068674,0.4608929,0.00022465913,0.000111055044,0.00007546188,0.00012837796,0.00018452581,0.0084820455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996718,0.00007514728,0.000016790234,0.000041356932,0.00015806734,0.000036917125],"domain_scores_gemma":[0.9994677,0.00022781936,0.000049471848,0.00011480609,0.00010734753,0.000032902095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000750707,0.00034245566,0.0003489707,0.00079560676,0.00039935316,0.0010962235,0.0008005034,0.00057875994,0.003541265],"category_scores_gemma":[0.0042778854,0.0001564292,0.000349946,0.000573962,0.0009870793,0.00163409,0.00067586894,0.0010376154,0.0010904939],"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.00013117986,0.00004095514,0.00079513673,0.00015747032,0.00001053626,0.0001580357,0.00013719097,0.034172006,0.011350847,0.8855571,0.0016767194,0.065812804],"study_design_scores_gemma":[0.000027297085,0.00011563589,0.00053168926,0.000061467435,0.000014038798,0.0003166712,0.000057811634,0.5553947,0.010893667,0.42477095,0.0077705937,0.0000454148],"about_ca_topic_score_codex":0.0004039035,"about_ca_topic_score_gemma":0.00045347738,"teacher_disagreement_score":0.003541265,"about_ca_system_score_codex":0.00052459206,"about_ca_system_score_gemma":0.00044349846,"threshold_uncertainty_score":0.011846721},"labels":[],"label_agreement":null},{"id":"W4399582806","doi":"10.32614/cran.package.precisesums","title":"PreciseSums: Accurate Floating Point Sums and Products","year":2017,"lang":"en","type":"dataset","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.04113843165412018,"score_gpt":0.3412170548314588,"score_spread":0.30007862317733863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399582806","genre_codex":"methods","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010453936,0.0011348278,0.6431594,0.00065809087,0.0008357775,0.00018422806,0.011988344,0.31212354,0.028870372],"genre_scores_gemma":[0.036791664,0.0022073688,0.64141995,0.0014743119,0.0006507631,0.0009758185,0.03765055,0.22464277,0.05418671],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9890744,0.0012949911,0.0011927595,0.001196785,0.0065765455,0.0006646263],"domain_scores_gemma":[0.9928347,0.0017525014,0.00043733447,0.002551734,0.002139176,0.00028458223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045818803,0.003751179,0.0028202625,0.003561812,0.0015385923,0.0070833573,0.007837584,0.0022242514,0.16363195],"category_scores_gemma":[0.032787148,0.0034379293,0.0044713314,0.0048724897,0.002273044,0.01448508,0.0096240435,0.005978686,0.17467315],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047180124,0.00007398592,0.0006786222,0.0011633438,0.00012967632,0.00022321174,0.00029429354,0.009601111,0.004688879,0.07896264,0.6491536,0.2545589],"study_design_scores_gemma":[0.00021235185,0.000078838224,0.00052894483,0.0004674132,0.000069675676,0.0004001653,0.00008287657,0.05148459,0.025380565,0.14672467,0.77432907,0.00024088241],"about_ca_topic_score_codex":0.0030109074,"about_ca_topic_score_gemma":0.00404619,"teacher_disagreement_score":0.16363195,"about_ca_system_score_codex":0.001884249,"about_ca_system_score_gemma":0.0029653655,"threshold_uncertainty_score":0.5474034},"labels":[],"label_agreement":null},{"id":"W4399828041","doi":"10.1007/978-3-031-54071-4_12","title":"Coding for Control and Connections with Information Theory","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Coding (social sciences); Computer science; Information theory; Communication; Psychology; Mathematics; Statistics","score_opus":0.010349412030994072,"score_gpt":0.2325417374375132,"score_spread":0.22219232540651912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044013914,0.018813778,0.6153236,0.0061312513,0.0024777136,0.000056218574,0.0004781514,0.00033615922,0.3519816],"genre_scores_gemma":[0.4278389,0.03759573,0.19816893,0.0040163747,0.006260964,0.00056730217,0.0007691326,0.00070415897,0.3240785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996113,0.00012096564,0.000017453498,0.000055740187,0.00016060655,0.00003392926],"domain_scores_gemma":[0.99909306,0.00061914045,0.00003526901,0.00013956963,0.00009287266,0.000020128899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056064955,0.00073890865,0.00070065603,0.0009591199,0.000679509,0.002404647,0.0008802585,0.0014934366,0.012998976],"category_scores_gemma":[0.0023618573,0.00032917937,0.00044559693,0.0016989642,0.0033733167,0.0035087115,0.0009892856,0.002494629,0.0021804152],"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.000002457585,0.0000034377565,0.0000065422196,0.000030043453,0.0000018839147,0.000005870042,0.000024334011,0.001401938,0.00013781137,0.9805768,0.003978204,0.013830774],"study_design_scores_gemma":[0.000001842023,0.000003569789,0.000015583173,0.000023071612,0.0000015831283,0.000012142544,0.000008018066,0.0040143915,0.00016543423,0.9799936,0.015755719,0.000004958024],"about_ca_topic_score_codex":0.0017582263,"about_ca_topic_score_gemma":0.0011977969,"teacher_disagreement_score":0.012998976,"about_ca_system_score_codex":0.0014336462,"about_ca_system_score_gemma":0.000838338,"threshold_uncertainty_score":0.04348588},"labels":[],"label_agreement":null},{"id":"W4399828208","doi":"10.1007/978-3-031-54071-4_17","title":"Optimal Coding Under Small Estimation Error and Observability Criteria","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Observability; Estimation; Coding (social sciences); Computer science; Mathematics; Statistics; Engineering; Applied mathematics","score_opus":0.054534141717654264,"score_gpt":0.3016642024157957,"score_spread":0.24713006069814147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009344648,0.00042508412,0.9717704,0.00041988783,0.0000909567,0.000022856953,0.0001431048,0.00014062147,0.01764247],"genre_scores_gemma":[0.69057804,0.0027920583,0.25452256,0.00051235256,0.00046696974,0.0003265204,0.00058115704,0.00036947356,0.049850874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993648,0.00019391246,0.000032299333,0.00010260028,0.00022974526,0.000076744465],"domain_scores_gemma":[0.9970306,0.0022818334,0.00012882208,0.00025740458,0.00026076063,0.000040554187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496613,0.000749485,0.00059296197,0.0005520239,0.00030040808,0.001337952,0.0007111158,0.0009024664,0.0040037963],"category_scores_gemma":[0.0065611997,0.00034388388,0.00030582555,0.00075642386,0.0013323576,0.0023081594,0.001461414,0.0012405809,0.00064292166],"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.000082292034,0.00002095766,0.00011986262,0.000110217676,0.000012951658,0.00007485205,0.00009150412,0.12680879,0.004946468,0.7939319,0.003519033,0.07028128],"study_design_scores_gemma":[0.000015104509,0.000033401062,0.00011645848,0.000044627326,0.000007828287,0.00007646877,0.000028164763,0.4572899,0.003395327,0.5360712,0.002904784,0.000016704456],"about_ca_topic_score_codex":0.0015846489,"about_ca_topic_score_gemma":0.0010892696,"teacher_disagreement_score":0.0040037963,"about_ca_system_score_codex":0.0007417451,"about_ca_system_score_gemma":0.00086119317,"threshold_uncertainty_score":0.013393998},"labels":[],"label_agreement":null},{"id":"W4401762479","doi":"10.1007/978-3-031-69070-9_16","title":"Computing Clipped Products","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.024198788103117697,"score_gpt":0.2873780727970872,"score_spread":0.2631792846939695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401762479","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02253168,0.0021652025,0.8783309,0.0004756498,0.0008699717,0.000054723103,0.0008812132,0.0029337795,0.09175694],"genre_scores_gemma":[0.25114614,0.0027770763,0.5960718,0.0006050085,0.0009011746,0.00019722538,0.005701882,0.0035607326,0.13903901],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992918,0.00010168651,0.000034709854,0.00018752503,0.000313623,0.00007064373],"domain_scores_gemma":[0.9989452,0.00032744088,0.000052326373,0.00036082068,0.0002208275,0.000093559815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006045336,0.0010693499,0.0009610266,0.0018695776,0.0007519069,0.0027054518,0.0013208846,0.0006413137,0.045571268],"category_scores_gemma":[0.0037359863,0.00062633323,0.00079591415,0.0025189058,0.0010317704,0.00425159,0.0027854552,0.0018862931,0.011498888],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000226847,0.00006843496,0.0005975967,0.0003134744,0.00007356374,0.00015687493,0.00019501887,0.0116330115,0.0073081963,0.5023425,0.056051403,0.42103302],"study_design_scores_gemma":[0.000026442305,0.00007781007,0.00039771583,0.00008646903,0.000038042726,0.00031416965,0.000085963125,0.08980626,0.008511612,0.79130673,0.1093165,0.000032269392],"about_ca_topic_score_codex":0.0006177539,"about_ca_topic_score_gemma":0.0009781776,"teacher_disagreement_score":0.045571268,"about_ca_system_score_codex":0.00069360645,"about_ca_system_score_gemma":0.00044230744,"threshold_uncertainty_score":0.1524511},"labels":[],"label_agreement":null},{"id":"W4402147775","doi":"","title":"PartiallySeparableNLPModels.jl: A Julia framework for partitioned quasi-Newton optimization","year":2023,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Numerical Methods and 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":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Computer science; Newton's method; Mathematical optimization; Parallel computing; Mathematics; Physics; Nonlinear system","score_opus":0.027466760587304562,"score_gpt":0.2831541010722624,"score_spread":0.25568734048495784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402147775","genre_codex":"methods","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011077821,0.00010679972,0.99488705,0.000100361685,0.000038215876,0.000025055153,0.00012471728,0.00042847026,0.003181498],"genre_scores_gemma":[0.08705224,0.00032750895,0.8973601,0.00018719789,0.00009416285,0.00038039393,0.0006741258,0.001672763,0.012251492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995091,0.00020339446,0.000017868328,0.000050312654,0.0001746226,0.000044612687],"domain_scores_gemma":[0.9992803,0.0003307377,0.000060337305,0.00012004015,0.00013297907,0.000075587464],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011981894,0.000970428,0.0009336891,0.00052040664,0.00048038125,0.0011830437,0.002333195,0.0012010965,0.011352168],"category_scores_gemma":[0.0028898395,0.0008455745,0.0009980691,0.00055199885,0.0008575444,0.0010756125,0.002344565,0.0024987487,0.003805022],"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.000099348865,0.00009151635,0.00029329615,0.00032043396,0.000060686452,0.00008793163,0.00015061296,0.6119482,0.0030691803,0.29903436,0.012590606,0.07225378],"study_design_scores_gemma":[0.000018059427,0.00001207242,0.000024757652,0.00001817973,0.000004811272,0.000010634668,0.000008921837,0.9558332,0.0003877786,0.036330815,0.0073448517,0.000005841845],"about_ca_topic_score_codex":0.0052985465,"about_ca_topic_score_gemma":0.012152257,"teacher_disagreement_score":0.011352168,"about_ca_system_score_codex":0.00078278396,"about_ca_system_score_gemma":0.0019134635,"threshold_uncertainty_score":0.0379768},"labels":[],"label_agreement":null},{"id":"W4402211524","doi":"10.2139/ssrn.4946941","title":"Computing Optima in Standard Quadratic Functions in Zero-Error Probabilistic Polynomial Time","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Zero (linguistics); Probabilistic logic; Quadratic equation; Polynomial; Quadratic function; Mathematics; Applied mathematics; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.014377830679064786,"score_gpt":0.29128708501453315,"score_spread":0.27690925433546837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402211524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08298138,0.0006107542,0.90810835,0.0010272887,0.00012689426,0.000054612356,0.00016072158,0.00084624207,0.006083795],"genre_scores_gemma":[0.70478106,0.0004299499,0.28591415,0.00031022623,0.00020321058,0.00017395518,0.000448515,0.00089661224,0.0068422635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99681085,0.001089147,0.0001703022,0.00071757054,0.0008348319,0.00037737892],"domain_scores_gemma":[0.97104555,0.024595927,0.0009897369,0.0015294976,0.0012445096,0.0005947424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060882145,0.0012793496,0.0019409494,0.001550985,0.0009908656,0.0031013552,0.0029822406,0.0022643704,0.006449123],"category_scores_gemma":[0.047526184,0.0010288385,0.0011236751,0.0020911153,0.0042562257,0.006310892,0.0041632284,0.004529659,0.00080049696],"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.0006677201,0.0001648011,0.0018086031,0.0004435445,0.000113947615,0.0000583616,0.00020519237,0.7390246,0.001382648,0.20571059,0.003076185,0.047343865],"study_design_scores_gemma":[0.000030947725,0.00002867295,0.00013345972,0.000013746192,0.0000133761005,0.00000975655,0.000018309798,0.8822573,0.0005847705,0.1166986,0.0002045355,0.0000065995787],"about_ca_topic_score_codex":0.0037439815,"about_ca_topic_score_gemma":0.005447479,"teacher_disagreement_score":0.006449123,"about_ca_system_score_codex":0.0024746526,"about_ca_system_score_gemma":0.0026382515,"threshold_uncertainty_score":0.032197952},"labels":[],"label_agreement":null},{"id":"W4403262677","doi":"10.1016/j.cherd.2024.10.005","title":"ReLU surrogates in mixed-integer MPC for irrigation scheduling","year":2024,"lang":"en","type":"article","venue":"Process Safety and Environmental Protection","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates","keywords":"Integer programming; Scheduling (production processes); Integer (computer science); Computer science; Mathematical optimization; Environmental science; Mathematics; Operating system","score_opus":0.01459223458876703,"score_gpt":0.2563255280713357,"score_spread":0.24173329348256867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403262677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02578851,0.00038899042,0.964912,0.0002527419,0.00009387471,0.000063416875,0.00013649496,0.00042898324,0.007934912],"genre_scores_gemma":[0.87237066,0.00028215948,0.12303383,0.00016061668,0.000036783356,0.00024104041,0.00026080286,0.000101896236,0.0035121979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995609,0.00020301701,0.000017400465,0.00005968046,0.00010526721,0.000053779127],"domain_scores_gemma":[0.9990702,0.00060282473,0.00011202015,0.000046259636,0.00013193913,0.000036687758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081395544,0.0008144473,0.00073605566,0.0002776286,0.00032438236,0.0009802268,0.00068083755,0.00085856224,0.0027624418],"category_scores_gemma":[0.0021523794,0.00041365038,0.00059573766,0.0004166754,0.00042071517,0.00073686795,0.00078981783,0.0013925763,0.00037294795],"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.000017741913,0.000010903489,0.000086339496,0.00002112836,0.0000048028937,0.000015260479,0.000007978897,0.99378926,0.0003055914,0.0018065437,0.00015703698,0.0037773615],"study_design_scores_gemma":[0.0000017113631,0.0000070239053,0.000011869497,0.0000018917281,6.5741375e-7,0.0000014015467,0.000001784306,0.99924576,0.00010427765,0.0004858089,0.00013682565,9.924465e-7],"about_ca_topic_score_codex":0.0034451429,"about_ca_topic_score_gemma":0.0032332465,"teacher_disagreement_score":0.0034451429,"about_ca_system_score_codex":0.000567897,"about_ca_system_score_gemma":0.00090828113,"threshold_uncertainty_score":0.009241283},"labels":[],"label_agreement":null},{"id":"W4403445211","doi":"10.48550/arxiv.2408.02778","title":"Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rewriting; Polynomial; Mathematics; Symbolic trajectory evaluation; Computer science; Algorithm; Discrete mathematics; Theoretical computer science; Mathematical analysis; Programming language; Model checking","score_opus":0.060615069150614646,"score_gpt":0.23025481272560583,"score_spread":0.16963974357499118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403445211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26810303,0.00011692537,0.7188274,0.00025466442,0.000039474147,0.00006076795,0.000062413375,0.0009107046,0.011624653],"genre_scores_gemma":[0.9414847,0.00008376595,0.056060817,0.00004752646,0.000014808175,0.000054455795,0.000054723074,0.00011920109,0.0020800312],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916637,0.00032210504,0.000038557086,0.00012846431,0.0002342877,0.000110247776],"domain_scores_gemma":[0.9981504,0.0012555376,0.00011468496,0.0002738012,0.00014216492,0.00006337173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008723372,0.0004090805,0.00048805412,0.00033897007,0.0004898464,0.0010218006,0.0009704682,0.0005701165,0.0024171178],"category_scores_gemma":[0.0048294924,0.00024890646,0.00055572647,0.0003898903,0.0019142539,0.0014155862,0.0013916694,0.0009890138,0.0003682051],"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.00018241955,0.00009753359,0.0011757691,0.000112428475,0.000058014237,0.00031836933,0.00046049381,0.43532747,0.02324265,0.5100188,0.00056052086,0.028445605],"study_design_scores_gemma":[0.00003155303,0.000043226377,0.000096319774,0.000009155367,0.000015989048,0.00003366698,0.000043027063,0.83995837,0.016370533,0.14258029,0.0008066048,0.000011289509],"about_ca_topic_score_codex":0.0014251256,"about_ca_topic_score_gemma":0.0016268526,"teacher_disagreement_score":0.0024171178,"about_ca_system_score_codex":0.0010662067,"about_ca_system_score_gemma":0.00085145404,"threshold_uncertainty_score":0.008086085},"labels":[],"label_agreement":null},{"id":"W4404564788","doi":"10.1109/uemcon62879.2024.10754781","title":"LUT-Based Multipliers for IEEE-754 Floating Point Arithmetic on FPGAs","year":2024,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Lookup table; Computer science; Arithmetic; Field-programmable gate array; Floating point; IEEE floating point; Parallel computing; Double-precision floating-point format; Saturation arithmetic; Computer hardware; Arbitrary-precision arithmetic; Algorithm; Mathematics","score_opus":0.030998825181658383,"score_gpt":0.3226229001053267,"score_spread":0.2916240749236683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404564788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09404456,0.0035834413,0.8028719,0.00034587953,0.00067879766,0.00063078944,0.00143705,0.015373208,0.08103433],"genre_scores_gemma":[0.37429416,0.0016204753,0.59035504,0.00028284875,0.000087015964,0.00035096027,0.0023601083,0.00085591286,0.029793436],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99973756,0.000048792586,0.00002614772,0.00003140984,0.000115792966,0.00004027779],"domain_scores_gemma":[0.99983895,0.00003810627,0.000021254567,0.000025753909,0.000070753624,0.0000051068637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026468668,0.00062054204,0.00027923755,0.0006269386,0.00023055817,0.00065146346,0.00052776834,0.00020769666,0.012774698],"category_scores_gemma":[0.0005559132,0.00023687613,0.00041317666,0.0005727106,0.00015165759,0.00043583286,0.00016206203,0.00045530655,0.0022996934],"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.00062357046,0.00014545293,0.001230658,0.0015056016,0.00015367872,0.0006177748,0.00026626996,0.11677174,0.1870035,0.06125433,0.03224675,0.59818065],"study_design_scores_gemma":[0.0003426747,0.0015201849,0.0030233138,0.00045713192,0.00022876677,0.0011801044,0.0001703729,0.33376867,0.2885421,0.015364592,0.35527316,0.00012895615],"about_ca_topic_score_codex":0.0017674312,"about_ca_topic_score_gemma":0.0032079862,"teacher_disagreement_score":0.012774698,"about_ca_system_score_codex":0.0006514533,"about_ca_system_score_gemma":0.0007248493,"threshold_uncertainty_score":0.042735636},"labels":[],"label_agreement":null},{"id":"W4404817872","doi":"10.1007/978-981-96-0617-7_17","title":"Formalizing Potential Flows Using the HOL Light Theorem Prover","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"HOL; Automated theorem proving; Computer science; Gas meter prover; Programming language; Calculus (dental); Algorithm; Theoretical computer science; Mathematics; Mathematical proof","score_opus":0.019014583944511936,"score_gpt":0.2735598452041234,"score_spread":0.25454526125961147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404817872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026478076,0.00034053114,0.96658003,0.00045174357,0.00018035715,0.000102699545,0.00041403866,0.004462767,0.024820013],"genre_scores_gemma":[0.15144569,0.001942466,0.80354977,0.00090373744,0.00030906487,0.0003966595,0.001751746,0.005407639,0.034293294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823403,0.00046677468,0.00013708201,0.00023194695,0.0007106002,0.0002195726],"domain_scores_gemma":[0.9973852,0.0018304952,0.00008483316,0.0003647987,0.0002775131,0.000057202236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024049617,0.0011399742,0.0008980668,0.0020454777,0.0014693561,0.00464022,0.002981122,0.00094383815,0.024136256],"category_scores_gemma":[0.0062295585,0.001387292,0.001833694,0.0015784026,0.0031212545,0.008492122,0.0044239424,0.004524429,0.00629634],"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.000062115665,0.00005323452,0.00013051758,0.00040923333,0.000023603621,0.00009959687,0.00029205641,0.005605965,0.002314551,0.90068877,0.010763498,0.07955676],"study_design_scores_gemma":[0.00004889686,0.000016499347,0.000052580188,0.00013619769,0.000031932977,0.00010807125,0.000085967884,0.023962347,0.009150702,0.9040481,0.06233003,0.00002868244],"about_ca_topic_score_codex":0.0016295322,"about_ca_topic_score_gemma":0.0019481722,"teacher_disagreement_score":0.024136256,"about_ca_system_score_codex":0.0012473809,"about_ca_system_score_gemma":0.0019084412,"threshold_uncertainty_score":0.08074379},"labels":[],"label_agreement":null},{"id":"W4404842853","doi":"10.1017/9781009423250.014","title":"Coding Examples","year":2024,"lang":"en","type":"other","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Computer science; Coding (social sciences); Mathematics; Statistics","score_opus":0.04009487539982778,"score_gpt":0.3134272301250153,"score_spread":0.2733323547251875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404842853","genre_codex":"other","genre_gemma":"software","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"software","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019965249,0.00021443477,0.065621324,0.0019283611,0.0007148753,0.00024459063,0.01845969,0.0055161025,0.90530413],"genre_scores_gemma":[0.035138305,0.00061419787,0.061966613,0.0014244606,0.0002164907,0.00081113796,0.028805975,0.0052632266,0.8657595],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99914515,0.00023941604,0.00003109037,0.00009239443,0.0003766257,0.00011527857],"domain_scores_gemma":[0.9971527,0.0012136989,0.0000687636,0.0005083736,0.00093938835,0.00011709919],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062913226,0.0009521822,0.00044536297,0.0019792335,0.0013094809,0.002092944,0.0014557268,0.001490708,0.48290676],"category_scores_gemma":[0.010288136,0.0003398361,0.0005273291,0.0027350618,0.0007163651,0.0022704739,0.0014482278,0.0014287505,0.24013068],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006861067,0.00004742028,0.00010326009,0.00011193886,0.0000021416668,0.00008622926,0.00009981061,0.0014790157,0.0002901458,0.17557693,0.7367735,0.08536105],"study_design_scores_gemma":[0.000038022787,0.000010554419,0.00022277547,0.00010000985,0.000003986728,0.00014425952,0.00009403383,0.008278363,0.0009862544,0.12825586,0.861843,0.000023056773],"about_ca_topic_score_codex":0.011132092,"about_ca_topic_score_gemma":0.014680854,"teacher_disagreement_score":0.48290676,"about_ca_system_score_codex":0.0014779768,"about_ca_system_score_gemma":0.0015109637,"threshold_uncertainty_score":0.73757076},"labels":[],"label_agreement":null},{"id":"W4404971006","doi":"10.3390/electronics13234762","title":"A Recursive Trigonometric Technique for Direct Digital Frequency Synthesizer Implementation","year":2024,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Direct digital synthesizer; Trigonometry; Frequency synthesizer; Computer science; Electronic engineering; Mathematics; Phase-locked loop; Engineering; Phase noise","score_opus":0.014836370666718082,"score_gpt":0.3174335327464833,"score_spread":0.3025971620797652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404971006","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080285175,0.00046279223,0.98273474,0.00010881065,0.00014320032,0.00006319575,0.00005310118,0.0015266531,0.006879065],"genre_scores_gemma":[0.14637032,0.0004742953,0.8464261,0.00015417216,0.00011135125,0.000081443315,0.00016229702,0.00016268506,0.0060572647],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996544,0.00004839353,0.00003113005,0.000061587205,0.00018117754,0.000023340179],"domain_scores_gemma":[0.99972993,0.00006501582,0.00003174495,0.000075375014,0.00008844191,0.000009552228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022760907,0.00051816914,0.0002680897,0.0006770187,0.00032847276,0.0005385977,0.00057240494,0.00039116692,0.005087065],"category_scores_gemma":[0.0010361444,0.00020869775,0.00035929005,0.00063865556,0.00029439185,0.0005570214,0.0003173009,0.0005437477,0.0025872518],"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.00013604743,0.000049078626,0.00034725392,0.00025073093,0.000027275057,0.00034096508,0.00015424163,0.012657328,0.2493781,0.035971463,0.003981823,0.69670576],"study_design_scores_gemma":[0.00014771,0.0008657933,0.0015437733,0.00013575717,0.00011917751,0.0045197923,0.00013807506,0.4129816,0.38941717,0.012724394,0.17727353,0.00013321076],"about_ca_topic_score_codex":0.00083837676,"about_ca_topic_score_gemma":0.0015272151,"teacher_disagreement_score":0.005087065,"about_ca_system_score_codex":0.00030711,"about_ca_system_score_gemma":0.0004952821,"threshold_uncertainty_score":0.01701796},"labels":[],"label_agreement":null},{"id":"W4406525730","doi":"10.3390/electronics14020365","title":"Estimating Word Lengths for Fixed-Point DSP Implementations Using Polynomial Chaos Expansions","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"CHAOS (operating system); Implementation; Fixed point; Polynomial; Fixed-point arithmetic; Word length; Word (group theory); Algorithm; Mathematics; Point (geometry); Digital signal processing; Computer science; Floating point; Arithmetic; Mathematical analysis; Computer hardware; Geometry","score_opus":0.02682425212788465,"score_gpt":0.3631049340599751,"score_spread":0.3362806819320905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406525730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08111932,0.0004345318,0.9145646,0.000102538455,0.000034799457,0.000050587063,0.00015453814,0.0012412806,0.002297905],"genre_scores_gemma":[0.4283402,0.00043426166,0.568291,0.00004124499,0.000020790734,0.000118917356,0.00042997338,0.00028458345,0.0020390842],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994023,0.00009625043,0.000043577988,0.00009099,0.00032672708,0.000040238454],"domain_scores_gemma":[0.9976888,0.0012471696,0.0003417877,0.00028882403,0.00039365047,0.00003975865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005982025,0.00068886403,0.0003181797,0.001324616,0.0003987624,0.0007450758,0.0006052557,0.0005079282,0.0022489456],"category_scores_gemma":[0.007975973,0.00030799667,0.00029173642,0.00084437843,0.0004196945,0.0016340081,0.00061262696,0.00081118813,0.0010038485],"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.00047799316,0.00009390438,0.0051956302,0.0003372736,0.00004858671,0.00019143791,0.00043736844,0.31035078,0.07874541,0.03541043,0.001754523,0.56695664],"study_design_scores_gemma":[0.00002633807,0.00017753216,0.001448176,0.00006683806,0.000018501163,0.00018818474,0.000089206056,0.9074897,0.06638315,0.01970051,0.0043711285,0.000040717176],"about_ca_topic_score_codex":0.0010428518,"about_ca_topic_score_gemma":0.0020718144,"teacher_disagreement_score":0.0022489456,"about_ca_system_score_codex":0.00059322536,"about_ca_system_score_gemma":0.00080130785,"threshold_uncertainty_score":0.007523477},"labels":[],"label_agreement":null},{"id":"W4406610261","doi":"10.1109/tetc.2025.3528972","title":"Software-Defined Number Formats for High-Speed Belief Propagation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Emerging Topics in Computing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Queen's University Belfast; European Commission","keywords":"Computer science; Software; Parallel computing; Theoretical computer science; Operating system","score_opus":0.021023612039396095,"score_gpt":0.3123285599023229,"score_spread":0.2913049478629268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406610261","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052511506,0.00014542055,0.9892952,0.000089612535,0.00010089138,0.0000493491,0.00011662771,0.0019027824,0.0030489524],"genre_scores_gemma":[0.21689242,0.0004365719,0.7767978,0.00019111451,0.00011886073,0.00035871568,0.0007372943,0.00047980432,0.0039874236],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99909616,0.00019106499,0.00011961901,0.00008696636,0.0004410495,0.00006519085],"domain_scores_gemma":[0.99790907,0.0007469524,0.00021670772,0.0003745702,0.00069943536,0.000053205615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011257398,0.00064454536,0.00035455663,0.0011069645,0.00037791664,0.00138146,0.0013280172,0.0004923468,0.0053398306],"category_scores_gemma":[0.0057997243,0.0002651183,0.00033033564,0.0010370663,0.00054878125,0.0016314308,0.0006240068,0.0010004062,0.0018973923],"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.0005618848,0.00012897998,0.0014585876,0.000500042,0.00005018069,0.00034381807,0.00044399936,0.10981844,0.04197992,0.28736144,0.015140408,0.54221237],"study_design_scores_gemma":[0.00014214702,0.0003136413,0.00030003604,0.00016075464,0.00004211663,0.00037435396,0.00008747499,0.7330632,0.11104581,0.076545835,0.077841304,0.000083332896],"about_ca_topic_score_codex":0.000982488,"about_ca_topic_score_gemma":0.0010454939,"teacher_disagreement_score":0.0053398306,"about_ca_system_score_codex":0.00064670603,"about_ca_system_score_gemma":0.0009458754,"threshold_uncertainty_score":0.017863512},"labels":[],"label_agreement":null},{"id":"W4408959881","doi":"10.1007/s10589-025-00676-x","title":"A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis","year":2025,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal","funders":"","keywords":"Mathematics; Rounding; Regularization (linguistics); Round-off error; Mathematical optimization; Quadratic equation; Error analysis; Algorithm; Applied mathematics; Computer science","score_opus":0.021428376056036993,"score_gpt":0.3476668886019623,"score_spread":0.32623851254592534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408959881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075576134,0.00010209207,0.99740064,0.00006390233,0.00008827027,0.000023499342,0.000022478513,0.00019325268,0.0013501256],"genre_scores_gemma":[0.027934708,0.0001565723,0.9668237,0.00011422077,0.00009349253,0.00013793219,0.00009798167,0.00036078613,0.004280564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987332,0.00043068573,0.000060192062,0.00012623603,0.00059227145,0.000057261583],"domain_scores_gemma":[0.9985207,0.00061933097,0.00009635904,0.00024925795,0.00043408386,0.000080262456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019622815,0.0010220235,0.0013113237,0.00081912224,0.0008084968,0.0012928359,0.0018894695,0.0020099576,0.0058125923],"category_scores_gemma":[0.005056118,0.0006440332,0.0011350396,0.00093956874,0.0008871919,0.0012458088,0.0019916196,0.0026891911,0.002218696],"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.00023402584,0.00020411774,0.0003291125,0.00043322623,0.00012571679,0.0001507901,0.00015139297,0.5624136,0.015102684,0.11367134,0.014793269,0.2923907],"study_design_scores_gemma":[0.000012378378,0.000023278799,0.000027943137,0.000016292359,0.000006750139,0.000023155226,0.000005335045,0.9907933,0.0010480676,0.0051631304,0.002867276,0.000013073],"about_ca_topic_score_codex":0.0027147194,"about_ca_topic_score_gemma":0.0035434242,"teacher_disagreement_score":0.0058125923,"about_ca_system_score_codex":0.00050780375,"about_ca_system_score_gemma":0.0014250083,"threshold_uncertainty_score":0.019445062},"labels":[],"label_agreement":null},{"id":"W4409920357","doi":"10.1145/3732933","title":"Sound Static Data Race Verification for C: Is the Race Lost?","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Programming Languages and Systems","topic":"Numerical Methods 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":"University of Waterloo","funders":"","keywords":"Computer science; Race (biology); Sound (geography); Arms race; Acoustics","score_opus":0.053239937609046516,"score_gpt":0.37149698846588414,"score_spread":0.31825705085683764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409920357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22944756,0.0034902715,0.70041,0.00792623,0.0007029045,0.00026869267,0.0019773026,0.03745646,0.01832061],"genre_scores_gemma":[0.7114571,0.0007613419,0.27504763,0.0025902786,0.00015331064,0.00022933762,0.0019397578,0.005088289,0.002732973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9741168,0.0066517065,0.0015424299,0.0034259257,0.011563371,0.0026997104],"domain_scores_gemma":[0.89958906,0.058623094,0.0064785015,0.021454822,0.012807063,0.0010473599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013597466,0.0013446452,0.0010813171,0.0020506654,0.002332864,0.004437492,0.00367279,0.0024855835,0.0039657154],"category_scores_gemma":[0.07862045,0.0008330477,0.001650432,0.0021450142,0.005464722,0.0087335445,0.0035099501,0.0040669264,0.0014601175],"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.00244419,0.0004638631,0.046473943,0.003466212,0.00045749545,0.0009935728,0.0034957388,0.088406056,0.07607496,0.22881581,0.045367163,0.50354105],"study_design_scores_gemma":[0.00027258662,0.0012037292,0.013716843,0.0016491696,0.00041350696,0.0015493897,0.001666992,0.38229057,0.25567725,0.24178044,0.09924737,0.0005320976],"about_ca_topic_score_codex":0.011301578,"about_ca_topic_score_gemma":0.0124463,"teacher_disagreement_score":0.013597466,"about_ca_system_score_codex":0.003001976,"about_ca_system_score_gemma":0.008735709,"threshold_uncertainty_score":0.071911156},"labels":[],"label_agreement":null},{"id":"W4410211991","doi":"10.3390/e27050506","title":"Karatsuba Algorithm Revisited for 2D Convolution Computation Optimization","year":2025,"lang":"en","type":"article","venue":"Entropy","topic":"Numerical Methods and 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 British Columbia","funders":"","keywords":"Multiplication (music); Convolution (computer science); Computer science; Matrix multiplication; Operand; Computation; Reduction (mathematics); Algorithm; Parallel computing; Arithmetic; Mathematics; Artificial intelligence","score_opus":0.01295184550081136,"score_gpt":0.30300991690447093,"score_spread":0.2900580714036596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410211991","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004942555,0.00034154658,0.9900928,0.000079195546,0.000028753937,0.000021671103,0.000016512595,0.0002427559,0.004234224],"genre_scores_gemma":[0.25742722,0.0008384267,0.7332159,0.00012716172,0.000054126358,0.00018568865,0.000115745745,0.00023877253,0.0077970554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996582,0.00007374616,0.000019484087,0.00005619919,0.00015488884,0.000037416496],"domain_scores_gemma":[0.9997414,0.00013216735,0.00002172938,0.00003105885,0.00006346372,0.000010223885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041221417,0.000623596,0.0005021184,0.00055083894,0.00048028323,0.00097629364,0.00068683055,0.000552594,0.005221443],"category_scores_gemma":[0.0011969261,0.0002938364,0.0006134897,0.00084764574,0.0005438275,0.00097072066,0.00070387416,0.0007898174,0.0010927275],"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.00015915137,0.00006284287,0.0007874797,0.00033814088,0.00007310383,0.00019951016,0.0002469395,0.582449,0.026998004,0.12321542,0.0033063232,0.26216415],"study_design_scores_gemma":[0.000024501871,0.000066031076,0.00016551584,0.000028215174,0.000015944295,0.000116250216,0.000029437902,0.95457095,0.007597619,0.026600424,0.010769347,0.000015792179],"about_ca_topic_score_codex":0.0020950644,"about_ca_topic_score_gemma":0.0029213936,"teacher_disagreement_score":0.005221443,"about_ca_system_score_codex":0.00064632465,"about_ca_system_score_gemma":0.0010991864,"threshold_uncertainty_score":0.017467499},"labels":[],"label_agreement":null},{"id":"W4410810258","doi":"10.1109/fccm62733.2025.00024","title":"AutoNTT: Automatic Architecture Design and Exploration for Number Theoretic Transform Acceleration on FPGAs","year":2025,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","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":"Simon Fraser University","funders":"","keywords":"Field-programmable gate array; Acceleration; Architecture; Computer science; Computer architecture; Hardware acceleration; Parallel computing; Computer engineering; Computational science; Embedded system; Physics","score_opus":0.02947099351882285,"score_gpt":0.3150801670171932,"score_spread":0.28560917349837034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410810258","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08026139,0.00048409292,0.87749046,0.00023024066,0.00011785714,0.00030718584,0.0005980233,0.02317249,0.017338272],"genre_scores_gemma":[0.37779346,0.0002504058,0.61382216,0.00014239663,0.000037615053,0.00040065407,0.0013789247,0.0013815153,0.0047927466],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99967563,0.00006848067,0.000024465086,0.00004845113,0.00013071329,0.000052303596],"domain_scores_gemma":[0.9995478,0.00018370245,0.000042729025,0.000082997,0.00012065081,0.000021954591],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048963114,0.00079544494,0.00029414555,0.0007128902,0.00030350333,0.00055473525,0.00093878753,0.00031208666,0.008956165],"category_scores_gemma":[0.0011149856,0.00029356786,0.0006375982,0.0004589092,0.0002998041,0.0007823246,0.0005386945,0.0005395768,0.0015857696],"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.0007227435,0.00020261986,0.004505617,0.0007737798,0.00010325328,0.00060171215,0.0003917371,0.21550477,0.091382235,0.036653515,0.033035886,0.6161222],"study_design_scores_gemma":[0.00020321086,0.0004498097,0.0009434452,0.00005858609,0.00004833618,0.00027618208,0.00007432219,0.8902298,0.0620014,0.012926721,0.032750126,0.00003813197],"about_ca_topic_score_codex":0.0012434396,"about_ca_topic_score_gemma":0.0019207991,"teacher_disagreement_score":0.008956165,"about_ca_system_score_codex":0.00063242647,"about_ca_system_score_gemma":0.0008509256,"threshold_uncertainty_score":0.029961348},"labels":[],"label_agreement":null},{"id":"W4411019249","doi":"10.1109/tase.2025.3576731","title":"Learning Autonomous Surgical Irrigation and Suction With the da Vinci Research Kit Using Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Canadian Institutes of Health Research; China Scholarship Council; Canada Foundation for Innovation; Ministry of Innovation and Advanced Education; Ministry of Advanced Education, Government of Alberta","keywords":"Reinforcement learning; Suction; Reinforcement; Irrigation; Computer science; Engineering; Artificial intelligence; Simulation; Engineering drawing; Mechanical engineering; Structural engineering","score_opus":0.03111430367718968,"score_gpt":0.32100857693103685,"score_spread":0.28989427325384715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411019249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20332356,0.00066056795,0.7782837,0.0002753049,0.00011710047,0.00047142815,0.0001453971,0.0056118458,0.0111111],"genre_scores_gemma":[0.729865,0.0001812075,0.26393414,0.00011406423,0.00001075507,0.00051581603,0.00022635693,0.00010311057,0.0050495095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983203,0.000037827096,0.000012001431,0.000045493103,0.0000437281,0.000028893743],"domain_scores_gemma":[0.9996524,0.00015766022,0.000050612627,0.000036265512,0.00006324739,0.000039821327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042556153,0.00073486276,0.00029517993,0.00016491693,0.00017904845,0.0003218358,0.0010327809,0.0004963964,0.0015383902],"category_scores_gemma":[0.0009805514,0.00031221609,0.00034806016,0.00008444434,0.00039291524,0.00029203197,0.00068789115,0.00064637884,0.0005229107],"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.0002119501,0.00031230578,0.00226918,0.00019636234,0.000063457395,0.00019631477,0.00015302181,0.8052926,0.028040968,0.003543387,0.002297856,0.15742266],"study_design_scores_gemma":[0.00004389153,0.00022865862,0.0006089721,0.0000113541655,0.000010438852,0.000045375495,0.000011408545,0.9906782,0.0055787535,0.0007905868,0.0019770553,0.000015284675],"about_ca_topic_score_codex":0.0034126572,"about_ca_topic_score_gemma":0.0038624334,"teacher_disagreement_score":0.0034126572,"about_ca_system_score_codex":0.00043079912,"about_ca_system_score_gemma":0.0007746137,"threshold_uncertainty_score":0.0067855716},"labels":[],"label_agreement":null},{"id":"W4411491548","doi":"10.3390/math13132048","title":"Efficient Application of the Voigt Functions in the Fourier Transform","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Numerical Methods and 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":"Thoth Technology (Canada); York University","funders":"","keywords":"Voigt profile; Rational function; Fourier transform; Computation; Mathematics; The Imaginary; Function (biology); Mathematical analysis; Fast Fourier transform; Applied mathematics; Pure mathematics; Algorithm; Physics; Quantum mechanics","score_opus":0.011664004384170909,"score_gpt":0.2757056922076243,"score_spread":0.2640416878234534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411491548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008936031,0.00025768898,0.9855538,0.0000729372,0.00006314657,0.000025173917,0.000025529192,0.00041591647,0.004649719],"genre_scores_gemma":[0.20994104,0.0006766978,0.78114045,0.000086514905,0.0000699274,0.000109276574,0.00013632647,0.00045747816,0.00738237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99949014,0.000106467625,0.000020444375,0.000039676626,0.00028745874,0.00005569189],"domain_scores_gemma":[0.99953556,0.00026392125,0.000024900246,0.000085640124,0.00007259531,0.00001740137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083414547,0.0005942763,0.00067380833,0.00090256147,0.0004316381,0.0011083981,0.0010736376,0.00075011846,0.0031514275],"category_scores_gemma":[0.002466488,0.00029108243,0.0005435155,0.0008637655,0.0007322158,0.0012691856,0.0009356644,0.0009851125,0.0018071162],"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.00020340843,0.000120035766,0.00069605897,0.00036564685,0.00005130432,0.00033897284,0.0003679503,0.21288905,0.047439065,0.39749405,0.0038136793,0.33622074],"study_design_scores_gemma":[0.00002016304,0.000029487675,0.00014687017,0.000029822577,0.000010467382,0.00014728056,0.00003863689,0.94092256,0.01305538,0.035719443,0.0098583,0.000021522455],"about_ca_topic_score_codex":0.0014840488,"about_ca_topic_score_gemma":0.0015346082,"teacher_disagreement_score":0.0031514275,"about_ca_system_score_codex":0.00052403513,"about_ca_system_score_gemma":0.0006610687,"threshold_uncertainty_score":0.010542512},"labels":[],"label_agreement":null},{"id":"W4411990406","doi":"10.1007/978-3-031-85747-8_4","title":"KronA: Parameter-Efficient Tuning with Kronecker Adapter","year":2025,"lang":"en","type":"book-chapter","venue":"Machine translation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Kronecker delta; Adapter (computing); Computer science; Artificial intelligence; Operating system; Physics","score_opus":0.026340994652421887,"score_gpt":0.25796435884123226,"score_spread":0.23162336418881035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411990406","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043684747,0.00054798194,0.90199107,0.00015317883,0.000370658,0.00008503794,0.0007621131,0.07759567,0.01412585],"genre_scores_gemma":[0.15937492,0.0005241877,0.7706649,0.0007194138,0.00019165689,0.000560894,0.00366001,0.035808757,0.028495235],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982967,0.00042060565,0.00017987116,0.00032256675,0.00058261753,0.00019768513],"domain_scores_gemma":[0.99757606,0.0007726944,0.00009854198,0.0010601477,0.00040437904,0.00008815943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014834964,0.0018804311,0.001023118,0.001046953,0.00073132076,0.0025528048,0.0032931003,0.0014954901,0.040004633],"category_scores_gemma":[0.008543103,0.0011227411,0.0010704405,0.0016016337,0.00085109426,0.0037039432,0.002638411,0.0026904575,0.02657209],"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.0011036221,0.0002867678,0.0010784598,0.0006281836,0.00014944094,0.00024285336,0.00023931253,0.046727225,0.026225343,0.07606447,0.1423032,0.70495117],"study_design_scores_gemma":[0.00027282152,0.00018326101,0.00062397256,0.00022282136,0.00008622099,0.0004121604,0.00012459283,0.60970414,0.07585375,0.16730241,0.14503472,0.00017912782],"about_ca_topic_score_codex":0.0018521583,"about_ca_topic_score_gemma":0.0027070479,"teacher_disagreement_score":0.040004633,"about_ca_system_score_codex":0.0007718855,"about_ca_system_score_gemma":0.0011516245,"threshold_uncertainty_score":0.13382888},"labels":[],"label_agreement":null},{"id":"W4412354895","doi":"10.1007/978-3-031-89087-1_5","title":"Iterative Sine 1° Computations in the Sanskrit Tradition","year":2025,"lang":"en","type":"book-chapter","venue":"Sources and studies in the history of mathematics and physical sciences","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity Western University; Western University","funders":"","keywords":"Sanskrit; Sine; Computation; Sine qua non; Sanskrit literature; Mathematics; Philosophy; Literature; Art; Algorithm; Geometry; Linguistics","score_opus":0.09775028216980898,"score_gpt":0.32829235397323153,"score_spread":0.23054207180342257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412354895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015524385,0.0061959294,0.74333936,0.0020783187,0.001298834,0.00003146701,0.00013707795,0.000813728,0.23058084],"genre_scores_gemma":[0.30929974,0.009217853,0.52570003,0.0009478689,0.0011515367,0.000115293056,0.0002623875,0.0015687902,0.15173647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994554,0.0002047212,0.000027117285,0.00007479907,0.00020677518,0.000031122367],"domain_scores_gemma":[0.9987043,0.00073976885,0.000044039454,0.0002593106,0.00022950301,0.000023064385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009568603,0.0006657179,0.00055888464,0.00073427433,0.00094114925,0.0022128588,0.000798967,0.0007388918,0.009379958],"category_scores_gemma":[0.005392856,0.00036195063,0.00047185487,0.0012809846,0.0039014828,0.0025353597,0.0013113044,0.002325872,0.0037273227],"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.000028863678,0.000005237721,0.000082353436,0.0000554259,0.000004892706,0.00001865254,0.0002229282,0.004939456,0.00048077377,0.9502166,0.0035598422,0.040384997],"study_design_scores_gemma":[0.000017426775,0.000027187896,0.00014413595,0.00012942609,0.000009312609,0.00009973271,0.00010852821,0.049772687,0.002475031,0.8565385,0.09065158,0.000026417212],"about_ca_topic_score_codex":0.002697183,"about_ca_topic_score_gemma":0.004061999,"teacher_disagreement_score":0.009379958,"about_ca_system_score_codex":0.0010452505,"about_ca_system_score_gemma":0.0008498512,"threshold_uncertainty_score":0.031379044},"labels":[],"label_agreement":null},{"id":"W4412712637","doi":"10.3390/electronics14153027","title":"A Hybrid Recursive Trigonometric Technique for Direct Digital Frequency Synthesizer","year":2025,"lang":"en","type":"article","venue":"Electronics","topic":"Numerical Methods and Algorithms","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":"Lakehead University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spurious-free dynamic range; CORDIC; dBc; Computer science; Direct digital synthesizer; Field-programmable gate array; Lookup table; Algorithm; Electronic engineering; Computer hardware; Dynamic range; Engineering; Frequency synthesizer; Phase-locked loop; Telecommunications; Offset (computer science)","score_opus":0.00959435611698719,"score_gpt":0.2703936046780751,"score_spread":0.26079924856108794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412712637","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01570367,0.00063821155,0.9752679,0.00010335754,0.00009492783,0.00007287204,0.00005069688,0.0010711649,0.006997147],"genre_scores_gemma":[0.25764728,0.00040438803,0.73630226,0.00011954509,0.000077329845,0.00007145815,0.00012029325,0.00008705115,0.0051704044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99968076,0.00004872723,0.000020099407,0.00005125163,0.00017916731,0.000019971314],"domain_scores_gemma":[0.9998185,0.000046968904,0.000028966024,0.00004771138,0.000049174894,0.000008684795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023633604,0.0004107283,0.0002822907,0.0005655659,0.0002545228,0.00043083893,0.00051549904,0.00035288712,0.0024577733],"category_scores_gemma":[0.0005597557,0.00018685435,0.00030623606,0.00050830113,0.00025491673,0.00044020495,0.00025638772,0.00034937213,0.0010609804],"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.0001923547,0.000056219265,0.0005730844,0.00025443712,0.000046301633,0.00031403633,0.00010758185,0.023677656,0.32259366,0.028195972,0.0022924053,0.6216963],"study_design_scores_gemma":[0.00014498885,0.001017476,0.0015007935,0.00007553969,0.0001108062,0.0040712995,0.000057576468,0.595422,0.31612915,0.006876067,0.07448337,0.00011082987],"about_ca_topic_score_codex":0.0005716686,"about_ca_topic_score_gemma":0.001269573,"teacher_disagreement_score":0.0024577733,"about_ca_system_score_codex":0.0003035453,"about_ca_system_score_gemma":0.00037614597,"threshold_uncertainty_score":0.0082220435},"labels":[],"label_agreement":null},{"id":"W4413204333","doi":"10.1109/icccas65806.2025.11102693","title":"Efficient Multi-Precision Approximate Posit Multiply-Accumulate Unit","year":2025,"lang":"en","type":"article","venue":"","topic":"Numerical Methods 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":"University of Saskatchewan","funders":"Natural Science Foundation of Qingdao; Natural Science Foundation of Shandong Province","keywords":"Computer science; Unit (ring theory); Mathematics","score_opus":0.03676048071235502,"score_gpt":0.34252318668860565,"score_spread":0.30576270597625066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413204333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14340143,0.0025624377,0.815885,0.000660353,0.000511784,0.00026366062,0.00032045736,0.007588141,0.028806694],"genre_scores_gemma":[0.76302326,0.0005067779,0.22162916,0.00036407245,0.00014197582,0.00013432081,0.0002958456,0.00009046911,0.013814173],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99969447,0.000037064714,0.000028277138,0.00005535424,0.00014695087,0.000037915175],"domain_scores_gemma":[0.9995943,0.00007437319,0.00006873268,0.00007882819,0.00016071244,0.000023084322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002746515,0.0004739422,0.0004318727,0.00069135305,0.00053392845,0.0010107678,0.0015055556,0.00036176748,0.0059815776],"category_scores_gemma":[0.000863449,0.00024575953,0.00022259691,0.00060497917,0.00033337728,0.0011131883,0.00063261454,0.00047190458,0.0015099864],"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.0016669295,0.00020490006,0.0041867695,0.0007616236,0.00009415822,0.000758096,0.00050760433,0.046294104,0.20296904,0.09478198,0.017165361,0.6306094],"study_design_scores_gemma":[0.00014748631,0.0021006248,0.0014862159,0.00014630661,0.00015774861,0.0025495626,0.00018439535,0.48734823,0.37976447,0.010789087,0.11519673,0.00012914851],"about_ca_topic_score_codex":0.0006599995,"about_ca_topic_score_gemma":0.0014988005,"teacher_disagreement_score":0.0059815776,"about_ca_system_score_codex":0.000534859,"about_ca_system_score_gemma":0.0007949243,"threshold_uncertainty_score":0.020010352},"labels":[],"label_agreement":null},{"id":"W4413812281","doi":"10.1080/10556788.2025.2531478","title":"A general framework for floating point error analysis of first-order simplex derivatives","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Simplex; Order (exchange); Point (geometry); Mathematical optimization; Simplex algorithm; Algorithm; Applied mathematics; Combinatorics; Linear programming; Geometry; Economics","score_opus":0.035310281368347456,"score_gpt":0.39890740731886803,"score_spread":0.36359712595052057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413812281","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067976525,0.00030820473,0.99770254,0.000110070934,0.000038227518,0.000015749765,0.000022310247,0.000084585285,0.001038607],"genre_scores_gemma":[0.13477826,0.002442614,0.85538137,0.00040164829,0.00035980038,0.00029316833,0.00021244265,0.00077710254,0.005353653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968432,0.0009661545,0.00021507079,0.00035679262,0.0014561476,0.0001625559],"domain_scores_gemma":[0.99430144,0.0028873861,0.00037012718,0.00078602426,0.0015142448,0.00014071782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060106306,0.0015480939,0.0013583221,0.0022859788,0.000921359,0.0025225373,0.0028459027,0.0017053605,0.0029688822],"category_scores_gemma":[0.02104017,0.00060777494,0.0019545364,0.0018543359,0.0027460142,0.0039727055,0.0031062004,0.0046296585,0.0011640288],"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.00003934113,0.000023099175,0.00044231687,0.00023624137,0.00004912101,0.00013147859,0.00021710401,0.2920468,0.004058074,0.65811414,0.0025934372,0.04204884],"study_design_scores_gemma":[0.000005866594,0.000026752075,0.00013604,0.00005683607,0.000014460649,0.00007691915,0.000023426373,0.8373291,0.0016233763,0.15358596,0.007097697,0.000023635836],"about_ca_topic_score_codex":0.0048498814,"about_ca_topic_score_gemma":0.002540851,"teacher_disagreement_score":0.0060106306,"about_ca_system_score_codex":0.0017331046,"about_ca_system_score_gemma":0.0017236244,"threshold_uncertainty_score":0.031787694},"labels":[],"label_agreement":null},{"id":"W4416707459","doi":"10.1109/lca.2025.3637718","title":"Fusing Adds and Shifts for Efficient Dot Products","year":2025,"lang":"en","type":"article","venue":"IEEE Computer Architecture Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Adder; Dot product; Multiplier (economics); Multiplication (music); Tree (set theory); Product (mathematics)","score_opus":0.011399782714914467,"score_gpt":0.2591586618781034,"score_spread":0.24775887916318892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416707459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108130656,0.0010306921,0.86309016,0.00043419693,0.0004993674,0.00027716506,0.0002805384,0.0078643495,0.01839289],"genre_scores_gemma":[0.33808964,0.0005276745,0.6455953,0.0003806508,0.00023773698,0.0001901176,0.0005069604,0.0004054152,0.014066409],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927133,0.00006561973,0.000100614845,0.00015062191,0.0003038859,0.00010794788],"domain_scores_gemma":[0.99920434,0.00019848441,0.000090634945,0.00023895438,0.0002253606,0.000042210508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042626858,0.0011384414,0.0007467655,0.0012592826,0.00090092985,0.0011234484,0.0010986641,0.00057318236,0.014416781],"category_scores_gemma":[0.0017971495,0.00054440834,0.0005379738,0.0012352638,0.00052316696,0.0022684128,0.0012339808,0.00064624916,0.0044463635],"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.0007024721,0.00021021834,0.0008186003,0.0003432887,0.00006378036,0.00049832545,0.0002605438,0.019067602,0.11912587,0.061434776,0.010039176,0.7874353],"study_design_scores_gemma":[0.00027180088,0.001800015,0.0010819192,0.00013971096,0.00021140295,0.0018965345,0.0002618849,0.2501518,0.46528178,0.12555507,0.15317748,0.00017062933],"about_ca_topic_score_codex":0.0008241181,"about_ca_topic_score_gemma":0.0026955993,"teacher_disagreement_score":0.014416781,"about_ca_system_score_codex":0.0005124552,"about_ca_system_score_gemma":0.0011748346,"threshold_uncertainty_score":0.04822892},"labels":[],"label_agreement":null},{"id":"W4417227565","doi":"10.1016/j.engappai.2025.113449","title":"A note on “Optimizing the selection of the secret parameters for public key cryptosystems by using interval linear programming and fully fuzzy linear programming”","year":2025,"lang":"en","type":"article","venue":"Engineering Applications of Artificial Intelligence","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Cryptosystem; Key (lock); Interval (graph theory); Fuzzy logic; Subtraction; Selection (genetic algorithm); Fuzzy number; Lexicographical order","score_opus":0.03616343098698093,"score_gpt":0.31103964180145327,"score_spread":0.27487621081447233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417227565","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059851697,0.010521394,0.80946773,0.089684874,0.04330365,0.00028181262,0.0006192834,0.001070985,0.03906514],"genre_scores_gemma":[0.15586983,0.012475421,0.6794762,0.044642035,0.03329593,0.00045369283,0.000662385,0.00096005475,0.072164394],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979296,0.00077062065,0.00012884753,0.00027774007,0.00078520103,0.00010801967],"domain_scores_gemma":[0.99520963,0.0032243803,0.0001393877,0.00051050977,0.00078793534,0.00012822726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033530055,0.0012014294,0.000879119,0.0005548862,0.0010299344,0.001610372,0.0023007877,0.0025776299,0.007453416],"category_scores_gemma":[0.010574045,0.00046081824,0.001317198,0.0009889393,0.0020705992,0.0032169505,0.0012149457,0.0059937015,0.001979227],"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.0011173643,0.0002451473,0.0006568401,0.0009031573,0.00027794327,0.0011062169,0.00029832957,0.05529081,0.01659057,0.32433867,0.4136238,0.1855512],"study_design_scores_gemma":[0.00025269875,0.00052145496,0.0016483985,0.00032465023,0.00020499622,0.00044869096,0.00015323944,0.22737265,0.02696672,0.40115023,0.3405771,0.00037919043],"about_ca_topic_score_codex":0.00428933,"about_ca_topic_score_gemma":0.0064425087,"teacher_disagreement_score":0.007453416,"about_ca_system_score_codex":0.0014660674,"about_ca_system_score_gemma":0.0018596709,"threshold_uncertainty_score":0.024934173},"labels":[],"label_agreement":null},{"id":"W45337212","doi":"10.1007/978-3-319-07058-2_2","title":"Parametric Method for Motion Analysis of Manipulators with Uncertainty in Kinematic Parameters","year":2014,"lang":"en","type":"book-chapter","venue":"Mechanisms and machine science","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Kinematics; Jacobian matrix and determinant; Parametric statistics; Control theory (sociology); Mathematics; Interval (graph theory); Range (aeronautics); Parametric equation; Planar; Equations of motion; Position (finance); Serial manipulator; Applied mathematics; Parallel manipulator; Computer science; Engineering; Geometry; Classical mechanics; Physics; Artificial intelligence; Statistics","score_opus":0.02584920889447265,"score_gpt":0.2866158899194706,"score_spread":0.26076668102499795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W45337212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039886622,0.0014874262,0.9936278,0.000061461484,0.000106627725,0.000014123419,0.000035351055,0.0001269786,0.0041414145],"genre_scores_gemma":[0.086129025,0.0061813234,0.87172264,0.00017450159,0.00044289225,0.00037718777,0.00029307135,0.0005897658,0.034089636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999506,0.000115796734,0.000020361573,0.00006328971,0.0002732274,0.000021305439],"domain_scores_gemma":[0.9996438,0.00019498557,0.00002581985,0.00005875817,0.00006601899,0.000010613335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006244135,0.001072244,0.0010784767,0.0009503985,0.00041350012,0.0010190605,0.0019708665,0.0012855338,0.0077066957],"category_scores_gemma":[0.0015270248,0.000585668,0.0009465633,0.0012727027,0.0011721423,0.0011665784,0.0011664496,0.0022671418,0.0026118846],"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.000053004842,0.000061001683,0.00016983645,0.00079873396,0.000107690656,0.0001662702,0.00021727952,0.2258183,0.011391298,0.4169948,0.017522413,0.32669935],"study_design_scores_gemma":[0.000016639979,0.000054517637,0.00026879844,0.00010768468,0.00003902745,0.00033301103,0.000041661868,0.6813634,0.0023764854,0.24468975,0.07066449,0.000044493834],"about_ca_topic_score_codex":0.0009457885,"about_ca_topic_score_gemma":0.0009568384,"teacher_disagreement_score":0.0077066957,"about_ca_system_score_codex":0.00047857294,"about_ca_system_score_gemma":0.00072300417,"threshold_uncertainty_score":0.025781512},"labels":[],"label_agreement":null},{"id":"W562550760","doi":"10.1049/el.2015.0342","title":"Area efficient floating‐point FFT butterfly architectures based on multi‐operand adders","year":2015,"lang":"en","type":"article","venue":"Electronics Letters","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Operand; Adder; Fast Fourier transform; Computer science; Parallel computing; Floating point; Butterfly; Point (geometry); Arithmetic; Computer architecture; Computer hardware; Algorithm; Mathematics; Telecommunications; Latency (audio)","score_opus":0.022838173421325377,"score_gpt":0.2606227942640772,"score_spread":0.23778462084275181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W562550760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31153274,0.003385737,0.65055496,0.0004939553,0.00026645744,0.00011696984,0.00043650597,0.0031810512,0.030031627],"genre_scores_gemma":[0.7498293,0.0010193111,0.23755021,0.00011442714,0.000059965052,0.000069829795,0.0004088778,0.000054577198,0.010893534],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99991584,0.0000082384395,0.000008387126,0.00001475655,0.000035258356,0.0000175167],"domain_scores_gemma":[0.9998758,0.000034175362,0.000016583957,0.000017549222,0.000049355313,0.0000065847257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010447801,0.00032469825,0.00021827786,0.0006242471,0.0003474079,0.00043381815,0.0007530657,0.00028580718,0.0038160942],"category_scores_gemma":[0.00027142698,0.00015942732,0.00023949177,0.0006397756,0.00017660447,0.0008891408,0.0002343804,0.00022813832,0.00054937945],"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.0006415101,0.00010788058,0.0015184452,0.00042233613,0.00010893438,0.0005712458,0.00017373798,0.099609695,0.26771304,0.062386766,0.011489368,0.55525714],"study_design_scores_gemma":[0.00012784207,0.00053958746,0.0021589403,0.000079335354,0.00011484864,0.0007519233,0.00008546857,0.76312673,0.18013886,0.015976535,0.03683204,0.00006781352],"about_ca_topic_score_codex":0.001755098,"about_ca_topic_score_gemma":0.004605358,"teacher_disagreement_score":0.0038160942,"about_ca_system_score_codex":0.00047311865,"about_ca_system_score_gemma":0.0005395254,"threshold_uncertainty_score":0.012766123},"labels":[],"label_agreement":null},{"id":"W592305","doi":"10.1530/jrf.0.0510495","title":"Exact computation of Simultaneous Rational Approximants","year":2000,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and 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 Waterloo","funders":"","keywords":"Computation; Mathematics; Fraction (chemistry); Hermite polynomials; Symbolic computation; Field (mathematics); Applied mathematics; Algorithm; Mathematical analysis; Pure mathematics","score_opus":0.0170643665511168,"score_gpt":0.2888889388205207,"score_spread":0.2718245722694039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W592305","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03401393,0.0001339965,0.95776784,0.00007887929,0.000049148846,0.000021131542,0.00002707357,0.0004753797,0.0074326233],"genre_scores_gemma":[0.58842003,0.0003107816,0.4016874,0.00007352142,0.000054317487,0.000072406285,0.00012420716,0.0002247851,0.009032688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916446,0.00014743823,0.00003765364,0.00010894736,0.0004348719,0.00010668556],"domain_scores_gemma":[0.998676,0.0008354365,0.00006689923,0.00021131022,0.00017726574,0.000033039792],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010440612,0.0006998499,0.0007751528,0.00089752924,0.00045831857,0.001690957,0.0007538182,0.00068672426,0.0039268485],"category_scores_gemma":[0.0052886237,0.00040316704,0.00070333306,0.0008650313,0.0010823724,0.0022859157,0.0014278725,0.0012529321,0.0009185323],"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.00026618442,0.000054322725,0.0010754141,0.00020770518,0.000060367707,0.00024104817,0.0004266528,0.14373371,0.009042885,0.65100306,0.0018874429,0.19200121],"study_design_scores_gemma":[0.000023434417,0.00004580843,0.00018418838,0.000024202714,0.000019578116,0.00011252146,0.00006202327,0.7827537,0.009153865,0.20349114,0.0041134567,0.00001605667],"about_ca_topic_score_codex":0.0012168173,"about_ca_topic_score_gemma":0.0017593707,"teacher_disagreement_score":0.0039268485,"about_ca_system_score_codex":0.0007624868,"about_ca_system_score_gemma":0.0006598693,"threshold_uncertainty_score":0.013136625},"labels":[],"label_agreement":null},{"id":"W6242962","doi":"10.1007/978-94-017-9454-1_4","title":"Representation of Functions in Basis Sets","year":2015,"lang":"en","type":"book-chapter","venue":"Scientific computation","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Basis (linear algebra); Representation (politics); Computer science; Mathematics; Political science; Geometry","score_opus":0.09377608752637932,"score_gpt":0.344813922399883,"score_spread":0.2510378348735037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6242962","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018442977,0.015307354,0.77509123,0.0011887784,0.0023045104,0.00006603783,0.00031348216,0.0006838247,0.20320038],"genre_scores_gemma":[0.056787062,0.03238647,0.7080857,0.0011335497,0.002070508,0.00042708544,0.0013458573,0.001611663,0.19615205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993899,0.00015275874,0.00003290518,0.000061308,0.0003262631,0.000036866997],"domain_scores_gemma":[0.99971944,0.00011588831,0.000012605803,0.00006634476,0.0000703489,0.000015304458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008911913,0.0013132134,0.0011812471,0.0018461505,0.00061738596,0.003685145,0.0017291091,0.0011380316,0.0114366915],"category_scores_gemma":[0.001560349,0.0005490057,0.0009439888,0.0026363267,0.002162073,0.0030861543,0.0014572046,0.0038488752,0.008723457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004980183,0.0000072665935,0.000014108802,0.00012025259,0.0000065462896,0.0000138641,0.000075483375,0.0021307608,0.00064002397,0.9238131,0.013811545,0.05936212],"study_design_scores_gemma":[0.0000053016242,0.000008979105,0.000046665267,0.00014417063,0.000007110667,0.00009694076,0.000030506126,0.012960993,0.00072371966,0.8109638,0.17499678,0.000014979589],"about_ca_topic_score_codex":0.00073994976,"about_ca_topic_score_gemma":0.0007989309,"teacher_disagreement_score":0.0114366915,"about_ca_system_score_codex":0.0009169539,"about_ca_system_score_gemma":0.0007668176,"threshold_uncertainty_score":0.038259566},"labels":[],"label_agreement":null},{"id":"W6925025436","doi":"10.17605/osf.io/k5nup","title":"Does dietitian involvement during pregnancy improve birth outcomes? A systematic review","year":2022,"lang":"en","type":"other","venue":"Open Science Framework","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pregnancy; Psychological intervention; Prenatal care; Low birth weight; Medical nutrition therapy; Intervention (counseling); Incidence (geometry); Health care","score_opus":0.019110993377965745,"score_gpt":0.32825058147598357,"score_spread":0.30913958809801784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925025436","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015601633,0.9969585,0.000088093766,0.0002525088,0.00009881043,0.00022970389,0.0005145501,0.0000070615247,0.0002906611],"genre_scores_gemma":[0.018784154,0.97958094,0.00030802027,0.0004443587,0.00006862789,0.0004611883,0.00025639049,0.0000045033175,0.000091862625],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.99394774,0.002258791,0.0021084705,0.0004698973,0.0010330616,0.00018200724],"domain_scores_gemma":[0.97017515,0.023123434,0.004371541,0.00037605606,0.001670394,0.00028350734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064007663,0.0009769059,0.0070441505,0.0048605716,0.0005726306,0.0021047436,0.0015204187,0.0019823397,0.0058566337],"category_scores_gemma":[0.04372248,0.000894089,0.0074207545,0.0070525766,0.0005804271,0.0017823805,0.0011294725,0.0012911569,0.00031927176],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000558408,0.000039029623,0.0021424354,0.9337246,0.011816898,0.00008253836,0.000204774,0.00006965198,0.000055888428,0.00013865325,0.001821633,0.04934549],"study_design_scores_gemma":[0.0005191367,0.0003083703,0.009791707,0.90653116,0.06912629,0.0002913378,0.00028006994,0.0000834774,0.000097191114,0.00019819802,0.012735881,0.000037278183],"about_ca_topic_score_codex":0.014268541,"about_ca_topic_score_gemma":0.03258937,"teacher_disagreement_score":0.014268541,"about_ca_system_score_codex":0.0031871914,"about_ca_system_score_gemma":0.008705057,"threshold_uncertainty_score":0.03385091},"labels":[],"label_agreement":null},{"id":"W6926381370","doi":"10.25316/ir-10574","title":"Nanaimo Free Press [Tuesday, August 4, 1896]","year":2019,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"","score_opus":0.012442272973211686,"score_gpt":0.21988064455126494,"score_spread":0.20743837157805325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926381370","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007534878,0.028894093,0.00048665254,0.0035689508,0.0060234717,0.000028618855,0.0024908995,0.00021422793,0.9575396],"genre_scores_gemma":[0.0018359498,0.0042233085,0.00017939479,0.00016301945,0.0002587585,0.000010705864,0.00027506976,0.0001101781,0.9929436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952424,0.000037629787,0.000023474684,0.000099465164,0.00024464916,0.00007055504],"domain_scores_gemma":[0.99971956,0.000041259274,0.000020936319,0.000025998086,0.00014204242,0.000050097136],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038572992,0.0011119144,0.0007688517,0.0022268507,0.003402449,0.0053340066,0.00086538016,0.0017288711,0.30381766],"category_scores_gemma":[0.0016731883,0.00050634966,0.0003476327,0.0036722368,0.00082372123,0.0023880466,0.0015529505,0.0025070105,0.09887987],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038255985,0.000011038516,0.00017620777,0.00013536125,0.0000059652,0.000085714804,0.0001284635,0.00014665452,0.000117330215,0.025095591,0.91013867,0.06392077],"study_design_scores_gemma":[0.0000017663747,0.0000024798708,0.0002525543,0.00006946131,9.706712e-7,0.000021341046,0.000028480561,0.000026528225,0.000039135724,0.0008230654,0.9987313,0.000002903823],"about_ca_topic_score_codex":0.09061999,"about_ca_topic_score_gemma":0.37777197,"teacher_disagreement_score":0.69618237,"about_ca_system_score_codex":0.0037371542,"about_ca_system_score_gemma":0.002256155,"threshold_uncertainty_score":0.99301964},"labels":[],"label_agreement":null},{"id":"W6929688700","doi":"10.48713/10336_10422","title":"El plan de los organismo internacionales, ONU y OEA dentro de la problemática de las minas antipersonal","year":2023,"lang":"es","type":"dissertation","venue":"Repositorio Institucional E-DocUR (Universidad Del Rosario)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Context (archaeology); Plan (archaeology)","score_opus":0.015876598821435477,"score_gpt":0.29341338523613675,"score_spread":0.27753678641470125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6929688700","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42371285,0.008708581,0.033406425,0.018727249,0.000643912,0.00026048074,0.0007138977,0.00030915425,0.51351744],"genre_scores_gemma":[0.9486344,0.0023867672,0.0077164723,0.00039604722,0.000054396878,0.0000876064,0.00014627527,0.00004878868,0.04052929],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99836737,0.0005639454,0.00004640019,0.00022929412,0.00030029856,0.00049268495],"domain_scores_gemma":[0.9954318,0.0008044927,0.00074738084,0.00043986016,0.0010760272,0.0015004582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018440472,0.0005303255,0.0003228847,0.0009064172,0.002488037,0.006108362,0.0007973007,0.0008965928,0.011421123],"category_scores_gemma":[0.0051036472,0.00018807105,0.0002822915,0.0012022149,0.0030807059,0.0035941761,0.0029646396,0.0014025411,0.00092044735],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004670278,0.00019111542,0.11179192,0.0008318853,0.000060225088,0.00037640092,0.024208033,0.009689883,0.0025683823,0.5410506,0.022607813,0.2861567],"study_design_scores_gemma":[0.00003692724,0.00029834302,0.16078156,0.0009705738,0.000065355634,0.0002564158,0.07684362,0.0074580847,0.0025438836,0.08467304,0.66597277,0.000099478726],"about_ca_topic_score_codex":0.097510815,"about_ca_topic_score_gemma":0.17297132,"teacher_disagreement_score":0.097510815,"about_ca_system_score_codex":0.008492041,"about_ca_system_score_gemma":0.012472316,"threshold_uncertainty_score":0.19388646},"labels":[],"label_agreement":null},{"id":"W6930932396","doi":"10.5281/zenodo.15439776","title":"50 YEARS OF ADVANCED COMPOSITES RESEARCH AND INNOVATION: A CANADIAN PERSPECTIVE","year":2013,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Perspective (graphical); Honour; Weaving; Scala","score_opus":0.04716823997825932,"score_gpt":0.2979474566705635,"score_spread":0.2507792166923042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930932396","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033272794,0.44861534,0.001783854,0.38267747,0.014768315,0.000047929636,0.00061452645,0.0000829424,0.14808236],"genre_scores_gemma":[0.100262694,0.7662495,0.0032275366,0.054897886,0.007465733,0.00008048494,0.0005721594,0.00016952919,0.0670745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9823614,0.001168236,0.0006596793,0.0010012165,0.010315174,0.0044942396],"domain_scores_gemma":[0.9690588,0.0038181578,0.0013496731,0.0006538704,0.013733477,0.0113861365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020824045,0.0019580473,0.0020248033,0.011164057,0.014734828,0.018394494,0.0036003904,0.008614427,0.026449176],"category_scores_gemma":[0.02061476,0.0008598509,0.0012383525,0.013770813,0.018039837,0.013335013,0.008830891,0.011272768,0.0033175256],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024227753,0.00017969767,0.0015695333,0.0015696149,0.00007996375,0.0004760738,0.0027274594,0.0018294506,0.0006534869,0.44115442,0.4070665,0.14245147],"study_design_scores_gemma":[0.000019368737,0.00004618566,0.002010902,0.0015964085,0.000028413593,0.00014316337,0.002297272,0.00029221876,0.0001953824,0.028486159,0.96480876,0.00007578309],"about_ca_topic_score_codex":0.8768119,"about_ca_topic_score_gemma":0.90276766,"teacher_disagreement_score":0.86944455,"about_ca_system_score_codex":0.13055544,"about_ca_system_score_gemma":0.24026334,"threshold_uncertainty_score":0.9472504},"labels":[],"label_agreement":null},{"id":"W6931275982","doi":"10.5281/zenodo.5226878","title":"Understanding behavioural responses to human-induced rapid environmental change: A meta-analysis","year":2021,"lang":"en","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Numerical Methods and 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":"Lakehead University","funders":"","keywords":"Boldness; Context (archaeology); Environmental change; Range (aeronautics); Fish <Actinopterygii>; Empirical research; Climate change; Empirical evidence","score_opus":0.45506976537317817,"score_gpt":0.35155478736076917,"score_spread":0.103514978012409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6931275982","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19167656,0.7667923,0.021037465,0.003732694,0.0009310286,0.00043015502,0.012842185,0.0007213328,0.0018363898],"genre_scores_gemma":[0.9297656,0.05455402,0.009215574,0.0013826328,0.00015984215,0.0005307588,0.0037476246,0.00020009807,0.00044392765],"study_design_codex":"meta_analysis","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9899296,0.0059617856,0.0012604026,0.0020471334,0.000454164,0.00034684848],"domain_scores_gemma":[0.9694476,0.024021301,0.0022284663,0.0025988815,0.0012190358,0.0004847565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015747188,0.0025493612,0.0073265093,0.0054244013,0.000767882,0.0031833097,0.003231374,0.0023161517,0.0044411337],"category_scores_gemma":[0.0277885,0.0012456403,0.039275274,0.007239899,0.00087230693,0.00195116,0.002260929,0.0023718036,0.00049494277],"study_design_candidate":"meta_analysis","study_design_consensus":"meta_analysis","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008823608,0.000043030665,0.06047742,0.03359987,0.892553,0.00031747558,0.00022253286,0.0025780643,0.0007215816,0.00042864683,0.0013588438,0.006817218],"study_design_scores_gemma":[0.00018669874,0.00023724051,0.05999385,0.004857027,0.92729837,0.00017743348,0.00029721038,0.0025378063,0.00039978846,0.0011775228,0.00276767,0.00006937715],"about_ca_topic_score_codex":0.016302142,"about_ca_topic_score_gemma":0.022371758,"teacher_disagreement_score":0.016302142,"about_ca_system_score_codex":0.0014707504,"about_ca_system_score_gemma":0.0017078122,"threshold_uncertainty_score":0.08328009},"labels":[],"label_agreement":null},{"id":"W6984844887","doi":"","title":"Page 198","year":2011,"lang":"en","type":"article","venue":"Pittsburg State University Digital Commons (Pittsburg State University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Ledger; Period (music); Register (sociolinguistics); Quarter (Canadian coin); Table (database)","score_opus":0.026721548299257297,"score_gpt":0.20163800878251967,"score_spread":0.17491646048326237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6984844887","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019422152,0.001538104,0.0003270805,0.0040099476,0.0074027847,0.000059727612,0.0019287784,0.00053134415,0.98400795],"genre_scores_gemma":[0.0006658626,0.0006199015,0.00010076893,0.0011280124,0.0006675568,0.000016460872,0.00081201683,0.00013486906,0.9958546],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99959975,0.000030340345,0.000021498037,0.00006861897,0.00023371546,0.000046177505],"domain_scores_gemma":[0.99853086,0.00020512234,0.00005166504,0.00014359136,0.00084110023,0.0002276551],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037896456,0.00057354197,0.000474382,0.0014277317,0.0017627119,0.0052691987,0.0006969523,0.0013418959,0.79173034],"category_scores_gemma":[0.0030460183,0.00028711266,0.00032827398,0.0015848926,0.00046289735,0.0021122813,0.0013150934,0.0013854522,0.7489776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004407056,0.000006351925,0.000049772058,0.000021529475,4.7073644e-7,0.000011495874,0.000018033328,0.000008221734,0.00004736342,0.0014465023,0.982396,0.01598983],"study_design_scores_gemma":[0.0000015889837,0.0000023705768,0.00012043875,0.000036827852,4.6947517e-7,0.000019673522,0.000028034554,0.00000875208,0.00002350856,0.000296563,0.9994605,0.0000012611933],"about_ca_topic_score_codex":0.0057401927,"about_ca_topic_score_gemma":0.011787182,"teacher_disagreement_score":0.20826966,"about_ca_system_score_codex":0.0012205802,"about_ca_system_score_gemma":0.0016277296,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W6989710314","doi":"","title":"Calabash Cadence Taisgeadan","year":2016,"lang":"en","type":"book","venue":"Research Portal (Queen's University Belfast)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; Queen's University","funders":"","keywords":"Cadence; Feature (linguistics); Statistical analysis; Compression (physics)","score_opus":0.033119872254332924,"score_gpt":0.3088082630854348,"score_spread":0.27568839083110186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6989710314","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006590338,0.013799866,0.010886189,0.0031631421,0.004844779,0.00008384306,0.0009227144,0.003219142,0.96242136],"genre_scores_gemma":[0.0013731035,0.002789206,0.0018091601,0.00032073542,0.0002807334,0.000026328773,0.00034513627,0.0005657137,0.9924899],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994615,0.00002855144,0.000014124933,0.00012196088,0.000322285,0.000051541556],"domain_scores_gemma":[0.9989498,0.00017829309,0.000038192098,0.00012847481,0.0005115248,0.00019373882],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005973968,0.0013550803,0.000914815,0.002595702,0.0017833012,0.0035113648,0.0010170848,0.0013798184,0.47338578],"category_scores_gemma":[0.0018974473,0.0005542403,0.00039382442,0.002183776,0.00073357986,0.0026178467,0.0020777637,0.002418201,0.3175741],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034456923,0.000012375036,0.000037534097,0.00016646818,0.0000017098987,0.0000358019,0.00006988932,0.00016821889,0.0005205499,0.0147365285,0.760393,0.22382338],"study_design_scores_gemma":[0.0000035645116,0.000006232189,0.00006403459,0.000039707196,0.0000011703997,0.000045981495,0.000018144845,0.00011826624,0.00014464243,0.0014052668,0.9981495,0.0000036125637],"about_ca_topic_score_codex":0.008977101,"about_ca_topic_score_gemma":0.02426371,"teacher_disagreement_score":0.47338578,"about_ca_system_score_codex":0.0018660892,"about_ca_system_score_gemma":0.0019653216,"threshold_uncertainty_score":0.75115126},"labels":[],"label_agreement":null},{"id":"W6996702661","doi":"","title":"Sparse Matrix-Vector floating-point multiplication with FPGAs for finite element electromagnetics","year":2006,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Pipeline (software); Field-programmable gate array; Sparse matrix; Iterative method; Initialization; Stratix; Finite element method; Solver; Multiplier (economics); Conjugate gradient method","score_opus":0.014864832620845857,"score_gpt":0.2654388472363755,"score_spread":0.25057401461552964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6996702661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0081994785,0.00067899283,0.9704487,0.00037006865,0.00026061706,0.000054561024,0.00018010868,0.0029644168,0.016843077],"genre_scores_gemma":[0.1670596,0.0013001192,0.8028036,0.00014280542,0.00013059498,0.00021140021,0.000740262,0.0003749076,0.027236694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997743,0.000055212764,0.000015967988,0.000022836079,0.000116272284,0.000015421896],"domain_scores_gemma":[0.9996358,0.00012538923,0.000021896676,0.00007946854,0.000119369586,0.000017978595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003283225,0.0005576682,0.0002984196,0.0004631986,0.00035071798,0.00068216346,0.000619188,0.0003610701,0.018354176],"category_scores_gemma":[0.001330901,0.00021637978,0.0003302248,0.0006795702,0.0002544306,0.0007099393,0.0005434847,0.00062085973,0.004986349],"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.00026741816,0.00006536723,0.00094715954,0.0003728345,0.000046881916,0.0002040844,0.00023993576,0.07966251,0.04322578,0.08384998,0.041714005,0.7494041],"study_design_scores_gemma":[0.00011254522,0.00028247008,0.0010893157,0.00017020389,0.000032272375,0.00049883686,0.000112291025,0.7466299,0.038168956,0.043697804,0.16916533,0.00004004173],"about_ca_topic_score_codex":0.0014389504,"about_ca_topic_score_gemma":0.0030511518,"teacher_disagreement_score":0.018354176,"about_ca_system_score_codex":0.0003332896,"about_ca_system_score_gemma":0.0006769655,"threshold_uncertainty_score":0.06140083},"labels":[],"label_agreement":null},{"id":"W6997240984","doi":"","title":"Two floating point LLL reduction algorithms","year":2013,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Reduction (mathematics); Lattice reduction; Block (permutation group theory); FLOPS; Floating point; Partition (number theory); Point (geometry)","score_opus":0.020990417027557592,"score_gpt":0.2800977408662967,"score_spread":0.2591073238387391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6997240984","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007845414,0.00038008156,0.9720749,0.00034359912,0.0001412309,0.00012231026,0.00014846165,0.0026930505,0.016250957],"genre_scores_gemma":[0.11382595,0.00051301165,0.8495644,0.0003708264,0.0001196641,0.0005462514,0.0010499341,0.0012563021,0.03275377],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868315,0.0001371561,0.000060604038,0.00015071999,0.00081610045,0.00015227283],"domain_scores_gemma":[0.99888355,0.00022254298,0.000059906688,0.00029270246,0.0004934324,0.000047831516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752101,0.0010458053,0.0008202372,0.0011652213,0.0010781095,0.0017350966,0.0018222539,0.0008247599,0.014855685],"category_scores_gemma":[0.0029750636,0.00045028832,0.0010297799,0.0010919721,0.00090000744,0.0017127466,0.0022673493,0.0015664541,0.0074931383],"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.00025823194,0.0001270581,0.00077392784,0.00024409266,0.000037313923,0.00010899232,0.0004066227,0.09396682,0.020497717,0.15348266,0.02113635,0.70896024],"study_design_scores_gemma":[0.00019848332,0.00016323087,0.00045505352,0.000089841174,0.00003832737,0.00027306896,0.000136757,0.7803186,0.042085152,0.08302165,0.093136124,0.00008367971],"about_ca_topic_score_codex":0.004317399,"about_ca_topic_score_gemma":0.003668664,"teacher_disagreement_score":0.014855685,"about_ca_system_score_codex":0.0014279275,"about_ca_system_score_gemma":0.0017199247,"threshold_uncertainty_score":0.04969722},"labels":[],"label_agreement":null},{"id":"W6999426804","doi":"","title":"Computing with uncertainty truth degrees: a convolution-based degrees","year":2017,"lang":"en","type":"dissertation","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Permission; License; Public use; Key (lock); Product (mathematics); Subject (documents); Order (exchange)","score_opus":0.026315590094846696,"score_gpt":0.27633630510345425,"score_spread":0.25002071500860756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999426804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010055775,0.00044867888,0.9866491,0.0007331372,0.00006503315,0.00003880575,0.00013284449,0.0002366015,0.0016401093],"genre_scores_gemma":[0.45618647,0.001087039,0.5354494,0.00066301867,0.00058256957,0.00018424889,0.00076267,0.0002904224,0.0047941874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962147,0.0012562688,0.0002524576,0.0010083633,0.00094439223,0.00032381684],"domain_scores_gemma":[0.991389,0.00545951,0.0004899208,0.0012104721,0.001013898,0.0004372427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042955377,0.0009336571,0.002116794,0.0018599797,0.0010974506,0.004444371,0.0029513456,0.0023547737,0.005604586],"category_scores_gemma":[0.02553196,0.0009743511,0.0022066464,0.0024713015,0.0026791594,0.007726887,0.005935623,0.004501507,0.0009887915],"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.00057769165,0.00015361077,0.0030855401,0.00032106135,0.00026477154,0.00019783582,0.00047536954,0.45690224,0.0034267418,0.21066749,0.006709878,0.3172178],"study_design_scores_gemma":[0.000015726906,0.000054369993,0.00026574437,0.000047187943,0.00003445466,0.00007807299,0.000033147335,0.8965116,0.0011231987,0.09999683,0.0018194646,0.000020195172],"about_ca_topic_score_codex":0.005534262,"about_ca_topic_score_gemma":0.0043606116,"teacher_disagreement_score":0.005604586,"about_ca_system_score_codex":0.0023641393,"about_ca_system_score_gemma":0.0026851478,"threshold_uncertainty_score":0.022717297},"labels":[],"label_agreement":null},{"id":"W7033065352","doi":"","title":"Observation of the decay BÌ0âÎc+pÌÏ0","year":2010,"lang":"en","type":"article","venue":"eScholarship (California Digital Library)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"SLAC National Accelerator Laboratory; Institut National de Physique Nucléaire et de Physique des Particules; Centre National de la Recherche Scientifique; Bundesministerium für Bildung und Forschung; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; European Commission; Alfred P. Sloan Foundation; Deutsche Forschungsgemeinschaft; U.S. Department of Energy; National Science Foundation","keywords":"Branching fraction; Collider; Branching (polymer chemistry); Detector; Invariant mass; Particle decay","score_opus":0.018602331341912175,"score_gpt":0.23360929898252275,"score_spread":0.21500696764061059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033065352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860102,0.00059330696,0.0052471478,0.000063718806,0.000021477028,0.000030402469,0.0011958819,0.000113093505,0.006724646],"genre_scores_gemma":[0.9910245,0.00022200379,0.0050249044,0.00005280606,0.000013605554,0.000037234575,0.0024328658,0.000023782404,0.0011683196],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9989611,0.00020361046,0.00003843302,0.00033554455,0.0002817063,0.0001795126],"domain_scores_gemma":[0.99882966,0.00019316998,0.00030586222,0.00011862411,0.00036221,0.00019043434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012261611,0.00045629565,0.00053193286,0.001574089,0.0010335112,0.0012432892,0.00046398496,0.0005467268,0.0021012642],"category_scores_gemma":[0.0014795836,0.00042653017,0.00024511974,0.0027667827,0.0004323604,0.0003709251,0.00097615964,0.0005427255,0.0010292282],"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.0025526918,0.00033577724,0.4436031,0.00033942956,0.0002877516,0.0009332698,0.00077377725,0.0015842105,0.5163351,0.004844329,0.0015808202,0.026829707],"study_design_scores_gemma":[0.00012968674,0.00089631777,0.5898219,0.000041022668,0.00025036235,0.0051059425,0.00035980289,0.019070456,0.3641239,0.0011801105,0.018868286,0.00015217457],"about_ca_topic_score_codex":0.0022461314,"about_ca_topic_score_gemma":0.0021827838,"teacher_disagreement_score":0.0022461314,"about_ca_system_score_codex":0.00063844625,"about_ca_system_score_gemma":0.0004284128,"threshold_uncertainty_score":0.007029474},"labels":[],"label_agreement":null},{"id":"W7033864144","doi":"","title":"The state of oncology literature as it relates to access to equitable cancer care as experienced by equity-seeking groups and priority populations in Canada","year":2021,"lang":"en","type":"other","venue":"OSF Preprints (OSF Preprints)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Cancer; Health care; State (computer science); MEDLINE; Population; Cancer survival","score_opus":0.031177112140332888,"score_gpt":0.3713941293423162,"score_spread":0.34021701720198333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7033864144","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":"methods","model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":"methods","domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007429558,0.9435532,0.0009201381,0.024046123,0.0007005411,0.00013034635,0.0017716837,0.000021827334,0.021426506],"genre_scores_gemma":[0.09804755,0.8915821,0.002679119,0.0043422594,0.00029214335,0.00021208041,0.00095241517,0.000043349584,0.001848972],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9818835,0.004012251,0.002559269,0.0012612063,0.0084676985,0.0018159725],"domain_scores_gemma":[0.8860642,0.05773575,0.0074163093,0.0014191592,0.04361341,0.0037512446],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.022897959,0.0006376645,0.0024384346,0.016334334,0.0066480185,0.014880968,0.0029431318,0.0021110142,0.008036471],"category_scores_gemma":[0.11066966,0.0007519649,0.0016655901,0.039260883,0.0067992155,0.0036367313,0.0046031205,0.0023479883,0.0004502231],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028293862,0.00006228551,0.034888595,0.15379384,0.0012477256,0.000843673,0.031398956,0.0034243676,0.0003854326,0.07856702,0.088221654,0.6068836],"study_design_scores_gemma":[0.000056029643,0.00008859992,0.055109434,0.34199452,0.0018898577,0.00047453187,0.039142128,0.0008723367,0.00041808755,0.012782786,0.54695725,0.0002144518],"about_ca_topic_score_codex":0.9781165,"about_ca_topic_score_gemma":0.9878924,"teacher_disagreement_score":0.97710204,"about_ca_system_score_codex":0.13274725,"about_ca_system_score_gemma":0.39536434,"threshold_uncertainty_score":0.9631532},"labels":[],"label_agreement":null},{"id":"W7034041388","doi":"","title":"Silicon containing organic-inorganic hybrid materials as EUV photoresists","year":2005,"lang":"en","type":"article","venue":"NPARC","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Silicon; Extreme ultraviolet lithography; Hybrid material; Hybrid system; Process (computing)","score_opus":0.013163004075531585,"score_gpt":0.263996832983639,"score_spread":0.25083382890810746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034041388","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9330373,0.0014463923,0.010609488,0.00066583743,0.00073056517,0.00010939834,0.00059104885,0.00043014894,0.052379888],"genre_scores_gemma":[0.9315884,0.0007514056,0.0065660723,0.00008009071,0.000037731286,0.000034144636,0.000384184,0.000116414005,0.06044158],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99980897,0.000017608501,0.000008180144,0.000039827486,0.000102133345,0.000023236462],"domain_scores_gemma":[0.99990654,0.000023562696,0.00001065427,0.000015985188,0.000034691453,0.000008614205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019154012,0.00016531243,0.00022152852,0.00015988799,0.00028470438,0.0005305983,0.00030812444,0.00037344304,0.011041491],"category_scores_gemma":[0.0002728366,0.00016439709,0.00014112618,0.00022104326,0.00013616715,0.00039290605,0.00024762636,0.00022512682,0.0024059366],"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.00020528544,0.000029404671,0.0006364727,0.00023403586,0.000015810994,0.00019480367,0.00006021077,0.0009670308,0.9774303,0.003758479,0.002635501,0.013832573],"study_design_scores_gemma":[0.00002425049,0.000106494466,0.0007671435,0.000008532432,0.000012908518,0.000075942786,0.000057599555,0.003891333,0.9788023,0.00036363892,0.015882166,0.000007556138],"about_ca_topic_score_codex":0.00029982266,"about_ca_topic_score_gemma":0.0009925942,"teacher_disagreement_score":0.011041491,"about_ca_system_score_codex":0.00023115863,"about_ca_system_score_gemma":0.00019062968,"threshold_uncertainty_score":0.036937475},"labels":[],"label_agreement":null},{"id":"W7034842684","doi":"","title":"Yhteisöllisen asumisen merkitys ikääntyneelle : Asukkaiden kokemuksia Wilhelmiina Tenholasta","year":2025,"lang":"fi","type":"other","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Data collection; State (computer science); Set (abstract data type); Quarter (Canadian coin)","score_opus":0.017273555999428276,"score_gpt":0.2833779594071583,"score_spread":0.26610440340773006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7034842684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6822232,0.030572224,0.014247153,0.006469417,0.0020059254,0.0005101554,0.0042494307,0.0010930189,0.2586295],"genre_scores_gemma":[0.6418923,0.012810812,0.017146666,0.0013848438,0.00020297314,0.00023000572,0.0032354428,0.00043460215,0.32266238],"study_design_codex":"bench_or_experimental","study_design_gemma":"qualitative","domain_scores_codex":[0.9995796,0.000045241697,0.000021155436,0.00009370838,0.00017855765,0.0000817548],"domain_scores_gemma":[0.9996376,0.0000483329,0.000048414782,0.00001648209,0.00016748648,0.00008172274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045266395,0.0005692247,0.00053817255,0.00075430935,0.001455681,0.0026051,0.0005182402,0.00077128876,0.020188361],"category_scores_gemma":[0.0003994255,0.00026445813,0.0005146735,0.0006936398,0.00051456434,0.0011859117,0.0012373433,0.0013207474,0.0048944894],"study_design_candidate":"qualitative","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.0018045679,0.0006536176,0.014787814,0.0027701156,0.00011426744,0.003207114,0.0059529846,0.0007004918,0.67955834,0.006029855,0.014698963,0.26972178],"study_design_scores_gemma":[0.000050950293,0.000784744,0.03791466,0.0004839283,0.00015959068,0.0018514043,0.0068839495,0.00047002226,0.19227663,0.0016699468,0.7573509,0.000103298946],"about_ca_topic_score_codex":0.008582353,"about_ca_topic_score_gemma":0.027782291,"teacher_disagreement_score":0.020188361,"about_ca_system_score_codex":0.0014206661,"about_ca_system_score_gemma":0.0018197786,"threshold_uncertainty_score":0.06753677},"labels":[],"label_agreement":null},{"id":"W7036684052","doi":"","title":"COMMUNITY DEVELOPMENT OF A SEXUAL HEALTH EDUCATION PROGRAM FOR PERSONS WITH INTELLECTUAL DISABILITIES: A CASE STUDY","year":2009,"lang":"en","type":"article","venue":"Scholarship@Western (Western University)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Resource (disambiguation); Curriculum; Reproductive health; Community education; Work (physics); Health education; Intellectual disability; Human sexuality","score_opus":0.17620476522940276,"score_gpt":0.4034873847801959,"score_spread":0.22728261955079315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7036684052","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9605598,0.0007333198,0.0028626435,0.0056437915,0.00009520198,0.0011666443,0.00006424669,0.00003087032,0.028843438],"genre_scores_gemma":[0.9776498,0.0023644222,0.006224821,0.0012198968,0.00005008216,0.00085080776,0.000064285305,0.000023888359,0.011551959],"study_design_codex":"qualitative","study_design_gemma":"case_report","domain_scores_codex":[0.9925989,0.0049384777,0.00017751117,0.00030909022,0.00077723764,0.0011987188],"domain_scores_gemma":[0.99199826,0.004062412,0.000621025,0.00031033083,0.0007777321,0.00223015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0066493438,0.0005878054,0.0005986425,0.0021082137,0.02138416,0.0038101368,0.0031269288,0.004009217,0.00502771],"category_scores_gemma":[0.01199463,0.00062808354,0.0005148494,0.0016856574,0.0053883716,0.0035961985,0.0074263727,0.0039050481,0.0005526556],"study_design_candidate":"case_report","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.0000857443,0.0032251684,0.014936655,0.000703665,0.000017073826,0.035440944,0.8680437,0.00044423234,0.0008837222,0.014093045,0.0061853295,0.055940617],"study_design_scores_gemma":[0.000026992906,0.00042964207,0.0033151284,0.0005415583,0.0000112633115,0.0069233635,0.9472842,0.00056443317,0.00061508355,0.0008716263,0.03938334,0.000033330678],"about_ca_topic_score_codex":0.01538177,"about_ca_topic_score_gemma":0.03780485,"teacher_disagreement_score":0.02138416,"about_ca_system_score_codex":0.006390337,"about_ca_system_score_gemma":0.011259787,"threshold_uncertainty_score":0.04636532},"labels":[],"label_agreement":null},{"id":"W7040650297","doi":"","title":"Préface","year":2017,"lang":"fr","type":"book-chapter","venue":"OpenEdition (OpenEdition)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Limiting; Corporatization","score_opus":0.057885179421011596,"score_gpt":0.29996524356390064,"score_spread":0.24208006414288905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7040650297","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020314523,0.0208082,0.0020898369,0.019141736,0.041146316,0.00020501146,0.0045159403,0.0003537753,0.90970784],"genre_scores_gemma":[0.005951377,0.005256539,0.00047311513,0.00088350184,0.0028977308,0.00004982423,0.001123191,0.00017615606,0.98318857],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906856,0.000066974426,0.00003023191,0.0001259425,0.0005964581,0.00011184597],"domain_scores_gemma":[0.9979395,0.0002327965,0.00007603552,0.00014932432,0.0012449754,0.00035734242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007376503,0.0007351741,0.00048255178,0.002194329,0.004450897,0.0032987017,0.0009814823,0.0012304725,0.19241254],"category_scores_gemma":[0.0029637953,0.00034319365,0.000353566,0.0024346102,0.0014435477,0.0016166761,0.0013710108,0.0020645198,0.064300254],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013343342,0.0000069225007,0.00012171175,0.00008850827,0.0000015235618,0.000042851545,0.0006081077,0.000055538494,0.00014898507,0.015916387,0.961522,0.021474201],"study_design_scores_gemma":[5.308324e-7,0.0000015640347,0.00024996186,0.000036968733,3.8513141e-7,0.000018042365,0.000095807154,0.000007413743,0.000024139206,0.00027212166,0.9992914,0.0000017407017],"about_ca_topic_score_codex":0.3198757,"about_ca_topic_score_gemma":0.44146743,"teacher_disagreement_score":0.3198757,"about_ca_system_score_codex":0.015519777,"about_ca_system_score_gemma":0.0088092685,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W7042266066","doi":"","title":"Patients' experience using a comprehensive web-based multimedia cancer information navigation platform","year":2018,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de Recherche du Québec - Santé; Canadian Institutes of Health Research","keywords":"Psychosocial; Competence (human resources); Autonomy; Cancer; Health care; Health information; Colorectal cancer; Health professionals","score_opus":0.028142168458529158,"score_gpt":0.2984056092033137,"score_spread":0.27026344074478453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042266066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9982792,0.0001267954,0.00011541463,0.00017117063,0.0000060529596,0.000010017451,0.00004925776,0.000011747427,0.0012302794],"genre_scores_gemma":[0.9989157,0.00012004214,0.00015781168,0.0000850973,0.0000044164717,0.000009988577,0.00003921416,0.0000033117553,0.00066450227],"study_design_codex":"observational","study_design_gemma":"qualitative","domain_scores_codex":[0.9994019,0.0002597943,0.000045964214,0.000043256296,0.0001333893,0.00011558135],"domain_scores_gemma":[0.99823797,0.00075657654,0.00030356643,0.000038944905,0.00014291202,0.0005200658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074233697,0.00016363671,0.00025269022,0.00025927293,0.0006351368,0.0011655949,0.00022220609,0.0005578325,0.0040132045],"category_scores_gemma":[0.004287316,0.00013561464,0.0003107278,0.00026113456,0.0002808668,0.00063619664,0.00093423104,0.00055436284,0.00032940664],"study_design_candidate":"qualitative","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.0015378926,0.0021925513,0.5094159,0.00074168324,0.00022751253,0.005858377,0.2773525,0.0017010221,0.010800722,0.0008052592,0.007488942,0.18187754],"study_design_scores_gemma":[0.00017712347,0.0076484187,0.63818425,0.00035854094,0.00037236916,0.013128205,0.2782023,0.004914357,0.0041020145,0.0004631525,0.05213227,0.0003169942],"about_ca_topic_score_codex":0.0022345283,"about_ca_topic_score_gemma":0.0027235406,"teacher_disagreement_score":0.0040132045,"about_ca_system_score_codex":0.00034312234,"about_ca_system_score_gemma":0.0003743316,"threshold_uncertainty_score":0.013425529},"labels":[],"label_agreement":null},{"id":"W7094192768","doi":"","title":"Canadian Association of General Surgeons Evidence Based Reviews in Surgery. 2","year":2002,"lang":"en","type":"article","venue":"Europe PMC (PubMed Central)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Association (psychology); Evidence-based practice; MEDLINE; Evidence-based medicine; Public health; Systematic review","score_opus":0.054135872447719655,"score_gpt":0.2527157844903392,"score_spread":0.19857991204261954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094192768","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060522184,0.9212744,0.0025850504,0.025573978,0.011778857,0.0017458363,0.015375783,0.00016379255,0.020897008],"genre_scores_gemma":[0.012183597,0.92669374,0.027267538,0.0060124006,0.0031929093,0.0028600618,0.0076854364,0.00010661631,0.013997574],"study_design_codex":"not_applicable","study_design_gemma":"systematic_review","domain_scores_codex":[0.9839662,0.0045189997,0.004060298,0.0006246573,0.0063997274,0.00043015814],"domain_scores_gemma":[0.9183386,0.018679326,0.008148693,0.001435997,0.04997747,0.0034198058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.021358011,0.0017801615,0.0046075247,0.020042589,0.0012826701,0.0029358044,0.003428333,0.0023557283,0.036046635],"category_scores_gemma":[0.078263864,0.0012185809,0.0025113046,0.022687504,0.0011144902,0.0014152102,0.0016407383,0.0023769813,0.005073842],"study_design_candidate":"systematic_review","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.00040340755,0.000033723823,0.0019052763,0.088958316,0.0016544788,0.000079523285,0.00011320758,0.0004178684,0.00013963786,0.0023983112,0.6985821,0.20531419],"study_design_scores_gemma":[0.0011494539,0.00012610797,0.027557258,0.10843663,0.007064005,0.0002360548,0.00015849179,0.0004705021,0.000281811,0.0028876537,0.85149616,0.00013595245],"about_ca_topic_score_codex":0.428565,"about_ca_topic_score_gemma":0.6955156,"teacher_disagreement_score":0.428565,"about_ca_system_score_codex":0.015973963,"about_ca_system_score_gemma":0.10617153,"threshold_uncertainty_score":0.8521409},"labels":[],"label_agreement":null},{"id":"W7099318928","doi":"","title":"This paper represents the views of the authors and does not necessarily reflect the opinions of Statistics Canada. Enhancing Food Safety and Productivity: Technology Use in the Canadian Food Processing Industry","year":2002,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Food safety; Food processing; Food industry; Government (linguistics); Food supply","score_opus":0.04978905326025906,"score_gpt":0.28376420649204664,"score_spread":0.23397515323178758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099318928","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044229563,0.010469621,0.014844133,0.102532804,0.00884331,0.00070395065,0.41872,0.00088220695,0.39877445],"genre_scores_gemma":[0.36025178,0.049462367,0.02832944,0.009239412,0.003299956,0.00056937244,0.11677215,0.0012800749,0.43079543],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.98932743,0.0010776013,0.00041486145,0.00044881436,0.007503822,0.0012273736],"domain_scores_gemma":[0.9481844,0.008468157,0.0022168297,0.0012840565,0.037947465,0.0018991883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052954135,0.0007131083,0.0014156705,0.0061461288,0.0017697867,0.0051898505,0.0023004604,0.0008579383,0.05433864],"category_scores_gemma":[0.040294807,0.0004101309,0.0010380094,0.020092,0.0009981343,0.0017172234,0.0013881405,0.0024691115,0.0072192075],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026645858,0.000073425465,0.04313542,0.0011186958,0.00027524823,0.0001168351,0.0008266188,0.0027484377,0.00054846297,0.027259504,0.8109064,0.11272441],"study_design_scores_gemma":[0.000094843555,0.00007541099,0.09567919,0.00095514534,0.00043439385,0.00017279998,0.00368238,0.0107325325,0.0022674168,0.010017877,0.87568367,0.00020438145],"about_ca_topic_score_codex":0.94041383,"about_ca_topic_score_gemma":0.9640445,"teacher_disagreement_score":0.059586167,"about_ca_system_score_codex":0.02909459,"about_ca_system_score_gemma":0.08049742,"threshold_uncertainty_score":0.211097},"labels":[],"label_agreement":null},{"id":"W7100041281","doi":"","title":"Surrogate Buyers in Corporate Buying of Luxury Hotel Rooms","year":2014,"lang":"en","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Tourism; Sample (material); Hotel industry; Hospitality industry; Hospitality; Quarter (Canadian coin); Stakeholder; Business tourism","score_opus":0.029020186605008217,"score_gpt":0.25139274920571486,"score_spread":0.22237256260070665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100041281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770827,0.0004988943,0.0007789922,0.00062086864,0.000035883208,0.000028479148,0.00003459933,0.0000059172094,0.0209136],"genre_scores_gemma":[0.99549377,0.0001430041,0.00031070437,0.000094411036,0.000013393039,0.0000057635493,0.00002245947,0.00000334092,0.0039131707],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9984339,0.0008210061,0.00005818316,0.000116948904,0.00039007343,0.00017992625],"domain_scores_gemma":[0.9951001,0.002009491,0.001462709,0.0003670649,0.00043384873,0.00062679267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020202075,0.00016414492,0.0003107586,0.0005939677,0.0017978102,0.0037717207,0.000488817,0.00056584843,0.015681142],"category_scores_gemma":[0.006213711,0.00034735192,0.00027478902,0.0006854956,0.001239992,0.0012102132,0.0013846187,0.0011948814,0.0010089802],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008898856,0.0009431479,0.8398206,0.00028417507,0.000087497654,0.0054696496,0.057754446,0.00058254745,0.0015931028,0.029287951,0.0074004564,0.055886574],"study_design_scores_gemma":[0.000063494444,0.00045139118,0.6687957,0.00030728852,0.0000824273,0.004036461,0.2725046,0.0033411537,0.0017963108,0.00901026,0.03950831,0.00010264321],"about_ca_topic_score_codex":0.001444954,"about_ca_topic_score_gemma":0.003191166,"teacher_disagreement_score":0.015681142,"about_ca_system_score_codex":0.0006660015,"about_ca_system_score_gemma":0.00036580808,"threshold_uncertainty_score":0.052458644},"labels":[],"label_agreement":null},{"id":"W7117958629","doi":"10.1145/3712285.3787186","title":"10.1145/3712285.3787186","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Component (thermodynamics); Key (lock); Representation (politics)","score_opus":0.00792250198283495,"score_gpt":0.21001345397978088,"score_spread":0.20209095199694593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117958629","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026164758,0.008193715,0.016731031,0.0020010713,0.002936652,0.0005715418,0.02424976,0.02483125,0.91786844],"genre_scores_gemma":[0.004816559,0.0032534883,0.0030763806,0.00097056635,0.0001979167,0.00027373704,0.0111144995,0.0029526886,0.973344],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915564,0.000062823565,0.00006896596,0.00024029509,0.00029699918,0.00017520161],"domain_scores_gemma":[0.9980964,0.00045661168,0.000097087795,0.0006685043,0.00040363264,0.00027779097],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002158687,0.004133915,0.003201949,0.0033306899,0.0026482064,0.00515023,0.0032999841,0.005741366,0.9434819],"category_scores_gemma":[0.0036800508,0.0021407655,0.0016580856,0.010776569,0.0018404768,0.009888937,0.006166566,0.003681425,0.96224517],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031039733,0.00022158654,0.00053902075,0.0006607944,0.000052636387,0.00019329149,0.000079687205,0.0009885064,0.0011821606,0.0075013107,0.67496616,0.31330445],"study_design_scores_gemma":[0.000063921405,0.00004434184,0.00090411684,0.00035030933,0.000059714635,0.00017043219,0.00007236387,0.0015350555,0.0007020503,0.0028106903,0.9932468,0.000040222785],"about_ca_topic_score_codex":0.021442648,"about_ca_topic_score_gemma":0.014519312,"teacher_disagreement_score":0.056518078,"about_ca_system_score_codex":0.0029848733,"about_ca_system_score_gemma":0.0012365587,"threshold_uncertainty_score":0.08061612},"labels":[],"label_agreement":null},{"id":"W7117989144","doi":"10.1145/3712285.3787160","title":"10.1145/3712285.3787160","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Session (web analytics); Matrix (chemical analysis); Matrix multiplication; Multiplication (music)","score_opus":0.00793204319213153,"score_gpt":0.21006109204174314,"score_spread":0.2021290488496116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117989144","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025798525,0.0076679676,0.01683568,0.0018747916,0.0026259883,0.00058258063,0.022658087,0.025945934,0.9192291],"genre_scores_gemma":[0.004976392,0.0032358197,0.0031260455,0.00097618054,0.00019276344,0.00029716257,0.010881594,0.0029579098,0.9733561],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9991492,0.000060665287,0.000067174944,0.00024654996,0.00029641972,0.000179964],"domain_scores_gemma":[0.99814665,0.0004364987,0.000094766314,0.0006583333,0.00037154742,0.00029218322],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002179264,0.0040586283,0.0031325207,0.0033339807,0.0026326969,0.0050488715,0.0034472912,0.005843616,0.94742286],"category_scores_gemma":[0.0036820022,0.0022087765,0.001614611,0.010505615,0.00178567,0.010220104,0.0066033015,0.0035841458,0.9650776],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030501306,0.00023920598,0.00052445027,0.0006697258,0.000052215135,0.0001957038,0.00008623906,0.0009942566,0.001131791,0.0081835985,0.6726435,0.3149743],"study_design_scores_gemma":[0.00006411879,0.00004569141,0.0008630924,0.00035819845,0.000058920574,0.00017000249,0.00007520513,0.0014388469,0.00068288116,0.0025873028,0.9936134,0.000042290303],"about_ca_topic_score_codex":0.020282421,"about_ca_topic_score_gemma":0.01340226,"teacher_disagreement_score":0.052577138,"about_ca_system_score_codex":0.0029764913,"about_ca_system_score_gemma":0.0012529221,"threshold_uncertainty_score":0.0749948},"labels":[],"label_agreement":null},{"id":"W7125635159","doi":"10.1109/cascon66301.2025.00066","title":"A Multi-Table Approach to Floating-Point Function Approximation","year":2025,"lang":"","type":"article","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"IBM (Canada); McMaster University","funders":"","keywords":"Function (biology); Function approximation; Approximation theory; Approximation algorithm; Term (time); Stability (learning theory)","score_opus":0.03342688432514955,"score_gpt":0.29553587074075166,"score_spread":0.2621089864156021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125635159","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001563567,0.00022814413,0.99419045,0.00011655352,0.00017305912,0.000023116927,0.000046639085,0.00032733506,0.0033311623],"genre_scores_gemma":[0.116954885,0.0008507299,0.8690631,0.0003044427,0.000379015,0.00019967098,0.00029569535,0.00062281964,0.011329665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988072,0.00023337542,0.00008062547,0.00011306024,0.0006731777,0.000092618895],"domain_scores_gemma":[0.9987509,0.00041484585,0.000059819955,0.0003733011,0.00034346222,0.000057614267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010192042,0.0007199997,0.0011849181,0.0014599833,0.0009859133,0.0024279936,0.0027673643,0.0010109219,0.016404025],"category_scores_gemma":[0.005956047,0.00057997863,0.0011560775,0.0018850015,0.0008431909,0.0024936658,0.0021479893,0.002216859,0.0054554134],"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.00029671175,0.0000971038,0.0004931827,0.00021502122,0.00006364671,0.00027958894,0.00016332607,0.18036027,0.007805398,0.50810516,0.012823211,0.28929734],"study_design_scores_gemma":[0.000029614908,0.00006527529,0.0000892896,0.00004521698,0.0000212524,0.00011924364,0.000027417955,0.8224192,0.003197352,0.15872853,0.015231846,0.00002563998],"about_ca_topic_score_codex":0.0014407288,"about_ca_topic_score_gemma":0.0016346889,"teacher_disagreement_score":0.016404025,"about_ca_system_score_codex":0.00058945623,"about_ca_system_score_gemma":0.00088207755,"threshold_uncertainty_score":0.054876983},"labels":[],"label_agreement":null},{"id":"W7132011429","doi":"","title":"Report on the Last Work by Dr. Erich Nuding","year":2016,"lang":"en","type":"article","venue":"Digital Repository (National Repository of Grey Literature)","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Work (physics); Facsimile; Quarter (Canadian coin); Mistake","score_opus":0.012281944063287234,"score_gpt":0.24928617091460992,"score_spread":0.2370042268513227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132011429","genre_codex":"other","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032483682,0.028173216,0.010933465,0.13968283,0.31992245,0.0004888843,0.009366635,0.001932691,0.48625147],"genre_scores_gemma":[0.0059892507,0.0076337173,0.0025763658,0.006611956,0.015642583,0.00012967267,0.0028162892,0.0008181914,0.95778185],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954782,0.00033339424,0.00016123167,0.00059367565,0.0031114253,0.00032209838],"domain_scores_gemma":[0.9859897,0.0012629906,0.0005832996,0.0011745559,0.008938141,0.0020512175],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0035441888,0.00062697165,0.0008523746,0.0023889928,0.0016247651,0.0038813464,0.0016504289,0.0016002785,0.32536948],"category_scores_gemma":[0.014157943,0.00032311102,0.0006709465,0.0018016401,0.000709576,0.002567354,0.002577912,0.0026005532,0.3168994],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026841839,0.000012720912,0.00007857854,0.00005170433,0.0000029650732,0.00004691714,0.000045627166,0.000027248734,0.0002876982,0.0009115779,0.9711701,0.027338061],"study_design_scores_gemma":[0.0000021974063,0.000013571263,0.00017067425,0.000031433512,0.0000019794704,0.000057971378,0.0000582917,0.0000151797985,0.00023192576,0.00018361612,0.99922955,0.0000036575218],"about_ca_topic_score_codex":0.0040139784,"about_ca_topic_score_gemma":0.0039734454,"teacher_disagreement_score":0.32536948,"about_ca_system_score_codex":0.0020872809,"about_ca_system_score_gemma":0.004078316,"threshold_uncertainty_score":0.96227854},"labels":[],"label_agreement":null},{"id":"W7140600106","doi":"10.1109/fpl68686.2025.00018","title":"FINN-GL: Generalized Mixed-Precision Extensions for FPGA-Accelerated LSTMS","year":2025,"lang":"","type":"article","venue":"","topic":"Numerical Methods and 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":"Advanced Micro Devices (Canada)","funders":"Advanced Micro Devices","keywords":"Feature (linguistics); Sequence (biology); Generalization; Matching (statistics)","score_opus":0.06500321655007829,"score_gpt":0.36771589737225935,"score_spread":0.30271268082218106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140600106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038674016,0.0010458186,0.85737014,0.0003399554,0.0003717567,0.00017517473,0.002074685,0.08432617,0.015622359],"genre_scores_gemma":[0.49930188,0.00058640697,0.47370327,0.0006388229,0.00008255775,0.00048584485,0.0049787983,0.006261943,0.013960506],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99971515,0.00003697118,0.000030787178,0.00008369915,0.000089917,0.000043590007],"domain_scores_gemma":[0.9996611,0.00011849776,0.000028983235,0.000098695404,0.00007787023,0.000014951054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004739641,0.0012664733,0.00034025006,0.0004898025,0.00021733566,0.00083170924,0.002402005,0.0006601479,0.014758703],"category_scores_gemma":[0.0019786062,0.0004932708,0.00071849866,0.00031232327,0.00043582934,0.0016803194,0.001015746,0.00122786,0.0036151884],"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.0012932797,0.0001967621,0.00393683,0.0012760013,0.00020317244,0.00091348856,0.000471289,0.3143594,0.053724866,0.043227326,0.054894496,0.52550304],"study_design_scores_gemma":[0.00013369421,0.00018925908,0.00047301888,0.00010465205,0.000043404892,0.00019272465,0.00004231774,0.9070184,0.043960236,0.01733162,0.03046791,0.00004267332],"about_ca_topic_score_codex":0.005508114,"about_ca_topic_score_gemma":0.010453937,"teacher_disagreement_score":0.014758703,"about_ca_system_score_codex":0.000905875,"about_ca_system_score_gemma":0.0010107664,"threshold_uncertainty_score":0.049372792},"labels":[],"label_agreement":null},{"id":"W903632109","doi":"10.1007/978-3-319-12481-0","title":"An Introduction to Modern Analysis","year":2015,"lang":"en","type":"book","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Mount Royal University","funders":"","keywords":"History","score_opus":0.02503700869168377,"score_gpt":0.3121167884643101,"score_spread":0.28707977977262633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W903632109","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007752948,0.08926853,0.27987653,0.0063662482,0.011269157,0.000097885815,0.00087287324,0.0024547116,0.60901874],"genre_scores_gemma":[0.010306754,0.055583555,0.08860993,0.0031309603,0.009811139,0.00025050106,0.0009614632,0.0022610198,0.82908463],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918646,0.00010349959,0.000037931128,0.00010135052,0.0005288229,0.00004198649],"domain_scores_gemma":[0.99919575,0.0003994412,0.000026477384,0.00011628537,0.00021928502,0.000042808628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006364232,0.0022672724,0.0018258117,0.0035390293,0.00094069284,0.002735923,0.001199913,0.001155718,0.07690103],"category_scores_gemma":[0.0023970671,0.00086916867,0.0011453633,0.003472571,0.0019703142,0.0034743254,0.0018163085,0.0038672558,0.06686482],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017152408,0.000035754212,0.0000948824,0.00036330853,0.000020727353,0.000043777567,0.000105184314,0.0025438215,0.00072456634,0.23702355,0.45576474,0.30326256],"study_design_scores_gemma":[0.000004643233,0.00001222868,0.0001504569,0.00020552667,0.000008426865,0.00010019761,0.000019885847,0.0025718082,0.00019415646,0.24148306,0.75523293,0.000016612903],"about_ca_topic_score_codex":0.0009702418,"about_ca_topic_score_gemma":0.0020146805,"teacher_disagreement_score":0.07690103,"about_ca_system_score_codex":0.0014318068,"about_ca_system_score_gemma":0.0014952403,"threshold_uncertainty_score":0.2572596},"labels":[],"label_agreement":null},{"id":"W941612151","doi":"10.34767/simis.2011.05.02","title":"Crowdsourcing in rescue fire service – proposed application","year":2023,"lang":"en","type":"article","venue":"Repository of Kazimierz Wielki University","topic":"Numerical Methods 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":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Crowdsourcing; Service (business); Computer security; Business; Computer science; World Wide Web; Marketing","score_opus":0.011762760897319362,"score_gpt":0.22808932360512563,"score_spread":0.21632656270780626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W941612151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10214798,0.00271857,0.7783934,0.0057903226,0.0008904795,0.0024596811,0.0005868391,0.0066574393,0.10035531],"genre_scores_gemma":[0.6337188,0.0029486737,0.30552977,0.00075340044,0.0002549839,0.0010113925,0.00060616137,0.00015133354,0.055025402],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993717,0.00017847234,0.000031928612,0.00009908683,0.00023502136,0.00008372819],"domain_scores_gemma":[0.9997807,0.000047841433,0.0000063683656,0.000029910378,0.00009284737,0.000042382733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059021206,0.00042364356,0.00042486272,0.00067442894,0.00094941974,0.0013338082,0.0011362111,0.0018947213,0.0050016437],"category_scores_gemma":[0.00075385807,0.00016202341,0.00048705164,0.0008270891,0.0004304896,0.0008911687,0.0013803822,0.0004964645,0.0018000355],"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.0008993545,0.0007197619,0.005739991,0.0017299617,0.00010399258,0.004700725,0.0029217098,0.055610176,0.082749985,0.07624313,0.0336255,0.7349558],"study_design_scores_gemma":[0.00020013576,0.0005063152,0.003750376,0.0003559099,0.000106734995,0.0023215457,0.0022953262,0.5787011,0.0590821,0.032002624,0.32052037,0.00015758545],"about_ca_topic_score_codex":0.0051771505,"about_ca_topic_score_gemma":0.0033107167,"teacher_disagreement_score":0.0051771505,"about_ca_system_score_codex":0.0006760484,"about_ca_system_score_gemma":0.0008977186,"threshold_uncertainty_score":0.016732156},"labels":[],"label_agreement":null},{"id":"W964710139","doi":"10.1007/1-84628-210-1_39","title":"Predicting Design Quality through Sensitivity Modeling","year":2006,"lang":"en","type":"book-chapter","venue":"Springer series in advanced manufacturing","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Trois-Rivières","funders":"","keywords":"Quality (philosophy); Sensitivity (control systems); Product (mathematics); Context (archaeology); Computer science; Probabilistic design; Product design; Reliability engineering; Domain (mathematical analysis); Engineering; Engineering design process; Mathematics; Mechanical engineering","score_opus":0.04668122705234959,"score_gpt":0.2925921926027523,"score_spread":0.24591096555040273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W964710139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06730335,0.00063884724,0.92261595,0.00019024778,0.00005383069,0.00004899751,0.0002829387,0.000706367,0.008159448],"genre_scores_gemma":[0.8931309,0.00062392006,0.101707675,0.0000537896,0.00002754458,0.000076138655,0.00027176843,0.00014746386,0.003960799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947625,0.00013429785,0.00002231824,0.000084223495,0.00025276584,0.000030223802],"domain_scores_gemma":[0.99816704,0.0013481551,0.00014686004,0.00017718891,0.00014209356,0.000018689063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010876097,0.0008671362,0.0007257316,0.0009992317,0.00020583326,0.0007994153,0.00066652824,0.0008352435,0.0026160458],"category_scores_gemma":[0.0045535713,0.0006756117,0.0009634102,0.0008883749,0.000435751,0.0011670564,0.00060058245,0.00070365286,0.00046006573],"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.000014665938,0.00001696719,0.00047350672,0.00002428876,0.000011786097,0.000009161776,0.000008125077,0.97761893,0.00222908,0.0017578991,0.00019908152,0.017636487],"study_design_scores_gemma":[7.946144e-7,0.000009653621,0.0001966427,0.0000029457021,0.0000030988472,0.0000061220576,0.0000013456472,0.9964514,0.0010097625,0.0021722608,0.00014236961,0.000003625159],"about_ca_topic_score_codex":0.0024133723,"about_ca_topic_score_gemma":0.002001357,"teacher_disagreement_score":0.0026160458,"about_ca_system_score_codex":0.0006708228,"about_ca_system_score_gemma":0.0003624893,"threshold_uncertainty_score":0.008751571},"labels":[],"label_agreement":null},{"id":"W968296380","doi":"10.1007/978-1-4614-8453-0_5","title":"Solving Ax = λx","year":2013,"lang":"en","type":"book-chapter","venue":"","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Factoring; Context (archaeology); Simple (philosophy); Algebra over a field; Applied mathematics; Lambda; Linear algebra; Pure mathematics; Geometry; Physics","score_opus":0.028221643925140736,"score_gpt":0.25425422480978666,"score_spread":0.22603258088464592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W968296380","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005849064,0.0008252667,0.8439425,0.00079085503,0.00049366447,0.00009544114,0.00033031753,0.00076856225,0.1469043],"genre_scores_gemma":[0.079030834,0.0028158275,0.52518743,0.0006999737,0.00035506632,0.0003729732,0.0008997827,0.0011440987,0.38949403],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99986804,0.00002137039,0.00000590108,0.000034593413,0.000059601978,0.000010438862],"domain_scores_gemma":[0.999933,0.000030062967,0.000006471311,0.000011135993,0.000015209068,0.000004106427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021731907,0.00075935316,0.0006319068,0.00028620855,0.00038115415,0.0007531303,0.00063266006,0.0006255291,0.025048666],"category_scores_gemma":[0.00047935778,0.0002480853,0.00045686582,0.00040104208,0.0005394596,0.00071887125,0.0010463693,0.0012170792,0.0093564605],"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.000040944597,0.00006550113,0.00035762493,0.00089390686,0.000051909145,0.00012198412,0.00029792773,0.08652566,0.013972018,0.3042001,0.07442389,0.5190485],"study_design_scores_gemma":[0.00007418711,0.00007991273,0.00054129463,0.00019624681,0.000051379728,0.0004231005,0.00029516744,0.27026394,0.016910203,0.38120073,0.32992265,0.000041141902],"about_ca_topic_score_codex":0.0016241914,"about_ca_topic_score_gemma":0.0023085657,"teacher_disagreement_score":0.025048666,"about_ca_system_score_codex":0.00023863156,"about_ca_system_score_gemma":0.00056857616,"threshold_uncertainty_score":0.08379614},"labels":[],"label_agreement":null}]}