{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":452,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":452,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12","author_layer_release":"2026-06-26"},"query_hash":"04a5b40e35b7","filters":{"topic":"Numerical Methods and Algorithms"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nicholas I. M. Gould","is_ca":false},{"name":"Dominique Orban","is_ca":true},{"name":"Philippe L. Toint","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01743859568940361,"gpt":0.2496138020627257,"spread":0.232175206373322,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004355189,0.002584367,0.001739783,0.001334438,0.001098017,0.003032502,0.005774531,0.002454899,0.03423986],"category_scores_gemma":[0.01553816,0.002101523,0.002711503,0.001096121,0.002189339,0.004063946,0.004935823,0.004187017,0.00722292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007586296,"about_ca_system_score_gemma":0.00261027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002012941,"about_ca_topic_score_gemma":0.003603959,"domain_scores_codex":[0.9968002,0.001010776,0.0002861044,0.000412321,0.001133058,0.0003575923],"domain_scores_gemma":[0.9927291,0.004715532,0.0003144475,0.001219191,0.0007301682,0.0002915094],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00254712,0.0006293716,0.0039699,0.001640475,0.0005153744,0.0008084035,0.0009418541,0.2660711,0.01414794,0.1850415,0.1102586,0.4134282],"study_design_scores_gemma":[0.0005495378,0.0001310979,0.0002747544,0.0001176549,0.000071662,0.0001628212,0.00006174093,0.8204925,0.009502192,0.1283058,0.0402349,0.00009529094],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003577441,0.0001679431,0.9442099,0.0001532943,0.0001279584,0.0001094329,0.0003777125,0.04653558,0.00474081],"genre_scores_gemma":[0.124701,0.0002494872,0.8358855,0.0004187741,0.00009489687,0.0009496587,0.00161979,0.02871213,0.007368668],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03423986,"threshold_uncertainty_score":0.1145437,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Antony Savich","is_ca":true},{"name":"Medhat Moussa","is_ca":true},{"name":"Shawki Areibi","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03579771266803138,"gpt":0.3682386425984279,"spread":0.3324409299303965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008282962,0.0005764018,0.0002884156,0.0005085359,0.0002822374,0.0007696149,0.001033318,0.0004555286,0.003657811],"category_scores_gemma":[0.007961618,0.0002596247,0.0002437036,0.0006704406,0.0002322331,0.001780199,0.0002454294,0.0004823092,0.0004211192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005184228,"about_ca_system_score_gemma":0.0003386895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001695485,"about_ca_topic_score_gemma":0.001878453,"domain_scores_codex":[0.9989611,0.0003537448,0.0000935738,0.00009934638,0.0003658632,0.0001263275],"domain_scores_gemma":[0.9939522,0.004163241,0.000543158,0.0004942167,0.0007885625,0.00005858733],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002605312,0.0004700448,0.01282696,0.00218399,0.0002565256,0.001640727,0.0003560008,0.3368564,0.1405161,0.009365857,0.002650711,0.4902714],"study_design_scores_gemma":[0.0002174622,0.005224555,0.009726258,0.0002923992,0.0004118547,0.001881303,0.0005188995,0.6188613,0.3465391,0.002158559,0.01409935,0.00006893369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8887139,0.002403941,0.09577942,0.0004072961,0.0001711248,0.0001458495,0.0001313683,0.0009542675,0.01129285],"genre_scores_gemma":[0.9555369,0.0007672006,0.04187674,0.00006603778,0.00003209416,0.00003694879,0.00009159017,0.00008812199,0.001504283],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003657811,"threshold_uncertainty_score":0.0122366,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Nedialko S. Nedialkov","is_ca":true},{"name":"Kenneth R. Jackson","is_ca":true},{"name":"John D. Pryce","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03066109418581418,"gpt":0.3572135145938523,"spread":0.3265524204080381,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00186451,0.0005299056,0.0007252041,0.0007274186,0.0006015647,0.0009241389,0.00148933,0.001110762,0.002400133],"category_scores_gemma":[0.005458275,0.0002791918,0.0006304113,0.0004104624,0.0012463,0.001085174,0.001213717,0.001467925,0.0003087985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004264119,"about_ca_system_score_gemma":0.0008832511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001374112,"about_ca_topic_score_gemma":0.0009644162,"domain_scores_codex":[0.9991873,0.0002680305,0.00003711384,0.00007522175,0.0003775581,0.00005475621],"domain_scores_gemma":[0.9977323,0.001259038,0.0001596249,0.0003622744,0.0003941947,0.00009260891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003085218,0.000155375,0.00159557,0.000388103,0.0000746643,0.0002479795,0.000284014,0.686672,0.03748213,0.1737099,0.001226782,0.09785501],"study_design_scores_gemma":[0.000007612843,0.00004918037,0.00009649935,0.000009422238,0.000006218763,0.00002081574,0.00000896075,0.9923366,0.002369498,0.004427173,0.0006599687,0.000008094145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01386938,0.00008717786,0.9831087,0.00003932811,0.0000525515,0.00003640733,0.00002012787,0.0001954444,0.002590775],"genre_scores_gemma":[0.4417913,0.0001704758,0.5557231,0.00007034423,0.00003981084,0.0001589358,0.00007341794,0.000113683,0.001859052],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002400133,"threshold_uncertainty_score":0.009860575,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"M.-A. Cantin","is_ca":true},{"name":"Yvon Savaria","is_ca":true},{"name":"P. Lavoie","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03247539181759063,"gpt":0.3406031529151868,"spread":0.3081277610975962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003986429,0.001085086,0.0008609692,0.002485662,0.0008090656,0.001493122,0.00226719,0.0009215601,0.005454361],"category_scores_gemma":[0.0279596,0.0005790879,0.0008269626,0.002108934,0.0005291021,0.002040663,0.001269648,0.0009149104,0.001569991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008239517,"about_ca_system_score_gemma":0.001950169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001610594,"about_ca_topic_score_gemma":0.001777967,"domain_scores_codex":[0.9936173,0.001695339,0.0009587407,0.0005555339,0.002895857,0.0002773356],"domain_scores_gemma":[0.9817967,0.009485975,0.001475758,0.002937378,0.004106069,0.0001980809],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00159308,0.0004865717,0.001741143,0.000690988,0.0001627922,0.0001204384,0.0004250216,0.1015773,0.04127717,0.01536035,0.003700585,0.8328646],"study_design_scores_gemma":[0.0004764933,0.002937387,0.005580616,0.0002475595,0.0002470338,0.0008403627,0.0005170138,0.6568495,0.2813388,0.01162882,0.0389614,0.0003749905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1213329,0.001823408,0.8535477,0.0002365116,0.0001748557,0.0006371859,0.0003801659,0.0119014,0.009965844],"genre_scores_gemma":[0.237063,0.0007892991,0.754831,0.0001524201,0.00004833452,0.0005549568,0.0008667922,0.002837523,0.002856653],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005454361,"threshold_uncertainty_score":0.02108252,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"D. Al-Khalili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04092386196837652,"gpt":0.2486332864599392,"spread":0.2077094244915627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002774645,0.0003376746,0.0002682676,0.0003596962,0.0002328373,0.0004258667,0.0006253434,0.0003104947,0.002014143],"category_scores_gemma":[0.000633756,0.0002289551,0.0002813712,0.0002235945,0.0003047917,0.000368214,0.0003449459,0.0005119562,0.0005977195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003089769,"about_ca_system_score_gemma":0.0003964646,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002636616,"about_ca_topic_score_gemma":0.0006294445,"domain_scores_codex":[0.9997752,0.00003862096,0.00001486359,0.00004433328,0.0001101317,0.00001681688],"domain_scores_gemma":[0.999805,0.00006506127,0.00002735252,0.00003734648,0.00005516062,0.00001006726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002010175,0.000112153,0.0007186267,0.0004267888,0.0000653307,0.0002396807,0.0002727416,0.07077939,0.3781514,0.05718388,0.001509404,0.4903396],"study_design_scores_gemma":[0.0001706722,0.001039766,0.0007196136,0.00007424746,0.0000903287,0.001215179,0.00006369361,0.6638696,0.2262384,0.01700461,0.08945618,0.00005773224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009167352,0.0002335595,0.986068,0.0000479907,0.00003686557,0.00005585993,0.00001476591,0.0003549805,0.004020688],"genre_scores_gemma":[0.1531316,0.00039103,0.8423643,0.00006981592,0.00006352558,0.0001323603,0.00005852284,0.0000334506,0.003755337],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002014143,"threshold_uncertainty_score":0.006737947,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","authors":[{"name":"Mark Giesbrecht","is_ca":true},{"name":"George Labahn","is_ca":true},{"name":"Wen-shin Lee","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03533795481161242,"gpt":0.3080761204314586,"spread":0.2727381656198462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006295788,0.0003862627,0.0005752249,0.0007481099,0.0004533694,0.0008657166,0.0005765337,0.0004559005,0.004700074],"category_scores_gemma":[0.004941972,0.0002176453,0.0003319033,0.001491156,0.0007727204,0.001228397,0.001151976,0.001147205,0.0007466399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004747092,"about_ca_system_score_gemma":0.0007631872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001684421,"about_ca_topic_score_gemma":0.003022009,"domain_scores_codex":[0.9996079,0.0001281863,0.00001398946,0.00003081383,0.0001817845,0.00003743863],"domain_scores_gemma":[0.9991086,0.0003505932,0.00008759146,0.0002297168,0.0001847753,0.00003875326],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003194375,0.00008359745,0.001087744,0.0001472435,0.00003876902,0.0001594476,0.0001910336,0.3013948,0.01114013,0.4534547,0.004342564,0.2276405],"study_design_scores_gemma":[0.00001269633,0.00002091759,0.0001292875,0.00001295327,0.000005121131,0.00004140178,0.00002192897,0.940142,0.00287312,0.05347977,0.003252178,0.000008629954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04199856,0.000203711,0.9469651,0.0003285935,0.0001627683,0.00002253714,0.00008276622,0.0004035849,0.009832407],"genre_scores_gemma":[0.6993988,0.0004272646,0.2904477,0.0001120044,0.0001598357,0.00004923301,0.0002549667,0.0002752775,0.008875026],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004700074,"threshold_uncertainty_score":0.01572329,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Dongdong Chen","is_ca":false},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01378502794709515,"gpt":0.24885029591215,"spread":0.2350652679650549,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428161,0.0008410689,0.0007773097,0.001036528,0.0006551772,0.001153234,0.001838607,0.0005193828,0.004635712],"category_scores_gemma":[0.0009717937,0.0004236036,0.0005417577,0.0009243649,0.0003036981,0.002081818,0.0009874188,0.0006924658,0.001904417],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005019782,"about_ca_system_score_gemma":0.0008038125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008179835,"about_ca_topic_score_gemma":0.00203368,"domain_scores_codex":[0.9993941,0.00005181707,0.00005129174,0.00009366866,0.0003372468,0.00007177182],"domain_scores_gemma":[0.9994869,0.00007566419,0.0000500576,0.0001040455,0.0002569323,0.00002643282],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.001399663,0.0002120013,0.001549341,0.0007105466,0.0001833169,0.0008094903,0.0001953113,0.02148014,0.2174437,0.03381619,0.01282718,0.7093731],"study_design_scores_gemma":[0.0001912857,0.001282829,0.001275324,0.0001314172,0.000259393,0.002195031,0.00009941124,0.4990501,0.3971296,0.01197084,0.08624139,0.0001734596],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0872734,0.002379604,0.8897644,0.0003465154,0.0004789977,0.0001925907,0.0003200309,0.006042463,0.01320197],"genre_scores_gemma":[0.5018618,0.0005552689,0.4885871,0.0002647853,0.0001897634,0.0001663971,0.0006145546,0.0001242202,0.007636085],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004635712,"threshold_uncertainty_score":0.01550806,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Allan Hungria","is_ca":false},{"name":"Jean‐Philippe Lessard","is_ca":true},{"name":"J. D. Mireles James","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1111380474367099,"gpt":0.3245036518008521,"spread":0.2133656043641421,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045259,0.001406259,0.0009386825,0.002220809,0.0007451543,0.002760064,0.001871018,0.001170592,0.006884423],"category_scores_gemma":[0.01811711,0.0005609232,0.001314182,0.00131159,0.002101623,0.005396673,0.002633751,0.003455914,0.0030906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001644688,"about_ca_system_score_gemma":0.001334658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002013138,"about_ca_topic_score_gemma":0.00120121,"domain_scores_codex":[0.9974456,0.001163221,0.0001283594,0.0001674899,0.0009704489,0.0001248366],"domain_scores_gemma":[0.9962866,0.00205483,0.0002917845,0.0005400331,0.0006853456,0.0001412605],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003248852,0.0000170061,0.000172013,0.0001696507,0.0000162191,0.0000586073,0.0001406849,0.04509944,0.001647329,0.9225361,0.004010288,0.02610005],"study_design_scores_gemma":[0.00001288157,0.00002101532,0.0001535754,0.00005788355,0.000008647135,0.00003539113,0.00004089703,0.546519,0.0009780675,0.4383769,0.01377395,0.00002173852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00484234,0.001550746,0.9760377,0.0008364869,0.0002535493,0.00003106659,0.00009383955,0.0004548553,0.0158994],"genre_scores_gemma":[0.2785482,0.005547861,0.6850449,0.0005145731,0.001073354,0.0004979101,0.0004581359,0.002875807,0.02543923],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006884423,"threshold_uncertainty_score":0.02393556,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Erich Kaltofen","is_ca":false},{"name":"John P. May","is_ca":true},{"name":"Zhengfeng Yang","is_ca":false},{"name":"Lihong Zhi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02778806671875694,"gpt":0.3559300464458081,"spread":0.3281419797270511,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007088789,0.000797678,0.001111371,0.0009529014,0.0004618002,0.001111585,0.0005749517,0.0005786992,0.003927341],"category_scores_gemma":[0.003474547,0.000336131,0.0006721801,0.001158572,0.0006313075,0.001463656,0.0007907411,0.001175506,0.001252333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003958883,"about_ca_system_score_gemma":0.00094893,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003233185,"about_ca_topic_score_gemma":0.004210585,"domain_scores_codex":[0.9994961,0.00012962,0.00002212872,0.00004204928,0.0002552448,0.00005478008],"domain_scores_gemma":[0.9991819,0.0003250298,0.00007105079,0.0001531948,0.0002174253,0.00005135799],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0004101601,0.0001834938,0.001065834,0.0003072704,0.0001327092,0.0002852579,0.0002163233,0.4889563,0.02139729,0.166067,0.005707168,0.3152711],"study_design_scores_gemma":[0.00001289334,0.00002528155,0.00008048707,0.000009826394,0.000008147058,0.00003216044,0.00002167206,0.975009,0.001693464,0.02173086,0.001368988,0.00000721583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01496545,0.0002229911,0.9828405,0.0001050019,0.00007462622,0.00001668675,0.00004475082,0.0002392283,0.00149063],"genre_scores_gemma":[0.3433236,0.0008032183,0.6496348,0.00007793959,0.0001526958,0.00007104159,0.0003189923,0.0001822277,0.005435506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003927341,"threshold_uncertainty_score":0.01313829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nacim Ramdani","is_ca":false},{"name":"Nedialko S. Nedialkov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03962665466784618,"gpt":0.3365361485269545,"spread":0.2969094938591084,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001887397,0.001546931,0.001540365,0.0021112,0.001080645,0.001793119,0.001970154,0.001604244,0.004861268],"category_scores_gemma":[0.009511312,0.001324477,0.001671084,0.00168142,0.001510647,0.002712477,0.002228031,0.00199386,0.0005297253],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001184604,"about_ca_system_score_gemma":0.001669485,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01177809,"about_ca_topic_score_gemma":0.01130272,"domain_scores_codex":[0.9992287,0.0001816234,0.00005156682,0.0001293664,0.0003406378,0.00006801434],"domain_scores_gemma":[0.9945845,0.004393117,0.0003049762,0.0002057804,0.0003962646,0.0001154786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004513195,0.00002980284,0.0001843876,0.00006730294,0.00002393689,0.00003466457,0.00003629893,0.9752901,0.0004474743,0.007411249,0.0001753482,0.01625424],"study_design_scores_gemma":[0.000005352244,0.00000835675,0.00003732367,0.000008196805,0.000005096409,0.000003381724,0.000006712776,0.9929044,0.0003658617,0.00656454,0.00008590288,0.000004963616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02055894,0.00009965597,0.9767163,0.00004574084,0.00001598422,0.00005099466,0.0001164574,0.0002768998,0.002119037],"genre_scores_gemma":[0.4504565,0.0002319951,0.5464557,0.00004272946,0.00002162576,0.0002844544,0.0004945839,0.0001842036,0.00182824],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01177809,"threshold_uncertainty_score":0.02341908,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Paul Beame","is_ca":true},{"name":"Stephen Cook","is_ca":true},{"name":"H. James Hoover","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02844324645905073,"gpt":0.2895281330211929,"spread":0.2610848865621422,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007008226,0.000791467,0.0004831904,0.000960686,0.0006868712,0.002261435,0.001101877,0.00118284,0.0156204],"category_scores_gemma":[0.006743597,0.0004697364,0.0006653167,0.001282344,0.001145567,0.005925387,0.001418314,0.001935753,0.0008694096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002076495,"about_ca_system_score_gemma":0.0009304393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001030608,"about_ca_topic_score_gemma":0.002555448,"domain_scores_codex":[0.9992041,0.0001851126,0.00003988912,0.0001404476,0.0002740103,0.0001565516],"domain_scores_gemma":[0.9968659,0.002392107,0.0002436499,0.0002420154,0.0001722283,0.00008407189],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004465295,0.0002699141,0.001625448,0.0006307245,0.00003001504,0.000139842,0.0001509997,0.08481585,0.008875127,0.6697091,0.01577488,0.2175315],"study_design_scores_gemma":[0.0001155218,0.00009315373,0.0004885847,0.00008513885,0.00003252028,0.0002582234,0.0001024906,0.1614863,0.007030881,0.8155679,0.01471255,0.00002675229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1396537,0.004139722,0.7667125,0.004644608,0.0002491738,0.0004113749,0.001485704,0.001798552,0.08090474],"genre_scores_gemma":[0.6258727,0.002559421,0.3509907,0.001223878,0.000252587,0.0004013838,0.001310119,0.0003589793,0.01703014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0156204,"threshold_uncertainty_score":0.05225545,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"D. Al-Khalili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02890678999333943,"gpt":0.2931598722116165,"spread":0.264253082218277,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004064076,0.00072537,0.0006391884,0.001172288,0.0003412541,0.001108753,0.0005974991,0.0006429379,0.006339982],"category_scores_gemma":[0.001649434,0.0004034242,0.0005683494,0.00143699,0.0005470359,0.001056321,0.0005602569,0.001112826,0.004476892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003512691,"about_ca_system_score_gemma":0.0003256,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002392654,"about_ca_topic_score_gemma":0.0003770345,"domain_scores_codex":[0.9993998,0.00009872439,0.00006239684,0.00009689673,0.0003259784,0.00001626359],"domain_scores_gemma":[0.999568,0.0002156075,0.00003738301,0.00006010402,0.0001086316,0.00001016924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000628701,0.00004734993,0.0001885146,0.001979767,0.00003881735,0.0001791225,0.0001362466,0.01018425,0.03218542,0.07427604,0.006309939,0.8744116],"study_design_scores_gemma":[0.00004797701,0.0003800206,0.0005694315,0.0009205027,0.00009513112,0.003248014,0.00008865217,0.05634205,0.04079265,0.06652379,0.8308999,0.00009183969],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001894786,0.06812494,0.9109499,0.0002903469,0.0006079607,0.00008972767,0.00006050626,0.0003862278,0.01759565],"genre_scores_gemma":[0.05500452,0.1304982,0.7946096,0.0004260264,0.001424824,0.0002971345,0.0002421148,0.000234858,0.01726271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006339982,"threshold_uncertainty_score":0.0212093,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Jiongrui He","is_ca":true},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02182961480889462,"gpt":0.3019435780608762,"spread":0.2801139632519816,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003048571,0.0005357154,0.0002374675,0.0005520062,0.0002563814,0.0005157359,0.001022494,0.0002714764,0.006975816],"category_scores_gemma":[0.0008578733,0.0001990049,0.0002665079,0.0003567599,0.0002329359,0.000800685,0.0003752616,0.0005212663,0.001157975],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000540473,"about_ca_system_score_gemma":0.0007981939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006971628,"about_ca_topic_score_gemma":0.001566857,"domain_scores_codex":[0.999803,0.00003241325,0.00002211844,0.00004634693,0.00007141494,0.00002470828],"domain_scores_gemma":[0.9996967,0.00007439408,0.00004372627,0.00005693438,0.0001157643,0.00001251585],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00103211,0.0001922375,0.002635057,0.0006812939,0.00008383519,0.0006527034,0.0002480669,0.07950766,0.212268,0.07367881,0.02020911,0.6088111],"study_design_scores_gemma":[0.0001566815,0.0010013,0.001055061,0.00008907144,0.0001111671,0.0009920977,0.00005956705,0.6216352,0.3067935,0.01889068,0.04915874,0.00005684546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06728645,0.0005826592,0.9144423,0.0002646573,0.0001839794,0.000212873,0.0004331137,0.006836828,0.009757218],"genre_scores_gemma":[0.6561708,0.0003515179,0.3302125,0.0002965804,0.00006668974,0.0002406871,0.0009356778,0.0002879938,0.01143751],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006975816,"threshold_uncertainty_score":0.02333647,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Nedialko S. Nedialkov","is_ca":true},{"name":"Владик Крейнович","is_ca":false},{"name":"Scott A. Starks","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03378618326497619,"gpt":0.3240845600247492,"spread":0.290298376759773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008940325,0.0008292024,0.001718766,0.001680703,0.0009675025,0.007472521,0.001663392,0.004901006,0.006976532],"category_scores_gemma":[0.03040897,0.0004975598,0.0009547431,0.002930274,0.009039964,0.01502238,0.001805628,0.009130882,0.00356544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001430048,"about_ca_system_score_gemma":0.002190781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002755739,"about_ca_topic_score_gemma":0.002404541,"domain_scores_codex":[0.9965618,0.001886022,0.0001759303,0.000354921,0.0008434209,0.0001778477],"domain_scores_gemma":[0.9883515,0.006202633,0.0007238947,0.000860171,0.003372273,0.0004895284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001187431,0.000113834,0.001123696,0.001913479,0.0001011374,0.00009464035,0.0006078758,0.001403917,0.0005109541,0.5363647,0.1206467,0.3370004],"study_design_scores_gemma":[0.00004024372,0.00005011327,0.0006760731,0.00161597,0.00005715784,0.0002235606,0.001261283,0.003841429,0.0003198563,0.8147137,0.1771217,0.00007880518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.003920448,0.4875515,0.1707617,0.2823468,0.02933202,0.00007488328,0.000189235,0.0006386232,0.02518474],"genre_scores_gemma":[0.1393329,0.5018734,0.1860257,0.0715104,0.07650543,0.0003761079,0.0002422735,0.0007028192,0.02343099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.008940325,"threshold_uncertainty_score":0.0472815,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Hao Zhang","is_ca":true},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03726954680774584,"gpt":0.2528530961319673,"spread":0.2155835493242215,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002023248,0.0005437054,0.0003212181,0.000674063,0.0004485308,0.0009737131,0.0009641783,0.000412519,0.01047645],"category_scores_gemma":[0.0004999953,0.0002685197,0.0002355552,0.0005025204,0.0002461,0.0008617891,0.0004557736,0.0003697745,0.003170516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006206817,"about_ca_system_score_gemma":0.0009680787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005232136,"about_ca_topic_score_gemma":0.001151957,"domain_scores_codex":[0.999805,0.00002597389,0.00002288928,0.00005185672,0.00006374886,0.00003052089],"domain_scores_gemma":[0.99981,0.00002300938,0.00002978589,0.00001958267,0.0001051292,0.00001251152],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008930903,0.0001382828,0.002157239,0.001182279,0.0001179386,0.0009785064,0.0003838392,0.03180846,0.2973558,0.08559039,0.04084073,0.5385534],"study_design_scores_gemma":[0.000327151,0.002424555,0.001912088,0.000292559,0.0002042977,0.003762545,0.0002655998,0.2991324,0.3518248,0.01941085,0.3202839,0.0001591585],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05201462,0.00233851,0.8856152,0.001026977,0.0008696365,0.0005706871,0.000508917,0.004347689,0.05270792],"genre_scores_gemma":[0.6163059,0.001447316,0.3401628,0.000798135,0.0002606547,0.000516189,0.0007325143,0.0001934448,0.03958295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01047645,"threshold_uncertainty_score":0.03504717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"David H. Bailey","is_ca":false},{"name":"Jonathan M. Borwein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02511251533703866,"gpt":0.3043765023234904,"spread":0.2792639869864517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01147058,0.0009790647,0.002500325,0.001508386,0.001033314,0.006411951,0.00415234,0.00386345,0.007072995],"category_scores_gemma":[0.02402678,0.0007670822,0.0006584445,0.003052338,0.004830943,0.01098974,0.003724395,0.005978284,0.003555818],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00130003,"about_ca_system_score_gemma":0.002484882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001044907,"about_ca_topic_score_gemma":0.001104843,"domain_scores_codex":[0.9960949,0.0008997262,0.0001856014,0.000377649,0.002247153,0.0001950288],"domain_scores_gemma":[0.9778021,0.01294603,0.000537548,0.002379193,0.005515348,0.0008198153],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005829232,0.0002653367,0.00216106,0.003009402,0.000133768,0.0001149556,0.0005749392,0.02235631,0.003404546,0.3746912,0.03888911,0.5538164],"study_design_scores_gemma":[0.000211821,0.0002488646,0.001271882,0.001222128,0.00009034826,0.0003300406,0.0007543749,0.1711278,0.00413753,0.6555912,0.1648704,0.0001435697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.03440129,0.5006759,0.3404361,0.06986557,0.005024377,0.00007901775,0.0003184751,0.002061132,0.04713817],"genre_scores_gemma":[0.3955154,0.3004449,0.2687475,0.005216229,0.01182184,0.000215939,0.0006679209,0.0008231589,0.01654717],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.01147058,"threshold_uncertainty_score":0.06066298,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Xiaojun Wang","is_ca":true},{"name":"Miriam Leeser","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01659433051528137,"gpt":0.2598416499404852,"spread":0.2432473194252038,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006651366,0.001647631,0.0006970187,0.00151782,0.0006949986,0.002474421,0.004273758,0.001027587,0.07944029],"category_scores_gemma":[0.002379728,0.0008516082,0.001327291,0.001327193,0.0005240673,0.002356376,0.001350748,0.001328333,0.03561187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001155834,"about_ca_system_score_gemma":0.001226124,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00269078,"about_ca_topic_score_gemma":0.003378229,"domain_scores_codex":[0.9992282,0.00005978248,0.00007410753,0.0001357418,0.0003560413,0.0001460572],"domain_scores_gemma":[0.9991056,0.0002079009,0.0000878611,0.0002341591,0.0003248015,0.00003955435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00159426,0.0001708599,0.002217589,0.001415827,0.0001399973,0.0004785163,0.0002625523,0.02615369,0.02804959,0.04136128,0.2834782,0.6146777],"study_design_scores_gemma":[0.0003275915,0.0003646046,0.001417782,0.0002858244,0.00008846595,0.001016368,0.00007334253,0.1100095,0.1211298,0.02401659,0.7410037,0.0002664461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007957839,0.0008748904,0.6971358,0.0001837023,0.0002554929,0.0002500431,0.007970869,0.2347594,0.05061198],"genre_scores_gemma":[0.184513,0.001757833,0.553584,0.001312189,0.0002303858,0.001513761,0.05691218,0.05771172,0.1424649],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.07944029,"threshold_uncertainty_score":0,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Kenneth R. Jackson","is_ca":true},{"name":"Nedialko S. Nedialkov","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06086522953131451,"gpt":0.3734721183587686,"spread":0.3126068888274541,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007715923,0.001748697,0.002166921,0.00213581,0.001092617,0.003080908,0.003832507,0.002409287,0.004921735],"category_scores_gemma":[0.02456212,0.001190736,0.002834114,0.002092756,0.00285666,0.003613171,0.004308622,0.004496971,0.001962099],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001359121,"about_ca_system_score_gemma":0.001757395,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003089721,"about_ca_topic_score_gemma":0.002291176,"domain_scores_codex":[0.9957567,0.001845866,0.0003891828,0.0004044754,0.001452307,0.0001513903],"domain_scores_gemma":[0.9877202,0.006221033,0.0006649106,0.001867456,0.003307126,0.0002192981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002017213,0.0001352794,0.001960378,0.003613893,0.0004760134,0.0002922732,0.0003646985,0.1382348,0.007915967,0.4317889,0.009147807,0.4058684],"study_design_scores_gemma":[0.00005852636,0.0002170844,0.001639043,0.001086182,0.0002450753,0.0003972769,0.0001083359,0.6421505,0.01236097,0.211463,0.1300158,0.0002582294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003537923,0.03383776,0.951005,0.00108029,0.001533325,0.00008258125,0.0001295054,0.0002825611,0.008511093],"genre_scores_gemma":[0.1494794,0.07984749,0.7406742,0.002020405,0.004111718,0.0005731129,0.0008895776,0.001604811,0.02079925],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007715923,"threshold_uncertainty_score":0.04080617,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jordan Ninin","is_ca":false},{"name":"Frédéric Messine","is_ca":false},{"name":"Pierre Hansen","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01547858183578562,"gpt":0.3128095133241821,"spread":0.2973309314883965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001620269,0.00131844,0.001250567,0.0009926845,0.0006606782,0.001205862,0.001645406,0.001709621,0.008823407],"category_scores_gemma":[0.005107614,0.0007904841,0.001157272,0.001061956,0.001099147,0.001542101,0.002122767,0.003766106,0.002710896],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005411113,"about_ca_system_score_gemma":0.001175034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002498543,"about_ca_topic_score_gemma":0.00313767,"domain_scores_codex":[0.9990816,0.0003203213,0.00003836811,0.0001156299,0.0003947131,0.00004933064],"domain_scores_gemma":[0.9987166,0.0005152898,0.00009436253,0.000264901,0.0003498805,0.00005896896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001910003,0.0000819739,0.0002602054,0.0004140666,0.0001171088,0.0001313066,0.0001692173,0.5386562,0.009509152,0.2134437,0.01416085,0.2228651],"study_design_scores_gemma":[0.00001441411,0.00003218682,0.00004853321,0.00002409969,0.00001536477,0.00002869232,0.00000976601,0.9711879,0.001341338,0.0201236,0.0071594,0.00001459678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0007413079,0.0001577831,0.9962749,0.00009149744,0.00008761384,0.00001703803,0.0000491024,0.0002105609,0.002370247],"genre_scores_gemma":[0.06753274,0.0005211533,0.919757,0.0002111517,0.0002294944,0.0002048752,0.0002798816,0.001037003,0.01022667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008823407,"threshold_uncertainty_score":0.02951717,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Curriculum; Pedagogy; Psychology","authors":[{"name":"Eric Eaton","is_ca":false},{"name":"Sven Koenig","is_ca":false},{"name":"Cláudia Schulz","is_ca":false},{"name":"Francesco Maurelli","is_ca":false},{"name":"John Lee","is_ca":false},{"name":"Joshua Eckroth","is_ca":false},{"name":"Mark Crowley","is_ca":true},{"name":"Richard G. Freedman","is_ca":false},{"name":"Rogelio E. Cardona-Rivera","is_ca":false},{"name":"Tiago Machado","is_ca":false},{"name":"Tom Williams","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02168010944389468,"gpt":0.3422874222797634,"spread":0.3206073128358687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.03198244,0.0007363029,0.0006053887,0.001710098,0.006895252,0.01380279,0.001242016,0.009806163,0.01831483],"category_scores_gemma":[0.02426438,0.0005195462,0.0006443826,0.001618352,0.006004369,0.01056012,0.01253692,0.02257569,0.004003216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008089489,"about_ca_system_score_gemma":0.01450787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002720288,"about_ca_topic_score_gemma":0.007922939,"domain_scores_codex":[0.9808498,0.007280347,0.0005287879,0.000811056,0.007353801,0.003176264],"domain_scores_gemma":[0.9701818,0.007315197,0.0007848985,0.0006876892,0.006077982,0.01495232],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"qualitative","study_design_scores_codex":[0.00007771247,0.0002636416,0.0009141928,0.0001271153,0.000007340003,0.0001549934,0.00712697,0.0001538127,0.0006284798,0.06255458,0.8945624,0.03342874],"study_design_scores_gemma":[0.00002005365,0.00005961474,0.0008865226,0.0002142733,0.000003964933,0.00004871389,0.006412218,0.0001778246,0.0002515578,0.006961147,0.9849445,0.0000195539],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"empirical","genre_scores_codex":[0.009448866,0.005538444,0.002346409,0.8973098,0.02408054,0.0000899914,0.0001527499,0.0001386042,0.06089452],"genre_scores_gemma":[0.1964054,0.0146877,0.01446494,0.4029241,0.01632637,0.000814671,0.0007076155,0.0007929806,0.3528763],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03198244,"threshold_uncertainty_score":0.1691413,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02156385517594522,"gpt":0.2647108640006778,"spread":0.2431470088247326,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001787711,0.0003908311,0.0002566553,0.0004684062,0.0002320976,0.0004425423,0.0004777309,0.0001715055,0.002318721],"category_scores_gemma":[0.00051773,0.0001847802,0.0002284823,0.0005403591,0.0001732908,0.0005780639,0.0002594923,0.0002210884,0.0006532307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466756,"about_ca_system_score_gemma":0.0003849642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004287184,"about_ca_topic_score_gemma":0.0009048812,"domain_scores_codex":[0.9998568,0.00002344931,0.00001214438,0.00002926167,0.00005990081,0.00001835407],"domain_scores_gemma":[0.9997727,0.00006178694,0.00003337917,0.00006421725,0.00006120236,0.000006618502],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007033073,0.0001623505,0.001922611,0.0004230005,0.00008479104,0.0007430704,0.0002272862,0.08093324,0.3668958,0.0417396,0.004624607,0.5015404],"study_design_scores_gemma":[0.0001311294,0.0006280869,0.001377943,0.00005099018,0.0001144656,0.001428983,0.00006492763,0.5444551,0.4140514,0.01179617,0.0258533,0.00004746956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3221468,0.0008357544,0.652557,0.0001942466,0.0001602691,0.00008974077,0.0002581971,0.00400514,0.01975293],"genre_scores_gemma":[0.6914211,0.0003441673,0.2994781,0.00006598277,0.00004177526,0.00006082474,0.000410727,0.00009777118,0.008079715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002318721,"threshold_uncertainty_score":0.007756829,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","authors":[{"name":"Linbin Chen","is_ca":false},{"name":"Jie Han","is_ca":true},{"name":"Weiqiang Liu","is_ca":false},{"name":"Fabrizio Lombardi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04612738478204215,"gpt":0.2917238515425709,"spread":0.2455964667605288,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003303369,0.0004427818,0.0003442509,0.0006051542,0.0004550875,0.0008344417,0.001025324,0.0004664488,0.003991414],"category_scores_gemma":[0.0008396611,0.0002146107,0.0002306151,0.0005661635,0.0004058863,0.0007327425,0.000487534,0.000469061,0.001201817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007469666,"about_ca_system_score_gemma":0.001116269,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001944286,"about_ca_topic_score_gemma":0.002379259,"domain_scores_codex":[0.9996836,0.00004019726,0.00002225205,0.00005388641,0.0001789424,0.0000210881],"domain_scores_gemma":[0.9996786,0.00003794178,0.00003230636,0.00007447792,0.0001625132,0.00001419878],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002594179,0.00004796781,0.001393834,0.0005301503,0.00005176896,0.0002912289,0.0002751534,0.1878358,0.07828776,0.1235314,0.009143026,0.5983525],"study_design_scores_gemma":[0.00006505354,0.0004149452,0.0004868951,0.00008674596,0.00004855642,0.0008117495,0.00007177077,0.8544999,0.05500809,0.00945047,0.07901534,0.00004047565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004672361,0.0003376026,0.9870771,0.0001149877,0.00007027776,0.0001257976,0.0000535888,0.0007959714,0.006752478],"genre_scores_gemma":[0.1458849,0.0004986613,0.8471768,0.0001192304,0.00004445139,0.0002273862,0.0002099398,0.00009137775,0.005747053],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003991414,"threshold_uncertainty_score":0.01335263,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Adam B. Kinsman","is_ca":true},{"name":"Nicola Nicolici","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03213031079417149,"gpt":0.2864878461000372,"spread":0.2543575353058657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002250965,0.0008228974,0.0007771912,0.001760823,0.0008200298,0.002452234,0.001714809,0.0006494673,0.003425858],"category_scores_gemma":[0.008606303,0.0004232523,0.0006190127,0.001498536,0.001529922,0.003424881,0.001566827,0.00138816,0.0008723065],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001207002,"about_ca_system_score_gemma":0.001212889,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004087353,"about_ca_topic_score_gemma":0.0006185153,"domain_scores_codex":[0.9981472,0.0007130558,0.0001214684,0.0002664908,0.00060522,0.0001465552],"domain_scores_gemma":[0.9973015,0.001581122,0.0002621612,0.0005692861,0.0002369366,0.00004896169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002600593,0.00008764868,0.0006568388,0.0002848697,0.00005212074,0.0000910951,0.0001978262,0.1589627,0.02123028,0.6417997,0.00153966,0.1748371],"study_design_scores_gemma":[0.00005451232,0.0001830726,0.0001772828,0.0001515487,0.00003639812,0.0001183062,0.00008121057,0.5812278,0.04293029,0.3655824,0.009405021,0.00005207757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01173149,0.0005149152,0.9809259,0.0001498546,0.00007079614,0.0000450688,0.00004483679,0.0004489932,0.006068216],"genre_scores_gemma":[0.4389658,0.0008193357,0.5575481,0.0001893965,0.00009732382,0.0002091811,0.0001700559,0.0001898383,0.001810922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003425858,"threshold_uncertainty_score":0.01190442,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Dongdong Chen","is_ca":true},{"name":"Mihai Sima","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03119825405793174,"gpt":0.2929314508790531,"spread":0.2617331968211213,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003876481,0.0006799326,0.0005326335,0.0004428627,0.0003199821,0.0005887535,0.0008668916,0.00029926,0.00618217],"category_scores_gemma":[0.000934739,0.0002507979,0.0004259453,0.000682743,0.0003231366,0.000517029,0.0003325009,0.0003704591,0.002354442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004440545,"about_ca_system_score_gemma":0.0009406951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002761554,"about_ca_topic_score_gemma":0.003397778,"domain_scores_codex":[0.9995877,0.0001027854,0.00003287023,0.0000701457,0.0001594509,0.00004706243],"domain_scores_gemma":[0.999653,0.00006029617,0.00003573541,0.00007699255,0.0001575298,0.00001646143],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009200138,0.0001013967,0.001066235,0.0005017663,0.00009815978,0.0004119464,0.0002653544,0.1170959,0.1158711,0.03995604,0.01029975,0.7134123],"study_design_scores_gemma":[0.0002914295,0.001211776,0.0009227949,0.0001033903,0.00009653185,0.0007580857,0.0001037051,0.7980335,0.1471785,0.006185655,0.04503514,0.00007948311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02645039,0.0002994453,0.9599314,0.00009384718,0.0001147756,0.0001052698,0.0001178937,0.004934535,0.007952491],"genre_scores_gemma":[0.171735,0.0002709173,0.822728,0.00007404978,0.00005561739,0.0001035112,0.0003335972,0.0001234782,0.004575837],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00618217,"threshold_uncertainty_score":0.02068138,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Multiplication (music); Constant (computer programming); Arithmetic; Mathematics; Computer science; Combinatorics; Programming language","authors":[{"name":"Jason Thong","is_ca":true},{"name":"Nicola Nicolici","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.1102515315918191,"gpt":0.2907375211890358,"spread":0.1804859895972167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00102231,0.0009251239,0.000818697,0.001436268,0.00100619,0.001878474,0.001898744,0.001282369,0.01160966],"category_scores_gemma":[0.006652712,0.0005406167,0.000659071,0.001800448,0.001448022,0.002580293,0.0017879,0.001895086,0.00297392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001015967,"about_ca_system_score_gemma":0.00275197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001652212,"about_ca_topic_score_gemma":0.002606241,"domain_scores_codex":[0.9983846,0.0002888191,0.0000787977,0.0002354538,0.0008312792,0.0001810594],"domain_scores_gemma":[0.9984806,0.000490269,0.0001082325,0.0005023235,0.0003708623,0.00004776865],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002159855,0.0001486656,0.0005690358,0.0003471365,0.00004704262,0.0001603872,0.0001447287,0.1701512,0.01097549,0.2672405,0.01309654,0.5369031],"study_design_scores_gemma":[0.00006801583,0.0001062619,0.0001190441,0.00005708144,0.00002316968,0.0003798871,0.00006061563,0.7962368,0.007517058,0.1741427,0.0212632,0.00002625594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004736237,0.000491019,0.9836749,0.0004569827,0.00007263089,0.00005645753,0.00003463309,0.0007409785,0.009736133],"genre_scores_gemma":[0.1378923,0.0005616655,0.85615,0.00026125,0.0001172785,0.0001238969,0.0000995575,0.0001587685,0.004635233],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01160966,"threshold_uncertainty_score":0.03883821,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Numerical digit; Arithmetic; Computer science; Parallel computing; Mathematics","authors":[{"name":"Jonathan M. Borwein","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05911578884719328,"gpt":0.3663316064438394,"spread":0.3072158175966462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006230361,0.0008660252,0.001109692,0.002224351,0.002460291,0.005095651,0.002547968,0.002806987,0.009688948],"category_scores_gemma":[0.09029746,0.0004562448,0.0005982601,0.005189014,0.003724946,0.008637357,0.003748653,0.005038843,0.002956285],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001726495,"about_ca_system_score_gemma":0.003255569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006629374,"about_ca_topic_score_gemma":0.006460165,"domain_scores_codex":[0.9939879,0.001504626,0.0001860619,0.0005146971,0.003521772,0.0002850163],"domain_scores_gemma":[0.9537357,0.03210641,0.001271217,0.004846442,0.006526043,0.001514191],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0005610114,0.0002479571,0.007480857,0.001092271,0.00008023378,0.0002981686,0.0007344474,0.03364748,0.001223481,0.4627696,0.2722165,0.2196479],"study_design_scores_gemma":[0.0001169073,0.0001846164,0.004180653,0.0004644341,0.00004518837,0.0008913291,0.0009714011,0.2774405,0.005050554,0.5360637,0.1745067,0.00008415691],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2197894,0.08072466,0.3107263,0.1180544,0.009522611,0.0002871715,0.004641235,0.004437011,0.2518173],"genre_scores_gemma":[0.7874518,0.02228019,0.1251334,0.007306725,0.005505856,0.0002770686,0.004943796,0.002366265,0.044735],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009688948,"threshold_uncertainty_score":0.03294969,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"Laurent Imbert","is_ca":true},{"name":"Andrew Zakaluzny","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0134883598488035,"gpt":0.2653398218585705,"spread":0.251851462009767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215687,0.0009019704,0.0005772865,0.0006396945,0.0008333057,0.00357994,0.001008203,0.0005612727,0.009063195],"category_scores_gemma":[0.007998832,0.0003665171,0.0005279832,0.0009265137,0.002100254,0.007505607,0.001548016,0.002155653,0.002953087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510868,"about_ca_system_score_gemma":0.001232193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000588802,"about_ca_topic_score_gemma":0.0008775916,"domain_scores_codex":[0.9974927,0.0003966716,0.0001376084,0.0006174626,0.001024629,0.0003309448],"domain_scores_gemma":[0.9922925,0.004151387,0.0007891122,0.001964658,0.0006654227,0.0001368701],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001016746,0.00009440682,0.001370746,0.0007029103,0.00004389679,0.0002749643,0.0006125828,0.01679021,0.04562606,0.7699018,0.006146227,0.1574194],"study_design_scores_gemma":[0.0001184549,0.0004625259,0.0008648708,0.0001992915,0.000143777,0.00139875,0.0002802856,0.1445792,0.1584013,0.5668255,0.1266474,0.00007876175],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.172139,0.00504914,0.6976891,0.003693258,0.0007010274,0.0001082929,0.0003332502,0.003385243,0.1169017],"genre_scores_gemma":[0.775824,0.00199253,0.1971566,0.0006490425,0.0003650151,0.000133302,0.0002651667,0.0005562754,0.02305809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009063195,"threshold_uncertainty_score":0.03031939,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Yu Pang","is_ca":true},{"name":"Kartazyna Radecka","is_ca":true},{"name":"Željko Žilić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02620939205898265,"gpt":0.2593621603881209,"spread":0.2331527683291383,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001352773,0.0008323456,0.0007849535,0.0005103085,0.0002480829,0.001427296,0.0009086386,0.000695902,0.001539936],"category_scores_gemma":[0.004323678,0.0004641415,0.0005703619,0.000900038,0.0009153272,0.001452716,0.0005244231,0.001032672,0.0002641759],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001083075,"about_ca_system_score_gemma":0.0006922062,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009292118,"about_ca_topic_score_gemma":0.001030478,"domain_scores_codex":[0.9990509,0.0002382124,0.00004811461,0.0001368656,0.0004406783,0.0000852244],"domain_scores_gemma":[0.9988689,0.0007271624,0.0001684746,0.0001117072,0.000110612,0.00001310489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004774833,0.000009710055,0.0001197423,0.00006725538,0.00001524798,0.0000431608,0.00004547234,0.9311335,0.004917512,0.03923915,0.0002221566,0.02413934],"study_design_scores_gemma":[0.00001044141,0.00004189825,0.00004274882,0.0000120835,0.00001135355,0.00002202614,0.00001325471,0.9781554,0.004179967,0.01669439,0.0008090001,0.000007535979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03112758,0.0002453009,0.9648744,0.00009670797,0.00001831117,0.00001824789,0.00003672659,0.0001777175,0.003404939],"genre_scores_gemma":[0.7163448,0.0004604646,0.2802679,0.00005525045,0.00002460186,0.00009972092,0.00007201944,0.000128239,0.002546966],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001539936,"threshold_uncertainty_score":0.007858276,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Yinan Li","is_ca":true},{"name":"Jun Liu","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03102403031255806,"gpt":0.2980702254994427,"spread":0.2670461951868847,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005958422,0.0005589342,0.0005150538,0.0004710693,0.0002363485,0.0006482231,0.0006919796,0.0003573704,0.002226717],"category_scores_gemma":[0.0008760426,0.0002364,0.0006622141,0.0003787861,0.0006297634,0.0006371381,0.0005289082,0.0008661288,0.0003302371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005117118,"about_ca_system_score_gemma":0.0003674972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001054015,"about_ca_topic_score_gemma":0.0006525786,"domain_scores_codex":[0.9997067,0.00007954484,0.00001712647,0.00005995879,0.0001135883,0.00002306995],"domain_scores_gemma":[0.9997311,0.0001652956,0.00002998561,0.00002491225,0.00004107918,0.000007490549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00011058,0.00004700678,0.0002844027,0.0002119591,0.0000600592,0.00007651318,0.0002376926,0.6118867,0.03209463,0.1982865,0.001076125,0.1556277],"study_design_scores_gemma":[0.00001130696,0.00006530558,0.00008384963,0.00001261099,0.0000133473,0.00001467241,0.00001240666,0.9686527,0.003213781,0.02584814,0.002060935,0.00001081392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001860484,0.00007327792,0.9969153,0.00001525111,0.00001000475,0.000008001447,0.000006699469,0.00005715795,0.001053823],"genre_scores_gemma":[0.606232,0.0007310346,0.3898505,0.00007429196,0.00009796928,0.0002239274,0.0001242616,0.0001285051,0.002537512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002226717,"threshold_uncertainty_score":0.00744909,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Ma Weiwei","is_ca":true},{"name":"Mary E. Kaye","is_ca":true},{"name":"Dennis Lüke","is_ca":true},{"name":"R. Doraiswami","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.009827068608507123,"gpt":0.3031902495135223,"spread":0.2933631809050152,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001694183,0.0005795741,0.0005581862,0.000779049,0.0003430064,0.0007199445,0.000740033,0.0003258223,0.01240771],"category_scores_gemma":[0.0005099628,0.0002200234,0.00022542,0.0007592367,0.0001617713,0.0004822895,0.0002617744,0.0004237248,0.00484207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003249881,"about_ca_system_score_gemma":0.0005986916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001137446,"about_ca_topic_score_gemma":0.001342523,"domain_scores_codex":[0.9997422,0.00002442149,0.00001821666,0.00005345684,0.0001245998,0.00003718396],"domain_scores_gemma":[0.9997531,0.000040456,0.00001271082,0.00003959901,0.0001361348,0.00001807104],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008415255,0.0001564846,0.001315921,0.0003397405,0.00007223521,0.0004710183,0.0001076724,0.02729304,0.1115714,0.01298568,0.03337893,0.8114664],"study_design_scores_gemma":[0.0004458781,0.00142056,0.003296863,0.00009256875,0.0001281997,0.001916781,0.0001037914,0.6536236,0.1879469,0.005737459,0.1451722,0.0001151776],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03302684,0.0005033127,0.9200631,0.0001864493,0.000357218,0.0003977464,0.000607907,0.01923221,0.02562512],"genre_scores_gemma":[0.3174153,0.0004779497,0.6603404,0.0002666781,0.0001454613,0.0003752123,0.001571764,0.0002986858,0.01910859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01240771,"threshold_uncertainty_score":0.04150796,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"O. Sarbishei","is_ca":true},{"name":"Katarzyna Radecka","is_ca":true},{"name":"Željko Žilić","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04693249531288891,"gpt":0.2710562831933339,"spread":0.224123787880445,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009332115,0.0008088725,0.0004256496,0.0004916169,0.0003461764,0.001102944,0.0006848541,0.0005216646,0.002024908],"category_scores_gemma":[0.003671377,0.0004158026,0.0002797108,0.0005816516,0.0006882994,0.001014308,0.0004975961,0.0006819629,0.0003764207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056405,"about_ca_system_score_gemma":0.0007297568,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001355279,"about_ca_topic_score_gemma":0.001663848,"domain_scores_codex":[0.9995512,0.0001070373,0.00002519872,0.00006011338,0.0001970305,0.00005940142],"domain_scores_gemma":[0.9989065,0.0007068693,0.0001744358,0.00007017334,0.0001234518,0.00001849423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003812675,0.000009164506,0.0001454246,0.00007170698,0.000007885274,0.00002568225,0.00005160536,0.9464005,0.006772474,0.022858,0.0002580438,0.02336138],"study_design_scores_gemma":[0.000005655299,0.00001935499,0.00003982681,0.00001387644,0.000003814005,0.00000923621,0.000009215611,0.9888179,0.003009824,0.007727088,0.0003396948,0.000004459291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02882388,0.000610024,0.9647309,0.0001611397,0.00002096449,0.00003343448,0.00005689507,0.0004186772,0.005144097],"genre_scores_gemma":[0.9023606,0.0006336834,0.09478163,0.00006314871,0.00001405778,0.0001139817,0.00007180165,0.0001556379,0.001805511],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002024908,"threshold_uncertainty_score":0.0076648,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Valérie Berthé","is_ca":false},{"name":"Laurent Imbert","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01472248605679282,"gpt":0.2526930377902383,"spread":0.2379705517334455,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001364828,0.0005366435,0.0006138731,0.00104102,0.0009763211,0.002583121,0.00125231,0.0006078951,0.007460664],"category_scores_gemma":[0.00645073,0.0003573212,0.0004142946,0.001405485,0.003027404,0.006264815,0.002207314,0.002605814,0.002412615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006972014,"about_ca_system_score_gemma":0.0005702084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003868341,"about_ca_topic_score_gemma":0.0002636942,"domain_scores_codex":[0.9988073,0.0002719618,0.0000717496,0.000219316,0.0005224623,0.0001071098],"domain_scores_gemma":[0.9982424,0.0009543238,0.0000912918,0.0004685036,0.0001901515,0.00005336382],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007927235,0.00002549904,0.000133618,0.0001180799,0.00000587416,0.00004088577,0.0001735061,0.005854745,0.00460319,0.9244046,0.00188358,0.06267717],"study_design_scores_gemma":[0.00003264872,0.0000861962,0.0001048484,0.00008940126,0.000008881705,0.0001742635,0.0001439267,0.03270658,0.01498797,0.91167,0.039965,0.00003039614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02943484,0.001265352,0.9267641,0.0009760598,0.0006771248,0.00007641111,0.00009370991,0.0007913968,0.03992109],"genre_scores_gemma":[0.3408265,0.003007259,0.6361385,0.001061115,0.0004728964,0.0002245351,0.0003465269,0.0004586488,0.01746404],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007460664,"threshold_uncertainty_score":0.02495837,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Eric Matthews","is_ca":true},{"name":"Alec Lu","is_ca":true},{"name":"Zhenman Fang","is_ca":true},{"name":"Lesley Shannon","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06230162562591059,"gpt":0.3037506070495505,"spread":0.2414489814236399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003545533,0.0005075234,0.0002122283,0.0005496814,0.0001891928,0.0007715755,0.0009018471,0.0002328018,0.002103653],"category_scores_gemma":[0.0008535469,0.0002539389,0.00022805,0.0003689625,0.000253342,0.0009567687,0.0003485303,0.0005576477,0.0005093242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005152404,"about_ca_system_score_gemma":0.0006232942,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000867998,"about_ca_topic_score_gemma":0.002082384,"domain_scores_codex":[0.9996663,0.00005014237,0.00003357492,0.00005026033,0.0001413246,0.00005836163],"domain_scores_gemma":[0.9996599,0.0001130106,0.00006287194,0.00006276698,0.00008385384,0.00001748947],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008260382,0.0001521056,0.004894099,0.0006669761,0.00009239071,0.0005410367,0.0003386216,0.07991241,0.3754931,0.02228447,0.003973226,0.5108255],"study_design_scores_gemma":[0.0002872355,0.002558195,0.004368335,0.0002145797,0.0001963721,0.001159821,0.0002443823,0.4191675,0.4824912,0.009922135,0.07928271,0.0001074921],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3664805,0.003854504,0.6078248,0.0004586776,0.0002186741,0.0002253258,0.0001615569,0.004967956,0.015808],"genre_scores_gemma":[0.7173549,0.0008387075,0.2745581,0.0002745732,0.00004426133,0.00006822979,0.0001977739,0.0003364596,0.006326921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002103653,"threshold_uncertainty_score":0.007037461,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jason Thong","is_ca":true},{"name":"Nicola Nicolici","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01695558374234841,"gpt":0.2549822595759776,"spread":0.2380266758336292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003428221,0.0006130002,0.000717647,0.0008788535,0.0005005088,0.0008520343,0.001199451,0.0004687488,0.005225482],"category_scores_gemma":[0.001764208,0.0003285874,0.0004578193,0.001891224,0.0004282139,0.001281059,0.0006998439,0.0004004927,0.001260704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004166833,"about_ca_system_score_gemma":0.001088123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001552035,"about_ca_topic_score_gemma":0.00250929,"domain_scores_codex":[0.9995609,0.00006383433,0.00003331,0.00009439647,0.0001710992,0.00007636254],"domain_scores_gemma":[0.9992651,0.0003238674,0.00008008518,0.000163681,0.0001318373,0.00003543882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006064627,0.0001060778,0.001033544,0.0002877254,0.0000478111,0.0002944533,0.000127054,0.1043881,0.04184648,0.02916795,0.006340611,0.8157538],"study_design_scores_gemma":[0.0002074265,0.0003334625,0.0005494303,0.0000328759,0.00003932183,0.0006308357,0.00006610689,0.8969607,0.06377476,0.02807146,0.00929404,0.00003963639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07393396,0.0003719956,0.9164175,0.0001638737,0.00008080524,0.00008559057,0.00009543684,0.002169943,0.006680801],"genre_scores_gemma":[0.2928256,0.0001670158,0.7026948,0.00006406143,0.00002868279,0.00008117624,0.00020726,0.0001162854,0.00381506],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005225482,"threshold_uncertainty_score":0.01748097,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Ladislav Zjavka","is_ca":false},{"name":"Witold Pedrycz","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05939473861804295,"gpt":0.302278272939761,"spread":0.2428835343217181,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008608712,0.0006958999,0.001199472,0.001087614,0.0006573375,0.0009862201,0.001251116,0.001434074,0.002874295],"category_scores_gemma":[0.004681898,0.0007015303,0.001088602,0.001147111,0.001618764,0.001635365,0.001933909,0.00159565,0.0004705601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009664402,"about_ca_system_score_gemma":0.001372385,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00563754,"about_ca_topic_score_gemma":0.008765182,"domain_scores_codex":[0.9996881,0.0001072117,0.00001756917,0.00005396812,0.00009869817,0.00003454206],"domain_scores_gemma":[0.9990979,0.0005630209,0.00009603236,0.00006864943,0.000120672,0.00005371886],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003967626,0.00005269893,0.0004744202,0.0001524835,0.00003782291,0.00007396811,0.00008248993,0.7878944,0.001728167,0.1763982,0.000975686,0.03209004],"study_design_scores_gemma":[0.000008078962,0.000006043741,0.00004085344,0.00000532606,0.000004049481,0.000007785654,0.000008614958,0.9549347,0.0002042317,0.04423832,0.0005364542,0.000005526439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873688,0.0002598202,0.9760867,0.0002352477,0.00009232469,0.00003916199,0.00005491921,0.000124675,0.004370232],"genre_scores_gemma":[0.4257453,0.001059759,0.5587,0.0002169842,0.0001771982,0.0002257167,0.0002421526,0.000231687,0.01340118],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00563754,"threshold_uncertainty_score":0.01120943,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Iain Macdonald","is_ca":true},{"name":"J.A. Clarke","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02431116221979534,"gpt":0.2816772244617821,"spread":0.2573660622419867,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194878,0.0007593025,0.001116629,0.00115904,0.0008149597,0.001768378,0.001234308,0.001189159,0.002328836],"category_scores_gemma":[0.01102377,0.0005577139,0.001065673,0.001128109,0.002048312,0.002977936,0.002477927,0.002849139,0.0002083649],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001191598,"about_ca_system_score_gemma":0.0008418125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006006598,"about_ca_topic_score_gemma":0.003788836,"domain_scores_codex":[0.9990213,0.0004426545,0.00004525801,0.00007274398,0.0003615676,0.00005651558],"domain_scores_gemma":[0.9971584,0.002084319,0.0001710247,0.0001527455,0.0003713045,0.00006211936],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001518267,0.00001478626,0.0002161576,0.00008454444,0.0000273822,0.00007099829,0.0001116538,0.198975,0.0004430691,0.7861615,0.001022219,0.01285747],"study_design_scores_gemma":[0.00000360746,0.000005945694,0.00008783561,0.00002264487,0.000007693699,0.00001471639,0.00002356799,0.4764885,0.0002243453,0.5204312,0.00267887,0.00001111457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008726691,0.001483254,0.9748657,0.001459808,0.0003325783,0.00002002904,0.00004931688,0.00003825763,0.01302451],"genre_scores_gemma":[0.7479958,0.00513702,0.2259992,0.00099006,0.001335075,0.0002275818,0.000147021,0.0003081569,0.0178601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006006598,"threshold_uncertainty_score":0.01194328,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Amir Kaivani","is_ca":true},{"name":"Seok‐Bum Ko","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03015383399844895,"gpt":0.2853131006588002,"spread":0.2551592666603513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001149724,0.0004084455,0.0002727801,0.000606649,0.0003267487,0.0005666551,0.0008130749,0.0003843796,0.003431306],"category_scores_gemma":[0.0002769249,0.0001538869,0.0002819061,0.0007166007,0.0002397344,0.0007160068,0.0002283322,0.0003902912,0.001099551],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004074492,"about_ca_system_score_gemma":0.0005336247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145705,"about_ca_topic_score_gemma":0.001909909,"domain_scores_codex":[0.9998739,0.00001110698,0.00001135216,0.00002757617,0.00005716396,0.00001889079],"domain_scores_gemma":[0.9998868,0.00001995509,0.00001311566,0.00001926651,0.00005327944,0.000007624918],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000398591,0.00008127204,0.0009309106,0.0005016056,0.00006824513,0.0007759963,0.0001550297,0.01969419,0.3746036,0.05631969,0.008915082,0.5375558],"study_design_scores_gemma":[0.0001551158,0.001783604,0.002791556,0.000172317,0.0002142422,0.003636286,0.0001217672,0.3527919,0.4502808,0.01619239,0.1717185,0.0001416219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1119622,0.003896465,0.8416751,0.0003982612,0.0005583412,0.000197408,0.0003641295,0.004535575,0.0364126],"genre_scores_gemma":[0.5615161,0.002010373,0.419692,0.0003451423,0.0002071207,0.0001112563,0.000683728,0.00009429522,0.01533999],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003431306,"threshold_uncertainty_score":0.0114789,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Richard P. Brent","is_ca":false},{"name":"Colin Percival","is_ca":true},{"name":"Paul Zimmermann","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.06061191258833785,"gpt":0.3590213579512863,"spread":0.2984094453629484,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006693456,0.002194585,0.001454411,0.002794332,0.001331641,0.004502727,0.002403378,0.001466539,0.0139393],"category_scores_gemma":[0.04128893,0.0006229791,0.001288542,0.002065411,0.004583294,0.006924685,0.005656742,0.004534956,0.004919813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003207754,"about_ca_system_score_gemma":0.002124748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002777587,"about_ca_topic_score_gemma":0.001980687,"domain_scores_codex":[0.9922338,0.001106155,0.0004193404,0.001134657,0.004240069,0.0008659666],"domain_scores_gemma":[0.9721868,0.01715198,0.001304136,0.00412823,0.004564511,0.0006643601],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009980913,0.00006972948,0.00222209,0.0005164662,0.0001049694,0.0004220027,0.0004661289,0.106175,0.004658584,0.7924222,0.01413657,0.07780816],"study_design_scores_gemma":[0.00004009782,0.00008289965,0.0006540829,0.0002930505,0.00004943625,0.0002386714,0.0001027255,0.4570923,0.008017148,0.5197058,0.01366018,0.00006362541],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04334421,0.005175562,0.845475,0.003488718,0.001536126,0.00006958407,0.0007059704,0.002015573,0.09818941],"genre_scores_gemma":[0.7790099,0.003674528,0.1616793,0.001220423,0.001473322,0.000335085,0.001420378,0.00230654,0.04888058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0139393,"threshold_uncertainty_score":0.04663157,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Jean-François Landry","is_ca":true},{"name":"Jean‐Pierre Dussault","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02885852018583881,"gpt":0.3082347174655897,"spread":0.2793761972797509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007073541,0.0007054046,0.001144671,0.0006578235,0.001048369,0.002091752,0.001543209,0.002097998,0.01219151],"category_scores_gemma":[0.002475337,0.0005657972,0.0006278409,0.0005608251,0.001656881,0.001390541,0.001859689,0.001397541,0.0009057312],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588123,"about_ca_system_score_gemma":0.001216203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007290157,"about_ca_topic_score_gemma":0.00408707,"domain_scores_codex":[0.9996637,0.0001129414,0.00001390717,0.0000585832,0.00007503732,0.00007573836],"domain_scores_gemma":[0.9994308,0.000282756,0.00003801817,0.00003642824,0.00008953422,0.000122422],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003619713,0.0000955216,0.0006166041,0.00008884948,0.00005236339,0.0002041071,0.000120668,0.7728851,0.002364477,0.2038306,0.005152916,0.01422674],"study_design_scores_gemma":[0.00001980935,0.0000329011,0.00006789697,0.000006602812,0.000005868845,0.00001800474,0.00003093792,0.981169,0.0001889453,0.01749214,0.0009616931,0.000006258277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1536383,0.000688697,0.6931313,0.003286623,0.0005587631,0.000195708,0.000280729,0.0002844196,0.1479354],"genre_scores_gemma":[0.8629619,0.0002767541,0.05733754,0.0002384028,0.00009537024,0.0001093365,0.0001279256,0.0001116858,0.078741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01219151,"threshold_uncertainty_score":0.04078466,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"CancerCare Manitoba","funders":"","keywords":"Medicine; Lymphoma; Internal medicine; Oncology; Intensive care medicine; Dermatology; Family medicine","authors":[{"name":"Erin Elizabeth Elphee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.08595756026008981,"gpt":0.3553679361017726,"spread":0.2694103758416828,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005632583,0.0006607852,0.002021734,0.003623116,0.0005224855,0.002918492,0.001525607,0.002291916,0.001970996],"category_scores_gemma":[0.02969772,0.0004060227,0.001214276,0.004459021,0.002253829,0.004352095,0.001484107,0.002297888,0.0002888751],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002241466,"about_ca_system_score_gemma":0.006224633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003907219,"about_ca_topic_score_gemma":0.004810684,"domain_scores_codex":[0.9962811,0.002319003,0.0004530109,0.0001619882,0.000709536,0.00007543696],"domain_scores_gemma":[0.9728732,0.02359235,0.001885152,0.0001736144,0.001316825,0.00015882],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"qualitative","study_design_scores_codex":[0.0001015932,0.00004130646,0.001903535,0.10038,0.0005179195,0.0004619317,0.002266202,0.001128951,0.0001530989,0.01513128,0.01635646,0.8615578],"study_design_scores_gemma":[0.0001411234,0.0003329286,0.009626067,0.4075926,0.001735491,0.008814275,0.007610698,0.001141568,0.0004991289,0.05610064,0.506248,0.0001576226],"study_design_candidate":"qualitative","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002462336,0.9972505,0.0003575101,0.001464131,0.0001323379,0.000008765952,0.000006825772,0.000002047718,0.0005315724],"genre_scores_gemma":[0.006205741,0.9921416,0.0006977116,0.0006081021,0.000203509,0.00003436717,0.00001485833,0.000001433915,0.00009261596],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.005632583,"threshold_uncertainty_score":0.02978826,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Sofiène Tahar","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02977798201588066,"gpt":0.2621392654441915,"spread":0.2323612834283108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004908614,0.0003747465,0.0002890189,0.0003546645,0.0003091956,0.0009140731,0.0007856738,0.0004148967,0.003633702],"category_scores_gemma":[0.0006785619,0.0001968418,0.0003822826,0.0002998229,0.0002090491,0.0005683905,0.0002157525,0.0003795396,0.001690094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007845766,"about_ca_system_score_gemma":0.0008231335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001309576,"about_ca_topic_score_gemma":0.0009055053,"domain_scores_codex":[0.9997086,0.00003678188,0.00002142452,0.00004915369,0.0001398905,0.00004408815],"domain_scores_gemma":[0.9997947,0.00004105183,0.00001850667,0.00002559822,0.0001085485,0.00001163801],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005690921,0.0002067265,0.001313004,0.000780304,0.0001444897,0.0004672715,0.0003558454,0.1766215,0.368161,0.1884859,0.007628664,0.2552662],"study_design_scores_gemma":[0.0001928281,0.0009135407,0.0007789687,0.00009198706,0.0001451393,0.0005716696,0.00005590333,0.5015718,0.3705555,0.009819556,0.1152281,0.00007497326],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03741193,0.0002830318,0.9430102,0.0002109996,0.0001587432,0.0001646103,0.0002265317,0.00217161,0.01636242],"genre_scores_gemma":[0.5843029,0.0004504379,0.3986821,0.0001834153,0.00005723722,0.0002518469,0.0003910027,0.0002296567,0.01545139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003633702,"threshold_uncertainty_score":0.01215595,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","authors":[{"name":"Andrew Boutros","is_ca":true},{"name":"Brett Grady","is_ca":true},{"name":"Mustafa Abbas","is_ca":true},{"name":"Paul Chow","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.07441522438581342,"gpt":0.3109154474418738,"spread":0.2365002230560604,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006059411,0.0006939195,0.0003571905,0.000545403,0.0002934559,0.00103399,0.001069982,0.0004971464,0.00738455],"category_scores_gemma":[0.001406601,0.0003825671,0.0003388226,0.0003150591,0.000407216,0.0009675169,0.0005497372,0.0005250167,0.001546451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005999861,"about_ca_system_score_gemma":0.0009460719,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002654247,"about_ca_topic_score_gemma":0.003192708,"domain_scores_codex":[0.9994761,0.0001040592,0.0000337095,0.00007992948,0.0002377163,0.00006848516],"domain_scores_gemma":[0.9993261,0.0002585009,0.00007520975,0.0001821077,0.0001261603,0.00003197106],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0008010929,0.0003076051,0.005515632,0.000532847,0.0001772932,0.0006825045,0.0003071865,0.396232,0.1203393,0.02456462,0.01419807,0.4363418],"study_design_scores_gemma":[0.0001721231,0.0002412226,0.0008071141,0.00004125545,0.00004022152,0.0002106848,0.00003838747,0.9050068,0.0741882,0.006411096,0.01280824,0.00003474839],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06684753,0.0003384153,0.8872932,0.0001558582,0.0001194673,0.0001787833,0.0002761471,0.02978806,0.01500258],"genre_scores_gemma":[0.5491294,0.0001447757,0.4449496,0.0001321346,0.00002218615,0.0001230844,0.0003660217,0.001061117,0.004071726],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00738455,"threshold_uncertainty_score":0.02470374,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"D. Al-Khalili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01049538702158869,"gpt":0.2295416421321713,"spread":0.2190462551105826,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001680942,0.0003082693,0.0003303105,0.0003312805,0.0002020919,0.0004272755,0.00049952,0.0003051382,0.003474418],"category_scores_gemma":[0.0003766987,0.0001585181,0.0001647832,0.0002276868,0.0001366078,0.0003342897,0.0002485719,0.0003754973,0.001143431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003231147,"about_ca_system_score_gemma":0.0004061293,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005974012,"about_ca_topic_score_gemma":0.00113639,"domain_scores_codex":[0.9997178,0.0000284795,0.00001890294,0.00005191217,0.0001500222,0.00003283678],"domain_scores_gemma":[0.999831,0.00003588495,0.00002296952,0.00003012234,0.00006598855,0.00001401348],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000415711,0.000155118,0.0009398137,0.0002624389,0.00003876493,0.000257694,0.0000895425,0.01764902,0.5567011,0.01159492,0.004634629,0.4072613],"study_design_scores_gemma":[0.0004977467,0.001533292,0.003457577,0.00004595487,0.0001190834,0.00235382,0.00004653485,0.2579103,0.6395152,0.003171297,0.0912648,0.00008440464],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09139887,0.0006268272,0.8794419,0.0002592773,0.0002046979,0.0001907731,0.0002612846,0.008086718,0.01952977],"genre_scores_gemma":[0.4916511,0.0002439503,0.4987133,0.0001216624,0.0000863934,0.0001194949,0.0003744957,0.0001431521,0.008546428],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003474418,"threshold_uncertainty_score":0.01162308,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Interval (graph theory); Computer science; Interval arithmetic; Symbolic data analysis; Theoretical computer science; Mathematics","authors":[{"name":"Nedialko S. Nedialkov","is_ca":true},{"name":"Martin v. Mohrenschildt","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01652825348506537,"gpt":0.333272565424711,"spread":0.3167443119396456,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001384241,0.0005607629,0.0007856794,0.0005873596,0.0003780936,0.001191064,0.001081293,0.0009277256,0.002219073],"category_scores_gemma":[0.005263982,0.0003692583,0.0006540222,0.0005439016,0.001654663,0.001302019,0.001878695,0.001237152,0.0002523513],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007665032,"about_ca_system_score_gemma":0.0009204697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002075341,"about_ca_topic_score_gemma":0.001228745,"domain_scores_codex":[0.9986915,0.0004891899,0.00007809539,0.00005672004,0.0006081315,0.00007640644],"domain_scores_gemma":[0.9972627,0.001822887,0.0002356655,0.00032145,0.0002752304,0.00008209112],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003897023,0.00002273386,0.0002760757,0.00004299581,0.00001643996,0.00005330994,0.00008344046,0.9093174,0.002606574,0.07799321,0.0002451306,0.009303708],"study_design_scores_gemma":[0.000009208808,0.000009773136,0.00002618147,0.000004792965,0.000001833892,0.0000064121,0.000005636242,0.9863274,0.0006415055,0.01248009,0.0004826877,0.000004504266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01795401,0.000137893,0.9778061,0.00009602798,0.00003443398,0.0000287623,0.00003571755,0.000342734,0.003564366],"genre_scores_gemma":[0.7239988,0.0003814436,0.2725846,0.00005786649,0.00004335249,0.0002534599,0.0001355044,0.0001618952,0.002383115],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002219073,"threshold_uncertainty_score":0.00742358,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Charles Audet","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Frédéric Messine","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.006864764530871105,"gpt":0.2185066202856297,"spread":0.2116418557547586,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001340514,0.0003236388,0.0006926219,0.0008907732,0.001103133,0.001904616,0.0006523815,0.001061093,0.009088211],"category_scores_gemma":[0.001675565,0.0003857408,0.0003531324,0.0008312339,0.001458488,0.001414294,0.001216187,0.001212948,0.001277727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003091228,"about_ca_system_score_gemma":0.0003773576,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007518654,"about_ca_topic_score_gemma":0.0007589922,"domain_scores_codex":[0.9997925,0.00004422594,0.000009994409,0.00005047689,0.00006244802,0.00004033721],"domain_scores_gemma":[0.9995228,0.0001729331,0.00006752783,0.00006589917,0.00005395888,0.0001168739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000664297,0.0000882719,0.00188202,0.0002397461,0.00002479863,0.0007850814,0.0003378516,0.01129622,0.01045442,0.8838125,0.01609049,0.07432431],"study_design_scores_gemma":[0.0001271719,0.0001110892,0.001140337,0.00004267655,0.00002261885,0.0008767702,0.0004130407,0.04178375,0.002872336,0.930385,0.02218951,0.00003562693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6983632,0.00154811,0.138819,0.00244487,0.000796405,0.0001211083,0.0008309378,0.000589462,0.156487],"genre_scores_gemma":[0.9365325,0.0005512816,0.0403595,0.0003284358,0.0002196503,0.00005847951,0.0004133108,0.0002183517,0.0213185],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.009088211,"threshold_uncertainty_score":0.03040314,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"D. Al-Khalili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.01229266546028316,"gpt":0.2554889317421519,"spread":0.2431962662818687,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000458954,0.0005550169,0.0004589702,0.0004214033,0.0002657659,0.0007154134,0.0007830592,0.0003572881,0.006421695],"category_scores_gemma":[0.001630992,0.00030256,0.0001929694,0.0003569535,0.0002641414,0.0006337355,0.0003057294,0.0004865749,0.002307119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005953895,"about_ca_system_score_gemma":0.000421255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006924543,"about_ca_topic_score_gemma":0.001654712,"domain_scores_codex":[0.9993958,0.00006073411,0.00004678466,0.0001272525,0.0003131446,0.00005619253],"domain_scores_gemma":[0.9993204,0.0002297885,0.0001606937,0.00009362119,0.0001656183,0.00002997157],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0003004904,0.0001019901,0.001308143,0.0005582336,0.0000440381,0.0003284454,0.0004091756,0.005377209,0.7153164,0.008369987,0.004306796,0.2635791],"study_design_scores_gemma":[0.0002468291,0.0007740294,0.001513326,0.00005350652,0.00007119682,0.0008752436,0.00008537265,0.02806763,0.9035934,0.001759509,0.06291533,0.00004465831],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1637714,0.0019576,0.7857254,0.0005875796,0.0002754768,0.0007561902,0.0007028645,0.01912587,0.02709757],"genre_scores_gemma":[0.3805317,0.0004187707,0.6022957,0.0001774444,0.00007605616,0.0002563744,0.0002611668,0.0003033392,0.01567942],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006421695,"threshold_uncertainty_score":0.02148271,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"John McNamee","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09880814579206969,"gpt":0.455565228878722,"spread":0.3567570830866523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005602757,0.001162254,0.001538451,0.003398924,0.0008855053,0.002343821,0.002835117,0.001441333,0.01275975],"category_scores_gemma":[0.03440029,0.0008014938,0.001338401,0.003566314,0.0008599123,0.003488971,0.002479872,0.001833973,0.004087029],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001136562,"about_ca_system_score_gemma":0.001879612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001823694,"about_ca_topic_score_gemma":0.001793696,"domain_scores_codex":[0.9895913,0.001809684,0.0005473645,0.0004441916,0.007367678,0.0002397629],"domain_scores_gemma":[0.9763677,0.01345935,0.0008646153,0.003836261,0.005164203,0.0003079688],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006266384,0.0001702677,0.001567215,0.002024552,0.0003089469,0.0001542643,0.000562238,0.08264915,0.006438476,0.1361323,0.02182185,0.7475441],"study_design_scores_gemma":[0.0003588924,0.0004736361,0.003126116,0.0009275983,0.0002276979,0.001214214,0.0003490264,0.7079679,0.03299653,0.1180165,0.1340646,0.0002773685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00683134,0.009653333,0.9617134,0.0004308544,0.000864919,0.0001746279,0.0002665824,0.003787719,0.01627719],"genre_scores_gemma":[0.07544942,0.008865007,0.900484,0.0002776575,0.0003807108,0.000500941,0.0006329547,0.002757595,0.01065177],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01275975,"threshold_uncertainty_score":0.04268563,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"Vassil S. Dimitrov","is_ca":true},{"name":"G.A. Jullien","is_ca":true},{"name":"William C. Miller","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03288132110837606,"gpt":0.2949261330994269,"spread":0.2620448119910508,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007935986,0.0008299996,0.000793512,0.002938213,0.001445356,0.00292565,0.0007888524,0.001166068,0.006328556],"category_scores_gemma":[0.002929075,0.0003120364,0.0006951509,0.001822009,0.002853994,0.003783246,0.001665566,0.002504068,0.002567708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009966665,"about_ca_system_score_gemma":0.0005677279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003211091,"about_ca_topic_score_gemma":0.0002363471,"domain_scores_codex":[0.9994264,0.0001043848,0.00004111843,0.0001004733,0.0002567707,0.00007091874],"domain_scores_gemma":[0.99919,0.0003324061,0.00009469878,0.0001296259,0.0001791342,0.00007414501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008034653,0.000006802981,0.00005975224,0.00004081018,0.000002381905,0.00007149055,0.00007444916,0.001342713,0.0007542749,0.9889851,0.00133059,0.007323554],"study_design_scores_gemma":[0.000004423371,0.00002734925,0.00007017866,0.00003769373,0.000003690769,0.0002729642,0.00002798463,0.01144164,0.0006857674,0.9646991,0.02271361,0.00001546697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0346923,0.006482824,0.8056573,0.00278882,0.002314584,0.0001025373,0.0002097818,0.0003869198,0.147365],"genre_scores_gemma":[0.6808813,0.00975507,0.2658027,0.001881691,0.004650328,0.0003671103,0.0003348105,0.0002708714,0.0360561],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006328556,"threshold_uncertainty_score":0.02117109,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","authors":[{"name":"J. M. Pierre Langlois","is_ca":true},{"name":"D. Al-Khalili","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0205460935419386,"gpt":0.2508166757484431,"spread":0.2302705822065045,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001313288,0.0002714761,0.0002121569,0.0003290219,0.0001609127,0.0003194161,0.00042601,0.0002493766,0.00345593],"category_scores_gemma":[0.0008019514,0.0001293985,0.0001583406,0.0003445244,0.0002391397,0.0005406634,0.000342682,0.0002857432,0.0009599586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001534604,"about_ca_system_score_gemma":0.0002670598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001810846,"about_ca_topic_score_gemma":0.0005442711,"domain_scores_codex":[0.9998189,0.00002244358,0.0000102853,0.00001857486,0.0001206056,0.000009335234],"domain_scores_gemma":[0.9997494,0.0001163088,0.00003170136,0.00005156929,0.00004308393,0.000007937557],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002128947,0.00005449977,0.0003140481,0.0003529976,0.00002131738,0.0003010682,0.00007375317,0.01684477,0.3851832,0.02626428,0.003089888,0.5672872],"study_design_scores_gemma":[0.0003218276,0.001285519,0.001677874,0.0001078815,0.00009948904,0.004216264,0.00006586828,0.3741163,0.509836,0.02488911,0.08332992,0.00005412041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07403226,0.002098244,0.909551,0.0003323689,0.0001270958,0.00007977665,0.00008572083,0.0015633,0.01213016],"genre_scores_gemma":[0.3188063,0.0008760465,0.6724288,0.0001153664,0.0001289823,0.0001089565,0.0001552511,0.0001128924,0.007267288],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00345593,"threshold_uncertainty_score":0.01156127,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","authors":[{"name":"K. Kunaraj","is_ca":false},{"name":"R. Seshasayanan","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0399000260591533,"gpt":0.2376914672461817,"spread":0.1977914411870284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007350915,0.0004211547,0.0003343366,0.0006060898,0.0003822341,0.0007475413,0.001020696,0.0005408404,0.001553825],"category_scores_gemma":[0.0008453018,0.0002839811,0.0005748371,0.0005272233,0.0005653172,0.000511321,0.0004444507,0.0005858989,0.0003040002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007080829,"about_ca_system_score_gemma":0.0009011478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00115635,"about_ca_topic_score_gemma":0.001308879,"domain_scores_codex":[0.9996696,0.0000815173,0.00001770186,0.00006185213,0.0001336453,0.00003570078],"domain_scores_gemma":[0.9997342,0.00008634287,0.00003015288,0.00003707768,0.00009799786,0.00001420526],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00006110401,0.00009282368,0.002253416,0.0003344491,0.0001184338,0.0002893456,0.0003632887,0.4629945,0.06346485,0.1430031,0.001535776,0.325489],"study_design_scores_gemma":[0.00004665252,0.0003095686,0.0007319341,0.00007970303,0.0000939382,0.0005005481,0.00006860995,0.9074084,0.0261171,0.03719848,0.02740388,0.00004133094],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01409851,0.0004470005,0.9791659,0.0001208843,0.00003458073,0.00007647146,0.00002311037,0.0001839869,0.005849626],"genre_scores_gemma":[0.1883893,0.0005520414,0.8047253,0.0001053241,0.00001707026,0.0002073521,0.00007056146,0.00006200574,0.005871056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001553825,"threshold_uncertainty_score":0.005198061,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}