{"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"},"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002278315,0.0001422351,0.0001657081,0.00006739121,0.0002976016,0.0001566123,0.0001247299,0.00004314507,0.00001264515],"category_scores_gemma":[0.00007735191,0.0001227383,0.00001925744,0.0002538067,0.0001786225,0.000185251,0.00005519024,0.00005339763,0.000002043549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001493944,"about_ca_system_score_gemma":0.00004162721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.467487e-7,"about_ca_topic_score_gemma":5.634182e-8,"domain_scores_codex":[0.9990316,0.00004239786,0.0002506566,0.0003742971,0.0001535695,0.0001474848],"domain_scores_gemma":[0.9985637,0.0008856084,0.0001295842,0.0001503661,0.0001369522,0.0001338043],"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.000001973115,0.00003987648,0.00003352333,0.0000142035,0.000007490838,8.165313e-8,0.00002558884,0.7137554,0.000006847935,0.2377837,0.000004803316,0.0483265],"study_design_scores_gemma":[0.0005838379,0.0001052306,0.00008136865,0.00001527076,0.00001559477,0.00003335117,0.0000144897,0.9477512,0.000007793799,0.05085985,0.0003771581,0.0001549184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002474706,0.00002202305,0.997069,0.001342326,0.00001041315,0.0006106826,0.00001133601,0.00009477358,0.0008147079],"genre_scores_gemma":[0.01233983,0.000007141648,0.9869112,0.0003077231,0.00004826835,0.0002890716,0.0000555323,0.00001208025,0.00002916018],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2339958,"threshold_uncertainty_score":0.5005125,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009662391,0.0001952506,0.0002103318,0.0001281482,0.0004748288,0.0001248219,0.0004786574,0.00004796972,0.00000978048],"category_scores_gemma":[0.00001359958,0.0001250047,0.0002366634,0.0008643329,0.00004750463,0.0001566555,0.000005817405,0.0004932714,0.000003953411],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006279366,"about_ca_system_score_gemma":0.00001464038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002282833,"about_ca_topic_score_gemma":0.00003890638,"domain_scores_codex":[0.9979863,0.0002929662,0.0004373144,0.0004043645,0.0003871822,0.0004919294],"domain_scores_gemma":[0.9976705,0.001376944,0.0001693615,0.0006065613,0.00006514924,0.0001114956],"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.00009844339,0.0004438505,0.00009721832,9.953685e-7,0.00005275518,0.00001187161,0.0001627864,0.2794346,0.0001109573,0.00008939225,0.00004536271,0.7194517],"study_design_scores_gemma":[0.0007706085,0.003676914,0.01016377,0.00002462756,0.00002526425,0.00001026995,0.0002004095,0.9817755,0.002640864,0.0004655887,0.00003307917,0.0002130587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1122816,0.00001328343,0.8861257,0.0001877417,0.0007508805,0.0004081436,0.000002510693,0.00007518412,0.0001549609],"genre_scores_gemma":[0.9945667,0.00001353296,0.005091662,0.0001219457,0.0001142285,0.00002304027,4.110427e-7,0.00001446005,0.0000539676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8822851,"threshold_uncertainty_score":0.5097542,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002178134,0.000131333,0.0003084022,0.00004798988,0.0002331052,0.00006197303,0.0005932447,0.00005997618,3.140502e-7],"category_scores_gemma":[0.0002423171,0.0001000722,0.00006319507,0.0003836915,0.00005574855,0.0003990351,0.0002069657,0.00009332353,3.749867e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002610466,"about_ca_system_score_gemma":0.00003324584,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003744468,"about_ca_topic_score_gemma":0.000005622706,"domain_scores_codex":[0.9984151,0.0004302007,0.0003291917,0.0004163456,0.0001392512,0.0002698905],"domain_scores_gemma":[0.9980379,0.0008327288,0.0003075511,0.0004294176,0.0003191438,0.00007323418],"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.00002978991,0.0001403505,0.0003564081,0.0001576967,0.00001902214,3.594677e-7,0.0008550948,0.008654424,0.04846746,0.01319125,0.000002081837,0.928126],"study_design_scores_gemma":[0.0003728496,0.0008033318,0.001453126,0.0001372042,0.00001634947,0.000007770965,0.00009356916,0.915466,0.06245414,0.01902888,0.00004312873,0.0001236728],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2173654,0.00003394393,0.7818151,0.0000455144,0.0002259454,0.000452538,0.000003370194,0.0000390399,0.00001923348],"genre_scores_gemma":[0.3021303,0.000001439332,0.6977314,0.00004288849,0.00006475591,0.0000138316,0.000001693919,0.000009759338,0.000003922088],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9280024,"threshold_uncertainty_score":0.4080825,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001670699,0.0000606672,0.0001501106,0.00004099698,0.0000325825,0.00003291379,0.0002237704,0.0000223114,0.00006198088],"category_scores_gemma":[0.0001830784,0.00004542982,0.00002829339,0.0003612085,0.00001882557,0.0001445413,0.000030496,0.00003976275,0.000005362541],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006985343,"about_ca_system_score_gemma":0.00003982997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003657813,"about_ca_topic_score_gemma":4.227736e-7,"domain_scores_codex":[0.9993309,0.00007845453,0.0001966373,0.0001406489,0.0001407814,0.0001126122],"domain_scores_gemma":[0.9995628,0.00008563844,0.00007703659,0.0001881853,0.00004326101,0.00004308986],"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.000001591029,0.000548317,0.003152875,0.0001257204,0.00002567379,0.000001437113,0.0009793922,0.03424416,0.0004887729,0.280638,0.0007926223,0.6790015],"study_design_scores_gemma":[0.0001006529,0.00005630677,0.0003444278,0.00001420727,0.000002395604,0.000002102139,0.00004648496,0.9900483,0.005937064,0.003093025,0.0002800754,0.00007488002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001331313,0.00006422193,0.9932647,0.000121535,0.00009458897,0.00007875196,8.643991e-8,0.00009889649,0.004945932],"genre_scores_gemma":[0.2169491,0.000002574965,0.7828726,0.00005142266,0.00000467376,0.000004187186,1.146747e-7,0.000002531451,0.0001127427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9558042,"threshold_uncertainty_score":0.1852574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004111207,0.0001884941,0.0002610974,0.000139572,0.0003853916,0.000597347,0.0001790929,0.00006305415,7.322394e-7],"category_scores_gemma":[0.00003522673,0.0001246364,0.00006119731,0.0004407714,0.00007363404,0.0006026544,0.00000249001,0.0001402871,9.52063e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001978729,"about_ca_system_score_gemma":0.00006314011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001373951,"about_ca_topic_score_gemma":1.706267e-7,"domain_scores_codex":[0.9987211,0.00008608464,0.0003092867,0.0003952192,0.0002794712,0.0002088788],"domain_scores_gemma":[0.9991335,0.0003707075,0.0001069813,0.0001648645,0.00008000513,0.0001439085],"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.00001660384,0.0005067145,0.00002892497,0.0001242844,0.00003624438,0.000001980764,0.0006327373,0.0667339,0.002330997,0.001444192,0.000004536538,0.9281389],"study_design_scores_gemma":[0.0002635554,0.0005645648,0.0000223315,0.0002577084,0.0000164144,0.00003350708,0.000194251,0.9971427,0.0008216793,0.0003198938,0.0001137319,0.000249613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003718717,0.000139757,0.9940474,0.00004183901,0.00009837282,0.0002568165,0.00002704105,0.00004536058,0.00497154],"genre_scores_gemma":[0.991254,0.000002284441,0.008551411,0.00006838985,0.00002347482,0.00002299854,6.923496e-7,0.00001176264,0.00006500608],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9908821,"threshold_uncertainty_score":0.5760232,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005756961,0.0001391081,0.0004742088,0.0003244484,0.00008048991,0.00003599863,0.0004248791,0.00005650755,0.000008482907],"category_scores_gemma":[0.0001362577,0.0001171569,0.0001787524,0.0005915618,0.00006058099,0.000584463,0.0000899682,0.0001821733,0.000007570322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004311244,"about_ca_system_score_gemma":0.0001216041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005685407,"about_ca_topic_score_gemma":2.88468e-7,"domain_scores_codex":[0.9980959,0.0002370254,0.0009110966,0.0001642101,0.0004094142,0.0001823491],"domain_scores_gemma":[0.9979708,0.0002789522,0.001107828,0.000166639,0.0003496648,0.0001261805],"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.00009694182,0.0006030783,0.004105881,0.00005350606,0.0001882302,0.0001045983,0.007996305,0.01094643,0.05622213,0.00791622,0.0005078954,0.9112588],"study_design_scores_gemma":[0.002027082,0.0009227308,0.1843617,0.0002117672,0.00004972271,0.00126422,0.00011726,0.7808497,0.008659959,0.02033964,0.0007756506,0.0004205619],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.240143,0.0001287959,0.7585486,0.0002487239,0.0006555408,0.00007287024,7.840679e-7,0.00001988285,0.0001818957],"genre_scores_gemma":[0.6713027,0.0000316036,0.3283914,0.00006644784,0.0001806727,7.42419e-7,4.985514e-7,0.000007003498,0.00001887699],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9108382,"threshold_uncertainty_score":0.4777521,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005896186,0.0004264177,0.0004769541,0.0003419548,0.0002944301,0.000231397,0.001078669,0.0001308909,0.00009289229],"category_scores_gemma":[0.00001485315,0.0003345581,0.0002604279,0.000880371,0.00007394645,0.0002717947,0.00002335883,0.0004966351,0.0005157667],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001336378,"about_ca_system_score_gemma":0.00007912268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004688244,"about_ca_topic_score_gemma":0.000008204964,"domain_scores_codex":[0.9966431,0.0002762485,0.0005332823,0.001093506,0.0008513989,0.0006024667],"domain_scores_gemma":[0.9967592,0.001371287,0.0001784518,0.001204111,0.0001612397,0.0003256476],"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.0001053571,0.0004312198,0.00003673873,0.00001294457,0.0000383661,0.00002307866,0.0004094313,0.4098108,0.002423518,0.0000434616,0.0001729057,0.5864922],"study_design_scores_gemma":[0.002240218,0.001234676,0.0003779868,0.0001561181,0.00001517105,0.00004426095,0.00004958332,0.972793,0.02144901,0.0000629079,0.001071787,0.0005052591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06665099,0.000008043329,0.9274907,0.0002693936,0.004331341,0.0006546446,0.00001310745,0.0004323085,0.0001494346],"genre_scores_gemma":[0.5219852,0.000003006056,0.4775546,0.0002625531,0.00004246573,0.00001544416,0.000001383945,0.0000269779,0.0001083574],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5859869,"threshold_uncertainty_score":0.9999107,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005896824,0.00009227206,0.0002457177,0.00007814026,0.00008180069,0.00004391964,0.0004175785,0.00003455238,7.679932e-7],"category_scores_gemma":[0.0003402654,0.00006536754,0.0001033199,0.0003517173,0.00008094425,0.0001277421,0.00009627517,0.00005267718,0.000001499668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002430195,"about_ca_system_score_gemma":0.00007596245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001240695,"about_ca_topic_score_gemma":2.753434e-7,"domain_scores_codex":[0.9989102,0.00008146318,0.0004276977,0.0001377457,0.0002991417,0.0001437798],"domain_scores_gemma":[0.9983257,0.0007383961,0.0003631569,0.0002602477,0.0002609901,0.00005150959],"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.00003714091,0.002650949,0.000027256,0.0006553591,0.0003109235,5.444034e-7,0.01579138,0.1200998,0.001763332,0.5868234,0.00364263,0.2681973],"study_design_scores_gemma":[0.0003402603,0.0001087906,0.00003520021,0.00001095254,0.00003190614,0.000002310962,0.0001624879,0.9252053,0.0002565973,0.07374214,0.0000361544,0.00006786462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00176306,0.00006342288,0.9971657,0.0002039453,0.0002105372,0.0003398341,0.000006890002,0.00002957945,0.0002170056],"genre_scores_gemma":[0.3733534,7.141954e-7,0.626553,0.000008966245,0.00003980935,0.00001695493,0.000005102578,0.000005104097,0.00001695032],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8051056,"threshold_uncertainty_score":0.2665611,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001404317,0.0001081737,0.0003083966,0.0003184286,0.0000736314,0.00006473708,0.0002338651,0.0000579769,0.000001355903],"category_scores_gemma":[0.00009330185,0.00009553659,0.0001107238,0.0005083942,0.00002515088,0.0005279593,0.00005049877,0.0001019095,4.521111e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009064927,"about_ca_system_score_gemma":0.00006497361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003241434,"about_ca_topic_score_gemma":1.490103e-7,"domain_scores_codex":[0.9983611,0.0001597242,0.0008049896,0.0001328249,0.0003712908,0.0001700627],"domain_scores_gemma":[0.9981298,0.0002347664,0.001059005,0.0001023556,0.0003802816,0.00009381756],"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.00005898784,0.000299717,0.0006495848,0.00004850347,0.00008290382,0.00002586626,0.001874546,0.08903696,0.3942165,0.01497492,0.000006293909,0.4987252],"study_design_scores_gemma":[0.0007733144,0.0002441099,0.02274507,0.000132351,0.00003422453,0.0001290657,0.00003508294,0.8986726,0.05015837,0.02687477,0.00003259283,0.0001684147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2010409,0.00005319586,0.7981157,0.00004806049,0.0006208334,0.00007309741,5.708873e-7,0.00001479297,0.0000327727],"genre_scores_gemma":[0.5193532,0.000002382887,0.4804986,0.00001888235,0.0001206351,7.535394e-8,7.229624e-7,0.000004759914,8.130036e-7],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8096357,"threshold_uncertainty_score":0.3895869,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003490988,0.0004882198,0.001289213,0.0006338197,0.0004500604,0.000965146,0.001221359,0.0001358859,0.000006872162],"category_scores_gemma":[0.0003110088,0.0004321767,0.0006588736,0.00141098,0.0001537517,0.0004997242,0.0002759239,0.000543437,0.00001397944],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001459092,"about_ca_system_score_gemma":0.0001963971,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001313551,"about_ca_topic_score_gemma":0.00001551157,"domain_scores_codex":[0.9954524,0.0005053257,0.001397585,0.001156156,0.0007081683,0.0007803413],"domain_scores_gemma":[0.9962842,0.0005245123,0.0008483111,0.001221641,0.0008086473,0.0003126355],"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.0001897708,0.002336997,0.0102452,0.003489393,0.01026783,0.0008110771,0.001216645,0.130915,0.2014673,0.02021546,0.002260468,0.6165849],"study_design_scores_gemma":[0.0002824102,0.0001158388,0.0000105439,0.0001166207,0.0002992178,0.000320253,0.000120607,0.9826207,0.007221222,0.00008877503,0.008291258,0.000512595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06116096,0.0001488099,0.9348297,0.0001153278,0.001893309,0.00099396,0.0002227022,0.0004832262,0.000151962],"genre_scores_gemma":[0.3355941,0.000004137019,0.6628633,0.00006662987,0.00110711,0.00004610613,0.0001298239,0.0000441163,0.0001446725],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8517057,"threshold_uncertainty_score":0.999813,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002361151,0.00006307151,0.00008848619,0.00002723129,0.00006629495,0.00006723224,0.0001895819,0.00003489746,0.00001024081],"category_scores_gemma":[0.00003592663,0.00004497422,0.00002660726,0.0001399758,0.00001700798,0.0002282405,0.0000905286,0.00004725095,0.00001492585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00000772455,"about_ca_system_score_gemma":0.000007357244,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000548399,"about_ca_topic_score_gemma":0.00000164619,"domain_scores_codex":[0.9993757,0.00002356186,0.0001228064,0.000235239,0.00008026504,0.0001624548],"domain_scores_gemma":[0.9996017,0.000113118,0.00002901518,0.0001546946,0.00002672962,0.00007474842],"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":[1.123083e-7,0.00001875675,0.0001462569,0.000003915887,0.000002733388,2.923644e-7,0.00006447135,0.00002195651,0.0005040138,0.02133481,0.0001343065,0.9777684],"study_design_scores_gemma":[0.000933512,0.0003563051,0.01175637,0.00002805889,0.000005673588,0.00002530248,0.000007718019,0.8131008,0.002443909,0.1222259,0.04877679,0.0003396427],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001456952,0.0001420407,0.9920991,0.001707113,0.0001125593,0.0001635533,3.396555e-7,0.0001118319,0.004206484],"genre_scores_gemma":[0.2365142,0.0000124685,0.7617577,0.0002827129,0.00003041818,0.00001198737,4.163046e-7,0.000004746382,0.001385404],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9774287,"threshold_uncertainty_score":0.1833996,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004949155,0.0002511039,0.000432122,0.0001520836,0.0002265075,0.001286404,0.0005654761,0.00009932109,8.768561e-7],"category_scores_gemma":[0.0001924211,0.0002067759,0.00009106076,0.0004203984,0.00004088237,0.001101163,0.0001071899,0.00008257631,0.000009933973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008290513,"about_ca_system_score_gemma":0.00003706905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008378865,"about_ca_topic_score_gemma":6.623255e-7,"domain_scores_codex":[0.998216,0.00001058943,0.0003821954,0.0006736221,0.0002952322,0.0004224029],"domain_scores_gemma":[0.998925,0.0001797507,0.0001797252,0.0001660667,0.0002616716,0.0002877472],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002160584,0.0006862644,0.001753049,0.00186054,0.0001353452,0.000022533,0.002905948,0.000005237383,0.04748181,0.07534716,0.0003905748,0.86939],"study_design_scores_gemma":[0.01411227,0.01937922,0.002528078,0.01296843,0.0005721076,0.001735843,0.007292472,0.03824618,0.3865381,0.07943396,0.4251409,0.01205239],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06785715,0.0008617225,0.9228414,0.0007237027,0.000658659,0.001571393,0.00006399036,0.0006679335,0.004754052],"genre_scores_gemma":[0.9621932,0.00001739321,0.03700134,0.0001935021,0.000243533,0.0002859228,0.000001155884,0.00002209471,0.00004186657],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.894336,"threshold_uncertainty_score":0.9997504,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002238009,0.00009825555,0.0001276613,0.00004625554,0.0001469952,0.0001104527,0.0004468852,0.00003640349,0.00003503892],"category_scores_gemma":[0.00002138513,0.00007938714,0.00006738185,0.00030591,0.00001221936,0.00005601403,0.0001487678,0.00008783809,0.0002252522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001486961,"about_ca_system_score_gemma":0.00001526255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009585148,"about_ca_topic_score_gemma":3.522074e-7,"domain_scores_codex":[0.9990923,0.00004914276,0.0001514052,0.0003431804,0.0001215639,0.0002424197],"domain_scores_gemma":[0.9992123,0.0002064324,0.0000521309,0.0003390262,0.00008919954,0.0001009003],"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.000004837505,0.0001186258,0.000708002,0.00002119012,0.00002083175,7.103376e-7,0.0001559175,0.0787271,0.0228437,0.09636468,0.00002069308,0.8010137],"study_design_scores_gemma":[0.0002617896,0.00006699379,0.0003662854,0.000002463618,0.000002784084,0.000001519125,0.00001556032,0.9606276,0.002925608,0.0005535409,0.03504082,0.0001350257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009855635,0.00005822337,0.988008,0.0002253458,0.0001671112,0.0005241838,9.614698e-7,0.0001766644,0.0009839345],"genre_scores_gemma":[0.09015156,0.00000178856,0.90762,0.0002776145,0.00006919255,0.0001093795,0.000002138013,0.00001033007,0.001758061],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8819005,"threshold_uncertainty_score":0.3237314,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001591251,0.0008856406,0.001314886,0.0003476751,0.0004389695,0.002886455,0.002719598,0.000333119,0.0002483673],"category_scores_gemma":[0.0005983592,0.0007454238,0.0005861482,0.002452269,0.0004517789,0.006748209,0.001328647,0.001041623,0.0004173773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002855523,"about_ca_system_score_gemma":0.0001696832,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002765161,"about_ca_topic_score_gemma":0.000003898901,"domain_scores_codex":[0.9935613,0.0008272519,0.001162349,0.001789515,0.001103541,0.001556022],"domain_scores_gemma":[0.9961096,0.0006438214,0.0003542558,0.001618667,0.0003528451,0.000920783],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002506557,0.0005122194,0.000005191785,0.00002597561,0.00009315046,0.0001806896,0.0004295864,0.0001814072,0.001461337,0.02014596,0.0001605764,0.9767789],"study_design_scores_gemma":[0.004784868,0.004047797,0.0006438384,0.0004052688,0.0001913437,0.001776326,0.001672683,0.1905018,0.05846026,0.3161727,0.4169583,0.004384826],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001087936,0.002323733,0.9734024,0.01836645,0.003774373,0.0004783675,0.000007801528,0.0009139298,0.0006241343],"genre_scores_gemma":[0.001357801,0.0005902064,0.992246,0.004336316,0.0008685809,0.0001488556,0.00001106232,0.00009322807,0.0003479776],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.972394,"threshold_uncertainty_score":0.9994997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003426015,0.0002816839,0.000501879,0.0001178108,0.0002756932,0.0001106344,0.0009167842,0.0001243715,0.00003010173],"category_scores_gemma":[0.00001600611,0.0002578076,0.0001807284,0.0006643911,0.00007488739,0.0002145624,0.00001048074,0.0002933535,0.00005240656],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004811123,"about_ca_system_score_gemma":0.00008103356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006441893,"about_ca_topic_score_gemma":9.375843e-8,"domain_scores_codex":[0.9973065,0.0003863527,0.0005880022,0.0006892355,0.0006225086,0.0004074443],"domain_scores_gemma":[0.9982957,0.0003441857,0.0001976374,0.0006812254,0.0001585573,0.0003227417],"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.00003449187,0.0007057157,0.000002244843,0.000128417,0.0001418251,0.00003672588,0.006787346,0.6631413,0.2568448,0.001257064,0.000312616,0.07060752],"study_design_scores_gemma":[0.001646485,0.001304334,0.00005301654,0.0003048773,0.00005625636,0.00005902458,0.0002146817,0.7746423,0.215353,0.0000518681,0.005436994,0.0008770947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00106754,0.0001817112,0.9957141,0.0002949023,0.001500305,0.0006394457,0.00003078672,0.0002613556,0.0003099006],"genre_scores_gemma":[0.9612892,0.000007145283,0.0380653,0.000297808,0.00006518542,0.00008382836,3.065268e-7,0.00003084255,0.0001604205],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9602216,"threshold_uncertainty_score":0.9999874,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005818615,0.00009379549,0.0002189127,0.0001298997,0.00006486347,0.0001369761,0.0002700129,0.00005513301,0.000004142503],"category_scores_gemma":[0.0001051603,0.00006771559,0.00005101712,0.0002035419,0.00004526713,0.0004700767,0.00007877683,0.0003014482,0.000003208879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001079063,"about_ca_system_score_gemma":0.00003373979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002634058,"about_ca_topic_score_gemma":4.12169e-7,"domain_scores_codex":[0.9989802,0.00009895761,0.0003486542,0.0001496876,0.0003094763,0.0001130666],"domain_scores_gemma":[0.998996,0.0002161249,0.0002958168,0.0001124466,0.0002553074,0.0001243239],"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.000005659767,0.00005152784,0.00004629798,0.000005321399,0.000007245719,0.000009382822,0.0003863168,0.00003626934,0.0005732533,0.01925799,0.00003026921,0.9795905],"study_design_scores_gemma":[0.00204257,0.00195843,0.1634451,0.000210394,0.00004141723,0.001901914,0.0002643041,0.4959918,0.003879369,0.3220931,0.007577416,0.0005941779],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07222649,0.0007762958,0.9194981,0.006136496,0.001229664,0.00005673805,2.032614e-7,0.00002458618,0.00005143764],"genre_scores_gemma":[0.5043555,0.0001295232,0.4952069,0.00003746525,0.0002635839,9.250837e-7,1.61281e-7,0.000003409111,0.000002501127],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9789963,"threshold_uncertainty_score":0.2761362,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002919123,0.0001331812,0.000214149,0.0003584174,0.0002775039,0.00009536556,0.0007349128,0.0002694483,0.00004193459],"category_scores_gemma":[0.00004825065,0.0001109968,0.00004142434,0.0006458443,0.0001239563,0.0001858871,0.000007112991,0.0006128765,0.00007694745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007693367,"about_ca_system_score_gemma":0.00002100121,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003146189,"about_ca_topic_score_gemma":0.00000574864,"domain_scores_codex":[0.9990273,0.00004497229,0.0002035207,0.0003753753,0.00009259353,0.0002562904],"domain_scores_gemma":[0.9987208,0.0001709019,0.00005540531,0.0009224943,0.00004724673,0.00008314749],"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.000002774015,0.00006016564,0.0000680002,0.00001329693,0.00002574794,0.000009878489,0.00003286113,0.00001808038,0.01273841,0.1058854,0.00004953276,0.8810958],"study_design_scores_gemma":[0.002434426,0.001591967,0.0008775898,0.0002103202,0.00007093736,0.002881642,0.0008550925,0.07550412,0.2121052,0.394401,0.3070124,0.002055284],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01273016,0.0002091125,0.9769965,0.004318716,0.002065691,0.0001856777,0.000003927195,0.000619805,0.002870427],"genre_scores_gemma":[0.8868102,0.00006492616,0.1111437,0.0001213651,0.0000353895,0.00009721992,2.846319e-7,0.00001046124,0.001716381],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8790405,"threshold_uncertainty_score":0.452632,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008346135,0.0002459096,0.0005639913,0.0000938843,0.0001033174,0.00009460271,0.000738006,0.00009502887,0.00002292313],"category_scores_gemma":[0.0004394788,0.0001999542,0.00012167,0.0006538354,0.00005256634,0.0002775161,0.0001370915,0.0001376574,0.00002316685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005026078,"about_ca_system_score_gemma":0.0000113268,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.917255e-7,"about_ca_topic_score_gemma":7.185757e-8,"domain_scores_codex":[0.9981294,0.00007673447,0.0005713658,0.0005010726,0.0001854413,0.0005359823],"domain_scores_gemma":[0.9968032,0.002304953,0.0001966376,0.0004849969,0.00006691333,0.0001432866],"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.000005628587,0.0002854333,6.236423e-7,0.00009390651,0.000009026033,4.47225e-7,0.0002417688,0.00004910584,0.0009876867,0.2780504,0.0001718788,0.720104],"study_design_scores_gemma":[0.000500751,0.0001078413,0.000001945643,0.00001538846,0.000009804447,0.000002468301,0.00003884526,0.352095,0.005740672,0.5579568,0.0832831,0.0002473159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001955863,0.001553983,0.9952835,0.001004647,0.0002626902,0.0009697766,0.000005790493,0.000166242,0.0007337694],"genre_scores_gemma":[0.0003717632,0.0007019261,0.9974329,0.0005230937,0.0001247547,0.0007375383,0.000002674447,0.00003219316,0.0000731569],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7198567,"threshold_uncertainty_score":0.8153896,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005449524,0.00006239022,0.00009983478,0.00001683551,0.0000706423,0.00006716914,0.00023399,0.0000378804,0.000009167503],"category_scores_gemma":[0.0003043933,0.0000524323,0.00004024309,0.0002720658,0.000006514671,0.0001842732,0.00005280937,0.0000293587,0.000009667716],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000278129,"about_ca_system_score_gemma":0.00001462752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001488837,"about_ca_topic_score_gemma":4.266398e-7,"domain_scores_codex":[0.9993455,0.00006543026,0.0001211443,0.0002230156,0.00009980435,0.0001451368],"domain_scores_gemma":[0.9994628,0.0001234255,0.00006995922,0.0002227618,0.00007056968,0.00005050647],"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.000004912661,0.00002590628,0.00002454407,0.000008353161,0.000003749898,1.688527e-7,0.0000203223,0.02531614,0.0001174742,0.1627803,0.0008837705,0.8108144],"study_design_scores_gemma":[0.0002254883,0.00009910204,0.0001059402,0.000005199128,0.000003603935,0.000002031079,0.000001243223,0.9220957,0.0003932782,0.03640828,0.04058841,0.00007173343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001080867,0.00002015329,0.9952934,0.001533773,0.0003745997,0.0001317648,0.000001387502,0.0001097394,0.002524379],"genre_scores_gemma":[0.0003169902,0.00000278851,0.9986064,0.0004263399,0.0001376416,0.00002736978,0.000003003805,0.000004369067,0.0004750373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8967795,"threshold_uncertainty_score":0.2138127,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001886223,0.0001156185,0.0001131519,0.0000415855,0.0001020301,0.0003150098,0.0005622136,0.00004468198,0.00003528279],"category_scores_gemma":[0.00002031588,0.00008134097,0.00002885146,0.0003146701,0.0001153318,0.000285389,0.0001285004,0.00017426,0.0001017785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002202186,"about_ca_system_score_gemma":0.00019317,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073003,"about_ca_topic_score_gemma":0.00006533401,"domain_scores_codex":[0.9990331,0.00009624429,0.0001805384,0.0003403508,0.0001337992,0.0002160012],"domain_scores_gemma":[0.9992875,0.00009249191,0.00006029277,0.0004042191,0.00003990992,0.0001156055],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00000299544,0.00006758505,0.0002016588,0.000002064204,0.000003950935,8.254055e-7,0.001424954,4.467549e-7,0.00009609572,0.006379505,0.0312849,0.960535],"study_design_scores_gemma":[0.0001275273,0.000330468,0.02414403,0.0001239086,0.00001978212,0.00002330519,0.001639347,0.01185447,0.004284965,0.3913805,0.5654495,0.000622145],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"commentary","genre_gemma":"methods","genre_scores_codex":[0.02021343,0.000353876,0.4610575,0.5141059,0.003773645,0.0003738987,0.000002174296,0.00008002883,0.00003948625],"genre_scores_gemma":[0.0417843,0.000067953,0.7548627,0.1959869,0.006992144,0.00009096653,0.000005636736,0.00002488769,0.0001845308],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9599129,"threshold_uncertainty_score":0.3316989,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000218942,0.0002050635,0.0002043287,0.0001375643,0.000192969,0.0001300763,0.0005823356,0.00005493802,0.00001357776],"category_scores_gemma":[0.000002213175,0.000163661,0.00009694399,0.0003724771,0.00007148997,0.0006453858,0.000006138491,0.0002646919,0.00007290785],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008426711,"about_ca_system_score_gemma":0.00002459074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008786775,"about_ca_topic_score_gemma":0.000001907266,"domain_scores_codex":[0.9985749,0.00009220748,0.0002378582,0.0003789641,0.0003048766,0.0004111957],"domain_scores_gemma":[0.9989538,0.0002100888,0.00009616046,0.00043082,0.00005902102,0.0002501319],"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.00009015227,0.0006007232,0.00008162421,0.000008930127,0.00008957153,0.000009270411,0.0008903157,0.02851354,0.00275056,0.003098275,0.0002080046,0.963659],"study_design_scores_gemma":[0.00325378,0.001346187,0.004868554,0.0002107531,0.00006526672,0.0003178657,0.00007273668,0.9209399,0.062143,0.0008682715,0.004639155,0.001274573],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01070131,0.00001730877,0.9863118,0.0007099857,0.001774357,0.0001711198,0.000003139342,0.0002464369,0.00006453969],"genre_scores_gemma":[0.4812476,0.00000831974,0.5183318,0.0002617977,0.0000868995,0.00001184658,4.092147e-7,0.000009673626,0.00004165203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9623845,"threshold_uncertainty_score":0.66739,"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)","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000631575,0.0003058107,0.0005359408,0.0001521978,0.0007447475,0.0009177813,0.0008233655,0.0001175487,7.282912e-7],"category_scores_gemma":[0.00001037202,0.0002783572,0.0001335058,0.0001683448,0.0001934515,0.0006757441,0.00002659156,0.0002647444,0.00001063937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004410443,"about_ca_system_score_gemma":0.00003376423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001571065,"about_ca_topic_score_gemma":0.000001007024,"domain_scores_codex":[0.9977667,0.0002443348,0.0005880868,0.0006627738,0.0003397366,0.000398409],"domain_scores_gemma":[0.9979718,0.0003478648,0.0004971489,0.0008126777,0.0001850203,0.0001854264],"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.00001543151,0.0002601217,0.0000694967,0.0000831974,0.00006164073,0.00001239462,0.0004130391,0.1516893,0.0003740337,0.00006080932,0.0000116042,0.8469489],"study_design_scores_gemma":[0.00114877,0.0002851732,0.0007937,0.0002058697,0.00001640951,0.00006049011,0.00004060389,0.9964896,0.0005068552,0.0001067592,0.00003924875,0.0003064531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001455252,0.00005903747,0.9956402,0.0001002905,0.001835682,0.0006513789,0.0000246637,0.0002107026,0.00002276668],"genre_scores_gemma":[0.3304034,0.000007313075,0.669363,0.00001770345,0.00007857395,0.00002034838,7.55202e-7,0.0000198333,0.00008913536],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8466424,"threshold_uncertainty_score":0.9999669,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001204,0.0001351184,0.0001492123,0.0001632142,0.0001341845,0.000185853,0.0002851403,0.00004450147,0.000005492874],"category_scores_gemma":[0.001218736,0.000114375,0.00001915891,0.0009614719,0.00003091796,0.0005522589,0.000047589,0.00009136822,0.0000183568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002200329,"about_ca_system_score_gemma":0.00004534213,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000671171,"about_ca_topic_score_gemma":2.968471e-7,"domain_scores_codex":[0.9985151,0.0004710213,0.0002962888,0.0003356665,0.0001896177,0.0001922566],"domain_scores_gemma":[0.9981821,0.001210091,0.0001119332,0.0002934059,0.0001319058,0.00007059966],"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.000005796356,0.0001524425,0.0007118187,0.000008235649,0.000003047863,0.00001183261,0.0006767726,0.002860727,0.005792368,0.01915413,0.00004653875,0.9705763],"study_design_scores_gemma":[0.0002440429,0.0002002034,0.08125257,0.00005699824,0.00000453926,0.00001451412,0.000005075903,0.8497928,0.001160113,0.06650236,0.0005838881,0.0001828536],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008960701,0.0001871461,0.9898065,0.0002644059,0.0001355603,0.0001856083,9.298354e-7,0.0001737554,0.000285422],"genre_scores_gemma":[0.2880349,0.00006716346,0.7113391,0.0004141073,0.00005618322,0.000003045458,0.000003043355,0.000008787261,0.00007378287],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9703934,"threshold_uncertainty_score":0.4664077,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001541372,0.000101483,0.0001087385,0.00005531226,0.0001162704,0.00005400739,0.0003340117,0.00003338026,0.0003121682],"category_scores_gemma":[0.00002279492,0.00008163376,0.00006285073,0.0002332154,0.00003121352,0.0001711821,0.00004604727,0.00008968559,0.0002358708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002407437,"about_ca_system_score_gemma":0.00002103955,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001150158,"about_ca_topic_score_gemma":0.000002259919,"domain_scores_codex":[0.9991238,0.00009958306,0.0001535204,0.0002752311,0.0001577072,0.000190229],"domain_scores_gemma":[0.999318,0.0001446535,0.00005269327,0.0003161895,0.00004973017,0.0001187342],"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.00002699632,0.001013354,0.0002267237,0.00001041944,0.00002691078,0.00002711766,0.0005286015,0.0001186169,0.008197264,0.0899644,0.01686666,0.8829929],"study_design_scores_gemma":[0.001840537,0.002932996,0.01407619,0.00008320365,0.00002633502,0.00001736066,0.00009982486,0.5146441,0.3791538,0.07206956,0.01390681,0.001149274],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0012619,0.000009156589,0.982067,0.001164149,0.0002537104,0.0001119822,0.000004922564,0.0001755755,0.01495159],"genre_scores_gemma":[0.1531977,0.000001518778,0.8444812,0.001980158,0.00002571227,0.00002233389,0.000004605637,0.000006680714,0.0002801086],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8818437,"threshold_uncertainty_score":0.3418023,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006349972,0.0002489356,0.0004153888,0.0002344846,0.0001503937,0.0002219454,0.0002701185,0.0001288964,0.000002601459],"category_scores_gemma":[0.00001198547,0.0002002103,0.00004855807,0.0004667541,0.0001088333,0.0004654933,0.000004408742,0.0002305114,0.000003435706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004218074,"about_ca_system_score_gemma":0.00007283603,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001634031,"about_ca_topic_score_gemma":5.205252e-7,"domain_scores_codex":[0.99783,0.0005089979,0.0005014621,0.0006443883,0.0002447315,0.0002704284],"domain_scores_gemma":[0.9984661,0.0003075463,0.0001558213,0.0004680794,0.0002745911,0.0003278388],"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.0001149545,0.002565711,0.00000825509,0.00009028953,0.0001543988,0.00002439834,0.003662966,0.01947024,0.0573762,0.01330975,0.0000606043,0.9031622],"study_design_scores_gemma":[0.0004277352,0.002083472,0.00004703162,0.00009438766,0.00002364085,0.000284489,0.0002723158,0.9775883,0.01866739,0.0001500231,0.00007224586,0.0002889564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003391123,0.00005003265,0.9950525,0.0000307918,0.0004563183,0.0006456159,0.00001447661,0.0001438848,0.0002152154],"genre_scores_gemma":[0.5337678,0.000008906872,0.4660971,0.00004749623,0.0000191653,0.00004047287,6.420487e-7,0.00001046138,0.000007969467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9581181,"threshold_uncertainty_score":0.8164339,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001786016,0.0002513001,0.0003697221,0.00005038375,0.0003538096,0.0004025254,0.002268843,0.00005709422,0.00008796805],"category_scores_gemma":[0.000797849,0.0001221317,0.0001114424,0.0007319443,0.0001956106,0.0002403373,0.000779009,0.0005239969,0.0005772684],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007192959,"about_ca_system_score_gemma":0.00003813075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003665677,"about_ca_topic_score_gemma":0.00000800773,"domain_scores_codex":[0.9971915,0.0004578444,0.0007214011,0.0004499432,0.0005660553,0.000613203],"domain_scores_gemma":[0.9942405,0.004421864,0.0001449149,0.0009935865,0.00006630728,0.0001328845],"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.00000819241,0.000682293,0.00003096131,0.000008561884,0.00002341398,0.00001166671,0.004027789,0.0002943953,0.00000694633,0.2000837,0.00008502857,0.794737],"study_design_scores_gemma":[0.0002078105,0.0003880349,0.0003820941,0.00006125669,0.0000127254,0.00002736993,0.001311087,0.599096,0.0004549008,0.3932864,0.004414112,0.000358239],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01277417,0.000244127,0.97475,0.009347347,0.0002314356,0.0006290726,4.062848e-7,0.0001393247,0.001884112],"genre_scores_gemma":[0.8648559,0.00003988717,0.1341644,0.0003783996,0.0002649517,0.00005569139,1.146044e-7,0.00001833891,0.0002223207],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8520817,"threshold_uncertainty_score":0.741981,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001901725,0.0007421767,0.0007008477,0.00061262,0.0004855921,0.001344563,0.002050483,0.0003009244,0.00001999461],"category_scores_gemma":[0.00008904297,0.0006853061,0.0002602284,0.002117214,0.0002189668,0.001300418,0.0006522367,0.0007386697,0.0001892985],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002455368,"about_ca_system_score_gemma":0.00005490017,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002248788,"about_ca_topic_score_gemma":1.754096e-7,"domain_scores_codex":[0.9944449,0.00001237692,0.001053505,0.001908801,0.001216867,0.00136356],"domain_scores_gemma":[0.9970956,0.000256421,0.0005309724,0.0003652277,0.00102766,0.0007240935],"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.0002208492,0.002273273,0.005282581,0.0004755204,0.0002577531,0.00003766789,0.005375262,0.000008365681,0.2232464,0.2911477,0.09175329,0.3799213],"study_design_scores_gemma":[0.004225921,0.003334247,0.002158802,0.00048563,0.0001125395,0.000525762,0.0002920243,0.5531386,0.2738242,0.01683533,0.1415668,0.0035001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02496404,0.0001472642,0.9468652,0.008660264,0.001135134,0.0009750006,0.00001522973,0.001360528,0.01587734],"genre_scores_gemma":[0.2524225,0.00006513223,0.7393788,0.006429442,0.001013373,0.00008733208,0.000006166797,0.00010301,0.000494246],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5531303,"threshold_uncertainty_score":0.9996921,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008492393,0.0003332776,0.000751734,0.0003098967,0.0001751048,0.0002081263,0.0004532245,0.0002367051,0.000009728437],"category_scores_gemma":[0.00003056978,0.0002783406,0.0001005091,0.0006756131,0.0002063946,0.0005121224,0.000007851487,0.0003430942,0.000001030059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002667494,"about_ca_system_score_gemma":0.00008850746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007815635,"about_ca_topic_score_gemma":0.000003436058,"domain_scores_codex":[0.9972265,0.0005444231,0.0009167266,0.0006569811,0.0003513362,0.0003040738],"domain_scores_gemma":[0.9977687,0.00051477,0.0004415485,0.0006201658,0.0004307209,0.0002241204],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006616663,0.000414333,0.00002031451,0.0001631131,0.0002295923,0.0000105875,0.0006246701,0.05120646,0.4968512,0.001640797,0.0002648897,0.4485079],"study_design_scores_gemma":[0.0008452777,0.001038417,0.00003445012,0.0001736202,0.00004281468,0.0001266148,0.00009462438,0.896185,0.1009097,0.0001560659,0.00005355618,0.0003398539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00839987,0.0001462563,0.9888316,0.00005635532,0.001633732,0.0006477959,0.00008790576,0.0001341561,0.00006236014],"genre_scores_gemma":[0.8504356,0.0002490931,0.1489963,0.00002872517,0.00006595911,0.0000555611,0.000005522853,0.00003350355,0.0001297222],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8449785,"threshold_uncertainty_score":0.9999669,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001160915,0.0003025257,0.0009434036,0.0002601959,0.0007522837,0.0008885039,0.001621295,0.0001276663,0.00002018076],"category_scores_gemma":[0.0001458025,0.0002516774,0.0005271537,0.0003081468,0.00009147767,0.0007131067,0.000003464573,0.000168365,0.00001941815],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007169793,"about_ca_system_score_gemma":0.00007459656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001613085,"about_ca_topic_score_gemma":0.00001511746,"domain_scores_codex":[0.9975691,0.000374029,0.000588912,0.0006745664,0.0003548377,0.0004385024],"domain_scores_gemma":[0.9961948,0.001156883,0.0004168065,0.001820926,0.0001621011,0.0002484936],"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.0001484843,0.001578005,0.00004181675,0.0002055732,0.003752874,0.00001361765,0.0004385254,0.07257327,0.00157147,0.001820244,0.00002165462,0.9178345],"study_design_scores_gemma":[0.001922766,0.0002034852,0.0003996992,0.00003805142,0.0009067074,0.000006747264,0.00004241778,0.9954649,0.0004498902,0.0001947555,0.0000745543,0.0002960627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001002676,0.00002224992,0.9958099,0.0008181368,0.0007714048,0.001012101,0.0001278604,0.000334757,0.0001009794],"genre_scores_gemma":[0.6871352,0.000001749496,0.3117847,0.0001744929,0.00007748249,0.0007312814,6.752101e-7,0.00001730636,0.00007710668],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9228916,"threshold_uncertainty_score":0.9999936,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002004854,0.00008605528,0.00009742782,0.00004619189,0.00009537153,0.00016751,0.0003762433,0.00003176363,0.00001595251],"category_scores_gemma":[0.000007566022,0.00006862678,0.00003737805,0.0002890469,0.00002016112,0.0003217976,0.00002463363,0.00005078968,0.0000222143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001783909,"about_ca_system_score_gemma":0.00003189344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001196252,"about_ca_topic_score_gemma":0.000001482628,"domain_scores_codex":[0.9991366,0.0000803182,0.0001369093,0.0002812364,0.0001794901,0.0001854415],"domain_scores_gemma":[0.9995072,0.00004563096,0.00003942772,0.0002845241,0.0000535836,0.00006959983],"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.000008505748,0.0009082605,0.0004051281,0.00002388545,0.000006050222,0.00003982462,0.00004040637,0.006274102,0.06290635,0.2283022,0.000419443,0.7006658],"study_design_scores_gemma":[0.0002146701,0.0001932576,0.001713512,0.000007719042,0.000002873236,0.000004045425,0.000001522451,0.8208387,0.1208974,0.05484327,0.001106875,0.0001761215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008550149,0.00002052198,0.9880137,0.0007464053,0.0001148028,0.00007197857,4.797434e-7,0.0002697326,0.002212165],"genre_scores_gemma":[0.205866,1.325037e-7,0.7933735,0.0006005172,0.00008331525,0.000005057645,0.000003107626,0.000004855338,0.00006352005],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8145646,"threshold_uncertainty_score":0.2798519,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001361611,0.0003050322,0.0007972928,0.0005760686,0.00008091767,0.0001257628,0.0004337535,0.0001968205,0.000007011241],"category_scores_gemma":[0.00001964572,0.0002454011,0.0001225754,0.001192937,0.00009775159,0.0005121674,0.000005545497,0.000311703,0.00000390153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001013493,"about_ca_system_score_gemma":0.00009340009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000457451,"about_ca_topic_score_gemma":8.686536e-7,"domain_scores_codex":[0.9968008,0.0008368005,0.001084042,0.0004372308,0.0004110909,0.0004300142],"domain_scores_gemma":[0.9979579,0.000707176,0.0003296352,0.0004828403,0.0002908052,0.0002316349],"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.00002072358,0.0005814041,0.00009152278,0.0001666257,0.000104154,0.000007491084,0.0004805886,0.9224206,0.001417567,0.004404051,0.00005494265,0.07025028],"study_design_scores_gemma":[0.0005605115,0.0005348492,0.00006963533,0.0004735191,0.00002640228,0.00006556841,0.0001501233,0.9952129,0.002581164,0.00004018244,0.00003507602,0.0002500937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00180519,0.0004661399,0.9948051,0.00003045236,0.002112027,0.0005938174,0.00002055777,0.00008494707,0.00008179052],"genre_scores_gemma":[0.9134005,0.00007153553,0.0863263,0.00002369535,0.00007163457,0.00004354283,0.000001732257,0.00002070485,0.00004036697],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9115953,"threshold_uncertainty_score":0.9999998,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001025065,0.0003229188,0.0003876168,0.00006313167,0.0001702359,0.0002504892,0.002151623,0.0001276141,0.000004807858],"category_scores_gemma":[0.0003986781,0.00021761,0.0005738906,0.000639795,0.0001331032,0.0004973833,0.0003506264,0.0003645883,0.0000165931],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002942093,"about_ca_system_score_gemma":0.00004485243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003687059,"about_ca_topic_score_gemma":1.15017e-7,"domain_scores_codex":[0.9974211,2.726546e-8,0.00064834,0.0005189887,0.0009167086,0.0004948732],"domain_scores_gemma":[0.9980401,0.0002346342,0.0003266694,0.0001225038,0.001069625,0.0002064164],"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.00006038852,0.00008758014,0.00004558615,0.0001958265,0.0001649987,2.652656e-7,0.0003351224,0.0008303117,0.04916802,0.9471333,0.001011811,0.000966772],"study_design_scores_gemma":[0.01065355,0.002132589,0.001135783,0.003585672,0.0003811103,0.0002496387,0.006801418,0.2278209,0.6905721,0.03676762,0.01724458,0.002655088],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.9744857,0.00002072164,0.009425567,0.01095618,0.0006373135,0.0006451049,0.00001258308,0.0001760183,0.003640822],"genre_scores_gemma":[0.3982706,0.000009382037,0.6001868,0.00066547,0.0004860235,0.0002046216,0.000001259211,0.00005021788,0.0001256144],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9103657,"threshold_uncertainty_score":0.887388,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008081459,0.0001288871,0.0001831157,0.00005631399,0.00007763814,0.0001610562,0.0007030515,0.00006136387,0.00008066728],"category_scores_gemma":[0.0001903642,0.00009284214,0.00009042124,0.0002829749,0.00002166746,0.000306791,0.0001059516,0.0001144329,0.00009573254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000227436,"about_ca_system_score_gemma":0.00006980478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004165,"about_ca_topic_score_gemma":3.447234e-7,"domain_scores_codex":[0.9988056,0.00008379735,0.0001798074,0.0004082218,0.0002155118,0.0003069979],"domain_scores_gemma":[0.9984052,0.0009536762,0.00006499213,0.0003871844,0.0001063081,0.00008262142],"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.0000328011,0.0001227837,0.0002625096,0.0001059663,0.00003207415,0.000004616905,0.0007600579,0.003866947,0.002242971,0.05888617,0.002406329,0.9312768],"study_design_scores_gemma":[0.0003805104,0.0001834131,0.00004347365,0.00002848764,0.000003856828,0.000001267566,0.00001107771,0.8074308,0.01990927,0.1674662,0.004320638,0.0002210013],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003044593,0.00003228141,0.9958979,0.001839806,0.0005329674,0.0003208587,5.216623e-7,0.0002180858,0.0008531572],"genre_scores_gemma":[0.05798994,5.580034e-7,0.9379607,0.002625152,0.00005044048,0.00003391575,5.03336e-7,0.00001221796,0.001326538],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9310558,"threshold_uncertainty_score":0.3785993,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004731781,0.0003420482,0.0003809612,0.0003278212,0.0003873824,0.0004627125,0.0004614163,0.0001604929,0.00003573461],"category_scores_gemma":[0.00002340101,0.0002934628,0.0002345869,0.0006749728,0.00004498462,0.0004190225,0.000002519656,0.0003571719,0.0002026023],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000351106,"about_ca_system_score_gemma":0.00006881002,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003291374,"about_ca_topic_score_gemma":0.000007111143,"domain_scores_codex":[0.9971622,0.0003242235,0.000637602,0.0007435359,0.0006781152,0.0004543314],"domain_scores_gemma":[0.9982004,0.0003269382,0.0002286117,0.0008115939,0.0002287868,0.0002036885],"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.0001459705,0.005379008,0.00002317556,0.00006371966,0.00006061966,0.00002488199,0.001229178,0.4090156,0.07730369,0.002563481,0.0003631538,0.5038275],"study_design_scores_gemma":[0.0006280579,0.000534347,0.00009957854,0.0003311429,0.00001342141,0.00001107203,0.0001447354,0.9630525,0.03375278,0.00004770381,0.001040825,0.0003438982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008184424,0.00001746831,0.9872344,0.0006149078,0.001539018,0.0006661225,0.0001183148,0.000438996,0.001186402],"genre_scores_gemma":[0.9851284,0.000004044664,0.01363817,0.0005821388,0.0001032942,0.00009050081,0.00001489692,0.00002075937,0.0004177922],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976944,"threshold_uncertainty_score":0.9999518,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002305158,0.0002527908,0.0003197595,0.00005638058,0.0002636174,0.0004374374,0.0004161735,0.0001349375,0.00000826305],"category_scores_gemma":[0.00007342528,0.0002232764,0.00009180897,0.0003609991,0.0001603535,0.0004744541,0.0004739075,0.0004408647,7.06681e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004732903,"about_ca_system_score_gemma":0.00002822162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001087072,"about_ca_topic_score_gemma":0.000006308533,"domain_scores_codex":[0.9978969,0.0003155585,0.0003713363,0.0005224806,0.0002544528,0.0006393127],"domain_scores_gemma":[0.998793,0.0002345399,0.0001600221,0.0003206398,0.00007069469,0.0004210793],"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.00003369158,0.00003674299,0.002752386,0.000002686552,0.00002550346,0.00003880359,0.0000974275,0.3640752,0.0001215294,0.004694023,0.0003116358,0.6278104],"study_design_scores_gemma":[0.0005729881,0.00009180226,0.0002207642,0.000005999392,0.0000190436,0.00008798644,0.00001935145,0.9984565,0.00002680754,0.0001714256,0.00006334555,0.0002639246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1161872,0.0002715593,0.8792853,0.0002980336,0.003643259,0.000133002,0.00000161762,0.0001341497,0.00004584525],"genre_scores_gemma":[0.9037756,0.000004610997,0.09278668,0.0003118549,0.003067034,0.000006408917,0.000005409187,0.00001887919,0.00002355049],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7875884,"threshold_uncertainty_score":0.9104946,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004117211,0.00009718252,0.0001114821,0.0001132314,0.0003165185,0.0001374728,0.0001316577,0.00004773897,0.00001458642],"category_scores_gemma":[0.0001916243,0.00008948791,0.00002780671,0.0003960548,0.0000353875,0.0002336322,0.0001068266,0.0000452137,0.000001589768],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002253842,"about_ca_system_score_gemma":0.0000305808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007477202,"about_ca_topic_score_gemma":0.0001248012,"domain_scores_codex":[0.9991218,0.00003936946,0.0001962365,0.0002808156,0.0001401681,0.0002215648],"domain_scores_gemma":[0.998913,0.0006261632,0.00005228085,0.0001721802,0.00008352256,0.0001528178],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001419498,0.00001159537,0.00002476378,8.016277e-7,0.000004544005,0.000003601352,0.00007089713,0.0002769422,0.00386561,0.7615144,0.0004683691,0.233757],"study_design_scores_gemma":[0.0003196542,0.0001213633,0.0003801275,0.00002834686,0.000009250521,0.00002964165,0.00007300971,0.1013955,0.02109385,0.3066027,0.5695293,0.0004173357],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001377338,0.00007600273,0.9937226,0.003338358,0.0001982762,0.00004587188,9.469705e-7,0.00009312442,0.001147503],"genre_scores_gemma":[0.3748707,0.0000131914,0.6155331,0.009107933,0.0001149507,0.00004830508,0.000002310334,0.000005863646,0.0003037111],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5690609,"threshold_uncertainty_score":0.3649211,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007668406,0.0003920133,0.000434059,0.0004535353,0.0003364741,0.0004848332,0.000550369,0.0002015294,0.00002911488],"category_scores_gemma":[0.00006100648,0.0003233532,0.0002622054,0.001021455,0.00005888382,0.0007357826,0.000005965169,0.0005767797,0.0001973651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002632649,"about_ca_system_score_gemma":0.0001468148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001989692,"about_ca_topic_score_gemma":0.00003119863,"domain_scores_codex":[0.9962468,0.0008008273,0.0006923443,0.000849976,0.0009379621,0.00047214],"domain_scores_gemma":[0.9977744,0.0004363333,0.000243417,0.000876963,0.0003204586,0.0003484643],"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.0004655454,0.002286137,0.00005267451,0.0001164707,0.0001159821,0.00009491864,0.004008749,0.6549401,0.01708111,0.001257157,0.006368898,0.3132122],"study_design_scores_gemma":[0.001194305,0.001116157,0.00002858442,0.0002402873,0.00002337833,0.00003353803,0.0006192588,0.9389102,0.05381983,0.0006124764,0.00291866,0.0004833518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003129027,0.00002369019,0.9887733,0.001509616,0.003993176,0.0006589217,0.00008252507,0.0004861131,0.001343577],"genre_scores_gemma":[0.9303412,0.00000321842,0.06715424,0.0009088844,0.0002985009,0.0001776434,0.00002308059,0.00004395783,0.001049246],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9272122,"threshold_uncertainty_score":0.9999219,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000944614,0.0001112953,0.0001961028,0.0001194178,0.00007709946,0.00005250373,0.000320506,0.00004475309,0.000005350437],"category_scores_gemma":[0.000115689,0.00009934082,0.00005491738,0.0003237519,0.00003910915,0.0001419515,0.00007072427,0.00008582579,0.00003186563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003374579,"about_ca_system_score_gemma":0.00001387513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006696031,"about_ca_topic_score_gemma":6.677201e-7,"domain_scores_codex":[0.9987884,0.00004271387,0.0004604543,0.0001991409,0.0003384617,0.000170824],"domain_scores_gemma":[0.9985422,0.0006575979,0.0003163118,0.0002888521,0.000131967,0.0000630879],"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.00001055895,0.0007302345,0.00004043276,0.0001583023,0.00002405586,0.000003217062,0.003177745,0.00493728,0.01690229,0.2344099,0.000285222,0.7393208],"study_design_scores_gemma":[0.0002526577,0.0001638949,0.001962779,0.00004040242,0.000004244523,0.000004792417,0.00008771358,0.8717772,0.00797499,0.1173797,0.0002249818,0.0001265975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01874681,0.000005697044,0.9774457,0.0002697639,0.0001315768,0.000184227,0.00000120153,0.0001098244,0.00310518],"genre_scores_gemma":[0.387958,3.643869e-7,0.6119159,0.00007677927,0.00002643998,0.000001690208,0.000003711212,0.000006094393,0.0000109721],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8668399,"threshold_uncertainty_score":0.4051001,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00221607,0.0001248251,0.0004340316,0.0002697828,0.00003494394,0.00008106266,0.0006264681,0.00006951229,0.00001228416],"category_scores_gemma":[0.0001755614,0.00008656349,0.0001816804,0.0005187195,0.00003188348,0.0002855219,0.00006462482,0.0001875553,0.000008127497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007837562,"about_ca_system_score_gemma":0.000068621,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002656414,"about_ca_topic_score_gemma":3.13161e-7,"domain_scores_codex":[0.9977716,0.0001384907,0.001158884,0.0001406476,0.0005589428,0.0002313961],"domain_scores_gemma":[0.9978352,0.0003248214,0.0008437699,0.000258571,0.0005689814,0.0001686962],"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.00001975991,0.0001464185,0.0004377489,0.00005262049,0.00007986929,0.00005857626,0.000326864,0.9597845,0.0005752767,0.006561314,0.0003587878,0.03159823],"study_design_scores_gemma":[0.0003275093,0.000803044,0.0003229828,0.0005424125,0.00003874511,0.0006988257,0.0003510268,0.9831997,0.0100498,0.0008505599,0.002571417,0.000243971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003168619,0.0009411506,0.9949585,0.0003023593,0.003146055,0.0001112728,2.642921e-7,0.00001360814,0.0002099145],"genre_scores_gemma":[0.231736,0.0001142939,0.7673364,0.0001628886,0.0004772591,8.982692e-7,1.836273e-7,0.00001352876,0.0001585931],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2314191,"threshold_uncertainty_score":0.3529957,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002368749,0.0002840145,0.001246652,0.0001640369,0.000150889,0.00002178196,0.0009130949,0.000250157,0.000002558054],"category_scores_gemma":[0.00003975473,0.0001602113,0.0001830061,0.0007626229,0.0005665118,0.00009697501,0.0001277736,0.0003008024,0.000002405222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001880037,"about_ca_system_score_gemma":0.000711555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001434509,"about_ca_topic_score_gemma":0.000003144157,"domain_scores_codex":[0.997694,0.0006168268,0.0005153928,0.0004168988,0.0002839985,0.0004729257],"domain_scores_gemma":[0.998183,0.0006735314,0.0005527717,0.0004745176,0.00004660972,0.00006962151],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000007415938,0.0002433333,0.00002370197,0.00006819089,0.00002824221,0.000009414434,0.0004286703,0.00002163548,3.137719e-9,0.007722391,0.0002950615,0.9911519],"study_design_scores_gemma":[0.002050457,0.001951527,0.0001964824,0.01281169,0.0001128681,0.00008333161,0.0003260373,0.0009214314,4.696701e-7,0.005614749,0.9753727,0.0005582621],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.000004277343,0.7549114,0.2417376,0.0004514899,0.001050768,0.0006794076,0.000008331565,0.00003229098,0.001124494],"genre_scores_gemma":[0.0003820902,0.9613146,0.03789164,0.0002010845,0.00007028846,0.00005091247,0.00001603624,0.00003939785,0.00003399995],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9905937,"threshold_uncertainty_score":0.6533226,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004593896,0.00005192511,0.00008995502,0.00003148136,0.00004277574,0.00003187245,0.0001109539,0.00002380176,0.00002617611],"category_scores_gemma":[0.00005209038,0.00003982821,0.00001703098,0.00009841913,0.00002430227,0.0002249889,0.0000146198,0.00003241251,0.000003525046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003016706,"about_ca_system_score_gemma":0.00001191538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001776484,"about_ca_topic_score_gemma":2.228846e-7,"domain_scores_codex":[0.9992465,0.0002990165,0.0000958694,0.0001691351,0.00009559885,0.00009392158],"domain_scores_gemma":[0.999514,0.000202435,0.00003049565,0.0001713415,0.00002180002,0.00005990799],"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.000007130745,0.0001024553,0.00002080851,0.000004728111,0.00000784606,0.000001886865,0.0000546715,0.00004821986,0.02741922,0.0264403,0.00003651299,0.9458562],"study_design_scores_gemma":[0.0003036742,0.0005308381,0.001108577,0.000009338169,0.00001662308,0.00001909754,0.00003865483,0.18618,0.7673358,0.04345193,0.0007748973,0.0002305699],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006573162,0.00001698852,0.9921923,0.00002605701,0.0002127151,0.00004813392,9.19127e-8,0.00003572441,0.0008948434],"genre_scores_gemma":[0.2084608,0.00000364646,0.7914182,0.00004328221,0.00001031176,0.000004191869,2.028795e-8,0.000002309618,0.00005721633],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9456257,"threshold_uncertainty_score":0.1624147,"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","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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000551782,0.0003205357,0.000464695,0.0001352902,0.0008734445,0.0007892087,0.002357443,0.0001208446,0.0001117614],"category_scores_gemma":[0.0002750475,0.0002631381,0.0001789359,0.0002332114,0.0001502937,0.000927895,0.0002184121,0.0002393725,0.00002189797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009253476,"about_ca_system_score_gemma":0.0001119875,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00113884,"about_ca_topic_score_gemma":0.000008139736,"domain_scores_codex":[0.9975893,0.0001726242,0.0003859688,0.000750426,0.0004579096,0.0006437413],"domain_scores_gemma":[0.997452,0.0004285357,0.0002687057,0.001527387,0.00003789198,0.0002855099],"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.000004673049,0.0001548361,0.0003588918,0.00002821729,0.00004032876,0.00008241888,0.00007669207,0.0001466615,0.02971489,0.04852232,0.0001087831,0.9207613],"study_design_scores_gemma":[0.001020111,0.000172889,0.02317651,0.0002208279,0.00007126503,0.00004113847,0.00003488841,0.6824458,0.254507,0.03646363,0.0004951743,0.001350671],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01721726,0.00002733507,0.9753557,0.004556291,0.000967855,0.0001467906,0.00001647248,0.0002367098,0.001475547],"genre_scores_gemma":[0.4512418,0.000001780315,0.548229,0.0002614847,0.0001620527,0.000009177757,3.287842e-7,0.00001674004,0.00007766386],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9194106,"threshold_uncertainty_score":0.9999821,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002278166,0.0002545155,0.0003397804,0.00006295121,0.0001225232,0.0004536295,0.0006209204,0.0000601178,0.0001986687],"category_scores_gemma":[0.0002221765,0.0001588424,0.0001249311,0.0004600132,0.00009050132,0.0004752609,0.00007491616,0.0002409422,0.00004873008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003186183,"about_ca_system_score_gemma":0.00007667019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002619377,"about_ca_topic_score_gemma":0.000002087106,"domain_scores_codex":[0.9982183,0.0001619699,0.0002024223,0.000584671,0.0003407686,0.0004918702],"domain_scores_gemma":[0.9987684,0.0002798692,0.00006272987,0.000602482,0.0000532196,0.0002333338],"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.0001014961,0.001060048,0.002134899,0.00005533846,0.0003661454,0.001332246,0.0009030164,0.001981794,0.001584329,0.2242102,0.001142296,0.7651281],"study_design_scores_gemma":[0.01008116,0.003792087,0.01109641,0.000425821,0.0001866626,0.002293206,0.0003178303,0.04467945,0.111749,0.6796032,0.1273288,0.00844635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001347683,0.00009247465,0.8903993,0.0008433348,0.0001660239,0.0001753495,0.000006824667,0.0003207677,0.1066483],"genre_scores_gemma":[0.06295221,0.000006146666,0.9351157,0.0002390778,0.00006124446,0.00001612404,9.322257e-7,0.00001705816,0.001591506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7566818,"threshold_uncertainty_score":0.6477404,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525618,0.00008956885,0.0002081608,0.00005276457,0.00003212157,0.00005653214,0.0001604545,0.0000154977,0.000004010864],"category_scores_gemma":[0.00005794822,0.0000595083,0.00002289181,0.0001995435,0.0000405103,0.0001701155,0.00004625162,0.00005600651,0.000001343653],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001270176,"about_ca_system_score_gemma":0.00001595051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003612908,"about_ca_topic_score_gemma":5.013771e-7,"domain_scores_codex":[0.9990054,0.000336754,0.0001814971,0.0002235113,0.0001194948,0.0001332816],"domain_scores_gemma":[0.9992598,0.0002992133,0.00007714565,0.0002430669,0.00005780843,0.00006296028],"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.000009872138,0.0001039478,0.0004569858,0.00009581369,0.00006102357,0.0000171562,0.0002819367,0.028738,0.001571265,0.09701046,0.000006282078,0.8716472],"study_design_scores_gemma":[0.000171435,0.0001619227,0.0002575672,0.00001892558,0.000005922568,0.00005401735,0.00002983541,0.9935516,0.001674723,0.003487915,0.0004874044,0.00009879249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01428821,0.0002060105,0.9839355,0.00002543624,0.0001605326,0.0001059021,5.095125e-7,0.00005010553,0.001227756],"genre_scores_gemma":[0.4584883,0.000002802695,0.5413865,0.00001757103,0.000003544453,0.000002353359,9.468013e-8,0.000003317925,0.00009544809],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9648135,"threshold_uncertainty_score":0.2426678,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001524457,0.0001448982,0.000250667,0.00004689463,0.0002629088,0.0003667495,0.0009421055,0.00004603406,0.000007711199],"category_scores_gemma":[0.0001125958,0.00007407746,0.0001193567,0.0002756119,0.0001830933,0.0004643132,0.0001131331,0.0002734735,0.00000306894],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000322258,"about_ca_system_score_gemma":0.00009207699,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007036002,"about_ca_topic_score_gemma":0.000001197239,"domain_scores_codex":[0.9985169,0.0003892732,0.0003695849,0.0001295426,0.0003398886,0.00025481],"domain_scores_gemma":[0.9983386,0.0005984756,0.000380999,0.0003224205,0.0002723783,0.00008709668],"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.0003321778,0.00007446732,0.00006425529,0.000002793541,0.00003089859,0.000062687,0.00008075852,0.00001150559,0.0003981811,0.9670042,0.0001880851,0.03174993],"study_design_scores_gemma":[0.000816515,0.001628364,0.000577222,0.00002513978,0.00001755324,0.0003324002,0.00008469661,0.00005214075,0.005739605,0.8994546,0.09110828,0.0001634833],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08753712,0.001969968,0.8786085,0.005234506,0.01738706,0.0002645935,0.000001609673,0.00009652737,0.008900104],"genre_scores_gemma":[0.6672536,0.000111772,0.3260166,0.0002645947,0.004230992,0.000008667169,3.535587e-7,0.00004523685,0.002068228],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5797164,"threshold_uncertainty_score":0.3536574,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001825589,0.0001278105,0.0001765281,0.00007278263,0.00003504835,0.0002030337,0.0005640381,0.00004739264,0.00009520244],"category_scores_gemma":[0.0001753063,0.0000973476,0.00007081049,0.0004919666,0.00004406158,0.0006507908,0.0001181257,0.000114357,0.0001619654],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006415683,"about_ca_system_score_gemma":0.00005207172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00010859,"about_ca_topic_score_gemma":0.000003022444,"domain_scores_codex":[0.9988897,0.00003556144,0.000192243,0.0003602697,0.0002031555,0.000318997],"domain_scores_gemma":[0.9993092,0.0001533519,0.00003294769,0.0003597573,0.00002251239,0.0001221689],"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.000005408911,0.0006382864,0.001838955,0.00001301775,0.00002302388,0.0003472434,0.0005737153,0.0001853579,0.002667838,0.09967422,0.0002308647,0.893802],"study_design_scores_gemma":[0.003772712,0.00136039,0.02751882,0.0004640738,0.0000117736,0.0001414127,0.0003361136,0.01036391,0.1022354,0.8401085,0.01039849,0.003288432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009343239,0.00005117325,0.8716559,0.001205013,0.0003336174,0.0001108369,0.000002111239,0.0002108504,0.1170873],"genre_scores_gemma":[0.5772839,0.00000412267,0.4219501,0.0003588946,0.00002423392,0.000007325517,2.242592e-7,0.000007612263,0.0003635904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8905137,"threshold_uncertainty_score":0.396972,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007945588,0.0001058857,0.000273004,0.00005247954,0.00006867021,0.00004771681,0.0008866598,0.0000543,0.00002249776],"category_scores_gemma":[0.00147572,0.0000910521,0.00009590878,0.000243889,0.00003476474,0.00007342033,0.0002242283,0.00008317088,0.00002871806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002240063,"about_ca_system_score_gemma":0.00003146366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003482939,"about_ca_topic_score_gemma":3.477386e-7,"domain_scores_codex":[0.9989383,0.0001470432,0.0003360051,0.0002646579,0.0001060431,0.0002080047],"domain_scores_gemma":[0.9980002,0.001079422,0.0001858859,0.0005611319,0.0001085311,0.00006484529],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001216978,0.0001470959,0.00005631438,0.00004085696,0.00001581716,4.488435e-7,0.0004015793,0.000435333,0.00943885,0.03626242,0.001640336,0.9515488],"study_design_scores_gemma":[0.001878788,0.000783554,0.001074794,0.00009969327,0.0000266354,0.000006162765,0.0001139808,0.03048769,0.3529842,0.1718487,0.4401693,0.0005264694],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009131708,0.0001736961,0.9906639,0.007508222,0.0002733826,0.0002226235,0.000002665752,0.00007288286,0.0001694542],"genre_scores_gemma":[0.03128557,0.000007048624,0.9682866,0.0002685195,0.00005344954,0.00004011659,0.000002637855,0.000008038921,0.00004806984],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9510223,"threshold_uncertainty_score":0.3712997,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002668083,0.00005067576,0.00007311318,0.00001277591,0.00008474039,0.00006998354,0.0001786235,0.00001883554,0.00002707991],"category_scores_gemma":[0.000005309053,0.00003669271,0.00002591758,0.0001237682,0.00002011462,0.00008965535,0.00005053499,0.00002535537,0.00006132342],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007793246,"about_ca_system_score_gemma":0.000002662964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004032756,"about_ca_topic_score_gemma":1.286208e-7,"domain_scores_codex":[0.9995357,0.00003343274,0.00008191182,0.0001861556,0.0000525332,0.0001102224],"domain_scores_gemma":[0.9994193,0.0002424702,0.00002108069,0.0002230998,0.00002634445,0.00006767527],"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.000001337437,0.00001397572,0.000009356844,0.00001259679,0.000002444764,2.78863e-7,0.00002240609,5.212599e-7,0.00002186508,0.794447,0.000179647,0.2052886],"study_design_scores_gemma":[0.003160435,0.0001509885,0.0001112765,0.00003734441,0.0000312072,0.0001450658,0.0003039775,0.4723189,0.003946613,0.2588371,0.2602451,0.0007120509],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005143493,0.00006884234,0.982115,0.000341421,0.00005026413,0.0002812358,0.00000126035,0.0001354509,0.01695511],"genre_scores_gemma":[0.03247208,0.000004090391,0.9639267,0.0002783933,0.00009228792,0.0003475766,2.216899e-7,0.000004944215,0.002873673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5356099,"threshold_uncertainty_score":0.1496285,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001006314,0.0001103846,0.0001453474,0.00002714311,0.000128864,0.0003770957,0.0002655883,0.00002950201,0.00002903236],"category_scores_gemma":[0.0001913673,0.00007433565,0.00004354161,0.0003190654,0.00004058077,0.0008884438,0.00002937545,0.00004844613,0.00001377249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000274869,"about_ca_system_score_gemma":0.00001522407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006379865,"about_ca_topic_score_gemma":4.642896e-7,"domain_scores_codex":[0.9991329,0.00002056366,0.0001288423,0.0003367311,0.0001535885,0.0002274057],"domain_scores_gemma":[0.9992954,0.0002830824,0.00005863105,0.000208382,0.00007185475,0.00008265579],"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.000002170513,0.00006719276,0.00002010139,0.00001325827,0.000006032238,0.000002118294,0.00005918914,0.000007069782,0.0005747724,0.0004648466,0.000155362,0.9986279],"study_design_scores_gemma":[0.002030054,0.001851405,0.001891914,0.0007700222,0.00009770965,0.0003456831,0.0004296832,0.8156186,0.1103817,0.04078836,0.02272999,0.003064891],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008603825,0.00007334915,0.9799766,0.0009597286,0.0001241371,0.0002190693,0.000003704678,0.0002196307,0.01756343],"genre_scores_gemma":[0.2684042,0.000004252718,0.7302909,0.00007167432,0.0000966948,0.00007386983,2.301061e-7,0.000009691347,0.00104841],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.995563,"threshold_uncertainty_score":0.3636343,"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","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004646802,0.0001642153,0.0003480676,0.0004724765,0.0001444556,0.0002075443,0.0002953745,0.00009178688,0.000007290811],"category_scores_gemma":[0.0001177227,0.0001580082,0.00005154251,0.0004415879,0.00003700679,0.0006399094,0.00003657259,0.0003737537,0.000002194875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001216206,"about_ca_system_score_gemma":0.0001200743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003608849,"about_ca_topic_score_gemma":0.00001327173,"domain_scores_codex":[0.9986377,0.0002127569,0.000315508,0.0002408984,0.0001336405,0.0004595357],"domain_scores_gemma":[0.9982719,0.0005509522,0.00009475516,0.0001140089,0.0001091139,0.00085927],"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.000008537937,0.00003585433,0.0005609423,0.00003010692,0.0001162084,0.0001323759,0.0003464398,0.007174228,0.03103254,0.005736193,0.00007210366,0.9547545],"study_design_scores_gemma":[0.0002670664,0.001157281,0.01988463,0.000075822,0.00002408157,0.0008468359,0.000004062323,0.968569,0.003167841,0.00554411,0.0001347428,0.0003244955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.08610487,0.001107984,0.9121773,0.0002466979,0.0002497782,0.00008139909,3.111111e-7,0.00002760751,0.000004073229],"genre_scores_gemma":[0.3888174,0.0000175469,0.6108418,0.0001003196,0.0002076979,0.000002258686,1.597548e-7,0.000009449809,0.000003414408],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9613948,"threshold_uncertainty_score":0.6443385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}